Skip to main content
SpringerLink
Log in

Mapping of DSP Algorithms on Field Programmable Function Arrays

  • Conference paper
  • First Online:
Field-Programmable Logic and Applications: The Roadmap to Reconfigurable Computing (FPL 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1896))

Included in the following conference series:

Abstract

This position paper1 discusses reconfigurability issues in low-power hand-held multimedia systems. A reconfigurable systems-architecture is introduced, with a focus on a Field Programmable Function Array (FPFA). Application domain specific algorithms determine the granularity of FPFA processor tiles. Several algorithms are discussed and mapped onto a FPFA processor tile.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Burger D., Goodman J., “Billion-Transistor Architectures”, IEEE Computer, September 1997.

    Google Scholar 

  2. Havinga P.J.M., “Mobile Multimedia Systems”, Ph.D. thesis, University of Twente, Februari 2000.

    Google Scholar 

  3. Kuse E.A., “Analysis and circuit design for low power programmable logic modules”, Ms. Thesis, University of California at Berkeley, December 1997.

    Google Scholar 

  4. Lettieri P., Srivastava M.B., “Advances in wireless terminals”, IEEE Personal Communications, pp. 6–19, February 1999.

    Google Scholar 

  5. Mehra R., Rabaey J., “Exploiting regularity for low-power design”, proceedings of the international Conference on computer-aided design, 1996.

    Google Scholar 

  6. Rixner S., Dally W.J., et al, “A Bandwith-Efficient Architecture for Media Processing”, Micro-31, 1998.

    Google Scholar 

  7. Smit J., et al, “Low Cost & Fast Turnaround: Reconfigrable Graph-Based Execution Units”, Proceedings Belsign Workshop, 1998.

    Google Scholar 

  8. Smit J., Huijsken, J.A, “On the energy complexity of the FFT”, Proceedings of the Patmos Conference, Oldenberg, Germany, 1995.

    Google Scholar 

  9. Stekelenburg M., “Optimization of a Field Programmable Function Array”, Ms. thesis, University of Twente, March 1999.

    Google Scholar 

  10. Taylor M., “The Raw Prototype Design Document”, Massachusetts Institute of Technology, V1.3, February, 2000.

    Google Scholar 

  11. Xilinx, “Virtextm-E 1.8V Field Programmable Gate Arrays”, Advance Product Specification, December, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. depts. Computer Science & Electrical Engineering, University of Twente, Enschede, the Netherlands

    Paul M. Heysters, Jaap Smit, Gerard J. M. Smit & Paul J. M. Havinga

Authors
  1. Paul M. Heysters
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jaap Smit
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gerard J. M. Smit
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Paul J. M. Havinga
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, University of Kaiserslautern, P. O. Box. 30 49, 67653, Kaiserslautern, Germany

    Reiner W. Hartenstein

  2. Carinthia Tech Institute, Richard-Wagner-Str. 19, 9500, Villach, Austria

    Herbert Grünbacher

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Heysters, P.M., Smit, J., Smit, G.J.M., Havinga, P.J.M. (2000). Mapping of DSP Algorithms on Field Programmable Function Arrays. In: Hartenstein, R.W., Grünbacher, H. (eds) Field-Programmable Logic and Applications: The Roadmap to Reconfigurable Computing. FPL 2000. Lecture Notes in Computer Science, vol 1896. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44614-1_43

Download citation

  • DOI: https://doi.org/10.1007/3-540-44614-1_43

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67899-1

  • Online ISBN: 978-3-540-44614-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation