IEEE Transactions on Computers

Issue 7 • July 1976

Filter Results

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

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

    Publication Year: 1976, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (225 KB)
    Freely Available from IEEE
  • New Results and Techniques in Resolution Theory

    Publication Year: 1976, Page(s):673 - 677
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2121 KB)

    A concise matrix notation is introduced, leading to a very simple statement of the resolution principle of mechanical theorem proving in the propositional calculus. The refinements of general resolution can also be stated easily using this notation. In addition, the notation has lead to the development of three new techniques of theorem proving which are described and proved complete. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Note on the Linear Space Automata Stability Problem

    Publication Year: 1976, Page(s):678 - 683
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2148 KB)

    Paz et al. [1] have revealed the necessary and sufficient conditions for a linear automaton to be strongly approximable. In this paper, we extend their theory to a linear space automaton [2], i.e., a linear system with more than one linear mapping, to obtain a necessary and sufficient condition that it is strongly stable. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Numerical Expansion Technique and Its Application to Minimal Multiplexer Logic Circuits

    Publication Year: 1976, Page(s):684 - 702
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4212 KB)

    A method of realizing arbitrary combinational switching functions with multiplexers is derived. These circuits are divided in two classes where the first allows only uncomplemented variables as control inputs and the second has unrestricted inputs. The selected inputs to each multiplexer in the first class of circuits (tree circuits) are shown to be residue functions of the output function. Using ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Matrix Transform Processor

    Publication Year: 1976, Page(s):703 - 712
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3867 KB)

    A matrix transform processor (MTP) for an Evans and Sutherland LDS-2 graphics system has been designed and built at the University of North Carolina. The MTP performs all the important functions of a matrix multiplier, clipper, and perspective divider. Because of fast division logic in the MTP, the clipping and perspective division algorithms are straightforward and the machine is quite simple. On... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aspects of a Dynamically Adaptive Operating System

    Publication Year: 1976, Page(s):713 - 725
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3826 KB)

    -Real-time optimization of the overall performance of a large computer system or network such as an air-traffic control system or teleprocessing network inherently requires the introduction of adaptive control into selected control functions or sets of control functions. Such adaptive control is necessitated by the high variance of the available resource inventory and the workload resource demands... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Representation of Random Waveforms by Relational Trees

    Publication Year: 1976, Page(s):725 - 736
    Cited by:  Papers (51)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6591 KB)

    In a number of applications of image processing, much information about objects or textures in the image can be obtained by sequential analysis of individual scan lines. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some Results on Distribution-Free Analysis of Paging Algorithms

    Publication Year: 1976, Page(s):737 - 745
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2568 KB)

    This work is devoted to the analysis of page replacement algorithms under assumptions on the stochastic nature of the sequence of memory accesses. A detailed discussion of the authors' results, some of which were published in Russian, and their relations to other papers is given. The object of study of this paper is two families of page replacement algorithms (PRA's) which contain certain algorith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Statistical Analysis of a Differential Threshold Logic Circuit Configuration

    Publication Year: 1976, Page(s):745 - 754
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3653 KB)

    A differential current-switching circuit configuration is proposed for implementing threshold logic, and a first-order statistical analysis of the configuration is described. The configuration is intended for use within functional digital integrated circuits. It can be realized in a form that is fully compatible with conventional emitter-coupled logic (ECL). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error Analysis of Two-Dimensional Recursive Digital Filters Employing Floating-Point Arithmetic

    Publication Year: 1976, Page(s):755 - 759
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (763 KB)

    In this correspondence, error analysis for two-dimensional direct form recursive digital filters employing floating-point arithmetic is carried out. A systematic way of estimating the mean-squared errors due to roundoff, coefficient, and input quantizations is discussed. Norm error bounds are also given. Extensive numerical experiments have shown that the present approach leads to satisfactory res... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Input and Next-State Equations of the R-S Type M-Stable

    Publication Year: 1976, Page(s):759 - 763
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (738 KB)

    This correspondence proposes a generalization of the normal DON'T CARE condition and develops the input and next-state equations for a R-S type M-stable. An example is used to clarify the application of such a device to sequential machine inplementation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Simple Technique for Partial Elimination of Unit Productions from LR(k) Parsers

    Publication Year: 1976, Page(s):763 - 764
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (435 KB)

    A simplified version of Aho and Ullman's algorithm [1] is presented for the elimination of unit productions of the form A::= B from LR(k) parsers. The algorithm does not eliminate all such unit productions, but it is applicable in practical instances not handled by Aho and Ullman's technique. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Storage Efficient Way to Implement the Discrete Cosine Transform

    Publication Year: 1976, Page(s):764 - 765
    Cited by:  Papers (50)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (339 KB)

    Ahmed has shown that a discrete cosine transform can be implemented by doing one double length fast Fourier transform (FFT). In this correspondence, we show that the amount of work can be cut to doing two single length FFT's. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "The Application of the Rademacher-Walsh Transform to Boolean Function Classification and Threshold Logic Synthesis"

    Publication Year: 1976, Page(s):766 - 767
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB)

    In the above paper1Edwards shows the implementation of several Boolean functions using a threshold gate and XOR gates. An unstated, but implicit, result is that any given Boolean function can be synthesized in this way. This result is of some historical interest. We wish to relate it to a previous paper by Kaplan and Winder [1], which in effect derived the result, and then to a mathemat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Author's Reply2

    Publication Year: 1976, Page(s): 767
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (258 KB)

    I wish to thank C. K. Yuen for calling attention to a previous paper on the application of the Rademacher-Walsh transform to threshold logic synthesis [1]. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Further Comments on "Closure Partition Method for Minimizing Incomplete Sequential Machines"

    Publication Year: 1976, Page(s):767 - 768
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (389 KB)

    In the above paper1Yang has expounded a concept of supersession and has claimed that superseded compatibles can be ignored in the process of minimizing incompletely specified sequential machines (ISSM). In this correspondence, we present a counterexample whose minimal solution must include a superseded compatible and not the superseding compatible. As a consequence of this it is evident... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Computer Society Publications

    Publication Year: 1976, Page(s): 768
    Request permission for commercial reuse | PDF file iconPDF (139 KB)
    Freely Available from IEEE
  • Papers to be Published in the Next Issue August 1976

    Publication Year: 1976, Page(s): 768
    Request permission for commercial reuse | PDF file iconPDF (338 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