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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on computers Ročník 40; číslo 2; s. 205 - 213
Hlavní autor:	Bryant, R.E.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.02.1991 Institute of Electrical and Electronics Engineers
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!