By Topic

Computers, IEEE Transactions on

Issue 10 • Date Oct. 1970

Filter Results

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

    Publication Year: 1970 , Page(s): c1 - 1008
    Save to Project icon | Request Permissions | PDF file iconPDF (610 KB)  
    Freely Available from IEEE
  • IEEE Computer Group

    Publication Year: 1970 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (187 KB)  
    Freely Available from IEEE
  • Iterative Solution of Large-Scale Systems by Hybrid Techniques

    Publication Year: 1970 , Page(s): 879 - 889
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2136 KB)  

    A hybrid computing technique is presented for improving the resolution of the discrete-space discrete-time (DSDT) resistive network method and the treatment of large scale systems encountered in the solution of partial differential equations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection and Parallel Execution of Independent Instructions

    Publication Year: 1970 , Page(s): 889 - 895
    Cited by:  Papers (63)  |  Patents (95)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1832 KB)  

    For a single instruction stream–single data stream organization the problem of simultaneously issuing several instructions is studied. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of Asynchronous Unit Delays

    Publication Year: 1970 , Page(s): 896 - 902
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1480 KB)  

    An asynchronous unit delay is an n-input n-output asynchronous sequential circuit such that the present value of the output n-tuple is equal to the value of the input n-tuple prior to the last input change. The delay is of significance as a building block for shift register realizations of asynchronous circuits. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Functional Microprogramming as a Logic Design Aid

    Publication Year: 1970 , Page(s): 902 - 907
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1368 KB)  

    While any digital computer can be designed using the tools of sequential network theory, it becomes practically impossible to handle a state table description and the appropriate synthesis methods for even modestly sized systems. Therefore, the most common approach to logic design considers subunits of the computer as individual sequential networks, i.e., sequential machines. They are designed separately and assembled into the overall system. Proper partitioning and an adequate system description are very essential in such a design effort. Functional microprogramming can greatly facilitate these tasks. View full abstract»

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

    Publication Year: 1970 , Page(s): 908 - 916
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2104 KB)  

    A descriptive notation is proposed for microprogramming which uses conventional sequential machine notation for the microprogram, and a register transfer language to define microoperations. The combination allows the definition of useful formal transformations which preserve system behavior. The transformations correspond to paralleling and disassembling microoperations in time and altering the control unit appropriately to preserve the original behavior. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Criterion and an Algorithm for Grouping Data

    Publication Year: 1970 , Page(s): 917 - 923
    Cited by:  Papers (22)  |  Patents (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1304 KB)  

    Many algorithms for grouping data without supervision depend on some criterion. We state two basic requirements such criteria should meet and we discuss several criteria in terms of these requirements. An attempt to satisfy both requirements simultaneously with a simple criterion leads us to introduce a linear transformation of the data. Although our principal result is for a two category problem, we present discussion and an example for the many category problem as well. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Case Study of a Versatile Generator of Repeatable Non-Poisson Sequences of Pseudorandom Pulses

    Publication Year: 1970 , Page(s): 924 - 938
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2480 KB)  

    This paper is a case study of a general method for designing generators of repeatable non-Poisson sequences of pseudorandom pulses. A class of normal distributions and some classes of skew distributions are derived. Block diagrams and design guides are given. The study is based both on analytical and simulation approaches. Applications of the proposed system may be found in the field of hardware simulation techniques and in more efficient arrangements of general purpose machines where they are used in simulation studies. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a New Theory of Sequential Switching Networks

    Publication Year: 1970 , Page(s): 939 - 956
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (4504 KB)  

    Classical switching theory has long been held inadequate in the solution of the pragmatic problems that face the logic designer because it is too cumbersome. This is primarily due to the exponential proliferation of states. A theory of sequential switching networks was sought that would yield more convenient methods for the analysis, synthesis, and debugging of switching networks. The basis for such a theory would have to be a departure from the microscopic individual state orientation of classical switching theory towards a macroscopic theory dealing with states and transitions as aggregates. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Linear Decomposition for Sequential Machines

    Publication Year: 1970 , Page(s): 956 - 963
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1856 KB)  

    This paper considers the loop-free decomposition of nonautonomous, synchronous, deterministic, nonlinear sequential machines into linear and nonlinear component machines. Two methods are derived which generate the desired decomposition and determine the state code assignment consistent with the linear realization of a component machine. Both processes are well suited for implementation by a digital computer. One of the procedures for decomposition and code assignment is analytic (in that trial and error processes are not required) and it discovers the largest possible linear component machine. In this decomposition the linear component machine is the predecessor of the nonlinear component machine. The other method, which may require iteration in some cases, yields a decomposition in which the nonlinear machine is the predecessor of the linear machine. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Many-Valued Algebra for Switching Systems

    Publication Year: 1970 , Page(s): 964 - 971
    Cited by:  Papers (28)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1784 KB)  

    Many-valued switching systems have been of considerable academic interest, despite the apparent inability to use them in practical applications. The main drawbacks, as pointed out by a number of authors, are the difficulties associated with the implementation of the functional basic set and the lack of adequate simplification techniques. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Readily Implemented Single-Error-Correcting Unit-Distance Counting Code

    Publication Year: 1970 , Page(s): 972 - 975
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1016 KB)  

    A new unit-distance counting code (similar to the Gray code but having error-checking properties) that offers distinct advantages in the simplicity of the digital equipment required for encoding and decoding is described. This code has application in several special areas of information processing. It is generated by a particular generalization of the family of Gray codes, which has no error- checking features, but shares with the Gray code a simple conversion relationship to the conventional binary counting code. The new code is derived, and its error-checking and code conversion properties are proven by simple combinatorial arguments. The code has a total of K(m)= 2.2m/2code words of m digits each (m any even integer). It may be employed for correction of single errors or for the detection of double errors. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Graphic Method for the Synthesis of Threshold Ternary Functions

    Publication Year: 1970 , Page(s): 975 - 976
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (488 KB)  

    In the final form of the Hanson method for the synthesis of ternary threshold functions on r-basis, a weighting vector appears whose coordinates were calculated by a tabular procedure. This must follow a definite ordered sequence since the value of each coordinate depends on the values of some of the previously calculated coordinates. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reduced Solutions of Boolean Equations

    Publication Year: 1970 , Page(s): 976 - 981
    Cited by:  Papers (11)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1096 KB)  

    The family of solutions for a Boolean equation is commonly represented in a single formula involving arbitrary Boolean parameters. It is well known that n parameters suffice to construct a general solution for an equation in n unknowns. For some equations, however, a general solution may be constructed using fewer than n parameters. This paper describes a method for constructing reduced solutions, i.e., general solutions involving the fewest parameters possible. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comment on "Delay-Free Asynchronous Circuits with Constrained Line Delays"

    Publication Year: 1970 , Page(s): 982
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (224 KB)  

    A method for applying Tracey's procedure to the state assignment problem of nonnormal mode flow tables is proposed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Parallel Operations on Hexagonal Arrays

    Publication Year: 1970 , Page(s): 982 - 983
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (344 KB)  

    Some comments arising from a recent paper concerning rectangular and hexagonal arrays are presented. An alternative skeletonizing algorithm for use in the latter type of array is described. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comment on "Computer Simulation of Pulse Propagation Through a Periodic Loaded Transmission Line"1

    Publication Year: 1970 , Page(s): 983
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (144 KB)  

    The authors of the above-mentioned paper have been informed by H. Haskal that the technique for the analysis of waveform propagation used in this paper had been previously used by Haskal and Rabinovici2 as early as 1965. This fact was unknown to the authors at the time of the publication of their paper. View full abstract»

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

    Publication Year: 1970 , Page(s): 984 - 985
    Save to Project icon | Request Permissions | PDF file iconPDF (2710 KB)  
    Freely Available from IEEE
  • B70-6 Computing Methods in Optimization Problems

    Publication Year: 1970 , Page(s): 986
    Save to Project icon | Request Permissions | PDF file iconPDF (320 KB)  
    Freely Available from IEEE
  • R70-39 On the Relational Homomorphisms of Automata

    Publication Year: 1970 , Page(s): 987
    Save to Project icon | Request Permissions | PDF file iconPDF (320 KB)  
    Freely Available from IEEE
  • R70-40 Module Clustering to Minimize Delay in Digital Networks

    Publication Year: 1970 , Page(s): 987 - 988
    Save to Project icon | Request Permissions | PDF file iconPDF (688 KB)  
    Freely Available from IEEE
  • R70-41 Diagnosis and Utilization of Faulty Universal Tree Circuits

    Publication Year: 1970 , Page(s): 988 - 989
    Save to Project icon | Request Permissions | PDF file iconPDF (672 KB)  
    Freely Available from IEEE
  • R70-42 Synthesis of Linear Sequential Machines with Unspecified Outputs

    Publication Year: 1970 , Page(s): 989
    Save to Project icon | Request Permissions | PDF file iconPDF (304 KB)  
    Freely Available from IEEE
  • R70-43 Lattice Functions, Pair Algebras, and Finite-State Machines

    Publication Year: 1970 , Page(s): 989
    Save to Project icon | Request Permissions | PDF file iconPDF (304 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