一种新的gyrator变换的快速算法

为了研究gyrator变换在光学信息处理中的应用,提出了一种采用两次快速傅里叶变换实现快速计算gyrator变换的新算法.在量纲归一化条件下,研究了gyrator变换离散化过程,获得了空域、傅里叶变换域和gyrator变换域的采样间隔,形成了一种能避免尺度变换的算法.采用该算法进行了数值模拟实验,实验结果与相关文献中报道的计算结果一致.结果表明,该算法可以应用于gyrator变换的研究中.     

LFM signal detection using LPP-Hough transform

This paper presents a new method to detect linear frequency modulated (LFM) signals by jointly using the local polynomial periodogram (LPP) and the Hough transform. Theoretical comparison is made on the 3 dB signal-to-noise ratios (SNRs), achieved by the pseudo-Wigner-Ville distribution (PWVD) and the LPP, to show that the latter is important to achieve significant increase of noise margins in the Hough transform domain. The results of computer simulations are presented for the detection of mono- and multi-component LFM signals corrupted by additive white Gaussian noise and impulsive noise. It is also found that by using the time-frequency filtering, the computational complexity of the detection can be substantially reduced. Both the theoretical analysis and the simulation results show that the proposed method achieves significant performance improvement on detecting the LFM signals in very low signal-to-noise ratio environments.     

长序列信号快速相关及卷积的算法研究

文章通过对快速傅立叶变换（FFT）的算法原理分析,根据线性相关和卷积的数学特征及物理含义,针对长序列信号,提出了一种基于FFT的长序列快速相关及卷积算法,用C＋＋进行了算法编程,在计算机上得到较好的实验效果,提高了运行速度,并结合算术傅立叶变换进行了改进。     

Some properties and fast algorithms of slant transform in image processing

A first order stationary Markov process model has been considered for image processing problems. A relative performance measure of unitary transforms to image data has been defined. It has been proved that the slant transform is superior to Walsh-Hadamard transform in this relative performance measure for positive correlation under the assumed model. A lower bound of relative performance has also been found. Furthermore, fast algorithms for computing diagonal elements of any slant transformed matrix have been presented. Finally, it has been shown how slant transform can be modified to improve the relative performance.     

128-point memory-based architecture for a fast Fourier transform

In this article, we take advantage of the merits of a one-sixteenth circle storage technique, radix-2 and radix-2/4/8 algorithms to implement a 128-point memory-based architecture for a fast Fourier transform processor. The one-sixteenth circle storage technique results in reducing 50% of the size of a look-up table (LUT) for storing the twiddle factors. The combination of radix-2 and radix-2/4/8 algorithms results in reducing the number of twiddle factors and allowing the processor to possess a regular architecture which is suitable for hardware implementation. This design has been synthesised by Altera Quartus II 6.0. The experimental results indicate that this design needs only 65,169 ALUTs for LUT. The operating frequency is 59.76?MHz. The signal-to-noise ratios for the real and imaginary parts of the output signal are 67.72?dB and 68.55?dB, respectively.     

光学分数傅里叶变换的卷积性质

根据分数傅里叶变换的位移性质和卷积运算的定义,分析了卷积的光学分数傅立叶变换性质,给出了其数学表达和物理解释,并将所得结论与常规傅立叶变换的卷积性质做了对比.计算机模拟实验验证了理论的可靠性与可行性,该结论在光学测量、信息处理等应用领域具有实用价值.     

A fast algorithm for the linear canonical transform

In recent years there has been a renewed interest in finding fast algorithms to compute accurately the linear canonical transform (LCT) of a given function. This is driven by the large number of applications of the LCT in optics and signal processing. The well-known integral transforms: Fourier, fractional Fourier, bilateral Laplace and Fresnel transforms are special cases of the LCT. In this paper we obtain an O(NlogN) algorithm to compute the LCT by using a chirp-FFT-chirp transformation yielded by a convergent quadrature formula for the fractional Fourier transform. This formula gives a unitary discrete LCT in closed form. In the case of the fractional Fourier transform the algorithm computes this transform for arbitrary complex values inside the unitary circle and not only at the boundary. This chirp-FFT-chirp transform approximates the ordinary Fourier transform more precisely than just the FFT, since it comes from a convergent procedure for non-periodic functions.     

运用遗传算法结合FFT进行多单元失效阵列校准

提出了利用遗传算法（GA）结合快速傅立叶变换（FFT）方法来进行阵列失效的校准,通过引入傅立叶变换的变换域和角域的映射,在变换域中利用FFT计算个体阵列的阵因子,减少了GA评估个体的时间,从而大大提高了失效校准的速度。以一个-35分贝副瓣电平的32单元阵列为例,校准一单元失效和二单元失效的时间都减少了至少一个数量级,算法也可应用于两个以上单元失效的情况。     

匹配傅里叶变换快速算法及在雷达信号处理中应用

为了减小匹配傅里叶变换分析的计算量,提出了一种基于快速傅里叶变换的快速算法。根据匹配傅里叶变换的分解将积分形式转化为离散形式,推导出快速算法表达式。该算法与直接的数值离散匹配傅里叶变换算法相比较,计算量大大减少。同时给出了其在雷达信号处理中线性调频信号的检测与参数估计的应用。理论及计算机仿真结果表明了该算法的有效性和精确性,有良好的工程应用前景。     

A fast near optimum VLSI implementation of FFT using residue number systems

