IEEE Transactions on Computers

Issue 9 • Sept. 1974

Filter Results

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

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

    Publication Year: 1974, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (201 KB)
    Freely Available from IEEE
  • A Projection Pursuit Algorithm for Exploratory Data Analysis

    Publication Year: 1974, Page(s):881 - 890
    Cited by:  Papers (583)  |  Patents (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4176 KB)

    An algorithm for the analysis of multivariate data is presented and is discussed in terms of specific examples. The algorithm seeks to find one-and two-dimensional linear projections of multivariate data that are relatively highly revealing. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Adaptive Search Optimization Algorithm

    Publication Year: 1974, Page(s):890 - 897
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3672 KB)

    A very fast nongradient procedure for function optimization is described. The procedure is based on the ideas of Rosenbrock [1] and Swann [2]. These were modified and refined to obtain an algorithm which provides an optimum with a very small number of function evaluations. This algorithm, compared with recently reported algorithms by Lawrence and Steglitz (L-S) [3], and Beltrami and Indusi (B-I) [... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Formalism for Description and Synthesis of Logical Algorithms and their Hardware Implementation

    Publication Year: 1974, Page(s):897 - 906
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3864 KB)

    The design methodology developed in the paper is based on an APL-like definition of logical arrays and operations on such arrays. First, the notion of a logical algorithm is introduced as a finite state automaton described by transition and output matrix. The technical realizations of such algorithms is then uniformly described as time-discrete, space-discrete, and time-space-discrete systems, and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Lee Path Connection Algorithm

    Publication Year: 1974, Page(s):907 - 914
    Cited by:  Papers (101)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2712 KB)

    The Lee path connection algorithm is probably the most widely used method for finding wire paths on printed circuit boards. It is shown that the original claim of generality for the path cost function is incorrect, and a restriction, called the pathconsistency property, is introduced. The Lee algorithm holds for those path cost functions having this property. Codings for the cells of the grid are ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error Detection and Correction by Product Codes in Residue Number Systems

    Publication Year: 1974, Page(s):915 - 924
    Cited by:  Papers (24)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3272 KB)

    The arithmetic error detecting and correcting capabilities of product (AN) codes in residue number systems (RNS) are described. The redundancy necessary and sufficient to allow single residue digit error detection or correction is determined, under the hypothesis that the error affects either an arbitrary legitimate number or a number in overflow. It is shown that single-bit errors are also correc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Generation of Internal State Assignments for Large Asynchronous Sequential Machines

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

    Several algorithms have been proposed for generating satisfactory state assignments for normal fundamental mode asynchronous sequential circuits. Programmed versions of minimal and near-minimal techniques have been incorporated in automated synthesis systems, but are known to require computational efforts which increase exponentially with flow table size. Other methods, requiring much less effort,... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Discretization Error Analysis in Linear DDA Connections

    Publication Year: 1974, Page(s):932 - 941
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3440 KB)

    In this paper mathematical models for digital integrators operating with multidigit increments are given, and the discretization error analysis of their linear connections is studied. The integration methods considered are linear multistep integration methods; some examples are studied in detail. Linear digital differential analyzer (DDA) connections are defined, and their use in connection with t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Two-Dimensional Digital Filtering and its Error Analysis

    Publication Year: 1974, Page(s):942 - 954
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2768 KB)

    The concept of a two-dimensional recursive digital filter is introduced and block diagram representations are given. Expressions for error bounds and mean-square, error for roundoff error accumulation are derived. Other sources of error are described. Simulation of the implementation of digital filters is discussed, and corresponding to this simulation, calculation of error is performed. Numerical... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diagnosis and Fault Equivalence in Combinational Circuits

    Publication Year: 1974, Page(s):955 - 963
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2808 KB)

    Two procedures are presented: one for diagnosis of single-gate failures and the other for deriving equivalence classes of single faults. Both procedures require use of a diagnostic table which lists gate sensitivities and primary output values for all input patterns in a set of tests which contains at most U tests, where U is an upper bound derived in the text. A gate is defined to be an n-input s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reciprocal Walsh Series

    Publication Year: 1974, Page(s):964 - 966
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    Any basis function of a generalized Fourier series takes on many values in an interval. In contrast, the binary nature of the basis functions of Walsh-Fourier series (WFS) allows them to be considered self-reciprocal1 except for a finite number of discontinuities. Hence, quotients of linear combinations of Walsh functions may be used to generate series representations of reciprocals of periodic fu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Characteristic Polynomials for a Class of Eigenvalue Problems

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

    Characteristic polynomials are here generated for a class of eigenvalue problems using the singularity condition previously encountered in the solution of corresponding forced system. The process is efficient and requires n2/2 operations in contrast to n3 operations required by techniques such as the Leverrier-Faddeev method. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Method for Transposing Externally Stored Matrices

    Publication Year: 1974, Page(s):967 - 970
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    A method for transposing large matrices stored on external storage devices allowing direct access is proposed. The method can be applied both to square and nonsquare matrices and it is particularly suitable when the number of rows and columns of the matrices are products of many factors. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Diagnostic Keys as a Representation for Context in Pattern Recognition

    Publication Year: 1974, Page(s):970 - 971
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (528 KB)

    Context may be introduced into a character-recognition system by accepting only classifications of a character which are consistent with the classifications of neighboring characters. Diagnostic keys are proposed as an efficient representation for this type of contextual information. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Asynchronous Circuit Design Language (ACDL)

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

    This correspondence describes a special purpose Asynchronous Circuit Design Language (ACDL) for specifying the terminal behavior of asynchronous sequential circuits. The language is a valuable tool for formalizing and documenting asynchronous designs, as well as providing a user interface to a completely automated synthesis system. The language includes many special features which permit quick and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sequency Domain Design of Frequency Filters

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

    Each discrete transform has its advantages over other transforms. Fourier domain filters are easier to design than Walsh domain filters. But Walsh transforms can be computed much faster than Fourier transforms. This paper considers the problem of designing a Walsh domain filter, given a Fourier domain filter. Same procedure can be applied to other transforms. Given a Slant filter its equivalent Fo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Divide-and-Correct Algorithm for Division in a Negative Base

    Publication Year: 1974, Page(s):981 - 983
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (400 KB)

    A divide-and-correct algorithm is described for multiple-precision division in the negative base number system. In this algorithm an initial quotient estimate is obtained from suitable segmented operands; this is then corrected by simple rules to arrive at the true quotient. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Numerical Algorithm for the Resolution of Boolean Equations

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

    This correspondence presents the remainder-quotient (RQ)-algorithm for the resolution of Boolean equations. If [mi]w = w ( xkl, xj2, ... XkN) = 1[/mi] is the Boolean equation equivalent to the system whose solution is desired, we want to determine the Boolean functions [mi]xk, = Xkp ( xhj+1,... -xkN)[/mi] with p = 1,2,... j, which verify the equivalent equation. We start with the function w given ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiplying D/A Converter

    Publication Year: 1974, Page(s):986 - 988
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    A multiplying D/A converter (MDAC) based upon the use of bipolar high precision current sources and inverted ladder networks is described. It is shown that if super-gain IC operational amplifiers are used with current sources a converter accuracy of 0.01 percent over the full temperature range can be achieved. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "The Extraction of Pattern Features from Imperfectly Identified Samples"

    Publication Year: 1974, Page(s):988 - 989
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    In a recent note1 C. C. Babu derives an upper bound on the probability of misclassification for the case when part of the training data is incorrectly labeled. Using this notation the bound is given by View full abstract»

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

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

    I thank Dr. Toussaint for his interest in my work. To answer his first point namely the validity of the upperbound, over the range of β, a better bound appears in another paper ([1, (10)]). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Fast Hardware Fourier Transformation Through Counting"

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

    The Appendix of the above paper1 presents a serial sign flipper for radix (-2). Recently, a simpler realization has been brought to the attention of the author. The improved circuit has been developed independently of the published design by H. C. Wilck of the Jet Propulsion Laboratory, Pasadena, Calif. His approach to the problem is quite different from the author's. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Monotone Functions in Sequential Circuits"

    Publication Year: 1974, Page(s):989 - 990
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (376 KB)

    The above paper1 by Magó discusses the state assignment problem by means of monotone increasing (i.e., positive) next-state functions for both synchronous and asynchronous sequential networks. It may be interesting to note that the same subject for synchronous sequential networks has also been studied under a somewhat different title: "Fail-Safe Realization of Sequential Machines." This is be... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • B 74-39 A Course in APL/360 with Applications

    Publication Year: 1974, Page(s):990 - 991
    Request permission for commercial reuse | PDF file iconPDF (488 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