DocumentCode
3002644
Title
RNS Fourier transforms
Author
Burrascano, P. ; Cardarilli, G.C. ; Lojacono, R. ; Martinelli, G. ; Salerno, M.
Author_Institution
Univ. di Roma La Sapienza, Italy
fYear
1988
fDate
11-14 Apr 1988
Firstpage
1427
Abstract
A novel approach to the definition of the roots of unity in the RNS (residue number system) is presented. The definition is based on a suitable polar representation of the complex residues. The resulting RNS Fourier transform provides an algorithm for performing circular convolutions characterized by flexibility in terms of length, computational cost, and storage
Keywords
Fourier transforms; number theory; RNS Fourier transforms; algorithm; circular convolutions; complex residues; computational cost; length; polar representation; residue number system; roots of unity; storage; Adaptive filters; Computational efficiency; Discrete Fourier transforms; Discrete transforms; Equations; Fourier transforms; Power generation;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on
Conference_Location
New York, NY
ISSN
1520-6149
Type
conf
DOI
10.1109/ICASSP.1988.196867
Filename
196867
Link To Document