By Topic

IEEE Transactions on Computers

Issue 1 • Date Jan. 1975

Filter Results

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

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

    Publication Year: 1975, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (196 KB)
    Freely Available from IEEE
  • Some Parametric Techniques in the Analog Solution of Ordinary Differential Equations

    Publication Year: 1975, Page(s):1 - 8
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1840 KB)

    The direct analog simulation of an ordinary differential equation over an interval for the independent variable is not possible whenever on that interval there is division by a variable which tends to zero, or there is a dependent variable such as a derivative which is represented by an integrator output and which becomes large without bound. Also, the raising of time dependent variables to fracti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Range of Logical Flexibility of Tree Networks

    Publication Year: 1975, Page(s):9 - 28
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4144 KB)

    The flexible network is a network composed of flexible logical multivalued cells which can be adjusted at will to perform any functions. The network is assumed to have a fixed interconnection pattern and to have a fixed-input variable assignment. We have already investigated the necessary and sufficient range of flexibility of the cell's function to obtain all the output functions the network coul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modular Replacement of Combinational Switching Networls

    Publication Year: 1975, Page(s):29 - 48
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4448 KB)

    This paper discusses a technique whereby a logic design which is unconstrained may be replaced quasi-optimally with modules from a constrained library. Necessary and sufficient conditions for the replacement of modules within a network are developed and then reformulated as integer linear programs. These integer linear programs are solved during individual steps of a dynamic programming formulatio... View full abstract»

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

    Publication Year: 1975, Page(s):48 - 62
    Cited by:  Papers (20)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4504 KB)

    Five operations are defined in the Rademacher-Walsh transform domain. It is shown that these operations allow Boolean functions to be classified in a very concise way. The result of applying this classification to Boolean functions of up to fourth order indicates that threshold functions play an important part in the composition of Boolean functions. A synthesis method is developed for the synthes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Boolean Difference and Multiple Fault Analysis

    Publication Year: 1975, Page(s):62 - 71
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3920 KB)

    The Boolean difference is a well-known mathematical concept which has found significant application in the single fault analysis of combinational logic circuits. One of the primary attributes of the Boolean difference in such situations is its completeness. In this paper we extend the Boolean difference concept to cover multiple fault situations. Expressions are developed which give all possible i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis Algorithms for 2-level MOS Networks

    Publication Year: 1975, Page(s):72 - 79
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2344 KB)

    Due to the considerable progresses during the past few years, metal oxide semiconductor (MOS) has become one of the most important technologies for large-scale integration (LSI). Since a fairly complex function can be realized by a single MOS cell, most of the conventional algorithms which use NOR, NAND, AND, and OR gates as the basic building blocks are not suitable to synthesize MOS networks. Th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Parallel Radix-4 Fast Fourier Transform Computer

    Publication Year: 1975, Page(s):80 - 92
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5048 KB)

    The organization and functional design of a parallel radix-4 fast Fourier transform (FFT) computer for real-time signal processing of wide-band signals is introduced. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Syntactic Recognition of Imperfectly Specified Patterns

    Publication Year: 1975, Page(s):93 - 95
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    The methods developed in this correspondence represent an approach to the problem of handling error-corrupted syntactic pattern strings, an area generally neglected in the numerous techniques for linguistic pattern description and recognition which have been reported. The basic approach consists of applying error transformations to the productions of context-free grammars in order to generate new ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Parallel Mechanism for Detecting Curves in Pictures

    Publication Year: 1975, Page(s):96 - 98
    Cited by:  Papers (36)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    In Hough [1], Duda and Hart [2], and Griffith [3] procedures were proposed for detecting lines in pictures and in [2] Duda and Hart extended their method for more general algebraic curve, fitting. This correspondence shows how this method can be used to detect any given curve in a specific orientation. The procedure presented here con be easily implemented and can be efficiently implemented in a p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Piecewise Polynomial L2Approximation of Functions of One and Two Variables

    Publication Year: 1975, Page(s):98 - 102
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    The problem of piecewise polynomial L2 approximation with variable boundaries is considered. Necdssary and sufficient conditions for local optima are derived. These suggest simple functional iteration, algorithms for locating the boundaries. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Constrained-Input Problem

    Publication Year: 1975, Page(s):102 - 106
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (904 KB)

    Given a combinational output function f and an input constraint φ = 0, there is a set G( f, φ) of output functions equivalent to f with respect to φ. A function belongs to G( f, φ), that is, provided its evaluations agree with those of f for all argument combinations satisfying the constraint φ = 0. We define the constrained-input problem as that of generating G( f, φ... View full abstract»

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

    Publication Year: 1975, Page(s):106 - 108
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB)

    This correspondence provides some clarifications and revision to the above-mentioned paper.1 It also presents the generalized versions of the definitions and theorems related to closure classes. These versions are applicable to arbitrary subsets of the state set of a sequential machine. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Derivation of Minimal Complete Sets of Test-Input Sequences Using Boolean Differences"

    Publication Year: 1975, Page(s): 108
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB)

    In the above paper1, the partial Boolean difference is defined and an algorithm for deriving complete minimal test input sequences for single-fault detection is given. In this correspondence, it is shown that the presentation of the algorithm is inadequate with respect to the need for multiple path sensitization. It is further shown that the computational procedure used in footnote 1 do... 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: 1975, Page(s): 109
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (65 KB)

    I wish to thank Metze et al. for having identified certain sources of difficulty with the algorithm given in my paper.1 The notion of "partial Boolean difference" introduced in my paper—and on which the algorithm was based—was unfortunately restricted to single path sensitization thus resulting in the well-known limitations of such an approach. The concept of partial Boolean difference... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • B75-1 Logic and Logic Design

    Publication Year: 1975, Page(s): 110
    Request permission for commercial reuse | PDF file iconPDF (256 KB)
    Freely Available from IEEE
  • B75-2 Systems Simulation

    Publication Year: 1975, Page(s):110 - 111
    Request permission for commercial reuse | PDF file iconPDF (448 KB)
    Freely Available from IEEE
  • Information for authors

    Publication Year: 1975, Page(s): 112
    Request permission for commercial reuse | PDF file iconPDF (276 KB)
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1975, Page(s): 112-a
    Request permission for commercial reuse | PDF file iconPDF (144 KB)
    Freely Available from IEEE
  • People are Getting More Important

    Publication Year: 1975, Page(s): 112-b
    Request permission for commercial reuse | PDF file iconPDF (1296 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