This paper presents how to compute n-bit CRC checksums on FPGAs in parallel. For this task, a specialized logic minimization strategy is outlined. It achieves signiicantly better results than standard logic optimizers. For n 96, CRC designs with an n-bit I/O interface are poorly routable. However, for smaller I/O interfaces even a 128-bit CRC can be implemented.

STAR:DUST (‘St. Andrews RISC: Dataflow Using Sequential Threads’) is a processor design optimized for efficient execution of sequential threads while supporting plug-and-play construction of large multiprocessor systems. Besides satisfying the major RISC criteria (small instruction set, simple instruction format, load/store principle, pipelining), STAR:DUST employs a dataflow approach to commun...

For redundant manipulators, the inverse kinematics equations are typically solved by taking the pseudoinverse of the Jacobian, or by adding enough constraints to algebraically remove the redundancy. Many popular measures of redundancy also depend on computing the algebraic rank or determinant of the Jacobian. We present fast, parallelizable algorithms to dynamically update all the pseudo-invers...

Efficient algorithms for computing mixed volumes, via the computation of mixed cells, have been implemented in DEMiCs [18] and MixedVol-2.0 [13]. While the approaches in those two packages are somewhat different, they follow the same theme and are both highly serial. To fit the need for the parallel computing, a reformulation of the algorithms is inevitable. This article proposes a reformulatio...

Chen, R.-J. and Y.-S. Hou, Non-associative parallel prefix computation, Information Processing Letters 44 (1992) 91-94. Associativity of a binary operation allows many applications that are not possible with a non-associative binary operation. We propose a method to transform a binary expression into an associative one and present two related applications.