# IEEE Transactions on Computers

## Filter Results

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

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

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

Publication Year: 1973, Page(s): nil1
| PDF (225 KB)
• ### A High Speed and Accuracy Digital Gaussian Generator of Pseudorandom Numbers

Publication Year: 1973, Page(s):629 - 634
Cited by:  Papers (8)
| | PDF (1364 KB)

In this paper a procedure for forming high-accuracy Gaussian distributed pseudorandom numbers is presented, and a digital system that mechanizes the procedure is suggested. The high accuracy that is obtainable while maintaining high output rates, makes the proposed method comparable to the established software generation methods so far as speed and accuracy are concerned. The approach that is sugg... View full abstract»

• ### Tours in Machines and Digraphs

Publication Year: 1973, Page(s):635 - 639
Cited by:  Papers (2)
| | PDF (1814 KB)

A tour in a machine is a shortest input sequence taking the machine from some initial state, through all of its remaining states and back again into its initial state. A best upper bound for tour length is found for two types of machines: n-state sequential machines with unrestricted input alphabet and n-state sequential machines with a two-letter input alphabet. The problem of finding a best uppe... View full abstract»

• ### Decomposition of Permutation Networks

Publication Year: 1973, Page(s):639 - 643
Cited by:  Papers (16)  |  Patents (1)
| | PDF (2254 KB)

The problem of decomposing an arbitrary permutation of a large number of elements into a number of permutations of smaller numbers of elements has become important recently in rearrangeable switching networks and in interconnectors for computer peripheral and processing units. Opferman and Tsao-Wu have published an algorithm for decomposing an arbitrary permutation of n = d Ã q elements into d pe... View full abstract»

• ### On The Advantages of Tagged Architecture

Publication Year: 1973, Page(s):644 - 656
Cited by:  Papers (36)  |  Patents (19)
| | PDF (4331 KB)

This paper proposes that all data elements in a computer memory be made to be self-identifying by means of a tag. The paper shows that the advantages of the change from the traditional von Neumann machine to tagged architecture are seen in all software areas including programming systems, operating systems, debugging systems, and systems of software instrumentation. It discusses the advantages tha... View full abstract»

• ### Derivation of Minimal Test Sets for Monotonic Logic Circuits

Publication Year: 1973, Page(s):657 - 661
Cited by:  Papers (14)
| | PDF (1190 KB)

It is shown that the number of maximal false vertices and minimal true vertices is the minimum number of tests required to detect all s-a-1 and s-a-0 faults in any irredundant two-level realization of a 2-monotonic function. View full abstract»

• ### Fault-Tolerant Asynchronous Networks

Publication Year: 1973, Page(s):662 - 669
Cited by:  Papers (6)
| | PDF (2169 KB)

The design of fault-tolerant asynchronous networks has been an unsolved problem. In this paper, necessary and sufficient conditions on state assignments for fault-tolerant asynchronous networks are given. Three design techniques, based on Liu's 2so - 1 assignment, Friedman et al.'s (2, 2) separating system, and (2so + 1) assignments, are given for fault-tolerant asynchronous ... View full abstract»

• ### A Hybrid Walsh Transform Computer

Publication Year: 1973, Page(s):669 - 672
Cited by:  Papers (9)  |  Patents (2)
| | PDF (2210 KB)

A hybrid special-purpose computer based on a recursive algorithm for discrete Walsh transform computations is described. The device uses feedback in time to reduce the required number of summing junctions to N, the number of data points to be transformed. Computations are completed in 700 μs when N = 256. View full abstract»

• ### Minimization of Multidimensional Linear Iterative Circuits

Publication Year: 1973, Page(s):673 - 678
Cited by:  Papers (72)
| | PDF (1618 KB)

A model for two-dimensional linear iterative circuits is defined in the form of matrix equations. From the matrix equations, a two-dimensional characteristic function is defined. It is then proved that a matrix satisfies its two-dimensional characteristic function. This property is used to form a diagnostic matrix. Finally, the diagnostic matrix is used in a minimization technique. View full abstract»

• ### The Analysis of Radiographic Images

Publication Year: 1973, Page(s):678 - 689
Cited by:  Papers (36)
| | PDF (4598 KB)

The problem considered is the development of a method of scene analysis that employs a descriptive approach in the analysis of pictures. In an effort to facilitate implementation of the algorithm to a wide range of picture classes, a description of the scene is read in as data in the form of a tree structure that guides the search for objects from the largest to the smallest. The algorithm has the... View full abstract»

• ### Waveform Segmentation Through Functional Approximation

Publication Year: 1973, Page(s):689 - 697
Cited by:  Papers (77)  |  Patents (1)
| | PDF (2785 KB)

Waveform segmentation is treated as a problem of piecewise linear uniform (minmax) approximation. Various algorithms are reviewed and a new one is proposed based on discrete optimization. Examples of its applications are shown on terrain profiles, scanning electron microscope data, and electrocardiograms. The processing is sufficiently fast to allow its use on-line. The results of the segmentation... View full abstract»

• ### A/D Conversion for Radix (-2)

Publication Year: 1973, Page(s):698 - 701
Cited by:  Papers (8)
| | PDF (651 KB)

The direct conversion of an analog signal to its digital representation in base (-2) is considered. A successive approximation version strategy is developed and applied to a practical converter that is described in detail. View full abstract»

• ### Representation of Associated Data by Matrix Operators

Publication Year: 1973, Page(s):701 - 702
Cited by:  Papers (62)
| | PDF (382 KB)

It is shown that associated pairs of vectoral items (Q(r), X(r)) can be recorded by transforming them into a matrix operator M so that a particular stored vector X(r) can be reproduced by multiplying an associated cue vector Q(r) by M. If the number of pairs does not exceed the dimension of the cue and all cue vectors are linearly independent, then the r... View full abstract»

• ### Comments on "On the Definition and Generation of Walsh Functions

Publication Year: 1973, Page(s):702 - 703
Cited by:  Papers (1)
| | PDF (260 KB)

A correction to the Gray code-to-decimal conversion of Davies is given, which follows from Davies' own proof if performed on the level of operations on wave number indices. An alternative proof for Walsh functions as combinations of Rademacher functions is also given, starting from the definition of Walsh-Kaczmarz functions. View full abstract»

• ### Correction to Discrete Convolutions via Mersenne Transforms''

Publication Year: 1973, Page(s): 703
| PDF (90 KB)
• ### Book Reviews

Publication Year: 1973, Page(s):704 - 708
| PDF (1233 KB)
• ### Information for authors

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

Publication Year: 1973, Page(s): c2
| PDF (69 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