A New Placement Method for Direct Mapping into LUT-Based FPGAs | SpringerLink
Skip to main content

A New Placement Method for Direct Mapping into LUT-Based FPGAs

  • Conference paper
  • First Online:
Field-Programmable Logic and Applications (FPL 2001)

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

Included in the following conference series:

Abstract

In this paper, we present a new placement method which provides short implementation times for today’s high capacity FPGAs within a direct mapping environment. We show that using additional component information is beneficial for faster logic block placement. The new placement method reduces the placer’s run time by taking the module in- and output interconnections into account.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11439
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14299
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

  1. J. Abke, and E. Barke, “CoMGen: Direct Mapping of Arbitrary Components into LUT-Based FPGAs, Field-Programmable Logic and Applications, The Roadmap to Reconfigurable Computing, FPL 2000, pp. 191–200. Springer.

    Google Scholar 

  2. K. Harbich, J. Stohmann, L. Schwoerer, and E. Barke, “A Case Study: Logic Emulation-Pitfalls and Solutions”, In Proc. of the 10th IEEE Int’l. Workshop on Rapid System Prototyping, 1999, IEEE Computer Society, pp. 160–163.

    Google Scholar 

  3. V. Betz, and J. Rose, VPR: A New Packing, Placement and Routing Tool for FPGA Research, A CM Symp. on FPGAs, FPGA 1997, pp. 213–222.

    Google Scholar 

  4. V. Betz, J. Rose, and A. Marquardt, “Architecture and CAD for Deep-Submicron FPGAs”, Kluwer Academic Publishers, 1999.

    Google Scholar 

  5. M. Butts, J. Batcheller, and J. Varghese, “An Efficient Logic Emulation System”. Proc. of the Int’l. Conf. of Circuit Design, ICCD 1992, pp. 138–141.

    Google Scholar 

  6. S. W. Gehring, S. H.-M. Ludwig, “Fast Integrated Tools for Circuit Design with FPGAs”, A CM Symp. on FPGAs, FPGA 1998, pp. 133–139.

    Google Scholar 

  7. S. Kirkpatrick, C. D. J. Gelatt, and M. Vecchi, “Optimization by Simulated Annealing”, Technical report, 1982, IBM Thomas J. Watson Reseearch Center.

    Google Scholar 

  8. H. Krupnova, and G. Saucier, “FPGA-Based Emulation: Industrial and Custom Prototyping Solutions”. In Field-Programmable Logic and Applications, The Roadmap to Reconfigurable Computing, FPL 2000, pp. 68–77. Springer.

    Google Scholar 

  9. C. Sechen, “VLSI Placement and Global Routing Using Simulated Annealing”. Kluwer Academic Publishers, 1988.

    Google Scholar 

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

    Google Scholar 

  11. T. Lengauer “Combinatorial Algorithms for Integrated Circuit Layout”, Wiley Teubner, 1990.

    Google Scholar 

  12. “LPM 220: Description of LPM Modules”, http://www.edif.org/lpmweb/documentation/220cells.pdf.

  13. J. Stohmann and E. Barke, “An Universal CLA Adder Generator for SRAM-Based FPGAs”. Field-Programmable Logic: Smart Applications, New Paradigms and Compilers”, FPL 1996, pp. 44–54, Springer.

    Google Scholar 

  14. J. Stohmann and E. Barke, “A Universal Pezaris Array Multiplier Generator for SRAM-Based FPGAs”. Int’l Conf. on Computer Design, ICCD 1997, pp. 489–495.

    Google Scholar 

  15. J. Stohmann, K. Harbich, M. Olbrich, and E. Barke. “An Optimized Design Flow for Fast FPGA-Based Rapid Prototyping”, Field-Programmable Logic and Applications, From FPGAs to Computing Paradigm, FPL 1998, pp. 79–88, Springer.

    Google Scholar 

  16. Y. Sankar, J. Rose, “Trading Quality for Compile Time: Ultra-Fast Placement for FPGAs”, A CM Symp. on FPGAs, FPGA 1999, pp. 157–166.

    Google Scholar 

  17. R. Tessier, “Fast Place and Route Approaches for FPGAs”, Ph.D. thesis, Massachusetts Institute of Technology, 1998.

    Google Scholar 

  18. R. Tessier, “Frontier: A Fast Placement System for FPGAs”, Proc. of the 10th IFIP Int’l Conf. on VLSI, 1999.

    Google Scholar 

  19. D. E. Thomas and P. R. Moorby, “The Verilog Hardware Description Language”, Kluwer Academic Publishers, 4th edition, 1998.

    Google Scholar 

  20. N. Togawa, M. Yanagisawa, T. Ohtsuki; “Maple-opt: A Performance-Oriented Simultaneous Technology Mapping, Placement, and Global Routing Algorithm for FPGA’s”, IEEE Trans. on CAD, Sep. 1998, Vol. 17, No. 9, pp. 803–818.

    Google Scholar 

  21. W.-J. Sun, C. Sechen, “Efficient and Effective Placement for Very Large Circuits”, IEEE Trans. on CAD, Mar. 1995, Vol. 14, No. 3, pp. 349–359.

    Google Scholar 

  22. Xilinx, Inc. “Alliance Series 3.1i Software Documentation”, 2000.

    Google Scholar 

  23. Xilinx, Inc. “The Programmable Logic Data Book”, Xilinx Inc.,&San Jose, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abke, J., Barke, E. (2001). A New Placement Method for Direct Mapping into LUT-Based FPGAs. In: Brebner, G., Woods, R. (eds) Field-Programmable Logic and Applications. FPL 2001. Lecture Notes in Computer Science, vol 2147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44687-7_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-44687-7_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42499-4

  • Online ISBN: 978-3-540-44687-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics