FAST TABULAR TECHNIQUE FOR FIXED-POLARITY REED-MULLER LOGIC WITH INHERENT PARALLEL PROCESSES

We have developed a fast tabular technique for Boolean to fixed-polari ty Reed-Muller logic conversion. The idea is derived from the popular tabular technique but the processes of generating new terms and cancel ling pairs are vastly different. The feature of bit-by-bit operation i n the tabular technique has also been changed. In our technique, an in dex table is used to capture the number of occurrences of initial and new terms. This instant updating process eliminates the time-consuming step of cancelling pairs and makes the method much more efficient tha n the tabular technique. In addition, the fast tabular technique posse sses inherent parallelism since different minterms can be processed co ncurrently and added to the index table independently. Our method is a pplicable to any number of variables and is suitable for manual comput ations as well as computer programming. Some comparison results are gi ven, and we believe our technique has achieved the best time and space complexities so far.