Logic realization using mixed representations based on Reed-Muller forms

Logic design using Boolean representations employs a complete gate set. The conventional Reed-Muller representation only uses INVERTER, AND and XOR gates. This means that the conventional Reed-Muller form, in a sense, is less flexible and doesn't always generate economical circuits. This paper discusses some useful properties of Reed-Muller forms, and the use of mixed representations based on Reed-Muller forms to design practical circuits employing a complete gate set. A redundant binary adder cell designed using this approach is presented. This adder cell is compared with others, and it is concluded that the proposed circuit is simpler than many previously reported adders.<
>