Skip to main content

On Memory Capacity to Implement Logic Functions

  • Conference paper
Computer Aided Systems Theory – EUROCAST 2011 (EUROCAST 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6928))

Included in the following conference series:

Abstract

The paper presents logic synthesis method targeted at FPGA architectures with specialized embedded memory blocks (EMB). Existing tools/compilers treat ROM modules described in HDLs as indivisible entities and in consequence do not ensure effective utilization of the possibilities provided by such modules. In order to address this problem effectively we propose applying functional decomposition. The main contribution is based on the use of r-admissibility measure to guide decomposition structures for ROM-based synthesis.

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. Borowik, G., Łuba, T., Tomaszewicz, P.: A notion of r-admissibility and its application in logic synthesis. In: Proc. of the 4th IFAC Workshop on Discrete-Event System Design, DESDES 2009, Gandia Beach, Spain, pp. 207–212 (October 2009)

    Google Scholar 

  2. Brzozowski, J.A., Łuba, T.: Decomposition of Boolean functions specified by cubes. Journal of Multi-Valued Logic & Soft. Computing 9, 377–417 (2003)

    MathSciNet  MATH  Google Scholar 

  3. Meyer-Baese, U.: Digital Signal Processing with Field Programmable Gate Arrays, Signals and Communication Technology. Springer-Verlag New York, Inc., Secaucus (2004)

    Book  MATH  Google Scholar 

  4. Rawski, M., Jóźwiak, L., Nowicka, M., Łuba, T.: Non-disjoint decomposition of boolean functions and its application in fpga-oriented technology mapping. In: EUROMICRO 1997: ‘New Frontiers of Information Technology’, Proceedings of the 23rd EUROMICRO Conference, pp. 24–30 (September 1997)

    Google Scholar 

  5. Sasao, T.: On the number of LUTs to realize sparse logic functions. In: Proc. of the 18th International Workshop on Logic and Synthesis, Berkeley, CA, U.S.A., July 31-August 2, pp. 64–71 (2009)

    Google Scholar 

  6. Scholl, C.: Functional Decomposition With Applications to FPGA Synthesis. Kluwer Academic Publishers, Dordrecht (2001)

    Book  MATH  Google Scholar 

  7. Wilton, S.: Implementing logic in fpga embedded memory arrays: architectural implications. In: Proceedings of the IEEE Custom Integrated Circuits Conference, pp. 269–272 (May 1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Roberto Moreno-Díaz Franz Pichler Alexis Quesada-Arencibia

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Borowik, G., Łuba, T., Tomaszewicz, P. (2012). On Memory Capacity to Implement Logic Functions. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2011. EUROCAST 2011. Lecture Notes in Computer Science, vol 6928. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27579-1_44

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27579-1_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27578-4

  • Online ISBN: 978-3-642-27579-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics