Bit-Parallel Systolic Multipliers for GF(2m) Fields Defined by All-One and Equally Spaced Polynomials
Two operations, the cyclic shifting and the inner product, are defined by the properties of irreducible all one polynomials. An effective algorithm is proposed for computing multiplications over a class of fields $GF(2^m)$ using the two operations. Then,...
A Fast Algorithm for Multiplicative Inversion in GF(2m) Using Normal Basis
A fast algorithm for multiplicative inversion in $GF(2^m)$ using normal basis is proposed. It is an improvement on those proposed by Itoh and Tsujii and by Chang et al., which are based on Fermat's Theorem and require $O(\log m)$ multiplications. The ...
Bound Computation of Dependability and Performance Measures
We propose a new method to obtain bounds of dependability, performance or performability measures concerning complex systems modeled by a large Markov model. It extends previously published techniques mainly designed to the analysis of dependability ...
Synchronous Bandwidth Allocation for Real-Time Communications with the Timed-Token MAC Protocol
One of the key issues in tailoring the timed-token MAC protocol for real-time applications is synchronous bandwidth allocation (SBA), whose objective is to meet both the protocol and deadline constraints. The former constraint requires that the total ...
Symbolic Analysis of Bounded Petri Nets
This work presents a symbolic approach for the analysis of bounded Petri nets. The structure and behavior of the Petri net is symbolically modeled by using Boolean functions, thus reducing reasoning about Petri nets to Boolean calculation. The set of ...
Semiconcurrent Error Detection in Data Paths
A high-level synthesis strategy is proposed for design of semiconcurrently self-checking devices. Attention is mainly focused on data path design. After identifying the reference architecture against which cost and performance are evaluated, a ...
Design and evaluation of the Fibonacci optical ATM switch
An ATM switch architecture that uses optical delay fibers as buffers is presented. Based on the remarkable properties of the Fibonacci numbers, the architecture requires few fibers and yields low cell loss rates and latencies across diverse time-...
Uniprocessor Virtual Memory without TLBs
We present a feasibility study for performing virtual address translation without specialized translation hardware. Removing address translation hardware and instead managing address translation in software has the potential to make the processor design ...
An Optimal Fault-Tolerant Routing Algorithm for Double-Loop Networks
A weighted double-loop network can be modeled by a directed graph $G(n;h_1,h_2;w_1,w_2)$ with vertex set $Z_n=\{0,1,\ldots,n-1\}$ and edge set $E=E_1\cup E_2$, where $E_1=\{(u,u+h_1)\;|\; u\in Z_n\}$, $E_2=\{(u,u+h_2)\;|\; u\in Z_n\}$. Assume that the ...
Push-Based Information Delivery in Two Stage Satellite-Terrestrial Wireless Systems
One of the prominent objectives of National/Global Information Infrastructure is to provide all types of users global access to information. Satellite broadcast data delivery has inherent advantages, such as scalability and location independent ...
Parallel Matrix Multiplication on a Linear Array with a Reconfigurable Pipelined Bus System
The known fast sequential algorithms for multiplying two $N\times N$ matrices (over an arbitrary ring) have time complexity $O(N^\alpha)$, where $2 < \alpha < 3$. The current best value of $\alpha$ is less than 2.3755. We show that, for all $1 \le p \le ...
Comment on 'On-Line Scheduling Policies for a Class of IRIS Real-Time Tasks'
Scheduling policies for real-time tasks which receive rewards that depend on the amount of service received were presented by Dey et al. The policies utilized heuristic approaches to maximize the total accrued reward. In this comment, we propose an ...
