e(logN) Architectures For RNS Arithmetic Decoding
No Thumbnail Available
Authors
Elleithy, Khaled M.
Bayoumi, Magdy A.
Lee, K. P.
Issue Date
1989-09-06
Type
Article
Language
Keywords
Computation theory , Computer science , Mathematics , Operation research
Alternative Title
Abstract
Decoding in Residue Number System (RNS) based architectures can be a bottleneck. A high speed and flexible modulo decoder is an essential computational element to maintain the advantages of RNS. In this paper, a fast and flexible modulo decoder, based on the Chinese Remainder Theorem (CRT) is presented. It decodes a set of residues into its equivalent representation in either unsigned magnitude or 2s complement binary number system. Two different architectures are analyzed; the first one is based on using Carry Save Adders(CSA), while, the other is based on utilizing a modified structure of Carry Save Adders(MCSA). Both architectures are modular and are based on simple cells, which leads to efficient VLSI implementation. The proposed decoder is fast, it has a time complexity of e( IogN).