Optimisation of Reed-Muller PLA implementations

摘要

Decomposition techniques are utilised for mixed polaritynReed-Muller minimisation, which lead to Reed-Muller programmable logicnarray implementations for Boolean functions. The proposed algorithmnproduces a simplified mixed polarity Reed-Muller format from thenconventional sum-of-products input based on a top-down strategy. Thenoutput format belongs to the most general class of AND/XOR forms, namelynexclusive-OR sum-of-products. This method is further generalised to verynlarge multiple output Boolean functions. The developed decompositionnmethod is implemented in the C language and tested with MCNC and IWLS'93nbenchmarks. Experimental results show that the decomposition method cannproduce much better results than Espresso for many test cases. Thisnefficient method offers compact Reed-Muller programmable logic arraynimplementations with the added advantage of easy testability, inncontrast to the conventional programmable logic array realisations