IEEE Transactions on Computers

Issue 12 • Dec. 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 (444 KB)
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1975, Page(s): c2
    Request permission for commercial reuse | |PDF file iconPDF (214 KB)
    Freely Available from IEEE
  • Access and Alignment of Data in an Array Processor

    Publication Year: 1975, Page(s):1145 - 1155
    Cited by:  Papers (680)  |  Patents (81)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (3312 KB)

    This paper discusses the design of a primary memory system for an array processor which allows parallel, conflict-free access to various slices of data (e.g., rows, columns, diagonals, etc.), and subsequent alignment of these data for processing. Memory access requirements for an array processor are discussed in general terms and a set of common requirements are defined. The ability to meet these ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • System Fault Diagnosis: Masking, Exposure, and Diagnosability Without Repair

    Publication Year: 1975, Page(s):1155 - 1161
    Cited by:  Papers (32)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2608 KB)

    Diagnosability without fault repair of a digital system containing at most t faults is considered. A system-level diagnostic model defined in an earlier paper [1] is employed. The model is to an extent independent of the means used to implement diagnostic procedures, i.e., whether the tests are accomplished via hardware, software, or combinations thereof. Two parameters, the masking and exposure i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault Diagnosis in Combinational Tree Networks

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

    In this paper, which is a follow up to [8], we are concerned with the problem of generating minimal experiments to locate and diagnose faults in combinational tree networks. We establish lower bounds on the necessary number of fault-locating tests and show how, in a systematic way, such experiments can be obtained. Two types of testing procedures are considered—adaptive and preset. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Memories with Fast Random and Sequential Access

    Publication Year: 1975, Page(s):1167 - 1174
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (3600 KB)

    This paper treats two dynamic memories, one proposed by Aho and Ullman and the other proposed by Stone. The first memory has the property that every item is accessible in 0 (log2 N) steps, and that after access to the first two items of a block of contiguous items, each successive item can be accessed in unit time. In this paper we give a new derivation of the properties, and indicate minor variat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for Determining the Topological Dimensionality of Point Clusters

    Publication Year: 1975, Page(s):1175 - 1182
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2616 KB)

    The main thrust of this paper is to present a new algorithm for the analysis of structure in multivariate data point clusters from the standpoint of intrinsic (topological) dimensionality. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Method of Using Cluster Analysis to Study Statistical Dependence in Multivariate Data

    Publication Year: 1975, Page(s):1183 - 1191
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (2856 KB)

    A technique is presented that uses both cluster analysis and a Monte Carlo significance test of clusters to discover associations between variables in multidimensional data. The method is applied to an example of a noisy function in three-dimensional space, to a sample from a mixture of three bivariate normal distributions, and to the well-known Fisher's Iris data. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Group Averaged Linear Transforms that Detect Corners and Edges

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

    Linear transforms of the characteristic functions of plane figures are averaged over the one parameter continuous group of dilatations (homothetic scale changes) to obtain new dilatation-invariant transforms. For a large class of kernel functions, the group averaged transforms act as corner detectors or edge detectors. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Special-Purpose Computer for Digital Signal Processing

    Publication Year: 1975, Page(s):1202 - 1211
    Cited by:  Papers (13)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (3936 KB)

    This paper describes a special-purpose processor for use in performing various operations on sampled signals. The system is fast, flexible, and programmable for performing, in real time, operations such as fast Fourier transformation (FFT) and digital filtering of acoustically derived signals. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stochastic Syntax-Directed Translation Schemata for Correction of Errors in Context-Free Languages

    Publication Year: 1975, Page(s):1211 - 1216
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (3200 KB)

    A formal method of correcting errors of changed, deleted, and inserted terminals in the strings of a context-free language is considered. Grammars generating strings containing these errors are first constructed from a known grammar for the language; these new grammars are then used to specify simple syntax-directed translation schemata which can parse both correct strings and strings with errors ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Weighted Realizations of Switching Functions

    Publication Year: 1975, Page(s):1217 - 1221
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (920 KB)

    Any switching function has weighted representations, i.e., symmetric representations for which some of the arguments are repeated. We call a logic network based on such a representation a weighted realization. It is shown that a weighted realization may be implemented using a full-adder network (called a moment generator) whose outputs are fed to a multiplexer. A procedure is given to synthesize t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Generalization of Eklundh's Algorithm for Transposing Large Matrices

    Publication Year: 1975, Page(s):1221 - 1226
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (1072 KB)

    The purpose of this paper is to present an algorithm for transposing large rectangular matrices. This is basically a generalization of Eklundh's algorithm. Eklundh's method is designed to handle arrays in place of using powers-of-2 approach wherein partitions of the matrix have dimensions which are powers of 2. The algorithm presented here does not have this restriction. The choice of partitions i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On Overflow Detection and Correction in Digital Filters

    Publication Year: 1975, Page(s):1226 - 1228
    Cited by:  Papers (2)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (472 KB)

    A new method for correction of two's, complement adders characteristics at the output of the multiplier following the adders is proposed. It is very suitable to ordinary pipe-line implementation. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Picture Segmentation by Texture Discrimination

    Publication Year: 1975, Page(s):1228 - 1233
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (3056 KB)

    This correspondence describes a method of dividing a picture into differently textured regions by thresholding the values of a suitable local picture property. The approach used is a generalization to natural textures of a technique recently proposed by Tsuji. The examples given involve textures that differ in coarseness; a method of estimating texture coarseness by analysis of local property valu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Two's Complement Quasi-Serial Multiplier

    Publication Year: 1975, Page(s):1233 - 1235
    Cited by:  Papers (10)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (536 KB)

    This correspondence develops a multiplier for two's complement numbers, similar to the quasi-serial multiplier which operates on sign magnitude numbers. The method offers an alternative to add shift techniques for low cost two's complement multiplication. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems

    Publication Year: 1975, Page(s):1235 - 1238
    Cited by:  Papers (58)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (896 KB)

    The problem of scheduling tasks on a system of independent identical processors is discussed and the performance of a suboptimal method is evaluated. The computation is modeled by an acyclic directed graph G(T,<), where node set T represents the set of tasks to be completed and edge set < defines the precedence between tasks. The objective is to minimize the finishing time of the computation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Sign/Logarithm Number System

    Publication Year: 1975, Page(s):1238 - 1242
    Cited by:  Papers (153)  |  Patents (8)
    Request permission for commercial reuse | Click to expandAbstract |PDF file iconPDF (952 KB)

    A signed logarithmic number system, which is capable of representing negative as well as positive numbers is described. A number is represented in the sign/logarithm number system by a sign bit and the logarithm of the absolute value of the number (scaled to avoid negative logarithms). View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • 1975 Index IEEE Transactions on Computers Vol. C-24

    Publication Year: 1975, Page(s): 1242
    Request permission for commercial reuse | |PDF file iconPDF (3191 KB)
    Freely Available from IEEE
  • Computers the Next 5 Years

    Publication Year: 1975, Page(s):1242-m - 1242-n
    Request permission for commercial reuse | |PDF file iconPDF (264 KB)
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1975, Page(s): 1242-o
    Request permission for commercial reuse | |PDF file iconPDF (144 KB)
    Freely Available from IEEE
  • IEEE Computer Society Membership & Publications

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