Skip to main content

An optimized design flow for fast FPGA-based rapid prototyping

  • Conference paper
  • First Online:
Book cover Field-Programmable Logic and Applications From FPGAs to Computing Paradigm (FPL 1998)

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

Included in the following conference series:

Abstract

In this paper, we present an optimized design flow to map Register-Transfer-Level (RTL) netlists onto multiple-FPGA architectures. Our FPGA-dedicated method fully exploits design structure by letting the basic design steps technology mapping, hierarchical partitioning, floorplanning and signal flow driven placement, interact. This efficiently reduces runtime and yields design implementations of higher performance and better resource utilization than published before.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Butts, J. Batcheller, J. Varghese; “An Efficient Logic Emulation System”, ICCD,1992, pp.138–14

    Google Scholar 

  2. D. M. Lewis, D. R. Galloway, Marcus van Ierssel, J. Rose, P. Chow; “The Transmogrifier-2: A 1 Million Gate Rapid Prototyping System”, FPGA, 1997, pp. 53–61

    Google Scholar 

  3. P. K. Jha, N. D. Dutt; “High-Level Library Mapping for Arithmetic Components”, Trans. on Very Large Scale Integration (VLSI) Systems, Vol. 4, No. 2, 6/1996, pp. 157–169

    Article  Google Scholar 

  4. R. Murgai, N. Shenoy, R. K. Brayton, A. Sangiovanni-Vicentelli; “Improved Logic Synthesis Algorithms for Table Look Up Architectures”, ICCAD, 1991, pp. 564–567

    Google Scholar 

  5. R.J. Francis, J. Rose, Z. Vranesic; “Chortle-crf: Fast Technology Mapping for Lookup Table-Based FPGAs”, DAC, 1991, pp.227–233

    Google Scholar 

  6. J. Cong, Y. Ding; “FlowMap: An Optimal Technology Mapping Algorithm for Delay Optimization in Look-up Table Based FPGA Design”, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 13, Jan. 1994, pp.1–11

    Article  Google Scholar 

  7. C. Legl, B. Wurth, K. Eckl; “A Boolean Approach to Performance-Directed Technology Mapping for LUT-Based FPGA Designs”, DAC, 1996, pp.730–733

    Google Scholar 

  8. J. Stohmann, E. Barke: “A Universial Pezaris Array Multiplier Generator for SRAM-Based FPGAs”, ICCD, 1997, pp. 489–495

    Google Scholar 

  9. D. Behrens, K. Harbich, E. Barke; “Hierarchical Partitioning”, ICCAD, 1996, pp.470–477

    Google Scholar 

  10. Synopsys — Design Ware Components Databook, Version 3.4a, 1994

    Google Scholar 

  11. Quickturn — HDL-ICE — Reference Manual, 1996

    Google Scholar 

  12. J. Stohmann, E. Barke: “An Universial CLA Adder Generator for SRAM-Based FPGAs”, FPL, 1996, pp. 44–54

    Google Scholar 

  13. Library of Parameterized Modules, Proposed Standard 2.0, 1992

    Google Scholar 

  14. J. Cong, M. Smith; “A Parallel Bottom-Up Clustering Algorithm with Applications to Circuit Partitioning in VLSI Design”,DAC, 1993, pp. 755–760

    Google Scholar 

  15. D. Behrens, K. Harbich, E. Barke: “Circuit Partitioning Using High Level Design Information”, IDPT, 1996, pp.259–266

    Google Scholar 

  16. Xilinx — X-BLOX — User Guide, 1994

    Google Scholar 

  17. P. Pan, C. L. Liu; “Area Minimization for Floorplans”, IEEE Trans. on Computer-Aided Design, vol. 14, no. I, pp. 123–132, 1995.

    Google Scholar 

  18. H. Krupnova, C. Rabedaoro, G. Saucier; “Synthesis and Floorplanning For Large Hierarchical FPGAs”, FPGA, 1997, pp. 105–111

    Google Scholar 

  19. J. Shi, D. Bhatia; “Performance Driven Floor-planning for FPGA Based Designs”, FPGA, 1997, pp. 112–118

    Google Scholar 

  20. T. R. Mueller, D. F. Wong, C.L. Liu; “An Enhanced Bottom-Up Algorithm For Floorplan Design”, ICCAD, 1987, pp. 524–527

    Google Scholar 

  21. J. P. Cohoon et. al.; “Distributed Genetic Algorithms for the Floorplan Design Problem”, Trans. on Computer-Aided Design, vol. 10, no. 4, pp. 483–491, 1991

    Article  Google Scholar 

  22. M. Rebaudengo, M. S. Reorda; “GALLO: A Genetic Algorithm for Floorplan Area Optimization”, Trans. on Computer-Aided Design, vol. 15, no. 8, pp. 943–951, 1996.

    Article  Google Scholar 

  23. Objectivity — Objectivity/DB 3.5 — Guide, 1995

    Google Scholar 

  24. W.-J. Fang, A. C.-H. Wu: “A Hierarchical Functional Structuring and Partitioning Approach for Multiple-FPGA Implementations”, ICCAD, 1996, pp. 638–643

    Google Scholar 

  25. PiE Design Systems — MARS III Emulation System Tool, 1993

    Google Scholar 

  26. Quickturn Design Systems — Quest 4.2.3, 1994

    Google Scholar 

  27. L. A. Sanchis; “Multiple-way network partitioning”, IEEE Transactions on Computer, vol. 38, no. 1, pp. 62–81, 1989

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Reiner W. Hartenstein Andres Keevallik

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stohmann, J., Harbich, K., Olbrich, M., Barke, E. (1998). An optimized design flow for fast FPGA-based rapid prototyping. In: Hartenstein, R.W., Keevallik, A. (eds) Field-Programmable Logic and Applications From FPGAs to Computing Paradigm. FPL 1998. Lecture Notes in Computer Science, vol 1482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055235

Download citation

  • DOI: https://doi.org/10.1007/BFb0055235

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64948-9

  • Online ISBN: 978-3-540-68066-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics