一种改进的二维离散极坐标Fourier变换快速算法  

An Improved Fast 2D Discrete Polar Fourier Transform Algorithm

作　　者：许漫坤[1] 平西建[1] 李天昀[1] 

机构地区：[1]信息工程大学信息工程学院,河南郑州450002

出　　处：《电子学报》2004年第7期1140-1143,共4页Acta Electronica Sinica

摘　　要：在雷达天线、图象配准、图象检索等领域内常常需要用极坐标表示二维数字信号的离散Fourier变换(DFT) .与笛卡尔坐标系下的二维DFT不同 ,二维离散极坐标Fourier变换 (DPFT)不具有行列可分性 ,直接计算非常耗时 .本文提出一种改进的DPFT的快速算法 .该算法针对二维阵列实信号 ,算法全部过程可用一维运算实现 ,大大降低了计算复杂度并且适用于实时处理 .实验中与直接运算方法相比较 。The problem of calculating discrete Fourier transform in polar coordinate systems,which is called DPFT here,has been given considerable attention in many fields such as antenna,image registration and image retrieval.But the direct computation of DPFT is very time consuming because of no X Y separability.This paper proposes an improved fast 2D DPFT algorithm which aims at 2D real array data and can be realized by only 1D calculations.This decreases the overall computational complexity significantly and suits more for real time signal processing.Compared with the direct calculation,the experimental results demonstrate the good performance of the proposed algorithm.

关 键 词：极坐标Fourier变换 移位DFT CHIRP-Z变换 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]