A computer algorithm for AND-ExOR PLAs with k-bit decoders
Gulzar Ali Khuwaja, Abdulnasser Abu-Rezq · 2002
A computer algorithm which attempts to find the optimal modulo-2 factorized expression based on tabulation method is devised. This is a general algorithm to simplify switching functions (both Boolean and Reed-Muller) for the implementation of PLAs (both AND-OR and AND-ExOR) using k-bit maxterm decoders; 1/spl les/k/spl les/n/2 where n is the number of input variables. A maxterm decoder is a device which has k-inputs and p=2/sup k/ outputs such that for each input combination 2/sup k/-1 outputs are active.