摘要:

In this paper, we propose systematic procedures for generating the test sequence for digital systems described by means of procedural register transfer languages. Faults in the data unit (data faults) and in the control unit (control faults) will require different techniques for their detection. For the data unit, a graph representing the data flow, the transfer graph, is proposed. Techniques for justifying and sensitising data faults are described. For the control unit we study the problem of its identification by using distinguishing sequences for its states. Testing of both units can be overlapped to reduce the length of the test sequence for the whole circuit.

DOI:10.1049/ip-e.1987.0012

出版商:IEE    

年代:1987

数据来源: IET

摘要:

Faulty switches, broken interswitch connections and certain bridging faults in a Beněs switching network can be identified using a sequence of faulty paths across the network. The method described may use on-line faulty-path data and is suitable for use in the diagnosis of intermittent faults. It is shown that a single faulty switch can be identified in less than four random faulty paths on average, after presentation of the initial faulty path. The method applies to other types of switching network and provides a similar performance.

DOI:10.1049/ip-e.1987.0014

出版商:IEE    

年代:1987

数据来源: IET

摘要:

This paper describes some of the techniques that are being used to implement a two-dimensional wafer-scale processor array. Manufacturing defects on the wafer are tolerated by using hierarchical redundancy. This strategy employs programmable links at the highest sub-system level to ensure good electrical isolation against gross defects, while lower down in the hierarchy, transistor switches are used to reduce the overall test and programming overhead.This technique enables a logical two-dimensional array of cells to be efficiently mapped onto a larger but flawed array. A row-configuring algorithm is proposed and simulation results are given for 8 × 8 and 16 × 16 arrays by assuming a uniform distribution of defects across the wafer. An empirical yield model and a novel programmable link are also described.

DOI:10.1049/ip-e.1987.0015

出版商:IEE    

年代:1987

数据来源: IET

摘要:

A graphical method extended from a folding technique developed by Wuet al.is used to convert the minterms of a switching function to the coefficients of its Reed-Muller polynomial with fixed polarity. The conversion starts from a Karnaugh map and results in a Reed-Muller coefficient map. An algorithm which attempts to find a minimal exclusive-OR realisation for the switching function in mixed polarity by grouping the Reed-Muller coefficient map is presented. The graphical method of converting minterms to Reed-Muller coefficients and the minimisation algorithms are also applied to incompletely specified functions.

DOI:10.1049/ip-e.1987.0016

出版商:IEE    

年代:1987

数据来源: IET

摘要:

The performance of the phase-correlation image-registration algorithm when greyscale images are replaced by boundary maps is discussed in the light of several experiments. It is found that use of contours only does not substantially degrade the algorithm performance, while the reduced amount of information associated with each image may turn to advantage whenever the bandwidth of the communication channel is concerned.

DOI:10.1049/ip-e.1987.0018

出版商:IEE    

年代:1987

数据来源: IET

摘要:

Testability measures have been advocated by many authors as aids in the designing and testing of logic circuits. These have been shown to be inaccurate for circuits which contain reconvergent fanouts. An algorithm is presented which will detect all sources of reconvergence in a circuit by processing a normal textual circuit description. As well as identifying all the gates at which reconvergence occurs, the reconvergent sites, the algorithm lists all the fanout nodes that reconverge at each of these sites. The automatic detection of reconvergence can be used for improving the testability analysis of circuits containing such fanouts. This algorithm is also being used as the basis of an analysis which identifies the undetectable faults in a circuit.

DOI:10.1049/ip-e.1987.0019

出版商:IEE    

年代:1987

数据来源: IET

摘要:

An algorithm for obtaining a self-synchronisingM-ary code (M ≥ 2) enabling the compression of data from a stationary discrete memoryless source is proposed. After presenting the code algorithm, its properties are analysed and the implementation of the code is described. The code proposed is compared to the Huffman code with regard to the average code-word length, the possibility of self synchronisation and the complexity of hardware realisation. Although for certain sources the code proposed is equal or nearly equal to the Huffman code regarding data compression, in general it is less efficient. However, its property of being self synchronising, and its relatively simple hardware realisation, make this code valuable for practical applications.

DOI:10.1049/ip-e.1987.0020

出版商:IEE    

年代:1987

数据来源: IET

摘要:

A parallel image processor (PIP) consisting of eight Texas Instruments TMS32010 digital signal processors is described. The architecture is designed for image-processing applications and two common pattern-recognition algorithms, i.e. edge detection followed by thinning are implemented achieving a total processing time of less than one second for a 256 × 256 pixel image. The advantages and limitations of using the TMS32010 as a fast signal processor are described. Problems encountered in programming the parallel processors and ways to overcome them are highlighted.

DOI:10.1049/ip-e.1987.0021

出版商:IEE    

年代:1987

数据来源: IET