DocumentCode
3569582
Title
Isomorphic structured synthesis of Half Adder and Full Adder
Author
Ghaznavi-Ghoushchi, M.B. ; Nabavi, A.R.
Author_Institution
Sch. of Eng., Tarbiat Modares Univ., Tehran, Iran
Volume
2
fYear
2002
fDate
6/24/1905 12:00:00 AM
Firstpage
634
Abstract
In this paper we present a new method for synthesis of Half Adder (H.A.) and Full Adder (F.A) Units. The synthesis is based on Graph Oriented Realization (GOR). GOR uses BDD and generates another graph called Cut Set Graph. This graph is then simplified and compiled for technology mapping. In the synthesized circuits, we show that there is an isomorphism between 2-input´s AND (Carry) with 2-input´s XOR (Sum) in H.A. and between 3-input´s (Carry) with 3-input´s XOR (Sum). Level Restoration is accomplished by output drivers. Each unit is simulated by HSPICE.
Keywords
adders; binary decision diagrams; high level synthesis; Cut Set Graph; Full Adder; Graph Oriented Realization; I-layAdder; architecture; binary arithmetic; binary decision diagram; graph isomorphism; synthesis; technology mapping; Adders; Arithmetic; Binary decision diagrams; Circuit simulation; Circuit synthesis; Digital signal processors; Integrated circuit synthesis; Microprocessors; Signal restoration; Signal synthesis;
fLanguage
English
Publisher
ieee
Conference_Titel
Electrical and Computer Engineering, 2002. IEEE CCECE 2002. Canadian Conference on
ISSN
0840-7789
Print_ISBN
0-7803-7514-9
Type
conf
DOI
10.1109/CCECE.2002.1013015
Filename
1013015
Link To Document