IEEE Transactions on Computers

A symbol permutation invariant balanced (SPI-balanced) code over the alphabet {\hbox{\rlap{Z}\kern 2.0pt{\hbox{Z}}}}_m=\{0,1,\ldots,m-1\} is a block code over {\hbox{\rlap{Z}\kern 2.0pt{\hbox{Z}}}}_m such that each alphabet symbol occurs as many times ...

Packet classification has been a critical data path function for many emerging networking applications. An interesting approach is the use of Ternary Content Addressable Memory (TCAM) to achieve deterministic, high-speed packet classification ...

To address the growing I/O bottleneck, next-generation distributed I/O architectures employ scalable point-to-point interconnects and minimize operating system overhead by providing user-level access to the I/O subsystem. Reduced I/O overhead allows I/O ...

Fast algorithms for multiplication in finite fields are required for several cryptographic applications, in particular for implementing elliptic curve operations over binary fields {\hbox{\rlap{I}\kern 2.0pt{\hbox{F}}}}_{2^m}. In this paper, we present ...

We consider scheduling problems in the master-slave model. In this model, each job has to be processed sequentially in three stages. In the first stage, a preprocessing task runs on a master machine, in the second stage, a slave task runs on a dedicated ...

In the current work, we propose a pipelining scheme for implementing Elliptic Curve Cryptosystems (ECC). The scalar multiplication is the dominant operation in ECC. It is computed by a series of point additions and doublings. The pipelining scheme is ...

The continuous scaling trends of interconnect wires in deep submicron (DSM) circuits result in increased interconnect delay and crosstalk noise. In this work, we develop a new postlayout gate sizing algorithm for simultaneous optimization of ...

As the complexity of 3D scenes is on the increase, the search for an effective visibility culling method has become one of the most important issues to be addressed in the design of 3D rendering processors. In this paper, we propose a new rasterization ...

Self-organization is critical for a distributed wireless sensor network due to the spontaneous and random deployment of a large number of sensor nodes over a remote area. Such a network is often characterized by its abilities to form an organizational ...

We show that the problem of routing messages in a wireless sensor network so as to maximize network lifetime is NP-hard. In our model, the online model, each message has to be routed without knowledge of future route requests. We also develop an online ...

High-accuracy branch prediction is crucial for high-performance processors. Inspired by the work on indexing functions to eliminate conflict-misses in memory hierarchy, this paper explores different indexing approaches to reduce conflict aliasing in ...

This paper presents a general approach for designing array and tree integer multipliers with overflow detection. The overflow detection techniques are based on an analysis of the magnitudes of the input operands. The overflow detection circuits operate ...

A correction to the classification of the space of n{\hbox{-}}{\rm variable} Boolean functions proposed in the paper cited in [1] is reported here and commented upon.