By Topic

IEEE Transactions on Computers

Issue 8 • Date Aug. 1975

Filter Results

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

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

    Publication Year: 1975, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (211 KB)
    Freely Available from IEEE
  • Multiplication Using Logarithms Implemented with Read-Only Memory

    Publication Year: 1975, Page(s):761 - 765
    Cited by:  Papers (31)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1736 KB)

    A method for designing the read-only memories (ROM's) needed for multiplication using logarithms is developed. By defining the word length of the multiplicand, multiplier, and product as n bits and the word length of -the rounded logarithms as m bits, design curves are given that allow various values of n and m to be selected for a given multiplier accuracy. Then a table is used to determine, whic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Universal Four-State Cellular Computer

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

    The design and development of a universal computer in a four-state, five-neighbor cellular model is presented. The underlying structure of the model is an infinite two-dimensional space divided into unit cells each of which can be in one of four states 0, 1, 2, and x. State 0 is the quiescent state, states 1 and 2 are mainly used for signaling, while state x is used for structure purposes. Cells c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple-Output Optimization with Mosaics of Boolean Functions

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

    An algorithmic procedure is presented which produces an optimal two-level multiple-output network. In agreement with procedures suggested by other authors, the set of given (incompletely specified) Boolean functions of variables xi is transformed into a single (mosaic) function f( y,x) by using additional variables yi, related to the structure of the resulting network. The agreement ends here, how... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Computer Architecture for Level Structured Systems

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

    The notion of level structured operating systems is receiving growing acceptance in the computing community. These systems are implemented and debugged incrementally, one level at a time. Each level provides a pseudo-machine interface upon which the next level can be implemented. Such systems offer significant advantages from the piont of view of debugging, reliability, understandability, and modi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple Fault Detection in Arrays of Combinational Cells

    Publication Year: 1975, Page(s):794 - 802
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2496 KB)

    The problem of detecting faults in arbitrarily large unilateral iterative arrays of combinational cells when any number of modules can be faulty and each module can fail in an arbitrary manner has been considered. A simple design criterion has been given which if incorporated makes the array easily diagnosable. Methods of deriving test sets for the modified arrays, which requires rather trivial co... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Measurement of Curvature in a Quantized Environment

    Publication Year: 1975, Page(s):803 - 820
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3992 KB)

    Some aspects of the application of the mathematical concept of curvature as a practical descriptor of shape for pattern recognition and image processing applications are investigated. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Easily Testable Sequential Machines with Extra Inputs

    Publication Year: 1975, Page(s):821 - 826
    Cited by:  Papers (33)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2064 KB)

    In this paper, an easily testable machine is defined as one which possesses: 1) a distinguishing sequence of length [log2 n] which forces the machine into a specific state S1, and 2) transfer sequences of length at most [1og2 n] to carry the machine from state S1 to state Si for all i. A design procedure is presented in which an arbitrary machine is augmented to an easily testable machine by addin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Convergence in Iteratively Formed Correlation Matrix Memories

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

    Correlation matrix memories are formed iteratively given a single cue-response pair at a time to be stored in an associative anner. If the cues presented are not orthogonal, the memory provides imperfect recollections after a single training exposure; however, if the cues are linearly independent, repetitions of the exposures can lead to ultimate perfect memorization and recollection ability. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Worst Case Bounds for Maximal Compatible Subsets

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

    An exact upper bound is found for the number of maximal compatible subsets of an n-state incompletely specified sequential machine (ISSM). This bound, on the order of 3n/3, iS also a worst case computer storage and computation time limit for any algorithm to find maximal compatibles. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The 16-Vector Algorithm for Computer Controlled Digital X-Y Plotter

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

    Digital X-Y plotters are peripheral devices of digital computer installations and are used for directly plotting out the results of computations. Digital X-Y plotters normally use an 8-vector algorithm for plotting. This paper describes a superior 16-vector algorithm for digital plotting. The algorithm is based on the fact that, from a given starting point, the recording pen may be driven along an... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal Fuzzy Partitions: A Heuristic for Estimating the Parameters in a Mixture of Normal Distributions

    Publication Year: 1975, Page(s):835 - 838
    Cited by:  Papers (99)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB)

    An algorithm is described for generating fuzzy partitions which extremize a fuzzy extension of the k-means squared-error criterion function on finite data sets X. It is shown how this algorithm may be applied to the problem of estimating the parameters (a priori probabilities, means, and covariances) of mixture of multivariate normal densities, given a finite sample X drawn from the mixture. The b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Discussion on Two Algorithms for Determining Maximum Compatibles

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

    The algorithm for determining the set of maximum compatibles of Sinha Roy and Sheng is compared with the more recent algorithm of Stoffers. A refinement of the former algorithm is given and a minor mistake in the latter is pointed out. View full abstract»

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

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

    In this correspondence uniform decomposition procedures are extended to incompletely specified sequential machines. Any given Moore sequential machine is realized by interconnecting copies of a universal two-state component machine. The information processed by each component machine is represented by its corresponding partial mapping. When the sequential machine is incompletely specified, a reduc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Calculation of the Piecewise Linear Approximation to a Discrete Function

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

    A repeated scanning algorithm for determining the minimax approximation to an arbitrary function by means of a piecewise linear function with a fixed number of variable knots is described, and it is compared to optimal and suboptimal methods. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Floating Point Representation of Complex Numbers

    Publication Year: 1975, Page(s):846 - 848
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    It is shown that arithmetic operations are simplified if complex numbers are represented in an integrated form with real and imaginary parts sharing the same exponent. In the new representation, numbers with large magnitudes suffer increased rounding errors but errors for some other numbers decrease. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scan and Display Considerations in Processing Images by Digital Computer

    Publication Year: 1975, Page(s):848 - 853
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2744 KB)

    An analysis of the effects of finite aperture sizes in the scan and display of images is presented. The scanning aperture results in degrading the sample spectrum; the display results in a failure of the Shannon–Whittaker reconstruction theorem. Both effects can be partially corrected for, so as to give an image that is less degraded by scan and display. An example of correction of an actual... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Delayed Universal Logic Modules and Sequential Machine Synthesis

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

    A universal logic module of n variables (ULM-n) can be considered as a 2n-in-1 multiplexer (inverse binary tree) whose code is determined by the presentation of external variables. This interpretation permits synthesis of sequential machines. Starting from the state transition map, any sequential machine can be realized by delayed ULM's and OR gates. The decomposition concept of Weiner and Hopcrof... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "On a New Class of Bounds on Bayes' Risk in Multihypothesis Pattern Recognition"

    Publication Year: 1975, Page(s):855 - 856
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    Recently, Devijver [1] has written an excellent paper on the Bayesian distance and its relation to various measures of distance and information found in the literature. 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): 856-a
    Request permission for commercial reuse | PDF file iconPDF (152 KB)
    Freely Available from IEEE
  • Does Easier Mean Better?

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