Method for converting canonical rm logic circuits

Abstract

The invention discloses a method for converting to a standard RM logic circuit. First, the type of a circuit to be converted is judged as a Boolean logic circuit or an RM logic circuit; product itemscontained in the logic function expression are updated only by operating the product items according to different circuit types to be converted through simple intersection operations to obtain productitems contained in a middle nonstandard RM logic function expression; then variable character bits of the product items contained in the middle nonstandard RM logic function expression are replaced to convert to a target standard RM logic expression. The method has the advantage that the minimum term expansion or disjoint product term processing of the product terms is not needed, and the calculation complexity and the memory occupation amount are effectively reduced. Moreover, the calculation time is insensitive to the number of input variables but only related to the number of the product terms and the intersection. Converting to standard RM logic circuits with large-scale variables can be rapidly processed, with simple conversion process, and high conversion speed.

Description

technical field [0001] The invention relates to a method for converting RM logic circuits, in particular to a method for converting standard RM logic circuits. Background technique [0002] Binary digital logic circuits can be expressed as Boolean logic in the form of AND-OR, or as Reed-Muller (RM) logic in the form of AND-EXOR. The study found that circuits implemented with RM logic, such as arithmetic circuits, communication circuits, and parity check circuits, have significant advantages in terms of area, power consumption, speed, and testability compared to circuits implemented with traditional Boolean logic; in addition, emerging Synthetic optimization problems on reversible logic and quantum circuits can be conveniently mapped to RM logic domains for preprocessing. Therefore, RM logic has been widely used in the field of current low-power integrated circuit design and future quantum reversible circuit design [0003] Regardless of whether it is a Boolean logic functi...

AI Technical Summary

Problems solved by technology

For the list technique based on disjoint product items, the computational overhead of the additional disjoint product items increases the conversion difficulty; for the remaining methods except the list technique based on disjoint product items, their computational complexity and memory footprint are inevitably exponentially related to the size of the input variables of the logistic function

Therefore, these existing conversion methods are relatively complicated, and it is difficult to truly meet the rapid conversion requirements of large-scale variable norm RM logic circuits.

Images