IEEE Transactions on Computers

Issue 9 • Sept. 1973

Filter Results

Displaying Results 1 - 25 of 27
  • [Front cover]

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

    Publication Year: 1973, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (230 KB)
    Freely Available from IEEE
  • [Breaker page]

    Publication Year: 1973, Page(s): nil1
    Request permission for commercial reuse | PDF file iconPDF (230 KB)
    Freely Available from IEEE
  • The Application of Constrained Least Squares Estimation to Image Restoration by Digital Computer

    Publication Year: 1973, Page(s):805 - 812
    Cited by:  Papers (332)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3690 KB)

    Constrained least squares estimation is a technique for solution of integral equations of the first kind. The problem of image restoration requires the solution of an integral equation of the first kind. However, application of constrained least squares estimation to image restoration requires the solution of extremely large linear systems of equations. In this paper we demonstrate that, for convo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combinational and Sequential Cellular Structures

    Publication Year: 1973, Page(s):813 - 823
    Cited by:  Papers (11)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2259 KB)

    Cellular arrays composed of identical cells with uniform interconnections are presented. The basic cell is a switching device with two inputs, two outputs, and two control variables x and T. The cell structure is either purely combinational or with unit delay depending upon the control variable T. The control variable x sets up either a ``crossing mode'' or a ``bending mode'' in the cell. Thus a t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logical Network Cost and Entropy

    Publication Year: 1973, Page(s):823 - 826
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1337 KB)

    A measure of the minimum cost of a logical network is important in the evaluation of such networks. A hypothesis is investigated which states that the average minimum cost depends on both the number of input variables and the entropy (``entropy'' in this sense is based on the probability of a ``1'' in the functions' truth table) of the function realized. Some experimental results are presented to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Minimization of Fuzzy Functions

    Publication Year: 1973, Page(s):826 - 832
    Cited by:  Papers (47)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1865 KB)

    The study of fuzziness in combinational switching systems by means of a suitable fuzzy algebra is discussed. The insufficiency of the methods for simplification of fuzzy functions as presented by Lee and Chang [9] and by Siy and Chen [10] is discussed. A new technique for minimization of fuzzy functions is developed. Special properties of fuzzy functions are discussed and their relationships to tw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Remarks on Base Extension for Modular Arithmetic

    Publication Year: 1973, Page(s):833 - 835
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1177 KB)

    It is shown that in a residue system with only the two moduli m-1 and m+1, base extension to modulus m is possible with savings in time and sometimes in hardware over conventional techniques. It is also shown that the underlying theory generalizes to provide comparable savings when extending any system with two moduli nm-1 and nm+1 (where n may be any integer) to include the third modulus m. For s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Universal Test Sets for Logic Networks

    Publication Year: 1973, Page(s):835 - 839
    Cited by:  Papers (45)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2278 KB)

    This paper examines the problem of finding a single universal test set that will test any of a variety of different implementations of a given switching function. It is shown that, for AND/OR networks, universal test sets may be found that detect not only all single faults but all multiple faults as well. The minimality and size of these sets are examined and their derivation for incomplete functi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Performance Analysis of Retrieval Functions

    Publication Year: 1973, Page(s):840 - 844
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1431 KB)

    Threshold-type retrieval functions have been suggested by many people and used widely in clustering algorithms. In this paper, a discriminating capacity is defined for these retrieval functions. Explicit methods for computation are presented. The discriminating capacity is useful as a quantitative measure for the retrieval power of each function and can serve as a guide for selection. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Control Memory Minimization in Microprogrammed Digital Computers

    Publication Year: 1973, Page(s):845 - 848
    Cited by:  Papers (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1437 KB)

    The problem of minimizing the bit dimension of control memories in microprogrammed digital computers is considered in this paper. We start essentially with the same basic formulation as that of Grasselli and Montanari [2]. However, in order to minimize the computational requirements, we start directly with the set of maximum compatibility classes of microcommands whose number is usually small, and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel Processing in Boolean Algebra

    Publication Year: 1973, Page(s):848 - 851
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2137 KB)

    A processor called Boolean analyzer has been presented at the 1968 IFIP Congress to introduce parallel processing of Boolean expressions [1]. The present paper shows how to increase its speed many times by making its processing more parallel. The applications of the Boolean analyzer are limited to few but important problems. A typical problem of that kind: listing of all implicants of a function o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Hybrid Digital/Optical Computer System

    Publication Year: 1973, Page(s):852 - 858
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4335 KB)

    A brief review of the principles of optical data processing (ODP) with its high throughput data rate and parallel processing potential is given, followed by a description of a viable on-line electron-beam addressed electrical-to-optical input transducer. A proposed on-line hybrid digital/optical two-dimensional processing system is then described. An output plane optical-to-digital interface and s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Pattern Recognition by Piecewise Linear Discriminant Functions

    Publication Year: 1973, Page(s):859 - 862
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1405 KB)

    A piecewise linear function is represented in terms of a set of linear functions through the use of the maximum and minimum functions. A procedure for finding piecewise linear discriminant functions for pattern recognition is described. The procedure iteratively uses the accelerated relaxation method to find every linear function in a piecewise linear function. The procedure was implemented by a F... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Identification of Totally Symmetric Boolean Functions

    Publication Year: 1973, Page(s):863 - 864
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (403 KB)

    A modification in the algorithm for the detection of totally symmetric functions as expounded by the author in an earlier note1 is presented here. The modified algorithm takes care of a limited number of functions that escape detection by the previous method. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "The Relationship Between Multivalued Switching Algebra and Boolean Algebra Under Different Definitions of Complement

    Publication Year: 1973, Page(s): 864
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (230 KB)

    This correspondence identifies the definitions of the above paper in mathematical terms. Both algebraic and logical terms are given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Efficient Computation of Matrix Chain Products

    Publication Year: 1973, Page(s):864 - 866
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    It is pointed out that the number of scalar multiplications (additions) required to evaluate a matrix chain product depends on the sequence in which the associative law of matrix multiplication is applied. An algorithm is developed to find the optimum sequence that minimizes the number of scalar multiplications. A program is written for use on the CDC 6600 computer to implement this algorithm and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Simply Solvable Class of Simultaneous Linear Equations

    Publication Year: 1973, Page(s):866 - 867
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (414 KB)

    A solution is presented for a class of a very large system of linear algebraic equations. The given set of simultaneous equations is initially transformed to yield an equivalent system of equations in triangular form whose solution is straightforward. With the present technique, the number of operations on the computer is minimized while the convergence to a unique solution is guaranteed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Boundary Conditions for Iteratively Realized Sequential Circuits

    Publication Year: 1973, Page(s):867 - 868
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (421 KB)

    A more compact and structured way of obtaining the boundary conditions for iteratively realized sequential circuits is presented. The notion of a ``predecessor tree'' is used. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some Binary Output Sequence Properties of Deterministic Autonomous Finite-State Machines with Probabilistic Initialization

    Publication Year: 1973, Page(s):868 - 869
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (429 KB)

    An improved bound on the number of low-weight sequences that may be generated by L-step observable autonomous finite-state machines is derived. An upper and lower bound on the range of L for this same class of machines is also developed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Nonlinear Transformation for Digital Picture Processing

    Publication Year: 1973, Page(s):869 - 873
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1000 KB)

    A nonlinear picture-to-picture transformation is introduced and compared with a straightforward linear transformation. The criterion for comparison is based on the desire to smooth noisy or textured regions while retaining edge definition. Selected examples from a large number of simulations are presented. The transformation presented is believed to be superior to many techniques presently being e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Remarks on the SHR-Optimal State Assignment Procedure

    Publication Year: 1973, Page(s):873 - 875
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    The optimal state assignment procedure by Story, Harrison, and Reinhard [1] depends computationally on the number of distinct state assignment columsn Cdi, i = 1, 2, ..., C(R). C(R) can be computed exactly by see the [Eqa] in pdf file but a bound for C(R) is shown to be C(R) = 2R-1 - 1 for R - 1 =2n. Furthermore, for this value of R a distinct state assignment set ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Angle Detection on Digital Curves

    Publication Year: 1973, Page(s):875 - 878
    Cited by:  Papers (305)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (602 KB)

    A simple parallel procedure for selecting significant curvature maxima and minima on a digital curve is described. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Loading of Decoder Drivers

    Publication Year: 1973, Page(s):878 - 879
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (323 KB)

    The load on any input wire of a decoder is calculated and shown to be independent of the state of the other inputs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Book Reviews

    Publication Year: 1973, Page(s):879 - 884
    Request permission for commercial reuse | PDF file iconPDF (1410 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