Fast Fourier Transform on Hexagons

Huiyuan Li () and Jiachang Sun ()
Additional contact information
Huiyuan Li: Chinese Academy of Sciences, Laboratory of Parallel Computing, Institute of Software
Jiachang Sun: Chinese Academy of Sciences, Laboratory of Parallel Computing, Institute of Software

A chapter in Current Trends in High Performance Computing and Its Applications, 2005, pp 357-362 from Springer

Abstract: Summary We propose fast algorithms for computing the discrete Fourier transforms on hexagon. These algorithms are easy to implement, they reduce the computation complexity from $$\mathcal{O}$$ (M 2) to $$\mathcal{O}$$ (M log M), where M is the total number of sampling points.

Keywords: Fast Fourier transforms; algorithms; hexagon; non-tensor-product (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-540-27912-9_44

Ordering information: This item can be ordered from
http://www.springer.com/9783540279129

DOI: 10.1007/3-540-27912-1_44

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().