A fast and flexible residue decoder based on the Chinese remainder theorem
An implementation of a fast and flexible residue decoder based on the Chinese remainder theorem (CRT) is proposed for decoding a set of residues to its equivalent representation in a weighted binary number system. This decoder is flexible, since the decoded data can be selected to be either unsigned magnitude of two's complement binary number. It is shown that this residue decoder is extremely fast compared to previously proposed residue decoders.<<ETX>>