DocumentCode :
3257159
Title :
Coalgebraic division for multilevel logic synthesis
Author :
Hsu, Wen-Jun ; Shen, Wen-Zen
Author_Institution :
Dept. of Electron. Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan
fYear :
1992
fDate :
8-12 Jun 1992
Firstpage :
438
Lastpage :
442
Abstract :
By introducing two Boolean properties into an algebraic division operation, a subset of Boolean division can be performed with approximately the same complexity as the algebraic division implemented in the misII environment. The extended algebraic division algorithm is called coalgebraic division. The experimental results show that the execution time of coalgebraic division is very close to that of algebraic division. With a simple restriction during division, coalgebraic division can also preserve the network testability as well as the test patterns
Keywords :
Boolean functions; logic CAD; logic testing; Boolean division; Boolean properties; coalgebraic division; complexity; misII environment; multilevel logic synthesis; network testability; test patterns; Algorithm design and analysis; Boolean algebra; Boolean functions; Circuit synthesis; Circuit testing; Design optimization; Integrated circuit interconnections; Logic functions; Logic gates; Network synthesis;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Design Automation Conference, 1992. Proceedings., 29th ACM/IEEE
Conference_Location :
Anaheim, CA
ISSN :
0738-100X
Print_ISBN :
0-8186-2822-7
Type :
conf
DOI :
10.1109/DAC.1992.227763
Filename :
227763
Link To Document :
بازگشت