Logic design principles with emphasis on testable semicustom circuits
Logic design principles with emphasis on testable semicustom circuits
Electronic logic systems (3rd ed.)
Electronic logic systems (3rd ed.)
Easily Testable Realizations for Generalized Reed-Muller Expressions
IEEE Transactions on Computers
| Hi-index | 0.00 |
This paper presents two algorithms, the first one is used to convert between Product of Sums (POS) and Positive Polarity Dual Reed-Muller (PPDRM) forms. The second algorithm is used to compute all the coefficients of the Fixed Polarity Dual Reed-Muller (FPDRM) with polarity p from any polarity q. This technique is used to find the best polarity of FPDRM among the 2n fixed polarities. The algorithm is based on the dual property and the Gray code strategy. Therefore, there is no need to start from POS form to find FPDRM coefficients for all the polarities. The proposed methods are efficient in terms of memory size and CPU time as shown in the experimental results.