A STUDY ON TESTABILITY AND FOLDABILITY ASPECTS OF A PLA

Abstract

Programmable logic arrays (pLs) are fast catching up the imginatin of VLSt designers due to th!r flexible but hig.y regular structure. This focuses particular at'tentior on their testing and cOst.eectLve chip imple entat1on. Both of these aspects re considered in the present dissertation work. Two new algorithms are proposed for this a review of the various PLA concepts and some existing repz'e sentattve PtA testing and folding sohemewo The proposed PtA testing scheme comers almost all the possible faults in a PtA and the new folding aigoritbm produces more compact pact PLAs than other existing aorit1ins.