Abstract
The various techniques for exact and heuristic encoding based on multi-valued or symbolic minimization of two-level and multi-level logic, reported in [133, 131, 168, 61, 121, 33], produce various types of encoding constraints. By encoding constraints we mean requirements on the codes to be assigned to the symbols.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Villa, T., Kam, T., Brayton, R.K., Sangiovanni-Vincentelli, A. (1997). Encoding Constraints. In: Synthesis of Finite State Machines. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6155-2_6
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6155-2_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7821-1
Online ISBN: 978-1-4615-6155-2
eBook Packages: Springer Book Archive