Optimal table-lookup schemes for binary-to-residue and residue-to-binary conversions

Author

Parhami, Behraoz

Author_Institution

Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA, USA

fYear

1993

fDate

1-3 Nov 1993

Firstpage

812

Abstract

Alternate table-lookup schemes for conversion of binary to residue numbers, and vice versa, are presented. They are based on high-radix methods to minimize table size and to speed up the conversion process. Improved variants of VLSI-based pipelined binary-to-residue converters are derived along with balanced, highly regular, pipelined architectures for residue-to-binary conversion in VLSI

Keywords

VLSI; adders; data conversion; digital arithmetic; digital integrated circuits; minimisation; parallel algorithms; parallel architectures; pipeline arithmetic; residue number systems; table lookup; VLSI-based pipelined binary-to-residue converters; binary-to-residue conversions; high-radix methods; minimization; optimal table-lookup schemes; pipelined architectures; residue-to-binary conversions; Arithmetic; Delay; Digital signal processing; Latches; Parallel processing; Pipeline processing; Read only memory; Signal design; Signal processing algorithms; Table lookup; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems and Computers, 1993. 1993 Conference Record of The Twenty-Seventh Asilomar Conference on

Conference_Location

Pacific Grove, CA

ISSN

1058-6393

Print_ISBN

0-8186-4120-7

Type

conf

DOI

10.1109/ACSSC.1993.342634

Filename

342634