IEEE Transactions on Computers

Issue 3 • March 1977

Filter Results

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

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

    Publication Year: 1977, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (215 KB)
    Freely Available from IEEE
  • On Analog Computer Generation of Continuous Functions

    Publication Year: 1977, Page(s):193 - 195
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1823 KB)

    The generation of continuous functions by approximating them by solutions of linear constant-coefficient ordinary differential equations is discussed. The coefficients and initial conditions for these "differential approximations" can be found using "quasilinearization." An application to the problem of generating Bessel functions is described. View full abstract»

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

    Publication Year: 1977, Page(s):196 - 207
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3129 KB)

    A modular design strategy for the implementation of control logic is discussed. After discussing several basic control modules, the overall design of control sequencing is described and a particular control sequence taken from the Illiac III computer is worked as an example of the technique. Finally, the diagnostic features incorporated as part of the technique are discussed and a comparison made ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Error Detection in Digital Devices and Computer Programs with the Aid of Linear Recurrent Equations Over Finite Commutative Groups

    Publication Year: 1977, Page(s):208 - 218
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2645 KB)

    A method is proposed for error detection in digital devices and computer programs calculating the values of functions f(x), where x ∈ G and G is a finite commutative group. For the case of network implementation of the method, "errors" are catastrophic structural failures; for the case of program implementation, they are errors in the text of the program. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Bayesian Methods in Nonlinear Digital Image Restoration

    Publication Year: 1977, Page(s):219 - 229
    Cited by:  Papers (118)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5250 KB)

    Prior techniques in digital image restoration have assumed linear relations between the original blurred image intensity, the silver density recorded on film, and the film-grain noise. In this paper a model is used which explicitly includes nonlinear relations between intensity and film density, by use of the D-log E curve. Using Gaussian models for the image and noise statistics, a maximum a post... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple-Response Resolution in Associative Systems

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

    The selection of a single responding word out of several responses to an associative search is a major and frequent function of associative memories (AM's) and processors (AP's). To select a responder, an AM must be able to generate a signal that is one for the desired word and zero for all others. This paper describes two families of circuits for doing this. The first family, called the prelimina... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Understanding Shape: Angles and Sides

    Publication Year: 1977, Page(s):236 - 242
    Cited by:  Papers (97)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3324 KB)

    Methods of detecting the angles and sides of a simple closed curve are developed. These methods use approximations to the curve that have varying degrees of coarseness, and construct a hierarchy of angles and sides that describes the curve at any desired level of detail. The results can be used to obtain natural polygonal approximations to the curve. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Computer Resource Allocation Model with Some Measured and Simulation Results

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

    A need exists to predict computing system performance as a function of the system workload, resource architecture, and resource management policies. A model of multiprocessor, multiprogrammed virtual memory computing systems is described which can provide such predictions more economically than previous approaches. The model characterizes central processors, I/O devices, a memory hierarchy, perman... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Serial Integer Arithmetic with Magnetic Bubbles

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

    The logical operation of two-input bubble gates is described. All logical interactions use bubble repulsion to prevent bubbles from transferring to an adjacent path. This principle unifies the gate design and is intended to facilitate hardware development. The serial nature of bubble technology is used to best advantage with pipeline structures. Two-input gates are employed to produce relatively s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cross-Section Reconstruction with a Fan-Beam Scanning Geometry

    Publication Year: 1977, Page(s):264 - 268
    Cited by:  Papers (14)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2933 KB)

    A simple approach for cross-section reconstruction with a fan-beam scanning geometry is discussed. The scanner and the radiation beams are set up in such a way that the projection data can be rearranged and considered as if they were generated from the conventional parallel-beam configuration. The convolution algorithm is used for the cross-section reconstruction of synthetic patterns. Combarisons... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Recognition of Waveforms Using Autoregressive Feature Extraction

    Publication Year: 1977, Page(s):268 - 270
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (632 KB)

    It is proposed that the autoregressive coefficients (as computed from the estimated autocorrelation function) in an autoregressive spectral estimation scheme may be used for feature extraction purposes. An example is presented where such extractors are used to describe seismic wave traces originating from shallow earthquakes and underground nuclear explosions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comment on the Sequential and Indeterminate Behavior of an End-Around-Carry Adder

    Publication Year: 1977, Page(s):271 - 272
    Cited by:  Papers (18)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    The sequential and indeterminate behavior of an end-around-carry (EAC) adder is examined. This behavior is commonly overlooked in the literature. Design modifications to impose determinism are provided. These modifications also eliminate the troublesome negative zero found in the one's complement number system. View full abstract»

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

    Publication Year: 1977, Page(s):272 - 276
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3146 KB)

    A procedure is demonstrated for locating textural boundaries in the digital image representation of a natural scene. The technique involves development of an edge operator capable of integrating multiple textural features into a single boundary determination. The process is designed to simulate actual perception of textural discontinuities. Success of the system is demonstrated on pictures with pr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Shift Register Binary Rate Multipliers

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

    Novel implementations of a binary rate multiplier (BRM) circuit are described. These BRM's, which use the input data word to load patterns into shift registers, are capable of working at higher speed than a conventional circuit, and should be more suitable for silicon integration. Long input data words can be accommodated with a long shift register or by interconnecting several short registers. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-Synchronizing Circuits and Nonfundamental Mode Operation

    Publication Year: 1977, Page(s):278 - 281
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (783 KB)

    The self-synchronizing (SS) sequential circuits proposed by Chuang and Das, as well as by Rey and Vaucher are analyzed and compared. A variation of the latter system is proposed. It is shown that none of the above approaches can be used for unrestricted input change (UIC) operation. Procedures for synthesizing Huffman type asynchronous circuits suitable for UIC operation are improved. Data handlin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of Ternary COS/MOS Memory and Sequential Circuits

    Publication Year: 1977, Page(s):281 - 288
    Cited by:  Papers (27)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2182 KB)

    Ternary storage elements are realized using ternary operators and fundamental circuits, designed with the COS/MOS integrated circuits. Several ternary flip-flops (tri-flops) are constructed and described in detail: the PZN (set positive, set zero, and set negative), the clocked PZN, the D-type, and the T-type. Ternary shift registers and ring counter are formed by means of these tri-flops. A maste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Triangulation Method for the Sequential Mapping of Points from N-Space to Two-Space

    Publication Year: 1977, Page(s):288 - 292
    Cited by:  Papers (74)  |  Patents (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (832 KB)

    A method for the sequential mapping of points in a high-dimensional space onto a plane is presented. Whenever a new point is mapped, its distgnces to two points previously mapped are exactly preserved. On the resulting map, 2M -3 of the original distances can be exactly preserved. The mapping is based on the distances of a minimal spanning tree constructed from the points. All of the distances on ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Clocked Multivalued Flip-Flop

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

    A multivalued flip-flop is presented. The implementation of the flip-flop is independent of N (number of logic levels). The output of the flip-flop is stable during clock transitions. Techniques in the design of sequential circuits using this type of multivalued flip-flops are presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Problem of Finding d, t, r, and j Type Partition Pairs of a Sequential Machine

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

    This correspondence presents a new unified approach for defining and finding the various types of partition pairs ("d", "t","r","j") of a sequential machine. The notion of separation (distinguishability) of states is the key factor of the new approach. By this and the notion of transition sets one can easily find all maximal partitions τ which are in "d","t","r", and "j" relation with a given... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Corner-Finding Algorithm for Chain-Coded Curves

    Publication Year: 1977, Page(s):297 - 303
    Cited by:  Papers (300)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (909 KB)

    A method for detecting sharp "corners" in a chain-coded plane curve is described. A measure for the prominence ("cornerity") of a corner is introduced. The effectiveness of the method is illustrated by means of a number of examples. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Logic Circuit for Cycle Detection in a State Diagram

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

    A logic circuit is presented that detects cycles in an n-node state graph in o(n) basic operations. This compares favorably with software for cycle detection that requires 0(n2.8) operations and is, therefore, useful in situations where real-time detection is important. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some Results in Fixed-Point Fast Fourier Transform Error Analysis

    Publication Year: 1977, Page(s):305 - 308
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (607 KB)

    This correspondence presents some results in fixed-point error analysis of fast Fourier transform algorithms. Two kinds of schemes for preventing overflow are considered in the analysis. The results, obtained for the decimation-in-frequency form of the algorithm, are compared with those of decimation-in-time. The results show that the error performance of the decimation-in-frequency algorithm is b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for Sequency Ordering of Hadamard Functions

    Publication Year: 1977, Page(s):308 - 309
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (359 KB)

    A simple algorithm is developed for obtaining the sequency vector of high-order Hadamard transform matrices without the need for converting the order of individual Hadamard functions to sequency. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Little's Digital Filtering Algorithm

    Publication Year: 1977, Page(s): 309
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (213 KB)

    It is shown that Little's algorithm for high-speed digital filters can be applied to data represented in two's complement form. It is not necessary to use the more complex "biased" form or negative base representation. View full abstract»

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

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