Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Information Technologies and Control

The Journal of Institute of Information and Communication Technologies of Bulgarian Academy of Sciences

4 Issues per year

Open Access
Online
ISSN
1312-2622
See all formats and pricing
More options …

Investigation of the Indirect Hypercube as Natural Architecture for Parallel Algorithms of a Transpose Type for FFT and Other Fourier-Related Transforms

Ph. Philipov / V. Lazarov
Published Online: 2014-10-02 | DOI: https://doi.org/10.2478/itc-2013-0010

Abstract

The natural architectures are architectures, derived from the signal graph of the corresponding algorithm. That is why they are considered to be the most appropriate architectures for parallel realization of this algorithm. For Fast Fourier Transform algorithm (FFT) two types of natural architectures are known – the direct and the indirect hypercube. The direct hypercube has been investigated and analyzed a long time ago. The development of the concept of Indirect Hypercube, although quite old, is too difficult, controversal and still unfinished. Fast Hartley transform (FHT)/Real-valued Fast Fourier transform (RFFT) algorithms are important Fourier-related transforms, because they lower twice the operational and memory requirements when the input data is real-valued. These types of algorithms, however, have an irregular computational structure, which makes their parallel implementation a very difficult task. The aim of this paper is, based on the results achieved so far, to present further development of the concept Indirect Hypercube. A method of parametric synthesis of an indirect hypercube is described as a model of parallel FFT algorithms of a transpose type with different granularity/radix. This method is generalized for relevant RFFT/FHT and FCT algorithms. Two types of SIMD array architectures are described (radix-2 and radix-4), based on the indirect hypercube concept. These architectures are implemented as fast FFT/RFFT/FHT processors for real time applications. The performance estimation, as well as the estimation of resource utilization is carried out.

Keywords: Parallel FFT; parallel FHT; parallel real-valued FFT; parallel FCT; indirect hypercube; high-performance computer architectures

