A fast and flexible residue decoder based on the Chinese remainder theorem

Author

Lee, K.P. ; Bayoumi, M.A. ; Elleithy, K.M.

Author_Institution

Center for Adv. Comput. Studies, Southwestern Louisiana Univ., Lafayette, LA, USA

fYear

1989

Firstpage

200

Abstract

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

Keywords

decoding; digital arithmetic; Chinese remainder theorem; decoded data; equivalent representation; fast residue decoder; flexible residue decoder; two´s complement binary number; unsigned magnitude; weighted binary number system; Arithmetic; Cathode ray tubes; Decoding; Digital filters; Fast Fourier transforms; Filtering; Image processing; Signal processing; Table lookup;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1989., IEEE International Symposium on

Conference_Location

Portland, OR

Type

conf

DOI

10.1109/ISCAS.1989.100326

Filename

100326

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1615963