Scheduled System Maintenance
On Friday, October 20, IEEE Xplore will be unavailable from 9:00 PM-midnight ET. We apologize for the inconvenience.
Notice: There is currently an issue with the citation download feature. Learn more.

IEEE Transactions on Computers

Issue 2 • Feb. 1974

Filter Results

Displaying Results 1 - 25 of 43
  • IEEE Transactions on Computers - Table of contents

    Publication Year: 1974, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (598 KB)
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1974, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (165 KB)
    Freely Available from IEEE
  • Analysis of Multiprocessor Control Organizations with Partial Program Memory Replication

    Publication Year: 1974, Page(s):113 - 120
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2360 KB)

    In certain real-time multiprocessor controllers the program memory must be at least partly replicated to reduce queuing delays and meet throughput requirements. In these organizations the program memory is a common pool consisting of K sections servicing m CPU's. The jth section is of size Xi and is replicated ni times (ni ≤ m); j = 1,...-, K. Dynamic programming is used to find optimal valu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Quantitative Analysis of the Utilization of Associative Memories in Data Management

    Publication Year: 1974, Page(s):121 - 133
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3800 KB)

    An associative approach to data management is developed, and a methodology for measuring the performance and effectiveness of this approach is provided. Mathematical models which quantitatively describe retrieval, storage requirements, updating, and flexibility are developed for both a class of current sequential systems and an associative system. Utilizing these models, a comparison is made betwe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On-Set Realization of Fail-Safe Sequential Machines

    Publication Year: 1974, Page(s):133 - 138
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2056 KB)

    Fail-safe sequential machines can be constructed in such a way that if a failure happens in the sequential part, the ulterior functioning must carry on outside the code chosen to represent the set of states. This paper presents a study of the failures in the input combinational circuit and of the feasibility conditions of sequential machines with states coded by a k-out-of-n code. The electronic c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of Diagnosable Sequential Machines Utilizing Extra Outputs

    Publication Year: 1974, Page(s):138 - 145
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4000 KB)

    This paper is concerned with the problem of designing easily testable sequential machines, output-observable machines, for which there exist very short checking experiments. A sequential machine for which any initial state can be uniquely determined only by the output response is said to be output-observable. An algorithm is developed to modify a given machine to an output-observable one by adding... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Generation of Statistically Good Pseudonoise by Linearly Interconnected Shift Registers

    Publication Year: 1974, Page(s):146 - 152
    Cited by:  Papers (19)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2464 KB)

    Some new algorithms are presented for efficiently generating pseudorandom noise both in hardware and software. In software, a new word of pseudorandom bits can be generated about every 12 machine cycles, and hardware implementations can generate pseudo Gaussian noise with bandwith of 20 MHz or more. The algorithms generate binary maximal-length linear recursive sequencies of high degree and with m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power Minimization Problems of Logic Networks

    Publication Year: 1974, Page(s):153 - 165
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3760 KB)

    As a method for greatly reducing power dissipation in logic networks, we propose some logic organization techniques for logic networks. By such techniques, their power dissipation is to be minimized under certain input conditions, or the average power dissipation in the whole network should be minimized. A logic network in which these problems are taken into account will be called a power minimize... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unateness Properties of and-Exclusive-or Logic Circuits

    Publication Year: 1974, Page(s):166 - 172
    Cited by:  Papers (22)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2160 KB)

    Reordering the terms of a Reed-Muller or ring sum expansion of a switching function expressed in terms of the Boolean ring operations AND and EXCLUSIVE OR in a more natural way exploits the similarities between these expressions and unate functions and displays mathematical structure which apparently has not been noted before. McNaughton's n orderings on the n cube appear in a new setting and lead... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Consecutive Retrieval Property in File Organization

    Publication Year: 1974, Page(s):173 - 174
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    The consecutive retrieval (CR) property has been defined as the property of a query that can be answered by the retrieval of consecutive records in a file. In this correspondence we add some observations about boundary conditions to Gosh's study of the CR property. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Every Finite-State Machine can be Simulated (Realized) by a Synchronous (Asynchronous) Binary Feedback Shift-Register Machine

    Publication Year: 1974, Page(s):174 - 178
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    A theoretical model of a microprogram unit is formulated, and the relationship of this model to a form of feedback shift register is developed. The feedback shift-register machine variant has synchronous and asynchronous prototypes. The asynchronous binary feedback shift-register machines realize every fundamental mode asynchronous sequential (finite-state) machine. The synchronous feedback shift-... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonlinear Intrinsic Dimensionality Computations

    Publication Year: 1974, Page(s):178 - 184
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1104 KB)

    In pattern recognition, the raw data and dimensionality of the measurement space is usually very large. Therefore, some form of dimensionality reduction has been commonly considered as a practical preprocessing method for feature selection. Based on a method that increases the variance while maintaining local structure, a technique is developed to determine intrinsic dimensionality. A cost functio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Black-White Representation of a Gray-Scale Picture

    Publication Year: 1974, Page(s):184 - 186
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1992 KB)

    A hardware-implemented algorithm combining dynamic thresholding and edge detection allows black-white representation of gray-scale images for computer storage. The output resembles a highly detailed sketch, with resolution and contrast superior to a halftone representation. The same algorithm can be applied to text and line drawings, so that all three types of images can be stored using the same c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimization of Asynchronous Sequential Circuit Realizations

    Publication Year: 1974, Page(s):186 - 188
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (592 KB)

    Tan recently developed a heuristic state assignment algorithm for asynchronous sequential circuits. This note extends Tan's procedure to include optimization of the output state logic, as well as the next state logic, and single-output-change (SOC) flow tables with DON'T CARE entries. The extended algorithm exhibits the same simplicity of execution as Tan's procedure. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for Testing Asummability of Boolean Functions

    Publication Year: 1974, Page(s):188 - 191
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    An algorithm is described in this note to determine whether a switching function is asummable or not. The algorithm is efficient and simple for testing 2-asummability. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a Class of Recursive Algorithms for Continuous Estimation of the Mean

    Publication Year: 1974, Page(s):191 - 194
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (640 KB)

    In this correspondence a class of algorithms for recursive estimation of the mean of a random yariable is described and its properties are studied. New algorithms are presented that are shown to be statisticaily more efficient than the previous algorithms, and only slightly less efficient than the optimal algorithm of the same type. The computation time remains the same as in the best previous alg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some New Error Bounds and Approximations for Pattern Recognition

    Publication Year: 1974, Page(s):194 - 199
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1200 KB)

    For the average error probability Pe associated with the Bayes recognition procedures for two possible patterns, using no context, new upper and lower bounds and approximations are obtained. Results are given in terms of simple functions of feature "reliability" and a priori probabilities of the patterns. Two kinds of feature "reliability" are considered, i.e., distance between probability distrib... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rank-Augmented LU-Algorithm for Computing Generalized Matrix Inverses

    Publication Year: 1974, Page(s):199 - 201
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    A rank-augmnented LU-algorithm is suggested for computing a generalized inverse of a matrix. Initially suitable diagonal corrections are introduced in (the symmetrized form of) the given matrix to facilitate decomposition; a backward-correction scheme then yields a desired generalized inverse. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Note On High-Speed Generation of Maximal Length Sequences

    Publication Year: 1974, Page(s):201 - 203
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB)

    It is shown that high-speed generation of maximal length sequences can be realized by time division multiplexing instead of modulo-two adding the sequences obtained by decimation of a maximal length sequence. The advantage of this method is that higher speeds are obtainable. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Simplified Summation Array for Cellular Logic Modules

    Publication Year: 1974, Page(s):203 - 206
    Cited by:  Papers (1)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (688 KB)

    A greatly simplified configuration is proposed for the array that performs summation in a cellular logic module. Such modules realize arbitrary, multioutput, combinational switching behavior as sums of products (or sums of other terms). Special cases of these modules are random-access and associative memories (conventional or READ-ONLY). The simplifications are achieved by taking advantage of the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algebraic Approach to Boolean Equations

    Publication Year: 1974, Page(s):206 - 207
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    A generalization of the Löwenheim formula for the solutions of a Boolean equation was recently obtained by Ju. A. Serikov. In this correspondence the Serikov theorem is written in a somewhat simpler form and it is shown that it can also be viewed as a particular case of the classical Löwenheim formula. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Almost Uniform Distributions for Computer Image Enhancement

    Publication Year: 1974, Page(s):207 - 208
    Cited by:  Papers (66)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    The use of a gray level transformation which transforms a given empirical distribution function of gray level values in an image into a uniform distribution has been used as an image enhancement as well as for a normalization procedure. This transformation produces a discrete variable whose empirical distribution might be expected to be approximately uniform since it is related to the well known d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "A Measure of Computational Work"

    Publication Year: 1974, Page(s): 208
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB)

    This note indicates some difficulties in applying the above paper's1computational "work measure." View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Discussion of "A Measure of Computational Work"2

    Publication Year: 1974, Page(s):208 - 211
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1032 KB)

    This note presents a discussion of some issues that have been raised about my paper1"A Measure of Computational Work." View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • B74-6 PL/I Programming for Engineering and Science

    Publication Year: 1974, Page(s):211 - 212
    Request permission for commercial reuse | PDF file iconPDF (448 KB)
    Freely Available from IEEE

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