# IEEE Transactions on Computers

## Filter Results

Displaying Results 1 - 21 of 21
• ### [Front cover]

Publication Year: 1977, Page(s): c1
| |PDF (498 KB)
• ### IEEE Computer Society

Publication Year: 1977, Page(s): nil1
| |PDF (212 KB)
• ### [Breaker page]

Publication Year: 1977, Page(s): nil1
| |PDF (212 KB)
• ### Editor's Notice

Publication Year: 1977, Page(s): 1
| |PDF (793 KB)
• ### The Minimization of Inverters in Analog Computer Programming

Publication Year: 1977, Page(s):2 - 12
Cited by:  Papers (2)
| |PDF (2300 KB)

An algorithm is described for determining the least number of inverters required in an analog (or analog/hybrid) computer circuit for a general problem. The procedure requires the creation of a dependency matrix for the problem which reflects the interdependencies among the problem variables. Various modifications to this matrix are then made to produce a modified dependency matrix (MDM). The prob... View full abstract»

• ### The Generation of Completion Signals in Iterative Combinational Circuits

Publication Year: 1977, Page(s):13 - 18
Cited by:  Papers (1)
| |PDF (1755 KB)

It is shown that, if a flow table has synchronizing sequences, they can be used, at little added cost, to reduce substantially the average delay in combinational iterative realizations that generate completion signals. This constitutes a generalization of earlier work by Waite. Some quantitative results are presented indicating the extent of speed up to be expected. View full abstract»

• ### The MU5 Multicomputer Communication System

Publication Year: 1977, Page(s):19 - 28
Cited by:  Papers (2)  |  Patents (1)
| |PDF (2825 KB)

A multicomputer system is described incorporating an exchange which can connect up to 12 units. A description of the overall architecture is followed by a detailed discussion of the exchange design. This includes a storage transfer unit which has a maximum throughput of 89 Mbytes/s. A review of the timing and technology, and error analysis conclude the paper. View full abstract»

• ### Diagnosis of Faults in Linear Tree Networks

Publication Year: 1977, Page(s):29 - 33
Cited by:  Papers (30)  |  Patents (1)
| |PDF (1772 KB)

The problem of fault detection and location in tree networks of two input EXCLUSIVE-OR (EOR) gates is considered. The fault model assumes that an EOR gate can change to any other function of its two inputs except the equivalence function. An efficient procedure for single fault location is presented. In the worst case the number of tests necessary to locate single faults is bounded by a linear fun... View full abstract»

• ### Real-Time Correction of Intensity Nonlinearities in Imaging Systems

Publication Year: 1977, Page(s):34 - 39
Cited by:  Papers (29)  |  Patents (1)
| |PDF (1951 KB)

