
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
November 1986 (vol. 35 no. 11)
pp. 10081012
ASCII Text  x  
T.K. Truong, J.J. Chang, I.S. Hsu, D.Y. Pei, I.S. ReeD, "Techniques for Computing the Discrete Fourier Transform Using the Quadratic Residue Fermat Number Systems," IEEE Transactions on Computers, vol. 35, no. 11, pp. 10081012, November, 1986.  
BibTex  x  
@article{ 10.1109/TC.1986.1676704, author = {T.K. Truong and J.J. Chang and I.S. Hsu and D.Y. Pei and I.S. ReeD}, title = {Techniques for Computing the Discrete Fourier Transform Using the Quadratic Residue Fermat Number Systems}, journal ={IEEE Transactions on Computers}, volume = {35}, number = {11}, issn = {00189340}, year = {1986}, pages = {10081012}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1986.1676704}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Techniques for Computing the Discrete Fourier Transform Using the Quadratic Residue Fermat Number Systems IS  11 SN  00189340 SP1008 EP1012 EPD  10081012 A1  T.K. Truong, A1  J.J. Chang, A1  I.S. Hsu, A1  D.Y. Pei, A1  I.S. ReeD, PY  1986 KW  VLSI KW  DFT KW  error analysis KW  Fermat number KW  systolic array VL  35 JA  IEEE Transactions on Computers ER   
In this correspondence, the complex integer multiplier and adder over the direct sum of two copies of finite field developed in [1] is specialized to the direct sum of the rings of integers modulo Fermat numbers. Such multiplication over the rings of integers modulo Fermat numbers can be performed by means of two integer multiplications, whereas the complex integer multiplication requires three integer multiplications. Such multiplications and additions can be used in the implementation of a discrete Fourier transform (DFT) of a sequence of complex numbers. The advantage of the present approach is that the number of multiplications needed to compute a systolic array of the DFT can be reduced substantially. The architectural designs using this approach are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation.
Index Terms:
VLSI, DFT, error analysis, Fermat number, systolic array
Citation:
T.K. Truong, J.J. Chang, I.S. Hsu, D.Y. Pei, I.S. ReeD, "Techniques for Computing the Discrete Fourier Transform Using the Quadratic Residue Fermat Number Systems," IEEE Transactions on Computers, vol. 35, no. 11, pp. 10081012, Nov. 1986, doi:10.1109/TC.1986.1676704
Usage of this product signifies your acceptance of the Terms of Use.