On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication

Lower-bound results on Boolean-function complexity under two different models are discussed. The first is an abstraction of tradeoffs between chip area and speed in very-large-scale-integrated (VLSI) circuits. The second is the ordered binary decision diagram (OBDD) representation used as a data str...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers Jg. 40; H. 2; S. 205 - 213
1. Verfasser: Bryant, R.E.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.02.1991
Institute of Electrical and Electronics Engineers
Schlagworte:
Applied sciences
Boolean functions
Chip scale packaging
Computer science
Data structures
Design. Technologies. Operation analysis. Testing
Electronics
Exact sciences and technology
Input variables
Integrated circuit technology
Integrated circuits
Logic circuits
Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices
Size measurement
Very large scale integration
Lower bound
Multiplication
VLSI circuit
Integrated circuit
Boolean function
Decision
Complexity
Diagram
ISSN:0018-9340
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Lower-bound results on Boolean-function complexity under two different models are discussed. The first is an abstraction of tradeoffs between chip area and speed in very-large-scale-integrated (VLSI) circuits. The second is the ordered binary decision diagram (OBDD) representation used as a data structure for symbolically representing and manipulating Boolean functions. The lower bounds demonstrate the fundamental limitations of VLSI as an implementation medium, and that of the OBDD as a data structure. It is shown that the same technique used to prove that any VLSI implementation of a single output Boolean function has area-time complexity AT/sup 2/= Omega (n/sup 2/) also proves that any OBDD representation of the function has Omega (c/sup n/) vertices for some c>1 but that the converse is not true. An integer multiplier for word size n with outputs numbered 0 (least significant) through 2n-1 (most significant) is described. For the Boolean function representing either output i-1 or output 2n-i-1, where 1<or=i<or=n, the following lower bounds are proved: any VLSI implementation must have AT/sup 2/= Omega (i/sup 2/) and any OBDD representation must have Omega (1.09/sup i/) vertices.< >
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9340
DOI:10.1109/12.73590