ONE-BIT ADDER DESIGN BASED ON REED-MULLER EXPANSIONS

被引:1
|
作者
GUAN, Z
ALMAINI, AEA
机构
[1] Department of Electrical Electronic and Computer Engineering, Napier University, Edinburgh, 14 1DJ
关键词
D O I
10.1080/00207219508926289
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
It has been claimed for some time that the Reed-Muller technique can yield a simpler arithmetic circuit if it is employed in the design procedure. In fact, no practical application in this field can be found in the open literature. This paper attempts to demonstrate a practical one-bit adder design that is based on the Reed-Muller expansion. Although the one-bit adder is simple, no method can always guarantee to obtain both a time and area optimal circuit. In this paper, a procedure to design both a time and area optimal one-bit adder in static CMOS circuits is presented. Some issues are also addressed for practical logic circuit design.
引用
收藏
页码:519 / 529
页数:11
相关论文
共 50 条
  • [41] USING A GENETIC ALGORITHM FOR OPTIMIZING FIXED POLARITY REED-MULLER EXPANSIONS OF BOOLEAN FUNCTIONS
    MILLER, JF
    LUCHIAN, H
    BRADBEER, PVG
    BARCLAY, PJ
    INTERNATIONAL JOURNAL OF ELECTRONICS, 1994, 76 (04) : 601 - 609
  • [42] Fast optimization of fixed-polarity reed-muller expansions over GF(5)
    Falkowski, BJ
    Lozano, CC
    Rahardja, S
    34TH INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC, PROCEEDINGS, 2004, : 162 - 167
  • [43] Fast algorithm for minimizing Reed-Muller expansions of systems of incompletely specified MVL functions
    Zakrevskij, AD
    Zakrevski, LA
    27TH INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC - 1997 PROCEEDINGS, 1997, : 61 - 65
  • [44] Synthesis of minimum Reed-Muller expansions for multi-valued logic schemes.
    Zakrevsky, AD
    Zakrevsky, LA
    DOKLADY AKADEMII NAUK BELARUSI, 1997, 41 (05): : 5 - 9
  • [45] Non-exhaustive search methods and their use in the minimization of Reed-Muller canonical expansions
    Robertson, GI
    Miller, JF
    Thomson, P
    INTERNATIONAL JOURNAL OF ELECTRONICS, 1996, 80 (01) : 1 - 12
  • [46] Towards constructing one-bit binary adder in excitable chemical medium
    Costello, Ben De Lacy
    Adamatzky, Andy
    Jahan, Ishrat
    Zhang, Liang
    CHEMICAL PHYSICS, 2011, 381 (1-3) : 88 - 99
  • [47] BINARY MULTILEVEL COSET CODES BASED ON REED-MULLER CODES
    PELLIZZONI, R
    SPALVIERI, A
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1994, 42 (07) : 2357 - 2360
  • [48] TEST-PATTERN GENERATION BASED ON REED-MULLER COEFFICIENTS
    ORTEGA, J
    RUIZ, AL
    PRIETO, A
    PELAYO, FJ
    IEEE TRANSACTIONS ON COMPUTERS, 1993, 42 (08) : 968 - 980
  • [49] HIGHLY EFFICIENT EXHAUSTIVE SEARCH ALGORITHM FOR OPTIMIZING CANONICAL REED-MULLER EXPANSIONS OF BOOLEAN FUNCTIONS
    MILLER, JF
    THOMSON, P
    INTERNATIONAL JOURNAL OF ELECTRONICS, 1994, 76 (01) : 37 - 56
  • [50] Punctured Reed-Muller code-based McEliece cryptosystems
    Lee, Wijik
    No, Jong-Seon
    Kim, Young-Sik
    IET COMMUNICATIONS, 2017, 11 (10) : 1543 - 1548