摘要:

Initial investigations of the re-synchronisation properties of fifth augmentation level, variable length, self-synchronising T-codes are described. It has been found from simulation studies that within the fifth augmentation level family there are considerable differences in the resynchronisation delay statistics of individual code sets, with some code sets consistently outperforming others with the same codeword length distribution. Furthermore, the code sets with the shortest average re-synchronisation delays are generally those with the shortest average code-word length (i.e. the most efficient). The coding efficiency of these code sets has been found to be within 1% of the efficiency of a Huffman code optimised for the particular information source.

DOI:10.1049/ip-e.1990.0012

出版商:IEE    

年代:1990

数据来源: IET

摘要:

In this paper, a new approach to repairability/unrepairability detection for VLSI memory chips with redundancy is presented. An heuristic, yet efficient approach, is proposed. New conditions for detection are presented and fully analysed. These are based on a more accurate estimation of the regions of repairability and unrepairability. The main benefit of this approach is its practicality with respect to fast execution time and the improved ability to diagnose a VLSI redundant memory before the generation of the repair-solution. A new repair algorithm which utilizes a ternary tree approach is also presented.

DOI:10.1049/ip-e.1990.0013

出版商:IEE    

年代:1990

数据来源: IET

摘要:

In the paper, fast algorithms for three short prime length fast biased polynomial transforms are presented, based on the strategy of the minimum number of rotations. These algorithms are of practical use in digital image processing.

DOI:10.1049/ip-e.1990.0014

出版商:IEE    

年代:1990

数据来源: IET

摘要:

In the paper, by considering a Reed-Solomon (RS) code to be a special case of a redundant residue polynomial code, a fast transform decoding algorithm to correct both errors and erasures is presented. This decoding scheme is an improvement of the decoding algorithm for the redundant residue polynomial code suggested by Shiozaki and Nishida [1]. This decoding scheme can be realised readily on VLSI chips.

DOI:10.1049/ip-e.1990.0015

出版商:IEE    

年代:1990

数据来源: IET

摘要:

Adaptive lattice noise cancelling algorithms have features that make them appear attractive for the realisation of realtime adaptive noise cancellers with single chip digital signal processors. Two popular adaptive lattice noise cancelling algorithms have been evaluated for this application. Considered are stochastic gradient lattice and least squares lattice algorithms. For the purpose of comparison, the stochastic gradient transversal algorithm is also evaluated. Their performances under a variety of signal and noise excitations are summarised and compared in terms of operating rates and misadjustments.

DOI:10.1049/ip-e.1990.0016

出版商:IEE    

年代:1990

数据来源: IET

摘要:

An algorithm is described for forming the chaincode and the tree of relationships of the islands and lakes within a bilevel image.

DOI:10.1049/ip-e.1990.0017

出版商:IEE    

年代:1990

数据来源: IET

摘要:

An important issue in VLSI array design is how to test switches and data links in an array. In the paper, the authors present a ‘divide-and-conquer’ technique for testing data paths in VLSI arrays. The data paths including registers, switches and data links are tested in parallel by applying test patterns from the outside. The fault-free paths identified divide the array into smaller subarrays with fault-free boundaries so that testing can be done recursively. Fault masking due to switch failures is examined. A sufficient condition to avoid fault masking is obtained.

DOI:10.1049/ip-e.1990.0018

出版商:IEE    

年代:1990

数据来源: IET

摘要:

The complete binary tree has long been known to support important applications. This paper presents an efficient embedding of a complete binary tree in a 3-D rectangular array. The array hosting the binary tree is called the host, and the binary tree is referred to as the guest. The scheme is modular and high level trees are made of low level trees inductively. It is shown that all PEs (except one) of the host array may be utilised in embedding ak-level complete binary tree. The dilation (maximum length of an edge in the guest graph in terms of the number of edges in the host graph) is kept as low as possible by using building blocks, which allow tree embedding, with dilation of two at most occurring between leaf nodes and their parents where the message traffic is minimum. Upperbounds on propagation delay are reduced from O(2k/2to O(2k/3) as a result of the use of the third dimension. Results are compared with those dealing with 2-D layouts. As discussed, these bounds are the best known to date for structures with practically implementable dimensionality.

DOI:10.1049/ip-e.1990.0019

出版商:IEE    

年代:1990

数据来源: IET

摘要:

Knowledge of the advantages of realising VLSI circuits in cellular form have stimulated research in the synthesis of digital circuits by using cellular networks of suitable gates. The cascade network is a special kind of cellular form with a very simple interconnection structure. This paper is concerned with the synthesis of combinational circuits using a cascade of 2-input multiplexer units. A multiplexer unit has been taken as the building block because of its versatility and possibility of use as a universal logic module. Based on the characterising parameters called ‘ratio parameters’, an algorithm has been developed to synthesise a given Boolean function by a cascade of two input multiplexers, if realisable. The algorithm is easy to implement on a computer and a program implementing the algorithm in c-language has been developed, thereby allowing automated synthesis. This is essential when the complexity of the digital circuits is high. Both completely specified and incompletely specified functions have been considered.

DOI:10.1049/ip-e.1990.0020

出版商:IEE    

年代:1990

数据来源: IET