By Topic

IEEE Transactions on Computers

Issue 8 • Aug. 1977

Filter Results

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

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

    Publication Year: 1977, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (216 KB)
    Freely Available from IEEE
  • Interconnection Networks from Three State Cells

    Publication Year: 1977, Page(s):705 - 711
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1922 KB)

    A class of interconnection networks with n (even) terminals is considered where connections between any two terminals are possible. Synthesis of these networks is accomplished using 4-terminal, 3-state elementary switching cells. A network with a cell count growing as n1.7is described. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Combinational Circuit Synthesis with Time and Component Bounds

    Publication Year: 1977, Page(s):712 - 726
    Cited by:  Papers (5)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3226 KB)

    New results are given concerning the design of combinational logic circuits. We give time and component bounds for combinational circuits specified in several ways. For any sequential machine defined by linear recurrence relations, we discuss an algorithm for the synthesis of equivalent combinational logic. The procedure includes upper bounds on the time and components involved. We also discuss th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modular Design of Asynchronous Circuits Defined by Graphs

    Publication Year: 1977, Page(s):727 - 737
    Cited by:  Papers (26)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3070 KB)

    An universal cell (CUSA) permits one to realize any asynchronous automaton by associating such a cell with a state and a connection with a transition. There is no internal variable assignment and all kinds of hazards are avoided. In the first part of the paper we shall present the principle of the CUSA and the synthesis method using flow tables. It is an original method which enables one to reduce... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Totally Self-Checking Checkers for Separable Codes

    Publication Year: 1977, Page(s):737 - 744
    Cited by:  Papers (75)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3839 KB)

    Design of totally self-checking (TSC) checkers for separable codes is studied. Assuming a specific checker design, a sufficient condition on separable codes is derived such that the assumed checker is TSC. It is shown that the proposed checker is applicable to certain Berger codes and residue codes. A class of codes equivalent to Berger codes is derived for which the proposed checker is TSC. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Approach to Unified Methodology of Combinational Switching Circuits

    Publication Year: 1977, Page(s):745 - 756
    Cited by:  Papers (31)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3230 KB)

    A methodology based on the theory of Boolean equations has been developed which permits a unified approach to the analysis and synthesis of combinational logic circuits. The type of circuits covered by the approach includes both the classical loopless combinational networks as well as those that contain closed feedback loops and thus have internally a sequential character. To that end, a general m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Technique for the Fast Minimization of Switching Functions

    Publication Year: 1977, Page(s):757 - 764
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4011 KB)

    The minimization of switching functions involving many variables is a difficult task. This paper presents a new minimization procedure that allows this process to be implemented with reduced computational effort. This procedure, designated as the directed-search algorithm, is applicable to both manual and computer-programmed minimization. The details of the algorithm are presented and illustrated ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Wire-Routing Scheme Based on Trunk-Division Methods

    Publication Year: 1977, Page(s):764 - 772
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4795 KB)

    This paper deals with a wire-routing algorithm for a building-block LSI. This algorithm has several features which sharply define it from previous techniques. The most noteworthy one among them is that it can achieve perfect wirability. This feature enables a design automation of an LSI layout pattern without any human supports. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image Boundary Estimation

    Publication Year: 1977, Page(s):772 - 781
    Cited by:  Papers (28)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6961 KB)

    In this paper, an object boundary estimator, applicable to a class of noisy images, will be introduced. The images considered will contain an object of interest within the background where the statistics of the object, background, noise, and boundary are given. The procedures developed are recursive and readily implementable on a digital computer. A number of examples are considered to illustrate ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis of Optimal Ambiguity Resolver Functions

    Publication Year: 1977, Page(s):782 - 789
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2665 KB)

    Large-scale integration (LSI) circuits impose particular constraints and present special opportunities for improving the diagnostic resolution of a digital system. In particular, bond failures represent a very significant failure mode in integrated circuits, so it is important to be able to identify a fault on an input/output lead to a single bus of a least replaceable unit, and it is desirable to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computer Recognition of Partial Views of Curved Objects

    Publication Year: 1977, Page(s):790 - 800
    Cited by:  Papers (60)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2639 KB)

    The use of a variation of chain encoding of binary boundary images is described in the context of a scene analysis system. The system can learn single views of the three-dimensional curved objects and can later recognize various partial views of the same projections of the objects. The system is completely automatic except for specifying whether the object is to be learned or recognized. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Polygonal Approximations by Newton's Method

    Publication Year: 1977, Page(s):800 - 807
    Cited by:  Papers (57)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3387 KB)

    The problem of locating optimally the breakpoints in a continuous piecewise-linear approximation is examined. The integral square error E of the approximation is used as the cost function. Its first and second derivatives are evaluated and this allows the application of Newton's method for solving the problem. Initialization is performed with the help of the split-and-merge method [8]. The evaluat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Simple Technique for the Determination of Delayed Maximal Length Linear Binary Sequences

    Publication Year: 1977, Page(s):808 - 811
    Cited by:  Papers (2)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2787 KB)

    The problem of delayed sequence generation from a central pseudorandom binary sequence generator is considered. In particular a simple algorithm is derived which permits the convenient determination of delayed sequences. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Programmable Array Realizations of Synchronous Sequential Machines

    Publication Year: 1977, Page(s):811 - 818
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3471 KB)

    Cellular-array realizations of switching functions have been studied in order to take advantage of the many design possibilities offered by large-scale integration technology. This paper introduces a class of programmable cellular arrays that can be employed to realize arbitrary synchronous sequential machines. State assignments based upon k-out-of-m codes are employed to give rise to machine exci... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Recursive Algorithm for Sequency-Ordered Fast Walsh Transforms

    Publication Year: 1977, Page(s):819 - 822
    Cited by:  Papers (26)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1523 KB)

    An algorithm has been developed for calculating sequency-ordered fast Walsh-Fourier transforms (FWT's) using an additive recursion formula. Sequency-ordered FWT's of an N-dimensioned sampled data set are generated by a summation recursion of FWT's on subintervals of the data set. The algorithm is fast (N log2 N summations), computer efficient, and can be applied to time-dependent spectral analysis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiplicative Algorithms for Ternary Arithmetic Using Binary Logic

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

    This correspondence describes three algorithms of multiplicative type for ternary (base three) arithmetic using binary logic. The algorithms that are developed are multiplication, division, and natural logarithms. The method used is a normalization process of an operand to a specific constant. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis of Feed-Forward MOS Networks with Cells of Similar Complexities

    Publication Year: 1977, Page(s):826 - 831
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1203 KB)

    Recognizing the fact that there are practical limits on the complexities of the cells in an metal-oxide semiconductor (MOS) network, this correspondence attacks the problem of synthesizing MOS networks with cells of reasonable complexities. One step to achieve this goal is to avoid networks which consist of a very complex cell and a number of very simple ones. An algorithm is presented to synthesi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Segmented Selcuk Communication Networks and Response Routing

    Publication Year: 1977, Page(s):831 - 833
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (691 KB)

    Previously described Selcuk networks achieve routings of responses to the source of a "to-whom-it-may-concern" message without the use of location-based addressing. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Partitioning of Separating Edges: A New Approach to Combinational Logic Design

    Publication Year: 1977, Page(s):833 - 836
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    The list of separating edges for a switching function describes the boundary between its 1-cells and its 0-cells on the n-cube. It is shown how combinational logic can be designed by partitioning this list. The technique works from the output of the gates toward their inputs and is particularly suited for design with inverting gates (NAND, NOR). Fan-in limits are handled systematically. A necessar... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to "A Parrallel QR Algorithm for Symmetric Tridiagonal Matrices"

    Publication Year: 1977, Page(s): 836
    Cited by:  Papers (3)
    Request permission for commercial reuse | PDF file iconPDF (127 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • IEEE Computer Society Publications

    Publication Year: 1977, Page(s): 836
    Request permission for commercial reuse | PDF file iconPDF (131 KB)
    Freely Available from IEEE
  • Papers to be Published in the Next Issue September 1977

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