摘要:

MuTeam is a multimicroprocessor system designed to support concurrent programming and decentralised policies for fault treatment. In the paper, the hardware architecture of MuTeam is presented in detail, with particular reference to the innovative solutions adopted to support the above mentioned features.

DOI:10.1049/ip-e.1987.0037

出版商:IEE    

年代:1987

数据来源: IET

摘要:

The structure of Reed-Muller and generalised Reed-Muller transform matrices is discussed and in particular their description in terms of the Kronecker matrix product of basic forms is explained. The use of map-entered variables to enable function maps to be folded into smaller-dimension structures, thereby easing the transform process, is investigated. Methods for term-by-term transformation which are particularly suited to sparse functions are presented and it is shown that these can be incorporated into the procedures for handling incompletely specified operational-domain descriptions. The more general problem of deducing the optimum-polarity expansion of such functions is also considered.

DOI:10.1049/ip-e.1987.0038

出版商:IEE    

年代:1987

数据来源: IET

摘要:

The concept of pseudoexhaustive testing is combined with that of qualifier preselection to provide easily testable designs of digital systems based on the algorithmic state machine (ASM) method. The highly structured implementations resulting from direct synthesis procedures with modern programmable devices are augmented by the incorporation of a serial shadow state register to provide built-in testability. A basic general test procedure is outlined and some refinements for particular ASMs are discussed. These can be incorporated at little extra cost or loss of generality.

DOI:10.1049/ip-e.1987.0039

出版商:IEE    

年代:1987

数据来源: IET

摘要:

The paper describes a real-time feature detector which operates at video rates on binary images. It uses a variant on template matching over a 5 × 5 pixel local area. A notable aspect of the detector is its flexibility, allowing the user to define features for detection as required.

DOI:10.1049/ip-e.1987.0040

出版商:IEE    

年代:1987

数据来源: IET

摘要:

The fast prime-factor discrete Fouriertransform (DFT) algorithm [2–4] can be used to reduce the number of basic cells when the transform length of a DFT is not a highly composite number. This pipeline prime-factor DFT can be realised by a one-to r-dimensional index mapping by (r − 1) one-to two-dimensional mappings. Hence, only the one-to two-dimensional shuffling algorithm is needed to realise a practical prime-factor DFT. Recently, it was shown that a new algorithm can be developed to perform the shuffling operations needed in implement the above-mentioned one-to two-dimensional mapping for a prime-factor DFT. In the paper, the new shuffling algorithm is established and proved for the general case. It is evident that this algorithm can be applied directly to many different implementations of the prime-factor DFT, including a pipeline VLSI implementation.

DOI:10.1049/ip-e.1987.0041

出版商:IEE    

年代:1987

数据来源: IET

摘要:

The paper presents a new public-key cryptosystem and new digital-signature schemes. It uses a special matrix over a local ring, the power of which can be easily calculated. It then describes a nonsingular conjugate transformation matrix to get a new matrix as public key. The paper also presents three digital-signature schemes. Their security comes from the problems caused by zero divisors of the local ring and the difficulty of solving congruence equations of high degree. It increases the speed of the public-key cryptosystems and digital signatures and makes them directly applicable to small computers.

DOI:10.1049/ip-e.1987.0043

出版商:IEE    

年代:1987

数据来源: IET

摘要:

In previous research work, it has been reported that to obtain a high recognition rate in a printed Thai character recognition system, the system should be separated into two stages, namely rough and fine classification stages. In the rough classification stage, eigenvectors of the Karhunen-Loéve (K-L) expansion having the maximum eigenvalue are used as the standard patterns of each category of single-fount printed Thai characters, but the remaining eigenvectors which have been derived simultaneously were not used in that system. The same rough classification stage has been used in the paper. But in the fine classification stage, an experimental approach to fine classification, using higher-order eigenvectors (the remaining eigenvectors which were not used in rough classification) of the K-L expansion is described. Linear decision functions in the higher eigenvector space of the K-L expansion are constructed to discriminate between the characters in a category. The experimental results of recognising character patterns using the K-L expansion are shown in this paper.

DOI:10.1049/ip-e.1987.0044

出版商:IEE    

年代:1987

数据来源: IET