By Topic

IEEE Transactions on Computers

Issue 8 • Date Aug 1995

Filter Results

Displaying Results 1 - 14 of 14
  • A systematic methodology for the design of high performance recursive digital filters

    Publication Year: 1995, Page(s):971 - 982
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (980 KB)

    A systematic design methodology is described for the rapid derivation of VLSI architectures for implementing high performance recursive digital filters, particularly ones based on most significant digit (msd) first arithmetic. The method has been derived by undertaking theoretical investigations of msd first multiply-accumulate algorithms and by deriving important relationships governing the depen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A new design technique for column compression multipliers

    Publication Year: 1995, Page(s):962 - 970
    Cited by:  Papers (43)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (792 KB)

    In this paper, a new design technique for column-compression (CC) multipliers is presented. Constraints for column compression with full and half adders are analyzed and, under these constraints, considerable flexibility for implementation of the CC multiplier, including the allocation of adders, and choosing the length of the final fast adder, is exploited. Using the example of an 8×8 bit C... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multiple-valued Reed-Muller transform for incompletely specified functions

    Publication Year: 1995, Page(s):1012 - 1020
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (716 KB)

    This paper considers the Reed-Muller transform for incompletely specified multiple-valued logic functions, which is obtained as the finite field polynomial representation. A new algorithm for dealing with single-variable functions is presented. It is applicable to finite fields of small sizes (two to four), which is of interest because only these fields are readily implementable with today's MVL t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On TSC checkers for m-out-of-n codes

    Publication Year: 1995, Page(s):1055 - 1059
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB)

    Paschalis et al. (1988) have given a structured method to design TSC m-out-of-2m code checkers suitable for VLSI implementation. In this correspondence we give sufficient conditions so that the method previously given can be used to design checkers for classes of m-out-of-n codes with n≠2m View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of bipartite graphs for achieving race-free state assignments

    Publication Year: 1995, Page(s):1002 - 1011
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (912 KB)

    Achieving race-free state assignments is an important objective in the synthesis of asynchronous sequential logic circuits (ASLCs). Traditionally, adjacency diagrams are used to help identify and resolve race conditions; however, this approach has a high degree of computational complexity. This paper presents an efficient state assignment algorithm that utilizes a pattern matching technique to pre... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An O(log2 N) depth asymptotically nonblocking

    Publication Year: 1995, Page(s):1047 - 1051
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (428 KB)

    A self-routing multi-logN permutation network is presented and studied. This network has 3log2 N-2 depth and N(log2 γN)(3log2, N-2)/2 nodes, where N is the number of network inputs and γ a constant very close to 1. A parallel routing algorithm runs in 3log2N-2 time on this network. The overall system (network and algorithm) can wor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integer division in residue number systems

    Publication Year: 1995, Page(s):983 - 989
    Cited by:  Papers (13)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (456 KB)

    This contribution to the ongoing discussion of division algorithm for residue number systems (RNS) is based on Newton iteration for computing the reciprocal. An extended RNS with twice the number of moduli provides the range required for multiplication and scaling. Separation of the algorithm description from its RNS implementation achieves a high level of modularity, and makes the complexity anal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Lee distance and topological properties of k-ary n-cubes

    Publication Year: 1995, Page(s):1021 - 1030
    Cited by:  Papers (110)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (816 KB)

    In this paper, we consider various topological properties of a k-ary n-cube (Qnk) using Lee distance. We feel that Lee distance is a natural metric for defining and studying a Qnk. After defining a Qnk graph using Lee distance, we show how to find all disjoint paths between any two nodes. Given a sequence of radix k numbers, a funct... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A performance model of pipelined k-ary n-cubes

    Publication Year: 1995, Page(s):1059 - 1063
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (436 KB)

    Pipelined communication using virtual channels can realize low latency, high throughput, inter-processor communication. This paper presents an analytic performance model of pipelined communication in k-ary n cubes. The model contains elements intended to capture and study key performance issues. In addition to the modeling of throughput and latency, the following issues are addressed using this mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contention-free 2D-mesh cluster allocation in hypercubes

    Publication Year: 1995, Page(s):1051 - 1055
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (512 KB)

    Traditionally, each job in a hypercube multiprocessor is allocated with a subcube so that communication interference among jobs may be avoided. Although the hypercube is a powerful processor topology, the 2D mesh is a more popular application topology. This paper presents a 2D-mesh cluster allocation strategy for hypercubes. The proposed auxiliary free list processor allocation strategy can effici... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Householder CORDIC algorithms

    Publication Year: 1995, Page(s):990 - 1001
    Cited by:  Papers (29)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (940 KB)

    Matrix computations are often expressed in terms of plane rotations, which may be implemented using COordinate Rotation Digital Computer (CORDIC) arithmetic. As matrix sizes increase multiprocessor systems employing traditional CORDIC arithmetic, which operates on two-dimensional (2D) vectors, become unable to achieve sufficient speed. Speed may be increased by expressing the matrix computations i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Complete decomposition of stochastic Petri nets representing generalized service networks

    Publication Year: 1995, Page(s):1031 - 1046
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1260 KB)

    Complete decomposition is a new strategy for evaluating the performance of a network of generalized service centers, represented in the notation of Generalized Stochastic Petri Nets (GSPNs). Each service center can have arbitrary internal structure (including internal parallelism), but it must conserve tokens at the boundaries, and its inputs must be i/o-connected to its outputs. Routing between c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Montgomery inverse and its applications

    Publication Year: 1995, Page(s):1064 - 1065
    Cited by:  Papers (68)  |  Patents (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB)

    The Montgomery inverse of b module a is b-12n mod a, where n is the number of bits in a. The right-shifting binary algorithm for modular inversion is shown naturally to compute the new inverse in fewer operations than the ordinary modular inverse. The new inverse facilitates recent work by Koc on modular exponentiation and has other applications in cryptography View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum performance pipelines with switchable reservation tables

    Publication Year: 1995, Page(s):1066 - 1069
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (332 KB)

    We describe a new technique for achieving maximum performance in pipelines which allows task initiations to follow any arbitrary cycle provided that the average time between initiations is ⩽M, where M is the maximum number of reservations of any stage. This is not possible with the existing methods. The idea behind the proposed scheme is to allow different initiations to follow different reser... 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