IEEE Transactions on Computers

Filter Results

Displaying Results 1 - 19 of 19
• [Front cover]

Publication Year: 1976, Page(s): c1
| PDF (481 KB)
• IEEE Computer Society

Publication Year: 1976, Page(s): nil1
| PDF (215 KB)
• [Breaker page]

Publication Year: 1976, Page(s): nil1
| PDF (215 KB)
• Editor's Notice

Publication Year: 1976, Page(s): 209
| PDF (860 KB)
• The Modeling and Design of Multiple Function-Unit Processors

Publication Year: 1976, Page(s):210 - 221
Cited by:  Papers (2)  |  Patents (1)
| | PDF (2415 KB)

A quantitative and systematic design procedure for multiple function-unit (MFU) processors and microprocessors is presented in this paper. The MFU organization employs a set of function units such as adders, multipliers, etc. to concurrently execute instructions from a single instruction stream. A set of parameters describing this processor organization and the programs it executes are presented. ... View full abstract»

• Improved Simulation of Pulse Propagation Between Digital Circuits

Publication Year: 1976, Page(s):221 - 228
Cited by:  Papers (1)
| | PDF (3999 KB)

An improved simulation of pulse propagation between integrated digital circuits is presented. Two novel improvements associated with the inverse Laplace transform used are presented; 1) the introduction of two-dimensional weight factors σn,m and 2) the use of a shifting parameter a. The algorithm proposed is very fast and saves considerably on computer memory. Fast Fourier trans... View full abstract»

• On Models for Diagnosable Systems and Probabilistic Fault Diagnosis

Publication Year: 1976, Page(s):228 - 236
Cited by:  Papers (85)
| | PDF (3325 KB)

This paper is concerned with automatic fault diagnosis for digital systems with multiple faults. Three problems are treated: 1) Probabilistic fault diagnosis is presented using the graph-theoretic model of Preparata et al. The necessary and sufficient conditions to correctly diagnose any fault set whose probability of occurrence is greater than t have been developed. Some simple sufficient conditi... View full abstract»

• Flip-Flops for Multiple-Valued Logic

Publication Year: 1976, Page(s):237 - 246
Cited by:  Papers (11)  |  Patents (1)
| | PDF (2408 KB)

A family of multiple-valued (MV) electronic memory elements, referred to herein as flip-flops, is presented along with a system of MV algebra upon which they are based. These MV flip-flops are compared to binary flip-flops. MV asynchronous set-clear flip-flops and synchronous set-clear, D-type, JK, and modulo N counter flip-flops are presented, their next-state equations are derived, and they are ... View full abstract»

• On Magnetic Bubble Logic Circuits

Publication Year: 1976, Page(s):247 - 253
Cited by:  Papers (12)
| | PDF (2209 KB)

This paper is concerned with the realization of logic functions by using two-input magnetic bubble logic elements. A magnetic bubble logic element is the multiple-output logic element whose number of 1'' 's of the output is equal to that of corresponding input, and fanout of each output terminal of the element is restricted to one. In order to realize some functions, it is necessary to use the g... View full abstract»

• The Generation of Permutations in Magnetic Bubble Memories

Publication Year: 1976, Page(s):254 - 262
Cited by:  Papers (15)
| | PDF (2160 KB)

In this paper two recent models of basic operations in magnetic bubble memories are discussed. The accessing of an item and the generation of arbitrary permutations in these models are studied. It is shown that the two methods of accessing an item as described in this paper for the two models are optimal in terms of the number of operations. For each model, lower bounds for the number of operation... View full abstract»

• A Tree System Approach for Fingerprint Pattern Recognition

Publication Year: 1976, Page(s):262 - 274
Cited by:  Papers (53)  |  Patents (1)
| | PDF (3465 KB)

The purpose of this paper is to demonstrate how a syntactic approach and, in particular, a tree system may be used to represent and classify fingerprint patterns. The fingerprint impressions are subdivided into sampling squares which are preprocessed and postprocessed for feature extraction. A set of regular tree languages is used to describe the fingerprint patterns and a set of tree automata is ... View full abstract»

• Language Correction Using Probabilistic Grammars

Publication Year: 1976, Page(s):275 - 286
Cited by:  Papers (12)
| | PDF (2762 KB)

Error correction of programming languages has been effected in a heuristic fashion; error correction in the information-theoretic sense is very precise. The missing link is provided through probabilistic grammars. This paper provides the theoretical foundation for the precise construction of an error correcting compiler. The concept of code distance is extended to account for syntax in language. G... View full abstract»

• Some Aspects of the Zoom Transform

Publication Year: 1976, Page(s):287 - 296
Cited by:  Papers (18)  |  Patents (2)
| | PDF (1743 KB)

The spectral analysis of a long time series is often hampered by the limited capacity of the Fourier analyzer. The ideal frequency resolution of the analysis of N sample points cannot be realized if the analyzer cannot handle N points simultaneously. This paper examines some of the aspects of the zoom transform, which provides for partial recovery of the ideal resolution on an analyzer of limited ... View full abstract»

• Self-Synchronization of Asynchronous Sequential Circuits Employing a General Clock Function

Publication Year: 1976, Page(s):297 - 300
Cited by:  Papers (9)  |  Patents (2)
| | PDF (485 KB)

A self-synchronization model is developed. It is based on a general clock function which depends only on the state variables. This function is associated with the flip-flop type to be used and is independent of the flow table. A modular implementation which uses integrated circuits is obtained. With this technique, the synthesis procedures for synchronous machines can be directly applicable to asy... View full abstract»

• Synchronous Counters Constructed Entirely of J-K Flip-Flops

Publication Year: 1976, Page(s):300 - 306
Cited by:  Papers (3)
| | PDF (1436 KB)

Synchronous counters composed entirely of J-K flip-flops can be systematically designed to fit given specifications. However, known design methods do not provide useful counters for many specifications of interest. We prove that some plausible counters are impossible to construct. For example, we prove that there is no self-starting, gateless, synchronous J-K flip-flop counter with N J-K flip-flop... View full abstract»

• Optimum State Assignment for the D Flip-Flop

Publication Year: 1976, Page(s):306 - 311
Cited by:  Papers (1)
| | PDF (1095 KB)

This correspondence is a modification of the basic SHR-optimal1 state assignment procedure for the D flip-flop. Under the minimum sum-of-products (MSOP) constraint, a sequential machine with n D flip-flops has 2n times as many distinct state assignments and twice as many distinct state assignment columns as the other flip-flop types. This correspondence shows that even though... View full abstract»

• Rebuttal to the Authors' Reply to our Comments on The Relationship Between Multivalued Switching Algebra and Boolean Algebra Under Different Definitions of Complement''

Publication Year: 1976, Page(s):311 - 312
| | PDF (355 KB)

First Page of the Article
View full abstract»

• IEEE Computer Society Publications

Publication Year: 1976, Page(s): nil2
| PDF (134 KB)
• [Front cover]

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