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 |
Year | DOI | Venue |
---|---|---|
1988 | 10.1109/ICASSP.1988.196867 | New York, NY |
Keywords | DocType | ISSN |
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,fourier transform,power generation | Conference | 1520-6149 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
pietro burrascano | 1 | 0 | 0.34 |
Gian-Carlo Cardarilli | 2 | 57 | 14.97 |
r lojacono | 3 | 0 | 0.34 |
g martinelli | 4 | 0 | 0.34 |
m salerno | 5 | 0 | 0.34 |