Notice
There is currently an issue with the citation download feature. Learn more

IEEE Transactions on Computers

Issue 9 • Sept. 1970

Filter Results

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

    Publication Year: 1970, Page(s):c1 - 877
    Request permission for commercial reuse | PDF file iconPDF (620 KB)
    Freely Available from IEEE
  • IEEE Computer Group

    Publication Year: 1970, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (187 KB)
    Freely Available from IEEE
  • Incremental Curve Generation

    Publication Year: 1970, Page(s):783 - 793
    Cited by:  Papers (57)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1431 KB)

    The process of converting a mathematically defined curve into unit steps along a fixed axis in digital technique is known as interpolation. The representation of the curve may be parametric or nonparametric. The parametric representation is widely used since it lends itself to realization by ordinary DDA technique. However, the nonparametric representation is shown to be fully competitive. In many... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Preprocessing High-Speed Memory System

    Publication Year: 1970, Page(s):793 - 802
    Cited by:  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2025 KB)

    The fastest parallel and pipeline computers presently being designed use interleaved memory systems with more than 16 individual memory units. A common difficulty in these machines is the alignment of data before it is arithmetically processed. Usually the arithmetic unit is used to preprocess the data. This may increase the computation time by a factor of two or more. This paper proposes a progra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Novel Rotate and Shift Circuit Using Bidirectional Gates

    Publication Year: 1970, Page(s):802 - 808
    Cited by:  Papers (1)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1159 KB)

    A bidirectional gate is described which would allow information contained in one register to be transferred to another register or vice versa. The rotate/shift functions may be implemented by gating the data between two flip-flop registers through the shifted or skewed gates connecting the two. The unique property of bidirectional transfer of data signals between two registers permits a simplified... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Serial Binary-to-Decimal and Decimal-to-Binary Conversion

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

    Over ten years ago, Couleur described a serial binary/ decimal conversion algorithm, the BIDEC method. This was a two-step process involving a shift followed by a parallel modification of the data being converted. With the integrated-circuit J-K flip-flop, the implementation of this two-step process requires an excessive amount of control logic. This paper presents a one-step conversion algorithm ... View full abstract»

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

    Publication Year: 1970, Page(s):812 - 817
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1224 KB)

    In this paper the principles which are involved in designing an equipment for producing sequences of pseudorandom pulses, non-Poisson-distributed, are discussed. Design criteria are given and applications are discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enumeration of Threshold Functions of Eight Variables

    Publication Year: 1970, Page(s):818 - 825
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1233 KB)

    The number of threshold functions of eight variables is counted by ILLIAC II, the computer of the University of Illinois. Sets of optimum weights of majority elements realizing these functions also are investigated. Actually, canonical positive self-dual threshold functions of nine variables are investigated instead of directly investigating threshold functions of eight variables because it is eas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Optimal Discriminant Plane

    Publication Year: 1970, Page(s):826 - 829
    Cited by:  Papers (36)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1544 KB)

    In solving pattern classification problems, many researchers have successfully used the Fisher linear discriminant as the optimal linear method for discriminating between vector samples from two classes. With the introduction of on-line, interactive, graphic systems, it has become conveniently possible to extend the discrimination logic to piecewise linear methods. This paper describes such a meth... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • State-Variable Techniques for Digital Simulation of Bandpass Systems

    Publication Year: 1970, Page(s):830 - 831
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (351 KB)

    This note discusses a technique for representing linear bandpass systems in terms of a state-variable formulation (first-order matrix differential equation) involving complex-valued envelope functions. In narrow-band cases this yields a model involving more slowly varying quantities, and thus, less computing time is required for a given simulation task. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interconnection of High-Speed Logic Circuits

    Publication Year: 1970, Page(s):831 - 837
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2120 KB)

    The design of present-day logic systems, using circuits with transition times approaching 1 ns, meets with problems unless the transmission lines are properly terminated. It is very inconvenient to match the input and output of a logic circuit to the characteristic impedance of a transmission line, even at the cost of considerable distortion. An alternative method is to use lines of less than 5-cm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bypass Switching for Cellular Cascades

    Publication Year: 1970, Page(s):837 - 839
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1756 KB)

    Faults can be circumvented in one-dimensional cellular arrays simply by switching out (bypassing) the defective cells in the cascade. In this note, the problem is solved of finding the minimal network of switches capable of bypassing up to q possibly defective cells from an n-celled array. The cells may be combinational or sequential, unilateral or bilateral, and may employ digital or continuous s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Buffer Length for Erlang Input and Constant Removal Rate

    Publication Year: 1970, Page(s):839 - 843
    Cited by:  Papers (16)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    The problem of the length of a buffer store required for an Erlang input rate where words are removed at regular intervals is discussed. Analytical expressions relating buffer length to the loss resulting from overflow are derived. Graphical results are presented for a range of Erlang distributions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sorting Implicit Outputs in Digital Simulation

    Publication Year: 1970, Page(s):844 - 847
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (776 KB)

    The Stein-Rose sorting algorithm for digital simulation is reexamined and reformulated in current terms. It is pointed out that the algorithm already contains within itself the means for the automatic detection of feedback loops (implicit outputs) in analog programs. The algorithm is then extended so that it can handle implicit outputs and the extended version is shown to be finite. Thus compilers... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fast Digital Computer Method for Recursive Estimation of the Mean

    Publication Year: 1970, Page(s):847 - 850
    Cited by:  Papers (8)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB)

    An improvement in a method for recursive estimation of the mean of a random variable is suggested. The proposed algorithm is faster than conventional "ideal" averaging and only slightly less efficient, i.e., the estimate variance is only slightly larger for the same sample size. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comment on "Computation of the Fast Walsh-Fourier Transform"

    Publication Year: 1970, Page(s):850 - 851
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (304 KB)

    The matrix form of the Walsh functions as defined in the above-mentioned short note [1] can be generated by the modulo-2 product of two generating matrices: the natural binary code, and the transpose of the bit-reversed form of the first. As a result, the coefficients of the Walsh transform occur in bit-reversed order. By simply reordering the Walsh functions themselves to correspond to generation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid Solution of Partial Differential Equations

    Publication Year: 1970, Page(s): 851
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (94 KB)

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Correction to "Pictorial Output with a Line Printer"1(415) 851

    Publication Year: 1970, Page(s):(210) Correction to "Pictorial Output with a Line Printer"<sup>1</sup> 851 - 851
    Request permission for commercial reuse | PDF file iconPDF (94 KB)
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contributors

    Publication Year: 1970, Page(s):852 - 853
    Request permission for commercial reuse | PDF file iconPDF (2596 KB)
    Freely Available from IEEE
  • B70-4 Theory of Scheduling

    Publication Year: 1970, Page(s):854 - 855
    Request permission for commercial reuse | PDF file iconPDF (552 KB)
    Freely Available from IEEE
  • B70-5 Theories of Abstract Automata

    Publication Year: 1970, Page(s):855 - 857
    Request permission for commercial reuse | PDF file iconPDF (896 KB)
    Freely Available from IEEE
  • R70-32 Tessellation Automata

    Publication Year: 1970, Page(s):857 - 858
    Request permission for commercial reuse | PDF file iconPDF (488 KB)
    Freely Available from IEEE
  • R70-33 Fuzzy Events Realized by Finite Probabilistic Automata

    Publication Year: 1970, Page(s): 858
    Request permission for commercial reuse | PDF file iconPDF (288 KB)
    Freely Available from IEEE
  • R70-34 Unateness Test of a Boolean Function and Two General Synthesis Methods Using Threshold Logic

    Publication Year: 1970, Page(s): 858
    Request permission for commercial reuse | PDF file iconPDF (288 KB)
    Freely Available from IEEE
  • R70-35 Classes of Automata and Transitive Closure

    Publication Year: 1970, Page(s):858 - 859
    Request permission for commercial reuse | PDF file iconPDF (512 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