Many FFT processor designs have been proposed, most of which have been limited by hardware costs when a large number of points is to be processed.In recent years, VLSI technology modified design methodology and determined a general reduction of costs. The scope of this work is to present a fast near optimum VLSI architecture for solving an N-point FFT which exhibits T= ?(log log N) and AT² = ?(N²log²N log log N). Main features are: very high parallelism, proper communication parallelism, residue arithmetic, table look-up techniques and pipeline of data.Moreover, it will be shown that design performance does not depend on the input and output data representation (residue or weighted notation).     

基于链码和快速傅里叶变换的轮廓描绘方法

将八方向链码和快速傅里叶变换（FFT）相结合,提出一种新的形状轮廓描述方法。通过链码按顺序搜索物体边界,根据链码值的投影变换与轮廓的关系构造出轮廓的链码函数,对链码函数进行快速FFT,并对傅里叶描述符进行优化,提出了新的傅里叶不变因子描述符（FCFD）。实验结果表明,本文提出FCFD具有旋转、尺度和平移（RSS）不变性...     

Simple FFT and DCT algorithms with reduced number of operations

A simple algorithm for the evaluation of discrete Fourier transforms (DFT) and discrete cosine transforms (DCT) is presented. This approach, based on the divide and conquer technique, achieves a substantial decrease in the number of additions when compared to currently used FFT algorithms (30% for a DFT on real data, 15% for a DFT on complex data and 25% for a DCT) and keeps the same number of multiplications as the best known FFT algorithms. The simple structure of the algorithm and the fact that it is best suited for real data (one does not have to take a transform of two real sequences simultaneously anymore) should lead to efficient implementations and to a wide range of applications.     

A fast algorithm for discrete hartley transform of arbitrary length

DHT of length p~lq(p is odd and q is arbitrary) is turned into p~l DHTs of length qand some additional operations, while the additional operations only involves the computation ofcos-DFT and sin-DFT with length p. If the length of a DHT is p_1~(l_1)…P_N~(l_N)2~l(P_1…,P_N are oddprimes), a fast algorithm is obtained by the similar recursive technique. Therefore, the algorithmcan compute DHT of arbitrary length. The paper also Proves that operations for computingDHT of length N by the algorithm are no more than O(Nlog_2N), when the length is N=p~l,operations of the algorithm are fewer than that of other known algorithms.     

An improvement in the evaluation of convolutions of real symmetric signals using the fast Fourier transform

The evaluation of convolutions of real data using the fast Fourier transform can be made more efficient if one of the two signals is symmetric.     

半导体激光自混合变速测量的离散Chirp-Fourier变换方法

当外部激光被反射回激光内腔时,反馈光与激光器腔内光混合,调制激光器的输出功率和频率,通过信号处理可以得到物体运动的多普勒频率,从而计算出物体的运动速度。基于这种特性,设计出一种激光自混合干涉仪,为了知道该技术是否适用于变速测量,对激光自混合用于变速运动物体的速度测量进行了探索。基于激光自混合三镜腔模型,建立了激光自混合用于变速测量的数学模型,提出了基于该模型的特征参量提取方法,该方法基于离散Chirp-Fourier变换理论。对激光自混合输出信号进行离散Chirp-Fourier变换,变换结果的主瓣坐标反映了物体运动的速度及加速度信息。最后,对该方法进行了仿真分析,在SNR=0 dB和SNR=7 dB的情况下,能较好地获得物体的速度和加速度信息。因此,仿真试验证明:该方法在较低信噪比的情况下仍能有效提取物体的速度及加速度信息。     

对称双圆孔傅里叶变换干涉条纹法测焦距

提出用照相缩微法制作一个小孔距对称双圆孔作为待测透镜傅里叶变换输入函数,利用其傅里叶变换频谱面上的干涉条纹间距的测量值计算透镜焦距。该法装置简单,调节方便,测量精度较高。分析了测量原理和测量误差,并给出了与理论分析相符的结果。     

Calculation of valence band structures of InAs/GaAs quantum ring and quantum dot:using numerical Fourier transform method

This article puts forward a new method in calculating the band structures of low-dimensional semiconductor structures.In this study,the valence band structures of InAs/GaAs quantum ring and lens-shaped quantum dot are calculated with four-band model,in the framework of effective-mass envelope function theory.To determine the Hamiltonian matrix elements,this article develops the numerical Fourier transform method instead of the widely used analytical integral method.The valence band mixing is considered.The ...     

单缝分数傅里叶变换的透镜单色焦距测量

透镜的单色光焦距是激光应用中的重要参数。概括了分数傅里叶变换的基本原理,讨论了利用分数傅里叶变换测量透镜焦距的实现方法和技术特点,提出了一种利用单缝的分数傅里叶变换测量透镜单色光焦距的实验方案,并给出了相应的程序设计思路。该方法自动化程度高,操作灵活,易于实现。     

傅里叶变换与小波变换在信号去噪中的应用

对于高频信号和高频噪声干扰相混叠的信号,采用小波变换去除噪声可以避免用傅里叶变换去噪带来的信号折损。对于噪声频率固定的平稳信号,在对信号进行傅里叶变换后使用滤波器滤除噪声。对高频含噪信号则采用正交小波函数sym4对信号分解到第4层,利用极大极小值原则选择合适的阈值进行软阈值处理,最后利用处理后的小波系数进行重构。实验结果表明,对于高频含噪信号傅里叶去噪会出现严重的信号丢失现象,使用极大极小值原则选择阈值进行小波去噪可以有效地保留高频部分的有用信号。     

DFT与FFT在宽带数字接收机中的应用

介绍了DFT和FFT在数字信道化接收机中的应用,对ALTERA公司提供的FFT核进行了性能测试,分析了在宽带数字接收机中DFT相比于FFT可能具有的优越性,提出了对数据进行重叠处理的补零滑动算法,该算法有助于构造实时处理的数字信道化接收机。