Recursive Pseudo-Exhaustive Two-Pattern Generator  

Abstract

Pseudo-exhaustive pattern generators for built-in self-test (BIST) provide high fault coverage of detectable combinational faults with much fewer test vectors than exhaustive generation. In (n, k)-adjacent bit pseudo-exhaustive test sets, all 2k binary combinations appear to all adjacent k-bit groups of inputs. With recursive pseudoexhaustive generation, all (n, k)-adjacent bit pseudoexhaustive tests are generated for k, n and more than one modules can be pseudo-exhaustively tested in parallel. In order to detect sequential (e.g., stuck-open) faults that occur into current CMOS circuits, two-pattern tests are exercised. Also, delay testing, commonly used to assure correct circuit operation at clock speed requires two-pattern tests. In this paper a pseudoexhaustive two-pattern generator is presented, that recursively generates all two-pattern (n, k)- adjacent bit pseudoexhaustive tests for all k, n. To the best of our knowledge, this is the first time in the open literature that the subject of recursive pseudoexhaustive two-pattern testing is being dealt with. A software-based implementation with no hardware overhead is also presented.  

Authors and Affiliations

PRIYANSHU PANDEY , VINOD KAPSE

Keywords

Related Articles

A New Fragile Approach for Optimization in Invisible Image Watermarking by Using Symmetric Key Algorithms  

In the information technology and communication, the most important factor has been the security of information and one of the methods is watermarking. The Watermarking aims to validate the host and the undeniabl...

An innovative Accession intended for FEC Decryption predicated on the BP Contrivance in LTE as well as WiMAX Conformity  

Abstract—Numerous wireless contact systems such as IS-54, superior data tariff for the GSM succession (EDGE), universal interoperability for microwave access (WiMAX) and long term progression (LTE) have adopted low-densi...

Edge Preserving MAP Estimation of Images Using Filtering Approach and Wavelet Based Mehods

This paper presents an effective approach for image restoration in the presence of both blur and noise.Here the image is divided into independent regions. Each region is modelled with a WSS Gaussian prior. This algor...

Signal Strength Estimation and Comparison with Measured Signal Strength for Mobile Cellular Communication 

In wireless communication systems, path loss models are used to find out the path loss between transmitter and receiver. In this paper, Okumura, Cost-231, Hata, ECC 33 and SUI propagation models are discussed. Path...

Grid Density Based Clustering Algorithm  

Clustering is the one of the most important task of the data mining. Clustering is the unsupervised method to find the relations between points of dataset into several groups. It can be done by using various types...

Download PDF file
  • EP ID EP136141
  • DOI -
  • Views 100
  • Downloads 0

How To Cite

PRIYANSHU PANDEY, VINOD KAPSE (2012). Recursive Pseudo-Exhaustive Two-Pattern Generator  . International Journal of Advanced Research in Computer Engineering & Technology(IJARCET), 1(5), 380-385. https://europub.co.uk/articles/-A-136141