IEEE Transactions on Computers

Issue 11 • Nov. 1976

Filter Results

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

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

    Publication Year: 1976, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (221 KB)
    Freely Available from IEEE
  • On the Design of Modulo Arithmetic Units Based on Cyclic Groups

    Publication Year: 1976, Page(s):1057 - 1067
    Cited by:  Papers (7)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2626 KB)

    Many of the modulo arithmetics can be considered as cyclic groups. A generalized method for implementing the cyclic groups is established based on a decomposed mapping approach. In order to obtain efficient implementation of cyclic groups, certain mapping relations and a proper binary encoding method are investigated. Furthermore, a new class of code, called the circulative code, is developed, and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Computational Complexity of a Generalized Scheduling Problem

    Publication Year: 1976, Page(s):1067 - 1073
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3443 KB)

    The parallel scheduling of a partially ordered set of tasks has received great attention. The partially ordered tasks can be viewed as components of a straight-line program. In this note, we discuss some aspects of the nonpreemptive parallel scheduling of a program with more general control structures. We examine the existence of optimal k-processor schedules, and in line with recent interest in t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Floating-Point Multiplexed DDA System

    Publication Year: 1976, Page(s):1074 - 1077
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1893 KB)

    The design of a high-speed, high-accuracy floating-point digital differential analyzer (DDA) system is described. The advantages of a floating-point system are expounded. It is shown that the problem of module interconnection can be alleviated using matrix methods, and a practical implementation of a multiplexed system with a semiconductor fast data storage area is described. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic Properties of Functions Affecting Optimum Fault-Tolerant Realizations

    Publication Year: 1976, Page(s):1078 - 1088
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2708 KB)

    When a specific type of network is required, the function to be realized limits the amount of fault tolerance that can be achieved. Parameters of functions that affect the maximum obtainable fault tolerance and the maximum obtainable diagnosability are investigated for several types of combinational memoryless) networks. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Real-Time Hardware System for Digital Processing of Wide-Band Video Images

    Publication Year: 1976, Page(s):1089 - 1100
    Cited by:  Papers (9)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (6161 KB)

    A high-fidelity video digitizer/processor extracts spatial and gray-scale information from high resolution dynamic video imagery. The 15-MHz bandwidth 60/s images(fields) are low pass filtered to minimize aliasing and digitized in real-time at 20 million samples pe second (MS/s), 9 bits/sample; sequential fields are transferred to memory, retrieved from memory after computer image processing, and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Programmable Dynamic Memory Allocation System for Input/Output of Digital Data into Standard Computer Memories at 40 Megasamples/s

    Publication Year: 1976, Page(s):1101 - 1109
    Cited by:  Papers (4)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2148 KB)

    A memory control unit is described, which, operating in conjunction with a special purpose digital computer, achieves real-time storage into and retrieval from computer memory of individual video images undergoing on-line digitization, processing, and reconstitution. The memory control unit is capable of rapid sequential access on up to six 16 K-word core and two 131 K-word (28-bit word) solid-sta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Nonparametric Learning Without a Teacher Based on Mode Estimation

    Publication Year: 1976, Page(s):1109 - 1117
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2596 KB)

    The present paper discusses a nonsupervised multicategory problem in terms of nonparametric learning. An algorithm for seeking modes of an unknown multidimensional probability density function (pdf) is considered by employing a hypercubic window function. The convergence proof of the algorithm is also presented. The discriminant function for multicategory problems is constructed by using the estim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Algorithm for Transformation of an Arbitrary Switching Function to a Completely Symmetric Function

    Publication Year: 1976, Page(s):1117 - 1123
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3468 KB)

    It is well known that any switching function may be transformed into a completely symmetric function when repetition of the input variables is allowed. We present an algorithm that may be applied to reduce the number of repeated variables when the transformation is performed. The method is based on an iterative construction of symmetric functions by admitting an increasing number of variables towa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Decomposition of Fuzzy Functions

    Publication Year: 1976, Page(s):1124 - 1130
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1412 KB)

    An algorithm for obtaining simple disjunctive decompositions of fuzzy functions is described. The insufficiency of Boolean methods for simplification of fuzzy functions is discussed. Special properties of the decomposed fuzzy structures are introduced and their relationships to two-valued logic are investigated. This new algorithm is the first one in a containing research in the area of multivalue... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Realization Algorithm for Multiple Preset Experiments

    Publication Year: 1976, Page(s):1130 - 1132
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (673 KB)

    An algorithm for the realization of an unknown maczine's flow table by preset multiple experiments is given. A method for coding the states of the unknown machine is used to expedite the construction of a partition matrix from which the flow table may be constructed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Some Comments Concerning Design of Pipeline Arithmetic Arrays

    Publication Year: 1976, Page(s):1132 - 1134
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (657 KB)

    Cellular arrays for arithmetic operations usually consist of identical cells connected in an iterative or near iterative pattern. By introducing latch circuits between the rows of the array, the entire unit can be pipelined. The effect of this modification is to increase the throughput on a continuous processing basis. In most of such designs, however, the amount of hardware required for a maximal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Suggestion for a Fast Binary Sine/Cosine Generator

    Publication Year: 1976, Page(s):1134 - 1136
    Cited by:  Papers (26)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (536 KB)

    A combinational two-dimensional array for the rapid generation of sines and cosines is described. The array is a spatial realization of a continued product algorithm which uses multiplication by (1 + jEk2-k). Using 10-ns logic, it is estimated that 16-bit sines and cosines may be generated in less than 2 μs. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Relationship Between Two Types of Two-Layer Threshold-Element Pattern-Recognition Networks

    Publication Year: 1976, Page(s):1136 - 1139
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (624 KB)

    The two-layer threshold-element networks with feed-forward connections can be classified into two types, according to whether the inputs are fed directly to the second layer (Type II) or not (Type I). It is shown that there always exists a Type I network (with an appropriate number of elements in the first layer) which realizes the same discriminant function as that of any given Type II network; f... View full abstract»

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

    Publication Year: 1976, Page(s):1139 - 1142
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB)

    Networks of two input-one output cells are described in which the cells are restricted to realize a subset of the 16 two-variable functions. The restriction, if appropriately chosen, will result in a network whose function set is the same as that of a network of identical structure in which each cell realizes all 16 functions. A restricted network is demonstrated which realizes exactly those funct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Unified Matrix Treatment of the Fast Walsh-Hadamard Transform

    Publication Year: 1976, Page(s):1142 - 1146
    Cited by:  Papers (51)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (839 KB)

    A unified matrix treatment is presented for the various orderings of the Walsh-Hadamard (WH) functions using a general framework. This approach clarifies the different definitions of the WH matrix, the various fast algorithms and the reorderings of the WH functions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implications of Charge-Coupled Devices for Pattern Recognition

    Publication Year: 1976, Page(s):1146 - 1152
    Cited by:  Papers (5)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1223 KB)

    The use of charge-coupled devices (CCD's) for pattern recognition applications is discussed. In particular, it is suggested that the new CCD technology may satisfy the large memory, fast processing speed, low cost, small size, and low power requirements which could make practical many pattern processing systems which until now have not been feasible. Specific implementations are suggested along wi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Three-Valued Simulation of Digital Systems

    Publication Year: 1976, Page(s):1152 - 1156
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (920 KB)

    The problem of the so-called "pessimistic" results, obtained by usingg three-valued (0,1,u) simulation for design verification of digital systems, is discussed. A complete three-valued model for the sequential portion of the digital systems is suggested. The conventional gate model is replaced by the new model, which reduces the problem considerably. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The J-K Gate

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

    For many years two-input NAND, AND, NOR, OR and EX-OR gates have been commercially available as cheap quad TTL integrated circuits (IC's). Ideas on quad programmable two-input gates (three inputs per gate) have been published in the literature but have not reached the commercial stage [1]. However, complicated and expensive arithmetic logic units (ALU's) programmable to perform 16 different functi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Simplified General Method for Static Hazard Detection

    Publication Year: 1976, Page(s):1160 - 1164
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (916 KB)

    A simplified binary technique is presented for dedecting hazards in combinational and sequential systems. First, a duo-binary representation is developed to derive the necessary and sufficient conditions for describing transient and steady-state behavior of switching systems. The results obtained by the duo-binary representation serve to prove that static hazards in switching circuits can be detec... View full abstract»

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

    Publication Year: 1976, Page(s):1164 - 1167
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (757 KB)

    Three algorithms are given to construct a weighted r-ary tree with a given set of integer weighted leaves in which the weight of a parent node is 1 + max of its sons. Two goals are of interest; to minimize 1) the weight of the root of the tree, and 2) the number of internal nodes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • System Diagnosis and Redundant Tests

    Publication Year: 1976, Page(s):1167 - 1170
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (810 KB)

    If the addition of a test does not improve the diagdosability of a system the test is called redundant. It is shown that if at least one test is nonredundant, then the previous algorithms to determine the diagnosability [2],[3] can be further improved. It is also shown how and when the diagnosability of a system can be improved by the addition of an extra test. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Locating Object Boundaries in Textured Environments

    Publication Year: 1976, Page(s):1170 - 1175
    Cited by:  Papers (30)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3442 KB)

    Detection of object boundaries is an important step in the analysis of an image. In the presence of a textured background, local edge operators generate many edges that do not correspond to the object boundaries. However, edges along the object boundaries link in elongated segments. An efficient algorithm to perform such linking is described and experimental results of a working program are presen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Choice of Smoothing Parameters for Parzen Estimators of Probability Density Functions

    Publication Year: 1976, Page(s):1175 - 1179
    Cited by:  Papers (150)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (864 KB)

    Parzen estimators are often used for nonparametric estimation of probability density functions. The smoothness of such an estimation is controlled by the smoothing parameter. A problem-dependent criterion for its value is proposed and illustrated by some examples. Especially in multimodal situations, this criterion led to good results. 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