By Topic

IEEE Transactions on Computers

Issue 4 • Date April 1979

Filter Results

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

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

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

    Publication Year: 1979, Page(s): 285
    Request permission for commercial reuse | PDF file iconPDF (1408 KB)
    Freely Available from IEEE
  • Preliminary Specification of Spline Curves

    Publication Year: 1979, Page(s):286 - 290
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1726 KB)

    An interpolation model in computer-aided geometric design must satisfy at least two conditions: 1) the model must yield a smooth design and 2) modifications to the model must have only a local effect. These constraints on the model usually yield a large number of parameters with which the designer must deaL In this paper we discuss a preprocessor which requires interpolation data as input and prod... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Assignment of Tasks in a Distributed Processor System with Limited Memory

    Publication Year: 1979, Page(s):291 - 299
    Cited by:  Papers (67)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2411 KB)

    A recently published algorithm shows how to assign modules to a two-processor computer system with distributed execution so as to minimize the total of execution costs and interprocessor communication costs. In this paper we consider the same problem except that one processor has limited memory capacity. Although this problem is NP-complete, techniques based on the Gomory–Hu tree from networ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "A Stable, Two-Multiplies-per-Cycle Algorithm for Digital Generation of Sinusoids in Real Time"

    Publication Year: 1979, Page(s): 300
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (169 KB)

    Recently, Silverston1has given an algorithm to produce sinusoids with only two multiplications per cycle. With a simple substitution the algorithm can be further changed to have only one multiplication per cycle. The stability of these recursive algorithms depends on the roundoff errors and it cannot be stated straightforward. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Global and Modular Two's Complement Cellular Array Multipliers

    Publication Year: 1979, Page(s):300 - 306
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1144 KB)

    Two new families of LSI iterative logic arrays are proposed to perform two's complement multiplication based on the Baugh–Wooley algorithm [2]. The global approach is faster and attractive for LSI but limited in size due to current monolithic and packaging technology. The modular approach is better suited to realizing arbitrarily large array multipliers at only slight decrease in speed. The ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Iterative Realization of Multivalued Logic Systems

    Publication Year: 1979, Page(s):306 - 310
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (811 KB)

    The realization of multivalued combinational functions and sequential machines by using arrays of one type of cells is considered. The algebra used for the multivalued logic system has two binary operations and a set of unary operations. Each of these operations is realized by a cellular array. The cells are combinational and implemented by using binary logic gates. The cells are also designed so ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the Minimization of the Width of the Control Memory of Microprogrammed Processors

    Publication Year: 1979, Page(s):310 - 316
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1279 KB)

    A branch and bound method to minimize the width of the control memory of microprogrammed processors is given. Although it is exponential in the worst case, it appears much more effective than previous enumerative solutions. Furthermore, it can lead quickly to near-optimal solutions representing "good engineering" reductions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Microcode Bit Optimization is NP-Complete

    Publication Year: 1979, Page(s):316 - 319
    Cited by:  Papers (19)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (905 KB)

    The general problem of formatting microinstructions so as to minimize the width of words in control memory is shown to be computationally difficult. Hence, we should not attempt to solve the general case, but concentrate on heuristics for reasonable subcases. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Symmetry, Automorphism, and Test

    Publication Year: 1979, Page(s):319 - 325
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1020 KB)

    This paper shows how network symmetries (or the graph-theory concept of automorphism) can be used to cluster faults into classes and thus simplify the process of finding a test set: tests for these automorphic classes are found by classical methods and then expanded using automorphisms to produce a test-set. The process does not seem more complex than the classical ones. Furthermore, by using a mu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Synthesis of Asynchronous Machines Using Mixed-Operation Mode

    Publication Year: 1979, Page(s):325 - 329
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1025 KB)

    In this correspondence, we have introduced the concept of mixed-operation mode (MOM) in asynchronous sequential machines. View full abstract»

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

    Publication Year: 1979, Page(s): 329
    Request permission for commercial reuse | PDF file iconPDF (97 KB)
    Freely Available from IEEE
  • if your computer engineering library doesn't subscribe to all 4 it's not complete.

    Publication Year: 1979, Page(s): 329
    Request permission for commercial reuse | PDF file iconPDF (1235 KB)
    Freely Available from IEEE
  • Advance Program Announcement

    Publication Year: 1979, Page(s): 329
    Request permission for commercial reuse | PDF file iconPDF (1257 KB)
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1979, Page(s): 329
    Request permission for commercial reuse | PDF file iconPDF (160 KB)
    Freely Available from IEEE
  • Call for Papers

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