References

  • 1. [Hartley-1] Hartley, R. V. L. A More Symmetrical Fourier Analysis Applied to Transmission Problems. Proc. IRE 30, 1942, 144-150.Google Scholar

  • 2. [Danielson-1] Danielson, G. C. and C. Lanczos. Some Improvements in Practical Fourier Analysis and Their Application to X-ray Scattering From Liquids. J. Franklin Inst., 233, April 1942, 365-380, 435-452.Google Scholar

  • 3. [Cooley-1] Cooley, J. W., J. W. Tukey. “An Algorithm for the Machine Calculation of Complexes Fourier Series. – Math. Comput., 19, 1965, No. 90.CrossrefGoogle Scholar

  • 4. [Singleton-1] Singleton, C. A. Method for Computing the Fast Fourier Transform with Auxiliary Memory and Limited High-Speed Storage. – IEEE Transactions on Audio and Electroacoustics, AU-15, June 1967, 91-98.CrossrefGoogle Scholar

  • 5. [Bergland-1] Bergland, Glenn D. A Fast Fourier Transform Algorithm for Real-valued Series. – Communications of the ACM, 11, Oct. 1968, 10, 703-710.CrossrefGoogle Scholar

  • 6. [Stone-1] Stone, H. S. Parallel Processing with the Perfect Shuffle. – IEEE Trans. Computers, C-20, 1971, 153-161.Google Scholar

  • 7. [Ahmed-1] Ahmed, N., T. Natarajan and K. R. Rao. Discrete Cosine Transform. – IEEE Transactions on Computers, Jan. 1974, 90-93.Google Scholar

  • 8. [Pease-1] Pease, M. C. The Indirect Binary n-cube Microprocessor Array. – IEEE Trans. on Computers, May 1977.Google Scholar

  • 9. [Bracewell-1] Bracewell, R. N. Discrete Hartley Transform. – J. Opt. Soc. Am., 73, 1983, 12, 1832-1835.Google Scholar

  • 10. [Bracewell-2] Bracewell, R. N. The Fast Hartley Transform. – Proc. IEEE, 72, 1984, 8, 1010–1018.CrossrefGoogle Scholar

  • 11. [Ulman-1] Ulman, Ronald F. An Algorithm for Fast Hartley Transform. Technical Report, Stanford University, 1984.Google Scholar

  • 12. [Bhuyan-1] Bhuyan, L. Interconnection Networks for Parallel and Distributed Processing. – Computer, June 1987, 9-12.CrossrefGoogle Scholar

  • 13. [Sorensen-1] Sorensen, H. V., D. L. Jones, M. T. Heideman, C. S. Burrus. Real-valued Fast Fourier Transform Algorithms. – IEEE Trans. Acoust. Speech Sig. Processing, 35, 1987, 849–863.Google Scholar

  • 14. [Marchesi-1] Marchesi, M., G. Orlandi, F. Piazza. A Systolic Circuit for Fast Hartley Transform. IEEE International Symposium on Circuits and Systems, 7-9 June 1988, 2685-2688.Google Scholar

  • 15. [Rao-1] Rao, K., P. Yip. Discrete Cosine Transform: Algorithms, Advantages, Applications. Boston, Academic Press, ISBN 0-12-580203-X, 1990.Google Scholar

  • 16. [Zapata-1] Zapata, E. L., F. Arguello, F. F. Rivera, J. D. Bruguera. Multidimensional Fast Hartley Transform onto SIMD Hypercubes. – Microprocessing and Microprogramming, 29, September 1990, 2, 121-134.CrossrefGoogle Scholar

  • 17. [Chang-1] Chang, L.-W., S.-W. Lee. Systolic Arrays for the Discrete Hartley Transform. – IEEE Transactions on Signal Processing, 39, Nov. 1991, 11, 2411-2418.CrossrefGoogle Scholar

  • 18. [Zapata-2] Zapata, E. L., F. Arguello. A VLSI Constant Geometry Architecture for the Fast Hartley and Fourier Transforms. – IEEE Transactions on Parallel and Distributed Systems, 3, Jan. 1992, 1, 58-70.Google Scholar

  • 19. [Liu-1] Liu, K. J. R., C.-T. Chiu. Unified Parallel Lattice Structures for Time-recursive Discrete Cosine/Sine/Hartley Transforms. – IEEE Transactions on Signal Processing, Mar. 1993, 1357-1377.Google Scholar

  • 20. [Arguello-1] Arguello, F., J. D. Bruguera, R. Doallo, E. L. Zapata. Parallel Architecture for Fast Transforms with Trigonometric Kernel. – IEEE Transactions on Parallel and Distributed Systems, 5, Oct. 1994, 10, 1091–1099.Google Scholar

  • 21. [Uniyal-1] Uniyal, P. R. Transforming Real-valued Sequences: Fast Fourier Versus Fast Hartley Transform Algorithms. – IEEE Transactions on Signal Processing, 42, Nov. 1994, 11, 3249-3254.CrossrefGoogle Scholar

  • 22. [Mazzeo-1] Mazzeo, A. and U. Villano. Parallel 1D-FFT Computation on Constant-Valance Multicomputers. – Software – Practice and Experience, 25, June 1995, 6, 681-704.Google Scholar

  • 23. [Zhenyu Liu-1] Zhenyu, Liu, Yang Song, Takeshi Ikenaga, Satoshi Goto. A VLSI Array Processing Oriented Fast Fourier Transform Algorithm and Hardware Implementation. GLSVLSI'05, 17–19 April 2005, Chicago, Illinois, USA.Google Scholar

  • 24. [Jones-1] Jones, K. J. Design and Parallel Computation of Regularised Fast Hartley Transform. – Vision, Image and Signal Processing – IEEE Proceedings, 153, 9 Feb. 2006, 1, 70-78.Google Scholar

  • 25. [Phil-1] Philipov, Ph., V. Lazarov, Z. Zlatev, M. Ivanova. A Parallel Architecture for Radix-2 Fast Fourier Transform. IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing, Sofia, 2006, 229-234.Google Scholar

  • 26. [Phil-2] Philipov, Philip, Ilian Costov, Vladimir. Lazarov, Zlaty Zlatev, Milena Ivanova. Implementation of a Parallel Architecture for Radix-2 Fast Fourier Transform. – Information Technologies and Control, ISSN 1312–2622, 2008, No. 2, 12-16.Google Scholar

  • 27. [Phil-3] Philipov, Ph. Investigation of the Indirect Hypercube as a Natural Architecture for Realization of the Fast Fourier Transform Algorithm. PhD Thesis, Sofia, 2010.Google Scholar

About the article

Received: 2013-12-05

Published Online: 2014-10-02


Citation Information: Information Technologies and Control, Volume 11, Issue 2, Pages 29–44, ISSN (Online) 1312-2622, DOI: https://doi.org/10.2478/itc-2013-0010.

Export Citation

© 2013 Ph. Philipov and V. Lazarov. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License. BY-NC-ND 3.0

Comments (0)

Please log in or register to comment.
Log in