By Topic

IEEE Transactions on Computers

Issue 9 • Date Sept. 2005

Filter Results

Displaying Results 1 - 18 of 18
  • [Front cover]

    Publication Year: 2005, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (152 KB)
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2005, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (74 KB)
    Freely Available from IEEE
  • Average path length of binary decision diagrams

    Publication Year: 2005, Page(s):1041 - 1053
    Cited by:  Papers (25)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1040 KB) | HTML iconHTML

    The traditional problem in binary decision diagrams (BDDs) has been to minimize the number of nodes since this reduces the memory needed to store the BDD. Recently, a new problem has emerged: minimizing the average path length (APL). APL is a measure of the time needed to evaluate the function by applying a sequence of variable values. It is of special significance when BDDs are used in simulation... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New characterizations of 2D discrete cosine transform

    Publication Year: 2005, Page(s):1054 - 1060
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (272 KB) | HTML iconHTML

    We introduce a function to specify the transform coefficients. We state, prove, and apply useful rules. Our combination of two algorithms is unique. We describe an implementation for an 8×8 DCT that performs a total of 1,424 operations at a rate of 178 operations per clock cycle, which is approximately twice as fast as a unified algorithm on a serial-parallel architecture. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Low-complexity bit-parallel systolic Montgomery multipliers for special classes of GF(2/sup m/)

    Publication Year: 2005, Page(s):1061 - 1070
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (818 KB) | HTML iconHTML

    Recently, cryptographic applications based on finite fields have attracted much interest. This paper presents a transformation method to implement low-complexity Montgomery multipliers for all-one polynomials and trinomials. Using this method, we propose a new bit-parallel systolic architecture for computing multiplications over GF(2/sup m/). These new multipliers have a latency m+1 clock cycles a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New efficient MDS array codes for RAID. Part I. Reed-Solomon-like codes for tolerating three disk failures

    Publication Year: 2005, Page(s):1071 - 1080
    Cited by:  Papers (28)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    This paper presents a class of binary maximum distance separable (MDS) array codes for tolerating disk failures in redundant arrays of inexpensive disks (RAID) architecture based on circular permutation matrices. The size of the information part is m×n, the size of the parity-check part is m×3, and the minimum distance is 4, where n is the number of information disks, the number of par... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Maximum lifetime broadcasting in wireless networks

    Publication Year: 2005, Page(s):1081 - 1090
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1288 KB) | HTML iconHTML

    We consider the problem of broadcasting messages in a wireless energy-limited network so as to maximize network lifetime. An O(e log e) algorithm to construct a broadcast tree that maximizes the critical energy of the network following the broadcast is developed. Additionally, we propose two new greedy heuristics to construct minimum energy broadcast trees. We show how our maximum critical energy ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving unstructured peer-to-peer systems by adaptive connection establishment

    Publication Year: 2005, Page(s):1091 - 1103
    Cited by:  Papers (41)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1288 KB) | HTML iconHTML

    In unstructured peer-to-peer (P2P) systems, the mechanism of a peer randomly joining and leaving a P2P network causes a topology mismatch between the P2P logical overlay network and the physical underlying network, incurring a large volume of redundant traffic in the Internet. In order to alleviate the topology mismatch problem, we propose adaptive connection establishment (ACE), an algorithm for ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clustered worst-case execution-time calculation

    Publication Year: 2005, Page(s):1104 - 1122
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3360 KB) | HTML iconHTML

    Knowing the worst-case execution time (WCET) of a program is necessary when designing and verifying real-time systems. A correct WCET analysis method must take into account the possible program flow, such as loop iterations and function calls, as well as the timing effects of different hardware features, such as caches and pipelines. A critical part of WCET analysis is the calculation, which combi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy aware computing through probabilistic switching: a study of limits

    Publication Year: 2005, Page(s):1123 - 1137
    Cited by:  Papers (71)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (784 KB) | HTML iconHTML

    The main result in this paper establishes the energy savings derived by using probabilistic AND as well as NOT gates constructed from an idealized switch that produces a probabilistic bit (PBIT). A probabilistic switch produces the desired value as an output that is 0 or 1 with probability p, represented as a PBIT, and, hence, can produce the wrong output value with a probability of (1-p). In cont... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time/utility function decomposition techniques for utility accrual scheduling algorithms in real-time distributed systems

    Publication Year: 2005, Page(s):1138 - 1153
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1344 KB) | HTML iconHTML

    We consider Real-Time CORBA 1.2's distributable threads (DTs), whose time constraints are specified using time/utility functions (TUFs), operating in legacy environments. In legacy environments, system node resources - both physical and logical - are shared among time-critical DTs and local applications that may also be time-critical. Hence, DTs that are scheduled using their propagated TUFs, as m... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Testing from partial deterministic FSM specifications

    Publication Year: 2005, Page(s):1154 - 1165
    Cited by:  Papers (49)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (560 KB) | HTML iconHTML

    This paper addresses the problem of test generation from partially specified deterministic finite state machines (FSMs) that may have indistinguishable states and, thus, are not necessarily reduced (minimized). The known methods for checking experiments that are based on state identification are not applicable to unreduced machines. We propose the so-called state-counting approach that is directly... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Application of arithmetic coding to compression of VLSI test data

    Publication Year: 2005, Page(s):1166 - 1177
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1888 KB) | HTML iconHTML

    This paper proposes arithmetic coding for application to data compression for VLSI testing. The use of arithmetic codes results in a codeword whose length is close to the optimal value (as predicted by entropy in information theory), thus achieving a higher compression. Previous techniques (such as those based on Huffman or Golomb coding) result in optimal codes for data sets in which the probabil... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Out of order incremental CRC computation

    Publication Year: 2005, Page(s):1178 - 1181
    Cited by:  Papers (9)  |  Patents (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB) | HTML iconHTML

    We consider a communication protocol where the sender breaks a message, comprised of an information block and a corresponding CRC, into small segments and transmits these segments separately, possibly via different routes, to the receiver. Traditionally, reversing the sender operations, the receiver first assembles all the segments that make up the message, then computes a CRC based on the informa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Comments on "Distributed Bayesian algorithms for fault-tolerant event region detection in wireless sensor networks"

    Publication Year: 2005, Page(s):1182 - 1183
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    In this correspondence, several errors related to the distributed Bayesian algorithms for fault-tolerant event region detection in wireless sensor networks in (B. Krishnamachari et al., 2004) are spotted and corrected. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Call for Papers for Special Issue on Nano Systems and Computing

    Publication Year: 2005, Page(s): 1184
    Request permission for commercial reuse | PDF file iconPDF (69 KB) | HTML iconHTML
    Freely Available from IEEE
  • TC Information for authors

    Publication Year: 2005, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (74 KB)
    Freely Available from IEEE
  • [Back cover]

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