[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Sequential Circuit Technology Mapping

  • Living reference work entry
  • First Online:
Encyclopedia of Algorithms
  • 213 Accesses

Years and Authors of Summarized Original Work

1996; Pan, Liu

1998; Pan, Liu

1998; Pan, Lin

Problem Definition

One of the key steps in a VLSI design flow is technology mapping that converts a Boolean network of technology-independent logic gates and D-flipflops (FFs) into an equivalent one comprised of cells from a technology library [1, 4]. Technology mapping can be formulated as a covering problem where logic gates are covered by cells from the technology library. For ease of discussion, it is assumed that the cell library contains only one cell, a K-input lookup table (K-LUT) with one unit of delay. A K-LUT can implement any Boolean function with up to K inputs as is the case in field-programmable gate arrays (FPGAs) [1, 3].

Figure 1 shows an example of technology mapping. The original network in (1) with three FFs and four gates is covered by three 3-input cones as indicated in (2). The corresponding mapping solution using 3-LUTs is shown in (3). Note that gate iis covered by two...

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

Access this chapter

Institutional subscriptions

Recommended Reading

  1. Cong J, Ding Y (1994) FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs. IEEE Trans Comput Aided Des Integr Circuits Syst 13(1):1–12

    Article  Google Scholar 

  2. Cong J, Wu C (1997) FPGA synthesis with retiming and pipelining for clock period minimization of sequential circuits. In: ACM/IEEE design automation conference, Anaheim

    Google Scholar 

  3. Cong J, Wu C, Ding Y (1999) Cut ranking and pruning: enabling a general and efficient FPGA mapping solution. In: ACM international symposium on field-programmable gate arrays, Monterey

    Book  Google Scholar 

  4. Keutzer K (1987) DAGON: technology binding and local optimization by DAG matching. In: ACM/IEEE design automation conference, Miami Beach

    Google Scholar 

  5. Leiserson CE, Saxe JB (1991) Retiming synchronous circuitry. Algorithmica 6:5–35

    Article  MathSciNet  MATH  Google Scholar 

  6. Mishchenko A, Chatterjee S, Brayton R, Pan P (2006) Integrating logic synthesis, technology mapping, and retiming. ERL technical report, EECS Department, UC Berkeley

    Google Scholar 

  7. Pan P (1997) Continuous retiming algorithms and applications. In: IEEE international conference on computer design, Austin

    Google Scholar 

  8. Pan P, Lin CC (1998) A new retiming-based technology mapping algorithm for LUT-based FPGAs. In: ACM international symposium on field-programmable gate arrays, Monterey

    Book  Google Scholar 

  9. Pan P, Liu CL (1996) Optimal clock period FPGA technology mapping for sequential circuits. In: ACM/IEEE design automation conference, Las Vegas

    Book  Google Scholar 

  10. Pan P, Liu CL (1998) Optimal clock period FPGA technology mapping for sequential circuits. ACM Trans Des Autom Electron Syst 3(3):437–462

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Peichen Pan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer Science+Business Media New York

About this entry

Cite this entry

Pan, P. (2014). Sequential Circuit Technology Mapping. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27848-8_364-2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27848-8_364-2

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Online ISBN: 978-3-642-27848-8

  • eBook Packages: Living Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics