2002
DOI: 10.1109/tvlsi.2002.801578
|View full text |Cite
|
Sign up to set email alerts
|

Gate-diffusion input (GDI): a power-efficient method for digital combinatorial circuits

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
112
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 299 publications
(112 citation statements)
references
References 17 publications
0
112
0
Order By: Relevance
“…Though we highlighted an "Optical Circuit" for information processing and computation of even/odd parity circuit, we are not discussing in detail as such advanced topics like Photonics and Optical Computing, which deserve another research paper on an in-depth basis. Hence we are of the belief that our current research work is one of the pioneering efforts in this promising domain of Branching Programs which is interdisciplinary in nature (Mehlhorn & Nher, 1995;Moreinis, Morgenshtein, Wagner, & Kolodny, 2006;Morgenshtein, Fish, & Wagner, 2002;Morgenshtein, Friedman, Ginosar, & Kolodny, 2008;Nakano & Wada, 1998;Nishihara, Haruna, & Suhara, 1987;Okayama, Okabe, Kamijoh, & Sakamoto, 1999;Reed & Knights, 2004;Shi, Wa, Miller, Pamulapati, & Cooke, 1995;Isabelle, 2012;Anthony Fox, 2012; HOL: The Higher Order Logic Theorem Prover; Barrington's Theorem, 2009).…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Though we highlighted an "Optical Circuit" for information processing and computation of even/odd parity circuit, we are not discussing in detail as such advanced topics like Photonics and Optical Computing, which deserve another research paper on an in-depth basis. Hence we are of the belief that our current research work is one of the pioneering efforts in this promising domain of Branching Programs which is interdisciplinary in nature (Mehlhorn & Nher, 1995;Moreinis, Morgenshtein, Wagner, & Kolodny, 2006;Morgenshtein, Fish, & Wagner, 2002;Morgenshtein, Friedman, Ginosar, & Kolodny, 2008;Nakano & Wada, 1998;Nishihara, Haruna, & Suhara, 1987;Okayama, Okabe, Kamijoh, & Sakamoto, 1999;Reed & Knights, 2004;Shi, Wa, Miller, Pamulapati, & Cooke, 1995;Isabelle, 2012;Anthony Fox, 2012; HOL: The Higher Order Logic Theorem Prover; Barrington's Theorem, 2009).…”
Section: Discussionmentioning
confidence: 99%
“…One can have similar branching programs for the parity function. It can be shown that every function on n bits can be computed by a branching program of width 3 and exponential length" (Hunsperger, 2002;Hussein, Nounou, Saada, Atef, & Khalil, 2006;Jang, Park, & Prasanna, 1992;Taki, 2000;Lattner, 2002;Mehlhorn & Nher, 1995;Moreinis, Morgenshtein, Wagner, & Kolodny, 2006;Morgenshtein, Fish, & Wagner, 2002;Morgenshtein, Friedman, Ginosar, & Kolodny, 2008;Nakano & Wada, 1998;Nishihara, Haruna, & Suhara, 1987;Okayama, Okabe, Kamijoh, & Sakamoto, 1999;Reed & Knights, 2004;Shi, Wa, Miller, Pamulapati, & Cooke, 1995;Isabelle, 2012;Anthony Fox, 2012; HOL: The Higher Order Logic Theorem Prover; Barrington's Theorem, 2009). Figure 1, we designed a simple boolean circuit and deduced its equivalent branching program, using the established mathematical and computational paradigms.…”
Section: Branching Program/s (Bp)mentioning
confidence: 99%
“…It looks like CMOS inverter but the source and drain input of both the transistors are different [13] - [15].…”
Section: Gdi Techniquementioning
confidence: 99%
“…To reduce the area and power various techniques are used. Some of them are CMOS, Transmission Gate [1], Pass Transistor logic [1] etc. Although these several techniques have been proposed to reduce the area, power consumption but there were some limitations like low logic level and circuit complexity in it.…”
Section: Introductionmentioning
confidence: 99%
“…Step: 1 step: 2 1101(13) 1001(9) +1011 (ones complement of 4) +1011 11000 10100 1 1 1001 (9) 0101 (5) Step: 3 step: 4 0101(5) 0001(1) +1011 +1011 10000 01100 1 -0011(-3) 0001 (1) carry is zero Here when difference is positive final carry is 1 which is end around and added to get the actual difference. When difference is negative, carry is zero and true result is obtained by one's complement of the sum output.…”
Section: Introductionmentioning
confidence: 99%