By Topic

IEEE Transactions on Computers

Issue 7 • July 1975

Filter Results

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

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

    Publication Year: 1975, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (204 KB)
    Freely Available from IEEE
  • On the Number of Functions Realized by Cascades and Disjunctive Networks

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

    In this paper, the number of functions realized by certain networks of two-input one-output gates are presented. Two networks are considered; one is the disjunctive network, which is characterized by the restriction that each gate output and each network input connect to exactly one gate input. The other network, the cascade, is the special case of the disjunctive networks in which each gate has a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Probabilistic Analysis of Random Test Generation Method for Irredundant Combinational Logic Networks

    Publication Year: 1975, Page(s):691 - 695
    Cited by:  Papers (46)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2072 KB)

    In this paper the random test generation method for large logic circuits is analyzed. Formulas for the detection probability and the number of random input patterns required to complete the test generation with a high probability are obtained for an irredundant fan-out-free combinational network tree consisting of identical n-input NAND gates. The quantitative estimates for the number of random in... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Weighted Random Test-Pattern Generator

    Publication Year: 1975, Page(s):695 - 700
    Cited by:  Papers (124)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3416 KB)

    A heuristic method for generating large-scale integration (LSI) test patterns is described. In particular, this paper presents a technique for generating statistically random sequences to test complex logic circuits. The algorithms used to obtain a set of tests by means of weighted logic signal variations are included. Several techniques for assigning these weights and for varying them are discuss... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time and Parallel Processor Bounds for Linear Recurrence Systems

    Publication Year: 1975, Page(s):701 - 717
    Cited by:  Papers (49)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3496 KB)

    We give new time and processor bounds for the parallel evaluation of linear recurrence systems. Such systems may be represented as x̄ =c̄ + Ax̄ where A is an n X n strictly lower triangular matrix and c is a constant column vector. We show that O og22n) time steps and n3/ 8 + 0O2) processors are sufficient. We also show that mth order line... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Building a Distance Function for Gestalt Grouping

    Publication Year: 1975, Page(s):718 - 728
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3296 KB)

    A central problem in the area of scene analysis is that of segmenting a scene into its natural objects. Current work emphasizes the semantic approach in which a priori knowledge of the shape of an object is used. Yet there is much to learn about more primitive cues for segmentation such as texture, color, and brightness. In the case of human perception, segmentation appears to be due to a multipli... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • High Rate Realization of Finite-State Machines

    Publication Year: 1975, Page(s):729 - 740
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3120 KB)

    This paper is concerned with the high rate realization of finite-state machines. Two new techniques for high rate realization of finite-state machines are presented, one applicable to finite, the other to infinite memory span machines. It is found that any finite-state machine can be realized by a tree of component machines of a proper size with a given high rate, where the propagation delay of th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Remark on Code Sets and Context-Free Languages

    Publication Year: 1975, Page(s):741 - 742
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    Given two nonempty sets of nonempty codewords S = {s1,...,sn} and T = {t1,...,tm}, it is decidable whether there are i1,...,lkand j1,...,jksuch that si1...sik= tj1...tjk, and furthermore, the set of all such solutions is a one counter language. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for the Generation of Test Sets for Combinational Logic Networks

    Publication Year: 1975, Page(s):742 - 746
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (984 KB)

    An algorithm is developed for generating a single-fault detection test set to be used in a combinational logic network. This algorithm has two unique characteristics. 1) When a test is generated, a list of faults detected by this test is available. Fault simulation, therefore, is not required after the test has been generated. 2) It generates a test set rather than a single test. Each test, with t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Properties of Faults and Criticalities of Values under Tests for Combinational Networks

    Publication Year: 1975, Page(s):746 - 750
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1096 KB)

    This correspondence discusses the properties of faults in combinational networks and their relationships with fault-detection and fault-location test sets. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Branch and Bound Algorithm for Computing k-Nearest Neighbors

    Publication Year: 1975, Page(s):750 - 753
    Cited by:  Papers (226)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (886 KB)

    Computation of the k-nearest neighbors generally requires a large number of expensive distance computations. The method of branch and bound is implemented in the present algorithm to facilitate rapid calculation of the k-nearest neighbors, by eliminating the necesssity of calculating many distances. Experimental results demonstrate the efficiency of the algorithm. Typically, an average of only 61 ... View full abstract»

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

    Publication Year: 1975, Page(s):753 - 756
    Cited by:  Papers (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    An algorithm is presented in this correspondence which will generate only those prime implicants (PI's) which are essential or necessary for a minimal sum of products (the technique can be extended for product of sums form also) of a given switching function —iven all the minterms. This algorithm eliminates the neces-sity of finding out all the PI's. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Fault-Tolerant Asynchronous Networks"

    Publication Year: 1975, Page(s):756 - 758
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    The authors1have used a coding theory approach in an attempt to design fault-detecting and fault-tolerant asynchronous sequential machines. While the method appears to be sound from theoretical aspects, actual attempts to implement these design procedures reveal a serious shortcoming which should be made known. View full abstract»

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

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

    Sawin and Maki make the three following observations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Discrete Cosine Transform"

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

    In the above correspondence,1 Ahmed et al. proposed a discrete cosine transform (DCT) and compared its performance with the Karhunen-Loeve transform (KLT). They offered empirical evidence showing that the DCT and the KLT compare closely for a number of digital signal processing applications. The purpose of this note is to show that the DCT and the KLT are indeed asymptotically equivalent if the da... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Asynchronous Sequential Machines Designed for Fault Detection"

    Publication Year: 1975, Page(s):759 - 760
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (312 KB)

    A recent paper1has proposed the design of asynchronous sequential machines with an internal fault detection mechanism. The "hard core" circuitry in these machines can be eliminated by the use of self-checking checkers. 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: 1975, Page(s): 760-a
    Request permission for commercial reuse | PDF file iconPDF (144 KB)
    Freely Available from IEEE
  • Does Easier Mean Better?

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