DocumentCode
418478
Title
A heuristic approach to synthesize Boolean functions using TANT network
Author
Babu, Hafiz Hasan ; Islam, Rafiqul ; Nazmul, Rumana ; Haque, Anwarul ; Chowdhury, Ahsan Raja
Author_Institution
Dept. of Comput. Sci., Dhaka Univ., Bangladesh
Volume
2
fYear
2004
fDate
23-26 May 2004
Abstract
TANT is a three-level AND-NOT network with true inputs composed solely of NAND gates. This correspondence describe a systematic method for minimizing a TANT circuit and the heuristic algorithms for different stages of the technique are provided along with it to improve the existing method. It has been also shown that, the existing method produces sub optimal result in some cases, where as the proposed one produces the optimal result. Algorithms in each step of the proposed method are extensively discussed in this paper.
Keywords
Boolean functions; logic circuits; logic gates; minimisation; Boolean functions; NAND gates; heuristic algorithms; logic circuits; minimisation; three level AND-NOT network; Boolean functions; Computer science; DH-HEMTs; Heuristic algorithms; Integrated circuit interconnections; Logic devices; Minimization methods; Network synthesis; Programmable logic arrays; Tail;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 2004. ISCAS '04. Proceedings of the 2004 International Symposium on
Print_ISBN
0-7803-8251-X
Type
conf
DOI
10.1109/ISCAS.2004.1329286
Filename
1329286
Link To Document