An algorithm for fast computation of the multiresolution discrete Fourier transform
Abstract
The article presents a computationally effective algorithm for calculating the multiresolution discrete Fourier transform (MrDFT). The algorithm is based on the idea of reducing the computational complexity which was introduced by Wen and Sandler [10] and utilizes the vectorization of calculating process at each stage of the considered transformation. This allows for the use of a computational process parallelization and results in a reduction of computation time. In the description of the computational procedure, which describes the algorithm, we use the matrix notation. This notation enables to represent adequately the space-time structures of the implemented computational process and directly map these structures into the constructions of a high-level programming language or into a hardware realization space.
- Publication:
-
arXiv e-prints
- Pub Date:
- July 2015
- DOI:
- 10.48550/arXiv.1507.02525
- arXiv:
- arXiv:1507.02525
- Bibcode:
- 2015arXiv150702525A
- Keywords:
-
- Computer Science - Data Structures and Algorithms;
- 15A23;
- 15A04;
- 65Y20;
- F.2.1;
- G.1.0;
- I.1.2
- E-Print:
- 8 pages, 2 figures