Home
>
Journals & magazines
>
IEE Proceedings E (Computers and Digital Techniqu...
>
Volume 136
Issue 1
IEE Proceedings E (Computers and Digital Techniques)
Volume 136, Issue 1, January 1989
Volumes & issues:
Volume 136, Issue 1
January 1989
Changes of light
- Author(s): N.W. Horne
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 136, Issue 1, p. 1 –8
- DOI: 10.1049/ip-e.1989.0001
- Type: Article
- + Show details - Hide details
-
p.
1
–8
(8)
Static interconnection network extensibility based on marginal performance/cost analysis
- Author(s): P.W. Dowd ; M. Dowd ; K. Jabbour
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 136, Issue 1, p. 9 –15
- DOI: 10.1049/ip-e.1989.0002
- Type: Article
- + Show details - Hide details
-
p.
9
–15
(7)
The paper examines the trade-off between cost and performance of a hypercube based computer interconnection network founded on a detailed cost analysis model. A cost function is proposed which considers the economies of scale of bandwidth available through optical fibre communication and the nonincremental increase in node complexity resulting from variations in network size. When considering topology choice, an important consideration is expansion. Any comparison of expansion should be done through marginal analysis: weighing the additional benefits (performance) against the additional cost resulting from expansion. To demonstrate this technique, four interconnection networks are considered: boolean n-cube, nearest neighbour mesh hypercube, generalised hypercube, and spanning multiaccess channel hypercube. Systems with equalised performance are studied, investigating the variations in cost. This permits the investigation of the trade-off of performance/cost between high capacity communication channels and increased number of channels and degree.
Tri-state map for the minimisation of exclusive-OR switching functions
- Author(s): A. Tran
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 136, Issue 1, p. 16 –21
- DOI: 10.1049/ip-e.1989.0003
- Type: Article
- + Show details - Hide details
-
p.
16
–21
(6)
A tri-state map is developed as a general format for Karnaugh maps, Reed-Muller coefficient maps and transition (partially polarised) maps. The polarisation statuses of the variables in transition maps and Reed-Muller coefficient maps are indicated by the labels on the tri-state maps. A variable in a tri-state map can exist in two of three different states: true, complemented or nonexistent. Karnaugh maps and positive-polarity or negative-polarity Reed-Muller coefficient maps are special cases, in which there are only two states. Minimisation of exclusive-OR switching functions can be carried out, not only on Reed-Muller coefficient maps, but also on Karnaugh maps or any of the transition maps.
Simulating microprocessor systems using occam and a network of transputers
- Author(s): Ian Gorton ; Jon Kerridge ; Barrie Jervis
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 136, Issue 1, p. 22 –28
- DOI: 10.1049/ip-e.1989.0004
- Type: Article
- + Show details - Hide details
-
p.
22
–28
(7)
The simulation at component level of microprocessor systems provides a precise technique for evaluating the design of a system with regards to its requirements specification. The paper describes the use of occam to simulate individual microprocessor components, and presents a method of modelling the behaviour of microprocessor bus systems. The possibility of utilising transputers to provide real-time simulation is discussed.
Diagnosis of multiple bus faults
- Author(s): J.J. Narraway
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 136, Issue 1, p. 29 –40
- DOI: 10.1049/ip-e.1989.0005
- Type: Article
- + Show details - Hide details
-
p.
29
–40
(12)
A method is described for the identification of sticking bits on a data transmission bus. The method is probabilistic in nature and can use on-line bus data. It is also suitable for use against intermittent faults. Exact and useful approximate analyses are given for various diagnostic procedures using overall bus data words and compartmentalised bus data words. Numerical performance data are given for each procedure.
Content addressability: an exercise in the semantic matching of hardware and software design
- Author(s): G.M. Blair and P.B. Denyer
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 136, Issue 1, p. 41 –47
- DOI: 10.1049/ip-e.1989.0006
- Type: Article
- + Show details - Hide details
-
p.
41
–47
(7)
This paper considers content addressability and discusses its potential impact on software engineering in the context of its affinity to, and thus efficient implementation of, common abstract data types. More generally, we present an approach to language design based on the abstracted characteristics of the implementing hardware. Based on the perceived needs of common data types, a prototype MOS VLSI content addressable memory component is designed together with enhancements leading to large fault-tolerant memory systems. A novel computer architecture is introduced to include this component and to provide an example target machine. The specification of a high level programming language, using a tractable set of extensions to conventional language syntax, then completes the programming environment.
Use of linearisation and spectral techniques in input and output compaction testing of digital networks
- Author(s): S.L. Hurst
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 136, Issue 1, p. 48 –56
- DOI: 10.1049/ip-e.1989.0007
- Type: Article
- + Show details - Hide details
-
p.
48
–56
(9)
In the increasingly vital area of digital network testing, there have been proposals for both input compaction and output compaction using linear Ex-OR functions. In the paper we examine these proposals using the spectral domain rather than the conventional Boolean domain, and indicate that further research may be profitable.
Autocorrelation testing of combinational circuits
- Author(s): S. Aborhey
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 136, Issue 1, p. 57 –61
- DOI: 10.1049/ip-e.1989.0008
- Type: Article
- + Show details - Hide details
-
p.
57
–61
(5)
This paper considers autocorrelation testing for the detection of single stuck-at faults on non-syndrome testable input lines of an internally unate combinational network. The question of an autocorrelation test covering more than one input fault is considered. Also a test circuitry which requires only 2n input assignments for an n-input system is presented. The work of this paper is an extension of previous work on autocorrelation testing by Eris and Muzio [6].
Methodology for optimising cost/speed tradeoffs in real-time inspection hardware
- Author(s): E.R. Davies and A.I.C. Johnstone
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 136, Issue 1, p. 62 –69
- DOI: 10.1049/ip-e.1989.0009
- Type: Article
- + Show details - Hide details
-
p.
62
–69
(8)
The paper examines tradeoffs in the design of real-time electronic hardware for automated inspection. Starting with data from an earlier paper, it develops a methodology for optimising hardware implementations. Cost/time ratios of proposed hardware modules and the cost * time product of the whole system are found to be important and related criterion functions. Overhead costs and times complicate the picture, but a procedure is obtained that solves this problem. The emphasis of the work is on removing randomness in the design of hardware systems.
Complex number multipliers
- Author(s): K.Z. Pekmestzi
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 136, Issue 1, p. 70 –75
- DOI: 10.1049/ip-e.1989.0010
- Type: Article
- + Show details - Hide details
-
p.
70
–75
(6)
The direct digital multiplication of complex numbers is examined. The proposed technique bypasses the classical method based on the identity (A + Bj)(C + Dj) = AC − BD + (AD + BC)j. The complex multiplication is considered as one operation and is examined in the bit-level. Various multipliers, such as the parallel or serial-parallel types and the realisation through microprogramming on an arithmetic unit, are presented, all of which are based on the above technique.
Dynamic single-connection channel access in multichannel networks
- Author(s): B.P. Mohanty and T.D. Todd
- Source: IEE Proceedings E (Computers and Digital Techniques), Volume 136, Issue 1, p. 76 –84
- DOI: 10.1049/ip-e.1989.0011
- Type: Article
- + Show details - Hide details
-
p.
76
–84
(9)
When conventional CSMA/CD methods are applied in multichannel environments, the total system capacity is often dependent upon the static and dynamic channel assignment of user stations. If this is the case, user performance may suffer drastically since the traffic-handling capability of the system fluctuates with the system traffic (generation) statistics. The CSMA/CD/IC protocol proposed by Marsan and Roffinella does not have these shortcomings, because channels are selected for use in a dynamic fashion which follows the instantaneous system load. Unfortunately, CSMA/CD/IC requires that all stations possess a separate receiver for each channel. In the paper, we investigate the possibility of using a single receiver per station and yet achieve the automatic global load-balancing capability of the CSMA/CD/IC protocol. It is found that although both persistent and nonpersistent versions of MICON performed as well as CSMA/CD/IC in our tests, MICON imposes different restrictions on the system. Specifically, MICON exploits the fact that in typical network environments, complete connectivity between all stations at any time instant is not required. As a result, MICON requires additional station synchronisation and permits full connectivity only between dynamically established sets of user stations.
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.