An analysis of two-dimensional imaging systems with general intensity nonlinearities is presented and several methods for real-time correction are discussed. Exact correction for measurement purposes and approximate correction for the human observer are described, and system implementation is by digital hardware, primarily using programmable read-only memories (PROM's). Calibration techniques for ... View full abstract»

• ### Aircraft Identification by Moment Invariants

Publication Year: 1977, Page(s):39 - 46
Cited by:  Papers (460)  |  Patents (1)
| |PDF (3230 KB)

Although many systems for optical reading of printed matter have been developed and are now in wide use, comparatively little success has been achieved in the automatic interpretation of optical images of three-dimensional scenes. This paper is addressed to the latter problem and is specifically concerned with automatic recognition of aircraft types from optical images. An experimental system is d... View full abstract»

• ### Nonparametric Estimation of the Bayes Error of Feature Extractors Using Ordered Nearest Neighbor Sets

Publication Year: 1977, Page(s):46 - 54
Cited by:  Papers (9)
| |PDF (2323 KB)

Since the Bayes classifier is the optimum classifier in the sense of having minimum probability of misclassification among all the classifiers using the same set of pattern features, the error rate of the Bayes classifier using the set of features provided by a feature extractor, called the Bayes error of the feature extractor, is the smallest possible for the feature extractor. Consequently, the ... View full abstract»

• ### A Fast Z Transformation Algorithm for System Identification

Publication Year: 1977, Page(s):55 - 67
Cited by:  Papers (8)
| |PDF (1931 KB)

Algorithms for system identification and the computation of its mathematical model through a fast' Z transformation of its sampled response in the presence of noise are introduced. It is shown that by iteratively applying constant-damping-and constant-frequency contour finite Z transforms a system's mathematical model-in the presence of noise can be efficiently evaluated. On line tracking of the... View full abstract»

• ### The Hardware Simulator: A Tool for Evaluating Computer Systems

Publication Year: 1977, Page(s):68 - 72
Cited by:  Patents (20)
| |PDF (2952 KB)

Software simulation is often used when evaluating computer systems. It may, however, be time consuming and expensive, especially when many runs with slightly differing parameters have to be done or when small changes in the model have to be performed frequently. In such situations, and when not too much detail and only small amounts of output data are required, the hardware simulator described in ... View full abstract»

• ### On the Number of Distinct State Assignments for a Sequential Machine

Publication Year: 1977, Page(s):73 - 75
| |PDF (682 KB)

The determination of the number of distinct state assignments for a sequential machine has generally been made by the elimination of assignments that are the result of complementation or permutation of the state variables within a basic set of state assignments. For the D-type flip-flop, however, complementation may have an effect upon the cost of the control logic for a machine, leading, as some ... View full abstract»

• ### A Decision-Directed Clustering Algorithm for Discrete Data

Publication Year: 1977, Page(s):75 - 82
Cited by:  Papers (12)
| |PDF (1149 KB)

This article presents a decision-directed approach for classifying discrete data. In the clustering algorithm, probable clusters are initiated through the use of a sorting scheme based on the estimated probability distribution of the data and an arbitrary distance measure. The subsequent iterative reclassification procedures are directed by the estimated distribution of each class. The distributio... View full abstract»

• ### Boolean Features of Sign-Flipping and Signed-Carry Logic in Base -2

Publication Year: 1977, Page(s):82 - 86
| |PDF (863 KB)

A direct self-contained proof of sign-flipping logic for base -2 binary numbers is derived and the same approach is extended to the derivation of a particular adder logic. Sign-flipping equations are contrasted with the logic for assimilated complement in classical binary. Logic equations for signed-carry addition and subtraction are then derived for various codes of interstage carry. Reduction of... View full abstract»

• ### A New Random-Error-Correction Code

Publication Year: 1977, Page(s):86 - 88
Cited by:  Papers (1)
| |PDF (610 KB)

A new random-error-correction code presented here is one of the most efficient two-error-correction codes. The new code can correct 2-bit random errors within twelve (12) consecutive bits while (15,7) BCH code [1] corrects two errors within fifteen (15) bits and Hagelbarger's code [2] corrects two errors within fourteen (14) bits. Although Peterson and Weldon's double-error-correcting (12,6) code ... View full abstract»

Publication Year: 1977, Page(s):88 - 91
| |PDF (1019 KB)

It is shown that an adaptive threshold logic element (ATLE) whose weight vector is perturbed reconverges without error provided its threshold is large compared with the perturbation. This result is generalized to a criterion of convergence, based on admissibility, for the nonseparable case. It is shown that conventional ATLE's cannot cope with nonseparability even according to this very weak crite... View full abstract»

• ### Realization of Fault-Tolerant and Fail-Safe Sequential Machines

Publication Year: 1977, Page(s):91 - 96
Cited by:  Papers (4)
| |PDF (1378 KB)

Given a synchronous sequential machine M, this correspondence deals with the fault-tolerant realization M of M and also its fail-safe realization M on the assumption that the faults that can occur to the circuitry of M or M are of permanent stuck-at type and the total number of faults can be at most some preset positive integer r. First, the realization of M or M is derived for r = 1 and then the ... View full abstract»

• ### IEEE Computer Society Publications

Publication Year: 1977, Page(s): nil2
| |PDF (127 KB)
• ### [Front cover]

Publication Year: 1977, Page(s): c2
| |PDF (250 KB)

## Aims & Scope

The IEEE Transactions on Computers is a monthly publication with a wide distribution to researchers, developers, technical managers, and educators in the computer field.

Full Aims & Scope

## Meet Our Editors

Editor-in-Chief
Paolo Montuschi
Politecnico di Torino
Dipartimento di Automatica e Informatica
Corso Duca degli Abruzzi 24
10129 Torino - Italy
e-mail: pmo@computer.org