输入端加译码器的可编程逻辑阵列的复杂性分析

COMPLEXITY OF PROGRAMMABLE LOGIC ARRAYS WITH INPUT DECODERS

输入端加译码器的可编程逻辑阵列比普通的可编程逻辑阵列具有更大的实现能力,这种阵列表现为三级的或-与-或电路,本文提出了与该电路相关的一系列基本概念和理论,并且还进行了复杂性分析,结论是使用该阵列实现一个任意n变量逻辑函数所需的最大存储单元数为:(2n+1)2^(n-2)。

Programmable logic arrays with input decoders have greater design capability than ordinary PLAs.These logic arrays are cascaded to perform a three-level OR-AND-OR circuit.This paper proposes basic definitions and theories about programmable logic arrays with input decoders and studies their complexity.To realize an arbitrary n-variable Boolean function,(2n+1)2n-2 elements is sufficient.