The peak-to-average power (PAPR) is one of the main challenges in multicarrier transmissions. Aiming at reducing the PAPR, we propose a residue number system (RNS)-based OFDM parallel transmission scheme. The key idea of the proposed scheme is to utilize the parallel property of RNS to convert the input signals into the parallel smaller residue signals while utilizing the characteristic of RNS ...

Logical candidates for residue number system (RNS) implementations are applications which require very high data rates and are numerically intensive. The quadratic residue number system (QRNS) is specifically designed for fast complex arithmetic. In a previous paper by Dubois and Venetsanopoulos the use of Eisenstein complex numbers was proposed for the implementation of a radix-3 fast Fourier ...

One of the biggest challenges confronting the bioinformatics community is fast and accurate sequence alignment. The Smith-Waterman algorithm (SWA) is one of the several algorithms used in addressing some of these challenges. Though very sensitive in doing sequence alignment, SWA is not used in real life applications due to the computational cost associated with the software implementation. Heur...

This thesis investigates architectures for high speed signal convolution using residue number system techniques. The focus is on VLSI implementations, a choice that gives two parameters by which judge different architectures: speed and hardware size. Although the focus is on the standard residue number system, the same concepts can be directly applied to quadratic residue number system architec...

This paper is focused on the crucial point of the use of Residue Number System (RNS) arithmetic in actual applications, i.e. the conversion from residue arithmetic to binary representation. Some of the most recent contributions in literature are considered and compared with the work developed by the authors on this conversion problem. It is shown that all the reviewed methods present particular...

The residue number system (RNS) has computational advantages for large integer arithmetic because of its parallel carry free, and high-speed arithmetic nature. However, magnitude comparison is a very complex operation for RNS. This paper presents a new comparison algorithm based on the modification of Mixed-Radix Conversion II technique. The new algorithm uses small modulo operations only and h...

Residue number system is popular in high performance arithmetic applications like digital signal processing because of its carry free nature, modularity and error correcting properties. But these opportunities are eclipsed by the high area and time requirements for reverse conversion. In this regard, we present two new techniques for residue-toweighted number system conversion. The first one is...

Residue number system (RNS) enables dimensionality reduction of an arithmetic problem by representing a large number as a set of smaller integers, where the number is decomposed by prime number factorization using the moduli as basic functions. These reduced problem sets can then be processed independently and in parallel, thus improving computational efficiency and speed. Here we show an optic...

Modular adder is one of the key components for the application of residue number system (RNS). Moduli set with the form of can offer excellent balance among the RNS channels for multi-channels RNS processing. In this paper, a novel algorithm and its VLSI implementation structure are proposed formodulo adder. In the proposed algorithm, parallel prefix operation and carry correction techniques ar...

In this paper, the design of a Finite Impulse Response (FIR) filter based on the residue number system (RNS) is presented. We chose to implement it in the (RNS), because the RNS offers high speed and low power dissipation. This architecture is based on the single RNS multiplier-accumulator (MAC) unit. The three moduli set 1 {2 ,2 ,2 1} n n n + − , which avoids 2 1 n + modulus, is used to design...