ISCAS OpenIR
fast fourier transform on hexagons
Li HY; Sun JC
2005
Conference NameInternational Conference on High Performance Computing and Its Applications
Pages357-362
Conference DateAUG 08-10,
Conference PlaceShanghai, PEOPLES R CHINA
Indexed Typeistp
Publish PlaceHEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
PublisherCurrent Trends in High Performance Computing and Its Applications, Proceedings
ISBN3-540-25785-3
DepartmentChinese Acad Sci, Lab Parallel Comp, Inst Software, Beijing 100080, Peoples R China.
English AbstractWe propose fast algorithms for computing the discrete Fourier transforms on hexagon. These algorithms are easy to implement, they reduce the computation complexity from O(M-2) to 0 (M log M), where M is the total number of sampling points.
KeywordFast Fourier Transforms Algorithms Hexagon Non-tensor-product
SponsorshipChina Comp Federat, Inst Appl Phys & Computat Math, Natl Nat Sci Fdn China, Shanghai Comp Soc, Shanghai Jiaotong Univ, Shanghai Supercomp Ctr, Shanghai Univ, Shanghai Univ Dingtech Co Ltd, Sybase China, Xian Jiaotong Univ
Language英语
Content Type会议论文
URIhttp://ir.iscas.ac.cn/handle/311060/12782
Collection中国科学院软件研究所
Recommended Citation
GB/T 7714
Li HY,Sun JC. fast fourier transform on hexagons[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:Current Trends in High Performance Computing and Its Applications, Proceedings,2005:357-362.
Files in This Item:
File Name/Size DocType Version Access License
fast fourier transfo(255KB) 开放获取--Application Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Li HY]'s Articles
[Sun JC]'s Articles
Baidu academic
Similar articles in Baidu academic
[Li HY]'s Articles
[Sun JC]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Li HY]'s Articles
[Sun JC]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.