IEEE Transactions on Computers

Issue 11 • Nov. 1975

Filter Results

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

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

    Publication Year: 1975, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (216 KB)
    Freely Available from IEEE
  • More Efficient Radix-2 Algorithms for Some Elementary Functions

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

    de Lugish [1] has defined efficient algorithms in radix 2 for certain elementary functions such as Y[X,Y/X1/2, Y + lnX, Y.exp (X), etc. His technique requires a systematic 1-bit left shift of a partially converged result, together with two 4-bit comparisons to select a ternary digit for the next iteration. This selection of digits reduces the average number of full precision additions t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Equational Realizations of Switching Functions

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

    Equational logic is an approach to combinational synthesis based on the equation f(x) = 1 rather than on the function f(x). The central problem of equational logic is to find a system of equations gi(x) = hi(x) (i = 1,2,...,k), of the simplest possible form, that has the same solutions as f(x) = 1. Given such a k-equation system, f(x) may be realized as the output of a k-wide... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Performance of Certain Multiprocessor Computer Organizations

    Publication Year: 1975, Page(s):1066 - 1074
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3768 KB)

    Analytic models are developed to evaluate the performance of a multiprocessor computer system. Markov chain techniques are used to model memory conflicts when the memory is modularized. The instruction execution rate (IER) is chosen as the measure of performance. The performance is studied with different storage allocations for instructions and data and with interleaving in the instruction space. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A/D Conversion Using Geometric Feedback AGC

    Publication Year: 1975, Page(s):1074 - 1078
    Cited by:  Papers (1)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2936 KB)

    A digital signal processing technique is described which utilizes a built-in automatic gain control (AGC) function. A particularly attractive algorithm called "geometric feedback" is developed which has certain desirable properties. A simple analytic solution of the response is derived for the special case of linear geometric feedback. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • System Fault Diagnosis: Closure and Diagnosability with Repair

    Publication Year: 1975, Page(s):1078 - 1089
    Cited by:  Papers (58)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4696 KB)

    Determination of the detectability and diagnosability of a digital system containing at most t faulty system components is considered. The model employed is to an extent independent of the means used to implement diagnostic procedures, i.e., whether the tests are accomplished via hardware, software, or combinations thereof. A parameter, called the closure index, is defined which characterizes the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimization of Incompletely Specified Sequential Machines

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

    A simple yet efficient method for the minimization of incompletely specified sequential machines (ISSM's) is proposed. Precise theorems are developed, as a consequence of which several compatibles can be deleted from consideration at the very first stage in the search for a minimal closed cover. Thus, the computational work is significantly reduced. Initial cardinality of the minimal closed cover ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algebraic Method for Designing Multivalued Logic Circuits using Principally Binary Components

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

    Algebraic reduction procedures for multivalued logic functions based upon a principally binary circuit realization are presented. The procedures given are also applicable to literal gate realizations employing compound literals. The prime implicant generation and covering problems are treated in detail. It is shown that the selected cover must be iteratively examined for possible reduction at each... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-Detection Experiments for Parallel-Decomposable Sequential Machines

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

    Methods are presented for designing fault-detection experiments for sequential machines which are realized as parallel connections of simpler component machines. The outputs of these components are assumed to be inaccessible for measurement but it is shown that knowledge of the structure can be utilized to design simpler experiments. The procedure is based upon placing all components but one in a ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Digital Differential Analyzer (DDA) Circle Generation for Computer Graphics

    Publication Year: 1975, Page(s):1109 - 1110
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (424 KB)

    This correspondence comments on the method of circle generation described by Armstrong [1], and discusses the methods by which satisfactory circles for computer graphics may be obtained with digital differential analyzers (DDA's) using a single-phase Adam's procedure. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Minimization of Tree-Type Universal Logic Circuits

    Publication Year: 1975, Page(s):1110 - 1113
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    The realization of arbitrary switching functions using the universal logic modules of Yau and Tang [1], [2] has the disadvantage that, in general, large trees of modules result. A decomposition theorem and an algorithm are given for reducing the size of such trees, using what is called a chain decomposition. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computer Methods for Creating Photomosaics

    Publication Year: 1975, Page(s):1113 - 1119
    Cited by:  Papers (87)  |  Patents (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4752 KB)

    A technique is described which allows overlapping images to be combined into a photomosaic in which the visual impact of the introduced seam. has been minimized. Images which have been brought into geometric and gray scale register are combined on a line-by-line basis by choosing a "best" seam point for each line. The resulting artificial edge at the seam point is then locally smoothed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Computation of the Hadamard Transform and the R Transform in Ordered Form

    Publication Year: 1975, Page(s):1120 - 1121
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (440 KB)

    This correspondence describes an improved computational algorithm for the Hadamard transform and the R transform. By performing the computation "in place", the number of storage locations is minimized and the speed is increased. The transformed coefficients are in the order of increasing sequency. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Alternative Definition for "Neighborhood of a Point"

    Publication Year: 1975, Page(s):1121 - 1125
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1016 KB)

    The concept of "neighborhood of a point" has been used in various programs for analyzing spatial dot patterns. The common definition based on k-nearest neighbors does not reflect the intuitive cluster associations of certain points in simple patterns. An alternative definition is proposed to reflect such associations more satisfactorily. Its applications includes cluster analysis and descriptive m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Performance of Magnetic Bubble Memories in Computer Systems

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

    This correspondence describes simple queueing models for a magnetic bubble memory chip organization. Some of the unique features of bubble memories are outlined. The performance improvement due to bidirectional shifting is modeled as a function of program locality. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Prime Implicant Algorithm with Factoring

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

    An algorithm for finding the prime implicants of a Boolean function is given. The algorithm is similar to Nelson's algorithm since both involve the operations of complementing, expanding, and simplifying, but the new algorithm includes the additional operation of factoring. The algorithm with factoring is proved, and it is shown that factoring accounts for a dramatic increase in efficiency over Ne... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Note on Fast Base Extension for Residue Number Systems with Three Moduli

    Publication Year: 1975, Page(s):1132 - 1133
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (408 KB)

    An algorithm is given for the base-extension (BE) computation in residue number systems that requires the standard four steps (for systems with three moduli) but which saves hardware. Furthermore, for the particular moduli m-1, m, and m+1 it is shown that fast-BE in only two steps is possible, for all combinations of the moduli. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structural Preserving Morphisms of Finite Automata and an Application to Graph Isomorphism

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

    The transition preserving morphisms (endomorphism, homomorphism, isomorphism, and automorphism) of state machines are developed on the basis of nontrivial closed partitions over their state sets. Algorithms with illustrated examples are provided for determining these morphisms. By means of these morphisms, the structural preserving morphisms of finite automata can be readily solved by simply makin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a Covering Problem for Partially Specified Switching Functions

    Publication Year: 1975, Page(s):1139 - 1141
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    We consider the problem of finding the minimum number K(n,c) of total switching functions of n variables necessary to cover the set of all switching functions which are specified in at most c positions. We find an exact solution for K(n,2) and an upper bound for K(n,c) which is better than a previously known upper bound by an exponential factor. View full abstract»

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

    Publication Year: 1975, Page(s):1141 - 1142
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (384 KB)

    This correspondence comments on the statement, described in the above-mentioned paper,1 which follows after a few definitions characterizing input-output sequences for the design of checking experiments. Namely, a counterexample will be shown for one of the two statements. Furthermore, three generalized properties useful to demonstrate the above counterexample are presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Synthesis of Multiple-Input Change Asynchronous Machines Using Controlled Excitation and Flip-Flops"

    Publication Year: 1975, Page(s):1142 - 1143
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB)

    Mealy synchronous machines cannot be implemented by Chuang and Das"1 procedure for multiple-input change asynchronous circuits. The circuit must be changed to handle this common type of machine. 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):1143 - 1144
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB)

    Prof. Bredeson rightly points out that the realization shown in the Figs. 1 and 4 of the above paper1 imposes a restriction that Mealy machines cannot be realized. But, as we pointed out in Section V of our paper, the output flip-flops are used in our realization only to remove possible hazards in the output terminals. For some applications, the output hazards could be tolerable and in such situat... 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): 1144-a
    Request permission for commercial reuse | PDF file iconPDF (144 KB)
    Freely Available from IEEE
  • IEEE Computer Society Membership & Publications

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