Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Computers, IEEE Transactions on

Issue 10 • Date Oct. 1975

Filter Results

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

    Publication Year: 1975 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (554 KB)  
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1975 , Page(s): c2
    Save to Project icon | Request Permissions | PDF file iconPDF (213 KB)  
    Freely Available from IEEE
  • A Simple Hardware Buddy System Memory Allocator

    Publication Year: 1975 , Page(s): 953 - 957
    Cited by:  Papers (5)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1704 KB)  

    The design of a simple hardware memory allocator is described, which allocates blocks of different lengths L = 2h = K, K-1,..., K-n in a memory according to the buddy system algorithm. The binary tree, representing the distribution of free and used blocks in memory is mapped into a set of shift registers. They are connected for end-around shifting and clocked with frequencies different for each register, preserving thereby the internal structure of the binary tree. A small counter, attached to each shift register in the set holds the address of the first free block and can be read out on request within 0.5 μs. A simple control unit realizes the algorithm. Having answered a request the system needs about 130 μs to compute the addresses of free blocks in a total of 511 blocks managed by the device. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hybrid Computer Methods for Direct Functional Optimization

    Publication Year: 1975 , Page(s): 958 - 965
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (2520 KB)  

    Control and trajectory optimization involves the minimization of a performance index (PI) of integral form where some optimal control law exists in a dynamic system. In this paper, a hybrid minicomputer with an adaptive random-search algorithm implements an iterative search for the optimal control. The search assumes that some initial control is randomly perturbed and a fast analog computer generates respective PI from the analog response of the dynamic system. An improved PI informs the digital computer to utilize the perturbed control as a basis for the next iteration; otherwise a new perturbation replaces the old perturbation in the next iteration. The search terminates when no further improvements occur. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computer Analysis of Moving Polygonal Images

    Publication Year: 1975 , Page(s): 966 - 976
    Cited by:  Papers (28)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (3112 KB)  

    A general mathematical model is developed as an idealization of the problem of determining cloud motions from satellite pictures. The model consists of superimposed planes of rigid moving polygons. The problem is to determine from a sequence of scenes the linear and angular velocities of the figures, and to decompose the scene into its component figures. Study of the model reveals a number of fundamental relations that form the basis for an analysis program. In particular, a systematic anaylsis is given of the topological changes that can occur when overlapping figures move together or apart. A computer program based on these results is described, and experimental results are presented. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Equivalence of Two Algorithms for Finding All Maximal Compatibles

    Publication Year: 1975 , Page(s): 977 - 979
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (640 KB)  

    This correspondence provides an extended version of the algebraic method using Boolean algebra for deriving all maximal compatibles. It then shows that the algorithm based on the reduction of the edge-inclusion table, with respect to a given incompatibility graph for finding all maximal compatibles, is equivalent to the extended version just mentioned, and that the latter is much simpler. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Approach to Unsupervised Learning Classification

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

    In this correspondence, an approach to unsupervised pattern classifiers is discussed. The classifiers discussed here have the ability of obtaining the consistent estimates of unknown statistics of input patterns without knowing the a priori probability of each category's occurrence where the input patterns are of a mixture distribution. An analysis is made about their asymptotic behavior in order to show that the classifiers converge to the Bayes' minmum error classifier. Also, some results of a computer simulation on learning processes are shown. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Generating a Line "Parallel" to a Digital Line-A Sequential Approach

    Publication Year: 1975 , Page(s): 983 - 988
    Cited by:  Patents (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (840 KB)  

    This correspondence describes a sequential algorithm which generates the chain coded description of a line "parallel" to and at a fixed distance from another digital line. A few examples are presented along with a comparison with a parallel approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Note on Automatic Detection of Texture Gradients

    Publication Year: 1975 , Page(s): 988 - 991
    Cited by:  Papers (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (664 KB)  

    The rate and direction of maximum change of texture coarseness across a surface are important cues to the orientation of the surface relative to the observer. This note describes a simple method of automatically detecting these "texture gradients." View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Periodic Equivalents of Finite Automata

    Publication Year: 1975 , Page(s): 991 - 994
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (928 KB)  

    This correspondence deals with the problem of finding periodic equivalents of finite automata, The idea of periodic equivalent is a generalization of the concept of strictly periodic equivalent studied in [4]. In this correspondence some essential properties of periodic equivalents of finite automata are investigated. Further-more, the concept of strong kernel of automaton is introduced and some connections of strong kernels with periodic equivalents are presented. Finally, the algorithm for determining minimal periodic equivalents of automata is given. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault Detecting Test Sets for Reed-Muller Canonic Networks

    Publication Year: 1975 , Page(s): 995 - 998
    Cited by:  Papers (33)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (720 KB)  

    Fault detecting test sets to detect multiple stuck-at-faults (s-a-faults) in certain networks, realizing Reed-Muller(RM) canonic expressions called RM canonic (RMC) networks, are given. It is shown that to detect t faults, t ≥ 1, in a network realizing an arbitrary n-variable logic function only tests need be applied ([x] is the integer part of x) and that these tests are independent of the function being realized. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Arithmetic Algorithms in a Negative Base

    Publication Year: 1975 , Page(s): 998 - 1000
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (552 KB)  

    Algorithms are described for the basic arithmetic operations in a negative base. These algorithms are simpler, faster, and more general than those proposed by Sankar et al. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for Finding Nearest Neighbors

    Publication Year: 1975 , Page(s): 1000 - 1006
    Cited by:  Papers (45)  |  Patents (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1240 KB)  

    An algorithm that finds the k nearest neighbors of a point, from a sample of size N in a d-dimensional space, with an expected number of distance calculations is described, its properties examined, and the validity of the estimate verified with simulated data. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Detection of Step Edges in Noisy One-Dimensional Data

    Publication Year: 1975 , Page(s): 1006 - 1010
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (624 KB)  

    A method of detecting step edges in noisy one-dimensional input data is described. The method involves examination of differences in average gray level over ranges of positions and sizes. Unlike previously described methods, it remains reliable when edges occur close to one another. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Efficiency of Universal Machines

    Publication Year: 1975 , Page(s): 1010 - 1012
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (640 KB)  

    The complexity of the universal programs is compared with the complexity of the programs being simulated. The results suggest that the efficiency of the universal machines depends heavily on the programs being simulated. All the results are machine-independent and they are derived based on the recursion theorem. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Probabilistic Approach of Designing More Reliable Logic Gates with Asymmetric Input Faults

    Publication Year: 1975 , Page(s): 1012 - 1014
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (536 KB)  

    Logic gates subject to asymmetric input faults may be made more reliable by employing redundant inputs. A mathematical expression for determining the optimum number of redundant inputs based on input reliabilities of the gate is developed. The development follows the theory of combinatorial probability. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Proof of the Modified Booth's Algorithm for Multiplication

    Publication Year: 1975 , Page(s): 1014 - 1015
    Cited by:  Papers (65)  |  Patents (6)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (456 KB)  

    A simplified proof of a modification of Booth's multiplication algorithm by MacSorley to a form which examines three multiplier bits at a time is presented. In comparison with the original Booth's algorithm, which examines two bits at a time, the modified algorithm requires half the nutmber of iterations at the cost of somewhat increased complexity for each iteration. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Method of Formulating a Minimum Edge Set

    Publication Year: 1975 , Page(s): 1015 - 1018
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (880 KB)  

    Mayeda and Ramamoorthy have reduced the problem of finding a minimum number of test points which detect an improperly operating functional element of a single entry-single exit (SEC) system graph, to the problem of finding a minimum number of edges under which this system graph is 1 distinguishable. This correspondence shows that the determilnation of the minimum edge set is equivalent to the determination of a minimum covering of a certain matrix M (S) of zeros and ones. A way of finding the matrix M (S) is proposed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On a Simple Postcorrection for Nonrestoring Division

    Publication Year: 1975 , Page(s): 1019 - 1020
    Cited by:  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (328 KB)  

    This correspondence points out that the usual terminal correction for nonrestoring division can always be made in such a way as to permit concatenation of the primary and secondary quotients to form a double precision answer. This eliminates the necessity of any separate postcorrection as suggested in [1] and [2]. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis and Comparison of Two's Complement Parallel Multipliers

    Publication Year: 1975 , Page(s): 1020 - 1027
    Cited by:  Papers (10)  |  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1104 KB)  

    A machine word mathematical formulation is applied to analysis and synthesis of circuits for signed binary number multiplication. The circuits are related to each other and to contemporary circuit algorithms in the course of the syntheses and in a comparative discussion. Circuits with complemented multiplier/multiplicand (M̄) or complemented partial product word (P̄) corrections offer advantages in circuit symmetry and algorithmic structure. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Serial Interfaces for Minicomputers

    Publication Year: 1975 , Page(s): 1027 - 1028
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (480 KB)  

    A standard serial interfacing scheme is described. It is appropriate for the interfacing of a variety of peripherals to minicomputers, as well as for the interconnection of two or more minicomputers. The use of this serial interface simplifies the problem of compatibility of communications between computers and peripherals with different word lengths. It is quite easy for computers with different word lengths to communicate with each other without modifications of any hardware. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Theorem on the Cyclic Correlations of Walsh Functions

    Publication Year: 1975 , Page(s): 1028 - 1029
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (448 KB)  

    It is shown that the cyclic correlation between two Walsh functions is identically zero except if they have equal "Contradegrees." View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Method for Reducing the Number of Input Variables to Synchronous Sequential Circuits

    Publication Year: 1975 , Page(s): 1029 - 1031
    Save to Project icon | Request Permissions | PDF file iconPDF (552 KB)  
    Freely Available from IEEE
  • Characterization of Binary Patterns and Their Projections

    Publication Year: 1975 , Page(s): 1032 - 1035
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (768 KB)  

    Algorithms for reconstruction of a two-dimensional binary pattern Z from its row-projection vector A and column-projection vector B have been developed by Chang. The projection set (A,B) is said to be unique, nonunique, or inconsistent if it determines one binary pattern, more than one binary pattern, or no binary pattern. A binary patern Z is said to be ambiguous if there exists another pattern with the same projections, otherwise it is unambiguous. Two characterization questions of binary patterns and their projections are posed. First, given Z what is the necessary and sufficient condition for Z to be ambiguous, or unambiguous? Second, given (A,B), what is the necessary and sufficient condition for (A,B) to be unique, nonunique, or inconsistent? These two combinational questions are discussed and efficient algorithms to answer them are derived from some ideas of Ryser. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Voltage to Frequency Converter

    Publication Year: 1975 , Page(s): 1035 - 1036
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (336 KB)  

    The technique for improving the linearity between the input voltage and the frequency of oscillation is described. This improvement is accomplished by adding a control circuit to Concentional voltage-to-frequency converters. From the experimental results, the linearity of this converter was about 0.15 percent at the frequency of 1 MHz. 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