To represent very large or small values, large range is required as the integer representation is no longer appropriate. These values can be represented using the IEEE754 standard based floating point representation. Floating point multiplication is a most widely used operation in DSP/Math processors, robots, air traffic controller, digital computers. Because of its vast areas of application, t...

In this paper, we present a single-pass technique to voxelize the interior of watertight 3D models with high resolution grids in realtime during a single rendering pass. Further, we develop a filtering algorithm to build a density estimate that allows the deduction of normals from the voxelized model. This is achieved via a dense packing of information using bitwise arithmetic. We demonstrate t...

In this paper, a reduced complexity structure for the Multipath Interference Canceller (MPIC) [1], is proposed. The structure is well suited for user equipments supporting High Speed Downlink Packet Access (HSDPA) standard. The reduced complexity structure is obtained by replacing the rootraised cosine for pulse shaping by a full raised cosine in the interference regeneration blocks. Indeed, th...

A 64-bit processor must necessarily implement substantial parallelism in the movement and processing of data. Data movement is inherently parallel at the bit level, and many operations implemented in the integer unit exhibit bit-level parallelism. A microvector is an array of small data items or bit elds packed into a single word. Scalar operations performed on a microvector can be used to impl...

In this paper a new, low power and high speed Bidirectional Shift Register (BSR) architecture is presented. It can be used for the design and the implementation of hard arithmetic operations. Reconfigurable computing, and cryptographic algorithms are two application examples where by using the new BSR their power and speed can be improved. Comparing to the conventional design, the proposed achi...

An efficient algorithm to determine the intersection status between arbitrarily oriented ellipsoids and boxes (OBBs) is presented. By choosing a proper representation of the geometric objects and by utilizing an affine transformation of space, the problem is converted into a corresponding sphere-parallelepiped intersection test. Thereby, the evaluation of more costly mathematical operations oth...

We present a coprocessor design for fast arithmetic over large numbers of cryptographic sizes. Our design provides a efficient way to prevent side channel analysis as well as fault analysis targeting modular arithmetic with large prime or composite numbers. These two countermeasure are then suitable both for Elliptic Curve Cryptography over prime fields or RSA using CRT or not. To do so, we use...