메뉴 건너뛰기




Volumn 35, Issue 5, 2016, Pages 806-819

Majority-Inverter Graph: A New Paradigm for Logic Optimization

Author keywords

Boolean Algebra; DAG; Design methods and tools; Logic Synthesis; Majority Logic; Optimization

Indexed keywords

ALGEBRA; BENCHMARKING; BOOLEAN ALGEBRA; CODES (SYMBOLS); COMPUTER CIRCUITS; DELAY CIRCUITS; DIRECTED GRAPHS; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); GRAPH THEORY; LOGIC DESIGN; LOGIC SYNTHESIS; MAJORITY LOGIC; OPTIMIZATION; RECONFIGURABLE HARDWARE;

EID: 84968547865     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2015.2488484     Document Type: Article
Times cited : (170)

References (52)
  • 2
    • 84968696233 scopus 로고    scopus 로고
    • May
    • (May 2015). ABC Synthesis Tool. [Online]. Available: http://www.eecs.berkeley.edu/~alanmi/abc/
    • (2015) ABC Synthesis Tool. [Online]
  • 3
    • 84903130344 scopus 로고    scopus 로고
    • Majority-inverter graph: A novel data-structure and algorithms for efficient logic optimization
    • San Francisco, CA, USA
    • L. Amarú, P.-E. Gaillardon, and G. De Micheli, "Majority-inverter graph: A novel data-structure and algorithms for efficient logic optimization," in Proc. DAC, San Francisco, CA, USA, 2014, pp. 1-6.
    • (2014) Proc. DAC , pp. 1-6
    • Amarú, L.1    Gaillardon, P.-E.2    De Micheli, G.3
  • 4
    • 84944104239 scopus 로고    scopus 로고
    • Boolean logic optimization in majority-inverter graph
    • San Francisco, CA, USA
    • L. Amarú, P.-E. Gaillardon, and G. De Micheli, "Boolean logic optimization in majority-inverter graph," in Proc. DAC, San Francisco, CA, USA, 2015, pp. 1-6.
    • (2015) Proc. DAC , pp. 1-6
    • Amarú, L.1    Gaillardon, P.-E.2    De Micheli, G.3
  • 10
    • 77954979683 scopus 로고    scopus 로고
    • ABC: An academic industrial-strength verification tool
    • Edinburgh, U.K.
    • R. Brayton and A. Mishchenko, "ABC: An academic industrial-strength verification tool," in Proc. CAV, Edinburgh, U.K., 2010, pp. 24-40.
    • (2010) Proc. CAV , pp. 24-40
    • Brayton, R.1    Mishchenko, A.2
  • 11
    • 0022769976 scopus 로고
    • Graph-based algorithms for Boolean function manipulation
    • Aug.
    • R. E. Bryant, "Graph-based algorithms for Boolean function manipulation," IEEE Trans. Comput., vol. C-35, no. 8, pp. 677-691, Aug. 1986.
    • (1986) IEEE Trans. Comput. , vol.C-35 , Issue.8 , pp. 677-691
    • Bryant, R.E.1
  • 12
    • 33846545005 scopus 로고    scopus 로고
    • DAG-aware AIG rewriting a fresh look at combinational logic synthesis
    • Austin, TX, USA
    • A. Mishchenko, S. Chatterjee, and R. Brayton, "DAG-aware AIG rewriting a fresh look at combinational logic synthesis," in Proc. DAC, Austin, TX, USA, 2006, pp. 532-535.
    • (2006) Proc. DAC , pp. 532-535
    • Mishchenko, A.1    Chatterjee, S.2    Brayton, R.3
  • 13
    • 40049085531 scopus 로고    scopus 로고
    • Scalable logic synthesis using a simple circuit structure
    • Vail, CO, USA
    • A. Mishchenko and R. K. Brayton, "Scalable logic synthesis using a simple circuit structure," in Proc. IWLS, Vail, CO, USA, 2006, pp. 15-22.
    • (2006) Proc. IWLS , pp. 15-22
    • Mishchenko, A.1    Brayton, R.K.2
  • 14
    • 27944499984 scopus 로고
    • Majority-logic synthesis by geometric methods
    • Feb.
    • H. S. Miller and R. O. Winder, "Majority-logic synthesis by geometric methods," IRE Trans. Electron. Comput., vol. EC-11, no. 1, pp. 89-90, Feb. 1962.
    • (1962) IRE Trans. Electron. Comput. , vol.EC-11 , Issue.1 , pp. 89-90
    • Miller, H.S.1    Winder, R.O.2
  • 15
    • 84879871001 scopus 로고
    • Decompositions of logical functions using majority decision elements
    • Dec.
    • Y. Tohma, "Decompositions of logical functions using majority decision elements," IEEE Trans. Electron. Comput., vol. EC-13, no. 6, pp. 698-705, Dec. 1964.
    • (1964) IEEE Trans. Electron. Comput. , vol.EC-13 , Issue.6 , pp. 698-705
    • Tohma, Y.1
  • 16
    • 84855672784 scopus 로고
    • Realization of arbitrary logical functions using majority elements
    • Jun.
    • F. Miyata, "Realization of arbitrary logical functions using majority elements," IEEE Trans. Electron. Comput., vol. EC-12, no. 3, pp. 183-191, Jun. 1963.
    • (1963) IEEE Trans. Electron. Comput. , vol.EC-12 , Issue.3 , pp. 183-191
    • Miyata, F.1
  • 17
    • 0027151707 scopus 로고
    • EXORCISM-MV-2: Minimization of ESOP expressions for MV input incompletely specified functions
    • Sacramento, CA, USA
    • N. Song and M. A. Perkowski, "EXORCISM-MV-2: Minimization of ESOP expressions for MV input incompletely specified functions," in Proc. MVL, Sacramento, CA, USA, 1993, pp. 132-137.
    • (1993) Proc. MVL , pp. 132-137
    • Song, N.1    Perkowski, M.A.2
  • 18
    • 33845331515 scopus 로고
    • Minimization of Boolean functions
    • Nov.
    • E. J. McCluskey, Jr., "Minimization of Boolean functions," Bell Syst. Tech. J., vol. 35, no. 6, pp. 1417-1444, Nov. 1956.
    • (1956) Bell Syst. Tech. J. , vol.35 , Issue.6 , pp. 1417-1444
    • McCluskey, E.J.1
  • 19
    • 0002846615 scopus 로고
    • The decomposition and factorization of Boolean expressions
    • R. K. Brayton and C. McMullen, "The decomposition and factorization of Boolean expressions," in Proc. ISCAS, 1982, pp. 49-54.
    • (1982) Proc. ISCAS , pp. 49-54
    • Brayton, R.K.1    McMullen, C.2
  • 23
    • 84968631832 scopus 로고    scopus 로고
    • BDS-MAJ: A BDD-based logic synthesis tool exploiting majority decomposition
    • Austin, TX, USA
    • L. Amaru, P.-E. Gaillardon, and G. De Micheli, "BDS-MAJ: A BDD-based logic synthesis tool exploiting majority decomposition," in Proc. DAC, Austin, TX, USA, 2013, pp. 1-6.
    • (2013) Proc. DAC , pp. 1-6
    • Amaru, L.1    Gaillardon, P.-E.2    De Micheli, G.3
  • 24
    • 33646385935 scopus 로고    scopus 로고
    • Using simulation and satisfiability to compute flexibilities in Boolean networks
    • May
    • A. Mishchenko et al., "Using simulation and satisfiability to compute flexibilities in Boolean networks," IEEE J. Technol. Comput.-Aided Des., vol. 25, no. 12, pp. 743-755, May 2006.
    • (2006) IEEE J. Technol. Comput.-Aided Des. , vol.25 , Issue.12 , pp. 743-755
    • Mishchenko, A.1
  • 25
    • 0030379797 scopus 로고    scopus 로고
    • Perturb and simplify: Multilevel Boolean network optimizer
    • Dec.
    • S.-C. Chang, M. Marek-Sadowska, and K.-T. Cheng, "Perturb and simplify: Multilevel Boolean network optimizer," IEEE J. Technol. Comput.-Aided Des., vol. 15, no. 12, pp. 1494-1504, Dec. 1996.
    • (1996) IEEE J. Technol. Comput.-Aided Des. , vol.15 , Issue.12 , pp. 1494-1504
    • Chang, S.-C.1    Marek-Sadowska, M.2    Cheng, K.-T.3
  • 27
    • 0003010428 scopus 로고
    • The decomposition of switching functions
    • Cambridge, MA, USA, Apr.
    • R. L. Ashenhurst, "The decomposition of switching functions," in Proc. Int. Symp. Theory Switch., Cambridge, MA, USA, Apr. 1957, pp. 74-116.
    • (1957) Proc. Int. Symp. Theory Switch. , pp. 74-116
    • Ashenhurst, R.L.1
  • 28
    • 0000568889 scopus 로고
    • Minimization over Boolean graphs
    • Apr.
    • J. P. Roth and R. M. Karp, "Minimization over Boolean graphs," IBM J. Res. Develop., vol. 6, no. 2, pp. 227-238, Apr. 1962.
    • (1962) IBM J. Res. Develop. , vol.6 , Issue.2 , pp. 227-238
    • Roth, J.P.1    Karp, R.M.2
  • 30
    • 0031356802 scopus 로고    scopus 로고
    • Disjunctive decomposition of logic functions
    • San Jose, CA, USA
    • V. Bertacco and M. Damiani, "Disjunctive decomposition of logic functions," in Proc. ICCAD, San Jose, CA, USA, 1997, pp. 78-82.
    • (1997) Proc. ICCAD , pp. 78-82
    • Bertacco, V.1    Damiani, M.2
  • 31
    • 84962475847 scopus 로고    scopus 로고
    • Faster logic manipulation for large designs
    • Austin, TX, USA
    • A. Mishchenko and R. Brayton, "Faster logic manipulation for large designs," in Proc. IWLS, Austin, TX, USA, 2013.
    • (2013) Proc. IWLS
    • Mishchenko, A.1    Brayton, R.2
  • 32
    • 84950635349 scopus 로고
    • Sets of independent postulates for the algebra of logic
    • Jul.
    • E. V. Huntington, "Sets of independent postulates for the algebra of logic," Trans. Amer. Math. Soc., vol. 5, no. 3, pp. 288-309, Jul. 1904.
    • (1904) Trans. Amer. Math. Soc. , vol.5 , Issue.3 , pp. 288-309
    • Huntington, E.V.1
  • 33
    • 0001521953 scopus 로고
    • Boolean algebras with operators. Part I
    • Oct.
    • B. Jonsson and A. Tarski, "Boolean algebras with operators. Part I," Amer. J. Math., vol. 73, no. 4, pp. 891-939, Oct. 1951.
    • (1951) Amer. J. Math. , vol.73 , Issue.4 , pp. 891-939
    • Jonsson, B.1    Tarski, A.2
  • 34
    • 0004190631 scopus 로고
    • New York, NY, USA: Amer. Math. Soc.
    • G. Birkhoff, Lattice Theory. New York, NY, USA: Amer. Math. Soc., 1967.
    • (1967) Lattice Theory
    • Birkhoff, G.1
  • 35
    • 84967792017 scopus 로고
    • Median algebra
    • Aug.
    • J. R. Isbell, "Median algebra," Trans. Amer. Math. Soc., vol. 260, no. 2, pp. 319-362, Aug. 1980.
    • (1980) Trans. Amer. Math. Soc. , vol.260 , Issue.2 , pp. 319-362
    • Isbell, J.R.1
  • 36
    • 84966216059 scopus 로고
    • A ternary operation in distributive lattices
    • G. Birkhoff and S. A. Kiss, "A ternary operation in distributive lattices," Bull. Amer. Math. Soc., vol. 53, no. 8, pp. 749-752, 1947.
    • (1947) Bull. Amer. Math. Soc. , vol.53 , Issue.8 , pp. 749-752
    • Birkhoff, G.1    Kiss, S.A.2
  • 37
    • 84968631896 scopus 로고    scopus 로고
    • Upper Saddle River, NJ, USA: Addison-Wesley
    • D. E. Knuth, The Art of Computer Programming, vol. 4A. Upper Saddle River, NJ, USA: Addison-Wesley, 2011.
    • (2011) The Art of Computer Programming , vol.4 A
    • Knuth, D.E.1
  • 38
    • 0031095414 scopus 로고    scopus 로고
    • On the computational power of depth-2 circuits with threshold and modulo gates
    • M. Krause and P. Pudlák, "On the computational power of depth-2 circuits with threshold and modulo gates," Theor. Comput. Sci., vol. 174, nos. 1-2, pp. 137-156, 1997.
    • (1997) Theor. Comput. Sci. , vol.174 , Issue.1-2 , pp. 137-156
    • Krause, M.1    Pudlák, P.2
  • 39
    • 0024753283 scopus 로고
    • The transduction method-design of logic networks based on permissible functions
    • Oct.
    • S. Muroga, Y. Kambayashi, H. C. Lai, and J. N. Culliney, "The transduction method-design of logic networks based on permissible functions," IEEE Trans. Comput., vol. 38, no. 10, pp. 1404-1424, Oct. 1989.
    • (1989) IEEE Trans. Comput. , vol.38 , Issue.10 , pp. 1404-1424
    • Muroga, S.1    Kambayashi, Y.2    Lai, H.C.3    Culliney, J.N.4
  • 40
    • 4544296705 scopus 로고
    • The use of triple-modular redundancy to improve computer reliability
    • Apr.
    • R. E. Lyons and W. Vanderkulk, "The use of triple-modular redundancy to improve computer reliability," IBM J. Res. Develop., vol. 6, no. 2, pp. 200-209, Apr. 1962.
    • (1962) IBM J. Res. Develop. , vol.6 , Issue.2 , pp. 200-209
    • Lyons, R.E.1    Vanderkulk, W.2
  • 41
    • 84904563123 scopus 로고    scopus 로고
    • Methodology for achieving best trade-off of area and fault masking coverage in ATMR
    • Fortaleza, Brazil
    • I. A. C. Gomes et al., "Methodology for achieving best trade-off of area and fault masking coverage in ATMR," in Proc. LATW, Fortaleza, Brazil, 2014, pp. 1-6.
    • (2014) Proc. LATW , pp. 1-6
    • Gomes, I.A.C.1
  • 42
    • 5544256331 scopus 로고    scopus 로고
    • Power minimization in IC design: Principles and applications
    • M. Pedram, "Power minimization in IC design: Principles and applications," ACM Trans. Design Autom. Electron. Syst. (TODAES), vol. 1, no. 1, pp. 3-56, 1996.
    • (1996) ACM Trans. Design Autom. Electron. Syst. (TODAES) , vol.1 , Issue.1 , pp. 3-56
    • Pedram, M.1
  • 43
    • 0012617745 scopus 로고    scopus 로고
    • Proclaiming dictators and juntas or testing Boolean formulae
    • Berlin, Germany: Springer
    • M. Parnas, D. Ron, and A. Samorodnitsky, "Proclaiming dictators and juntas or testing Boolean formulae," in Combinatorial Optimization. Berlin, Germany: Springer, 2001, pp. 273-285.
    • (2001) Combinatorial Optimization , pp. 273-285
    • Parnas, M.1    Ron, D.2    Samorodnitsky, A.3
  • 45
    • 78649987428 scopus 로고    scopus 로고
    • Device and architecture outlook for beyond CMOS switches
    • Dec.
    • K. Bernstein, R. K. Cavin, W. Porod, A. Seabaugh, and J. Welser, "Device and architecture outlook for beyond CMOS switches," Proc. IEEE, vol. 98, no. 12, pp. 2169-2184, Dec. 2010.
    • (2010) Proc. IEEE , vol.98 , Issue.12 , pp. 2169-2184
    • Bernstein, K.1    Cavin, R.K.2    Porod, W.3    Seabaugh, A.4    Welser, J.5
  • 47
    • 36449009014 scopus 로고
    • Logical devices implemented using quantum cellular automata
    • P. D. Tougaw and C. S. Lent, "Logical devices implemented using quantum cellular automata," J. Appl. Phys., vol. 75, no. 3, pp. 1811-1817, 1994.
    • (1994) J. Appl. Phys. , vol.75 , Issue.3 , pp. 1811-1817
    • Tougaw, P.D.1    Lent, C.S.2
  • 48
    • 84879089319 scopus 로고    scopus 로고
    • Three-input majority logic gate and multiple input logic circuit based on DNA strand displacement
    • W. Li, Y. Yang, H. Yan, and Y. Liu, "Three-input majority logic gate and multiple input logic circuit based on DNA strand displacement," Nano Lett., vol. 13, no. 6, pp. 2980-2988, 2013.
    • (2013) Nano Lett. , vol.13 , Issue.6 , pp. 2980-2988
    • Li, W.1    Yang, Y.2    Yan, H.3    Liu, Y.4
  • 49
    • 84968602364 scopus 로고    scopus 로고
    • Computing secrets on a resistive memory array
    • San Francisco, CA, USA
    • P.-E. Gaillardon et al., "Computing secrets on a resistive memory array," in Proc. DAC, San Francisco, CA, USA, 2015, pp. 7-11.
    • (2015) Proc. DAC , pp. 7-11
    • Gaillardon, P.-E.1
  • 50
    • 84883474388 scopus 로고    scopus 로고
    • Efficient arithmetic logic gates using double-gate silicon nanowire FETs
    • Paris, France
    • L. Amarú, P.-E. Gaillardon, and G. De Micheli, "Efficient arithmetic logic gates using double-gate silicon nanowire FETs," in Proc. NEWCAS, Paris, France, 2013, pp. 1-4.
    • (2013) Proc. NEWCAS , pp. 1-4
    • Amarú, L.1    Gaillardon, P.-E.2    De Micheli, G.3
  • 51
    • 84855759921 scopus 로고    scopus 로고
    • Delay optimization using SOP balancing
    • San Jose, CA, USA
    • A. Mishchenko, R. Brayton, S. Jang, and V. Kravets, "Delay optimization using SOP balancing," in Proc. ICCAD, San Jose, CA, USA, 2011, pp. 375-382.
    • (2011) Proc. ICCAD , pp. 375-382
    • Mishchenko, A.1    Brayton, R.2    Jang, S.3    Kravets, V.4
  • 52
    • 0025531379 scopus 로고
    • A depth-decreasing heuristic for combinational logic; or how to convert a ripple-carry adder into a carry-lookahead adder or anything in-between
    • Orlando, FL, USA
    • J. P. Fishburn, "A depth-decreasing heuristic for combinational logic; or how to convert a ripple-carry adder into a carry-lookahead adder or anything in-between," in Proc. DAC, Orlando, FL, USA, 1990, pp. 361-364.
    • (1990) Proc. DAC , pp. 361-364
    • Fishburn, J.P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.