Abstract
In this paper, a general algorithm for the computation of the Fourier coefficients of 2π-periodic (continuous) functions is developed based on Dirichlet characters, Gauss sums and the generalized Möbius transform. It permits the direct extraction of the Fourier cosine and sine coefficients. Three special cases of our algorithm are presented. A VLSI architecture is presented and the error estimates are given.
Similar content being viewed by others
References
T M Apostol. Introduction to Analytic Number Theory, Springer-Verlag, New York, 1976.
V G Atlas, D G Atlas, E I Bovbel. 2-D arithmetic Fourier transform using the Bruns method, IEEE Trans Circuits Syst I Fund Theory Appl, 1997, 44: 546–551.
H Bruns. Grundlinien des Wissenschaftlichichnen Rechnens, Leipzig, 1903.
J Gao, H Liu. Generalized Möbius transform and arithmetic Fourier transform, Acta Math Appl Sin, 2004, 27: 530–535. (In Chinese)
X Ge, N Chen, Z Chen. Efficient algorithm for 2-D arithmetic Fourier transform, IEEE Trans Signal Process, 1997, 45: 2136–2140.
C Hsu, I S Reed, T K Truong. Inverse Z-transform by Möbius inversion and the error bounds of aliasing in sampling, IEEE Trans Signal Process, 1994, 42: 2823–2831.
B T Kelley, V K Madisetti. Efficient VLSI architectures for the arithmetic Fourier transform (AFT), IEEE Trans Signal Process, 1993, 41: 365–384.
L Knockaert. A generalized Möbius transform and arithmetic Fourier transform, IEEE Trans Signal Process, 1994, 42: 2967–2971.
L Knockaert. A generalized Möbius transform, arithmetic Fourier transforms and primitive roots, IEEE Trans Signal Process, 1996, 44: 1307–1310.
H Qian, P Li. 2-D arithmetic Fourier transform algorithm, In: Proc ICSP, 1996, 147–150.
I S Reed, D W Tufts, X Yu, T K Truong, M T Shih, X Yin. Fourier analysis and signal processing by use of Möbius inversion formula, IEEE Trans Acoust Speech Singal Process, 1990, 38: 458–470.
I S Reed, Y Y Choi, X Yu. Practical algorithm for computing the 2-D arithmetic Fourier transform, In: High Speed Computing II, Proc SPIE, 1989, 54–61.
I S Reed, M T Shih, E Hendon, T K Truong, D W Tufts. A VLSI architecture for simplified arithmetic Fourier transform algorithm, IEEE Trans Signal Process, 1992, 40: 1122–1133.
J L Schiff, T J Surendonk, W J Walker. An algorithm for computing the inverse Z-transform, IEEE Trans Signal Process, 1992, 40: 2194–2198.
D W Tufts, G Sadasiv. The arithmetic Fourier transform, IEEE ASSP Mag, 1988, January: 13–17.
D W Tufts, Z Fan, Z Cao. Image processing and the arithmetic Fourier transform, In: High Speed Computing II, Proc SPIE, 1989, 46–53.
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by National Natural Science Foundation of China (11201370), the Science and Technology Program of Shaanxi Province of China (2013JM1017, 2014JM1007, 2014KJXX-61), and the Natural Science Foundation of the Education Department of Shaanxi Province of China (2013JK0558).
Rights and permissions
About this article
Cite this article
Gao, J., Liu, Hn. Dirichlet characters, Gauss sums and arithmetic Fourier transforms. Appl. Math. J. Chin. Univ. 29, 307–316 (2014). https://doi.org/10.1007/s11766-014-2777-2
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11766-014-2777-2