domains. The 2’s complement number system imposes a fundamental limitation on powerperformance efficiency as a result of sequential carry propagation. The Residue Number System (RNS) breaks this limitation by partitioning operations into parallel independent components resulting in fast and power

A burst-by-burst adaptive speech transceiver is proposed, which can drop its source coding rate and speech quality under transceiver control in order to invoke a more error resilient modem mode amongst less favourable channel conditions. The novel, high-quality, Adaptive Multi-Rate (AMR) speech codec [5], operated at bit rates of 4.75 and 10.2 kbps and combined with sourcesensitivity-matched

, the security of VoIP and data steganography through the protocol has been investigated. Finally, a technique for data steganography4 over this protocol will be proposed using the method of Residue Number System3. Also, using the combination of RNS, DNA sequences, and Huffman compressing algorithm, an algorithm

Sign determination is a fundamental problem in algebraic as well as geometric computing. It is the critical operation when using real algebraic numbers and exact geometric predicates. We propose an exact and efficient method that determines the sign of a multivariate polynomial expression

In this paper we explore the feasibility of implementing Residue Number System (RNS) based DSP algorithms on Lookup table based Field Programmable Gate Arrays (FPGAs). In this process, Binary Decision Diagrams are used for logic representation, and a new minimizing algorithm for incompletely

(n) processors, where n is the number of moduli in the RNS systems. Thus these conversions are the bottlenecks of the method, and any future improvements in RNS base conversions, or the use of particular residue systems, can immediately be applied.

, decreasing power consumption and error detection/correction are the major concerns of the KASUMI algorithm and its generation. On the other hand, Residue Number System is a non-weighted number system and it is currently considered as an important method for high-speed, low-power, parallel and carry

Abstract not found

this paper we present a modification to the QRNS, specifically oriented to computations with Eisenstein integers rather than Gaussian integers. Two main advantages accrue from this approach: first, using this RNS we have exact representations of the complex cubic roots of unity; second, it turns out that, in this case, we have a slightly larger dynamic range when the prime moduli are 5-bit integers

Abstract:- A special moduli set Residue Number System (RNS) of high dynamic range (DR) can speed up the execution of very large word-length repetitive multiplications found in applications like public key cryptography. The modulo 2