DocumentCode
940786
Title
Complex approximations using algebraic integers
Author
Games, Richard A.
Volume
31
Issue
5
fYear
1985
fDate
9/1/1985 12:00:00 AM
Firstpage
565
Lastpage
579
Abstract
The problem of approximating complex numbers by elements of
, the algebraic integers of
, where
is a primitive
th root of unity, is considered. The motivating application is to reduce the dynamic range requirements of residue number system implementations of the discrete Fourier transform. Smallest error tolerances for the case of eighth roots of unity are derived using a geometric argument. Scale factors involved are reduced from
to
for this case with roughly the same percentage errors. The case of sixteenth roots of unity gives even better range reductions and is considered only briefly.
, the algebraic integers of
, where
is a primitive
th root of unity, is considered. The motivating application is to reduce the dynamic range requirements of residue number system implementations of the discrete Fourier transform. Smallest error tolerances for the case of eighth roots of unity are derived using a geometric argument. Scale factors involved are reduced from
to
for this case with roughly the same percentage errors. The case of sixteenth roots of unity gives even better range reductions and is considered only briefly.Keywords
Approximation methods; DFT; Discrete Fourier transforms (DFT´s); Quantization; Residue arithmetic; Retrodirective antennas; Computer applications; Discrete Fourier transforms; Dynamic range; Fast Fourier transforms; Information theory; Quantization; Research and development;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1985.1057099
Filename
1057099
Link To Document