Fast And Flexible Architectures For Rns Arithmetic Decoding
No Thumbnail Available
Authors
Elleithy, Khaled M.
Bayoumi, Magdy A.
Issue Date
1992-04
Type
Article
Language
Keywords
Residue number system , Chinese remainder theorem , Modulo adder , Carry-save adder , Residue decoding , Finite field algorithm , Appraisal
Alternative Title
Abstract
An implementation of a fast and flexible residue decoder for residue number system (RNS)-based architectures is proposed. The decoder is based on the Chinese Remainder Theorem (CRT). It decodes a set of residues to its equivalent representation in weighted binary number system. This decoder is flexible since the decoded data can be selected to be either unsigned magnitude or 2's complement binary number. Two different architectures are analyzed; the first one is based on using carry-save adders (CSA's), while the other is based on utilizing modulo adders (MA). The implementation of both architectures is modular and is based on simple cells, which leads to efficient VLSI realization. The proposed decoder is fast; it has a time complexity of O(log N ) ( N is the number of moduli).
Description
Citation
K. M. Elleithy, M. A. Bayoumi, "Fast And Flexible Architectures For Rns Arithmetic Decoding," IEEE Transactions on Circuits and Systems-II: Analog and Digital Signal Processing, vol. 39, no. 4, Apr. 1992.
Publisher
IEEE