Home
>
Journals & magazines
>
IEE Proceedings E (Computers and Digital Techniqu...
>
Volume 131
Issue 5
IEE Proceedings E (Computers and Digital Techniques)
Volume 131, Issue 5, September 1984
Volumes & issues:
Volume 131, Issue 5
September 1984
Editorial
- Author(s): E.L. Dagless and F.K. Hanna
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 131, Issue 5, page: 157 –157
- DOI: 10.1049/ip-e.1984.0032
- Type: Article
- + Show details - Hide details
-
p.
157
(1)
Memory testing by linear checks
- Author(s): M. Karpovsky
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 131, Issue 5, p. 158 –168
- DOI: 10.1049/ip-e.1984.0033
- Type: Article
- + Show details - Hide details
-
p.
158
–168
(11)
In this paper we consider methods of error detection, location or correction in ROM or RAM by systems of orthogonal linear equality and inequality checks and by the Rademacher transform. Implementations and error detecting, locating, correcting capabilities of these techniques for ROM and RAM testing are also described.
Analysis and restructuring of concurrent systems using prolog
- Author(s): F.G. Heath ; P.W. Foulk ; D.Y. Li
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 131, Issue 5, p. 169 –176
- DOI: 10.1049/ip-e.1984.0034
- Type: Article
- + Show details - Hide details
-
p.
169
–176
(8)
The paper describes a CAD system for the analysis and restructuring of complex concurrent systems. The design process can be divided into two stages: top-down analysis and bottom-up restructuring. At the top-down stage, a complex system is represented by a hierarchy of subsystems written in the language SDL. Each subsystem is the integration of data and control flow, and can be treated independently for the purpose of design, optimisation, etc. Then, at the bottom-up stage, they are locally or globally restructured to obtain a new construction exhibiting maximal parallelism. Taking full advantage of logic progamming, the system has been implemented entirely in Prolog.
Minimisation of Reed-Muller polynomials with fixed polarity
- Author(s): Y.Z. Zhang and P.J.W. Rayner
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 131, Issue 5, p. 177 –186
- DOI: 10.1049/ip-e.1984.0035
- Type: Article
- + Show details - Hide details
-
p.
177
–186
(10)
An efficient algorithm for minimisation of Reed-Muller polynomials with fixed polarities is presented. The common terms of multiple-output polynomials are considered by applying a number of logical operations on their coefficients. The minimisation of the polynomials over extension Galois fields GF(2M) is considered. The average number of field multiplications for mapping a set of coefficients is reduced to less than Ṁ·2M−2.
Method of analysis for discrete-time buffers with randomly interrupted arrival stream
- Author(s): H. Bruneel
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 131, Issue 5, p. 187 –193
- DOI: 10.1049/ip-e.1984.0036
- Type: Article
- + Show details - Hide details
-
p.
187
–193
(7)
The paper considers a discrete buffered system with infinite waiting room, one single output channel and synchronous transmission of messages from the buffer. The arrival stream of messages to the buffer is assumed to be interrupted at random time points for random length time intervals. The arrival interruptions represent a decrease in the mean arrival intensity as compared to a buffer system without arrival interruptions. They also cause the need for a whole new method of analysis, which is presented here. Time is divided into two types of time intervals: ‘A-times’, during which arrivals are possible, and ‘B-times’, during which the arrival stream is interrupted. Both types of intervals are expressed in clock time periods and may have arbitrary probability distributions, provided their probability generating functions are rational functions of the variable z. Under these circumstances, expressions are derived for the probability generating functions of the number of messages in the buffer at various time instants. These expressions contain a finite number of unknown parameters, which can only be determined by solving a generally transcendent equation for its roots. As an example of the method, the special case is treated where both A-times and B-times are geometrically distributed; explicit expressions for the probability generating functions of the buffer occupancy are obtained for this special case.
Common-access channel network algorithm
- Author(s): A. Cantoni ; R.J. Evans ; B.J. Cook
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 131, Issue 5, p. 194 –198
- DOI: 10.1049/ip-e.1984.0037
- Type: Article
- + Show details - Hide details
-
p.
194
–198
(5)
The paper describes an algorithm developed for controlling access to a multiple-access broadcast channel. The algorithm, which is particularly simple, is suitable for networks with a small number of nodes. The algorithm was initially developed for use in a computer network dedicated to providing status information and control of a number of isolated plant sites. The channel available in this system was a radio-frequency troposcatter link, which supported a low 300 baud asynchronous data rate.
Erratum: Computing & Control Lecture
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 131, Issue 5, page: 198 –198
- DOI: 10.1049/ip-e.1984.0038
- Type: Article
- + Show details - Hide details
-
p.
198
(1)
Most viewed content for this Journal
Article
content/journals/ip-e
Journal
5
Most cited content for this Journal
We currently have no most cited data available for this content.
