fast fourier transform on hexagons

ISCAS OpenIR

	fast fourier transform on hexagons
	Li HY; Sun JC
	2005
会议名称	International Conference on High Performance Computing and Its Applications
页码	357-362
会议日期	AUG 08-10,
会议地点	Shanghai, PEOPLES R CHINA
收录类别	istp
出版地	HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者	Current Trends in High Performance Computing and Its Applications, Proceedings
ISBN	3-540-25785-3
部门归属	Chinese Acad Sci, Lab Parallel Comp, Inst Software, Beijing 100080, Peoples R China.
摘要	We 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.
关键词	Fast Fourier Transforms Algorithms Hexagon Non-tensor-product
主办者	China 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
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/12782
专题	中国科学院软件研究所
推荐引用方式 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.