Fourier Transforms on Finite Abelian Groups
D.R.G. Hulzebos
Abstract
D.R.G. Hulzebos
Abstract
In this research the Fourier transform on finite abelian groups is studied. To define this transform, characters are introduced. After the Fourier transform has been defined, an algorithm that will improve the computation time needed to do the Fourier transform is recalled. After this two applications of the Fourier transform will be discussed. In these applications the Fourier transform will be used to multiply huge integers in a faster way and to put watermarks on music.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this research the Fourier transform on finite abelian groups is studied. To define this transform, characters are introduced. After the Fourier transform has been defined, an algorithm that will improve the computation time needed to do the Fourier transform is recalled. After this two applications of the Fourier transform will be discussed. In these applications the Fourier transform will be used to multiply huge integers in a faster way and to put watermarks on music.
Key concepts: Fourier transform on finite groups, Fourier transform, Fractional Fourier transform, Discrete Fourier transform (general), Fourier inversion theorem, Hartley transform, Short-time Fourier transform, Non-uniform discrete Fourier transform