Skip to main content

Functions with Small C-Measures

  • Chapter
  • First Online:
Memory-Based Logic Synthesis
  • 586 Accesses

Abstract

Recall that the C-measure of a function is the maximum column multiplicity among a set of functional decompositions f(X 1, X 2), where X 1 = (x 1, x 2, , x k ) and \({X}_{2} = ({x}_{k+1},{x}_{k+2},\ldots, {x}_{n}).\) The C-measure tends to increase exponentially with the number of input variables, n. However, many practical functions have small C-measures. This chapter considers classes of functions whose C-measures are small. Such functions can be efficiently realized by LUT cascades.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tsutomu Sasao .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Sasao, T. (2011). Functions with Small C-Measures. In: Memory-Based Logic Synthesis. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-8104-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4419-8104-2_7

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4419-8103-5

  • Online ISBN: 978-1-4419-8104-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics