By Topic

IEEE Transactions on Computers

Issue 12 • Date Dec. 1974

Filter Results

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

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

    Publication Year: 1974, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (196 KB)
    Freely Available from IEEE
  • Editor's Notice

    Publication Year: 1974, Page(s): 1217
    Request permission for commercial reuse | PDF file iconPDF (1208 KB)
    Freely Available from IEEE
  • Structure Automata

    Publication Year: 1974, Page(s):1218 - 1227
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3368 KB)

    By modifying the acceptability conditions in finite automata, a new and equivalent variant—the "structure automaton"— is obtained. The collection SR(Σ) of sets of tapes on Σ definable by deterministic structure-automata forms, however, a proper subset of the collection of regular sets. The structure and closure properties of SR(Σ) are analyzed in detail, using a natural ... View full abstract»

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

    Publication Year: 1974, Page(s):1228 - 1237
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2608 KB)

    A combinational circuit realizing the switching function f(x) may be regarded as a solution verifier for the Boolean equation f(x) = 1. (*) The output of the circuit is 1, that is, if and only if the input-vector x is a solution for (*). We use the term "equational logic" to denote an approach to circuit synthesis based on (*) rather than on the function f(x). The central problem of equational log... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fan-In Constrained Tree Networks of Flexibe Cells

    Publication Year: 1974, Page(s):1238 - 1249
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2848 KB)

    This paper is concerned with the synthesis of irredundant tree networks with two-input single-output flexible cells. An algorithm is developed which tests whether a given Boolean function is tree realizable; if it is tree realizable, a best tree is generated which realizes the function. It is shown that for each realizable function there exists a nontrivial unique partition from which a best tree ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Message-Based Response Routing with Selcuk Networks

    Publication Year: 1974, Page(s):1250 - 1257
    Cited by:  Papers (1)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2568 KB)

    Computer-to-computer communication in a very large net, parallel processing, and content-based in retrieval associative memories all can be viewed in a broader context as the broadcast of a "to-whom-it-may-concern" type message and the subsequent routing of the response messages to the broadcast source. Simplicity and economies in logic and memory can be obtained if the routing does not require si... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Fortran Extension for Data Display

    Publication Year: 1974, Page(s):1257 - 1263
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3384 KB)

    This graphics extension uses a preprocessor which converts graphics commands into calls to a lower level graphics package. The preprocessor converts the source code containing the extended statements into a Fortran program. The objective is to generate contour plots or graphs with minimum effort by statements such as PLOT(U) or PLOT((X, Y)). In these cases, we are using the default options to spec... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Digital Straight Line Segments

    Publication Year: 1974, Page(s):1264 - 1269
    Cited by:  Papers (55)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2168 KB)

    It is shown that a digital arc S is the digitization of a straight line segment if and only if it has the "chord property:" the line segment joining any two points of S lies everywhere within distance 1 of S. This result is used to derive several regularity properties of digitizations of straight line segments. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Analytic Response Time Model For Single-and Dual-Density Disk Systems

    Publication Year: 1974, Page(s):1269 - 1276
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3576 KB)

    The question of replacing a single-density, two-channel, two-controller disk system with a cheaper, plug-compatible, dual-density, single-channel system having the same capacity is considered. An analytical model is explored to examine the effect of such a replacement on average response time, that is, the time between issuing an I/O request and completion of the request. Queueing theory is used t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Study of the Electrochemical Cell as a Storage Element for the Memory Access Gap

    Publication Year: 1974, Page(s):1277 - 1290
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (7496 KB)

    A memory device is proposed which is intended to fill the memory access gap, i.e., whose speed, cost, and capacity are intermediate between those of the electronic and electromechanical memories. Information is stored by electroplating metal on one or the other of two electrodes. The memory is random access and nonvolatile. Selection is by a coincident-voltage technique and stack operation is simi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Geometric Model for Stochastic Automata

    Publication Year: 1974, Page(s):1290 - 1299
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3760 KB)

    This paper is concerned with the problem of equivalence and dominance relations between sequential stochastic machines. We first introduce the transition output stochastic automaton together with the notion of pseudoautomaton. In Section III, we establish some fundamental properties concerning the rank of a stochastic automaton. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Serial Binary Division by Ten

    Publication Year: 1974, Page(s):1299 - 1301
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1504 KB)

    A technique is presented for dividing a positive binary integer by ten, in which the bits of the input are presented serially, low-order bit first. A complete division by ten is performed in two word times (comparable to the time needed for two serial additions). The technique can be useful in serial conversions from binary to decimal, or in scaling binary numbers by powers of 10. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Modular Arithmetic of Arbitrarily Long Sequences of Digits

    Publication Year: 1974, Page(s):1301 - 1303
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    Some fundamental results in the area of computability theory are presented. These include the fact that a finite state machine can find the residue of an arbitrarily long sequence using any modulus and any radix. This leads to the consideration of using modular arithmetic on arbitrarily long sequences with a finite state machine. A finite state machine can perform modular addition, subtraction, mu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cyclic and Dyadic Shifts, Walsh-Hadamard Transform, and the H Diagram

    Publication Year: 1974, Page(s):1303 - 1306
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    Cyclic and dyadic shifts of a periodic sequence are illustrated on the H diagram. Fast Walsh-Hadamard transform of the shifted (both cyclic and dyadic) sequence is represented graphically on the H diagram. The shift-invariant properties of the power spectrum are derived from these operations. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Self-Synchronized Asynchronous Sequential Machines

    Publication Year: 1974, Page(s):1306 - 1311
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1072 KB)

    In this correspondence, a new circuit structure is proposed which basically supresses the possibility of hazards and critical races in asynchronous sequential machines. In contrast to many approaches which try to solve these problems by changing the form of the automaton model, we suggest a more general "hardware" solution. This configuration provides performance extremely close to that of classic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On an Approximation of Mutual Information

    Publication Year: 1974, Page(s):1311 - 1313
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (616 KB)

    An approximation of mutual information which is often used for feature evaluation in pattern recognition is shown to be more closely related to Bayes error probability than mutual information is when equal a priori probabilities are assumed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithm for Minimal Polarized Polynomial Form Determination

    Publication Year: 1974, Page(s):1313 - 1315
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    Boolean difference when considering the polarized polynomial forms (AND–EXCLUSIVE OR forms in which each variable in all terms is complemented or uncomplemented) is used in this correspondence. Algorithms for determining quasi-minimnal and minimal polarized forms of the given functions are described. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Use of Residue Arithmetic for Computation

    Publication Year: 1974, Page(s):1315 - 1317
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB)

    Residue arithmetic offers the possibility of "carryfree" arithmetic as far as the operations of addition, subtraction, and multiplication are concerned. It is faster to implement these operations using residue arithmetic as compared to implementation using binary arithmetic. However, the process of algebraic sign detection is much slower in residue arithmetic and tends to offset the advantage of s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiple Match Resolvers: A New Design Method

    Publication Year: 1974, Page(s):1317 - 1320
    Cited by:  Papers (11)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    After a brief review of alternative techniques, this correspondence presents an approach to multiple-match resolver design which is significantly faster than ones which have hitherto been published. The approach involves the repeated use of a standard functional block to build resolver tree structures capable of generating addresses or logic vectors. Several example designs are shown to illustrate... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-Tolerant Carry-Save Adders

    Publication Year: 1974, Page(s):1320 - 1322
    Cited by:  Papers (2)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (800 KB)

    In this correspondence a design of fault-tolerant carry-save adders is presented. The design of fault-tolerant carry-save adders is of practical interest since in most of the modem day computers a carry-save adder is an essential circuit. We will also indicate how carry-save adders can be well used as a logic unit and thus some broader application of the design is illustrated. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Threshold Selection Technique

    Publication Year: 1974, Page(s):1322 - 1326
    Cited by:  Papers (32)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4048 KB)

    Threshold selection for picture segmentation is relatively easy when the frequency distribution of gray levels in the picture is strongly bimodal, with the two peaks comparable insize and separated by a deep valley. This report describes a method of handling cases in which the peaks are very unequal in size and the valley is broad. A Laplacian operation is applied to the picture to determine point... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Cause-Effect Analysis for Multiple Fault Detection in Combinational Networks"

    Publication Year: 1974, Page(s): 1326
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    Bosson and Hong1 have developed an effective procedure for multiple fault detection. However, their claim that their procedure gives near-minimal results is not necessarily the case. View full abstract»

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

    Publication Year: 1974, Page(s):1326 - 1327
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (464 KB)

    The comment is valid in that the authors followed the given algorithm G in footnote 1 to the letter to come to their conclusion. However, the spirit of the algorithm was somewhat misrepresented in the original paper. A clearer version for the algorithm G follows. The two additional tests claimed by the commentors do not arise if the following version is carried to the letter. And therefore our ori... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Parallel Processing Algorithms for the Optimal Control of Nonlinear Dynamic Systems"

    Publication Year: 1974, Page(s): 1327
    Request permission for commercial reuse | PDF file iconPDF (256 KB)
    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