首页   按字顺浏览 期刊浏览 卷期浏览 Computational complexity of test generation for ETG PLAs
Computational complexity of test generation for ETG PLAs

 

作者: Yinghua Min,   Yashwant K.Malaiya,   BidyutGupta,  

 

期刊: IEE Proceedings E (Computers and Digital Techniques)  (IET Available online 1989)
卷期: Volume 136, issue 2  

页码: 107-111

 

年代: 1989

 

DOI:10.1049/ip-e.1989.0016

 

出版商: IEE

 

数据来源: IET

 

摘要:

In a wide sense, easy test generation (ETG) circuits can be considered as design for testability (DFT) circuits. However most of the DFT techniques presented so far in the literature are attempts to ease test application. Major disadvantages with these DFT techniques are degradation of circuit performance, and often the requirement of a long and continuous test mode. However, an ETG circuit attempts to make test generation easier without any significant degradation of circuit performance, and the test mode can be divided into pieces to fit the requirement of real-time systems. The paper presents two important types of PLA design techniques which reduce the computational complexity for test generation. An O(n) ETG PLA is defined, and a sufficient condition for O(n2) ETG PLAs is also obtained. It is shown that the easily testable PLAs introduced by Bozorgui-Nesbat and McCluskey are O(n2) ETG PLAs.

 

点击下载:  PDF (607KB)



返 回