摘要:

The structure of two-and three-dimensional pseudorandom arrays produced by the folding of binary and multiple-valuedm-sequences is investigated. This procedure is shown to be related to the process of sequence sampling, and this enables the recursions corresponding to the rows and columns of the arrays to be related to that of the parentm-sequence. These recursions then determine the nature of symmetries which may be apparent in the arrays. It is also demonstrated that pseudorandom volumes can be constructed by folding any one of the three related two-dimensional arrays. The structure of arrays derived from twin-prime pseudorandom sequences is also investigated. Tables of the available binary and multiple-valued PRAs and PRVs are appended.

DOI:10.1049/ip-e.1985.0020

出版商:IEE    

年代:1985

数据来源: IET

摘要:

Multistage networks play an important role in parallel-processing architectures and particularly in reconfigurable structures, as they provide the ability to switch paths between modules according to both the requirements of throughput and fault occurrence. In this respect, effective fault diagnosis techniques of these devices are highly desirable to cover these switching modes. In the paper diagnostic tests applicable to SW Banyan networks (SWBNs) with a spread of two and a fanout of two are presented.

DOI:10.1049/ip-e.1985.0021

出版商:IEE    

年代:1985

数据来源: IET

摘要:

In the paper we investigate whether the function-independent test set for detecting single stuck-at faults in networks realising Reed-Muller canonic (RMC) expansions of switching functions is sufficient to detect all bridging faults in such networks. The investigation, however, reveals its insufficiency, and to circumvent this we propose a technique of augmenting the network with some additional observation points, so that a universal test set can be designed for detecting bridging faults as well.

DOI:10.1049/ip-e.1985.0022

出版商:IEE    

年代:1985

数据来源: IET

摘要:

A new class of variable-length, and statistically-synchronisable codes is presented in conjunction with code-construction methods and some significant property theorems. A notable feature of the codes (augmented T-codes) is their ability to recover correct character synchronisation under normal decoding procedures, following timing or additive errors in a serial-message sequence. As a result of the code construction, the synchronisation delay is found to be largely independent of the source, with the expected delay typically fewer than three characters. A further class of associated fixed-length binary codes (the binary-depletion T-codes) is introduced, and shown to be important in systematic applications for code generation, encoding/decoding operations and determining synchronisation status in digital processors.

DOI:10.1049/ip-e.1985.0023

出版商:IEE    

年代:1985

数据来源: IET

摘要:

A modified two-moment (MTM) method is proposed for waiting-time analysis of constant-service tandem queueing systems. Input to an intermediate queueing station consists of internal stream(s) provided by the output from previous queue(s) in addition to external Poisson traffic. Internal traffic at a queue is assumed to have initially originated from external Poisson sources and is permitted to exit from the tandem path with fixed independent probability. Analysis of such complex configuration is not tractable and known exact results are restricted to very special cases. It is shown that the MTM method provides a systematic and more accurate tool for waiting-time analysis of such queueing structures as compared to other known approximations.

DOI:10.1049/ip-e.1985.0024

出版商:IEE    

年代:1985

数据来源: IET

摘要:

Binary decision graphs provide the most efficient means for computing Boolean functions by program, and also relate to hardware implementation. In the present paper, formal properties of binary decision graphs are considered, and rules are provided for the anticipation of path lengths and vertex requirements, which indicate computation time and program length, respectively. Rules for the construction of efficient (but not truly optimal) binary decision graphs are provided, these rules are then applied in design examples.

DOI:10.1049/ip-e.1985.0025

出版商:IEE    

年代:1985

数据来源: IET