共查询到17条相似文献,搜索用时 453 毫秒
1.
2.
基于谐波特征分析的时间调制阵列测向方法的正确性与精度严重依赖接收谐波的估计精度. 传统的离散傅里叶变换(discrete Fourier transform, DFT)或快速傅里叶变换(fast Fourier transform, FFT)在估计谐波的幅相时,由于信号频率通常偏离采样频率的整数倍,会形成栅栏效应,从而引起基于谐波特征分析的时间调制阵列测向的精度降低甚至失效. 针对该问题,本文将全相位FFT引入二单元时间调制阵列接收谐波的分析中,通过提升谐波幅相估计的鲁棒性来提升时间调制阵列测向方法的稳健性. 仿真结果表明,当信号的载频为频谱分辨率的任意小数倍时,提出的全相位FFT时间调制阵列测向方法均能正确测向,且随着信噪比的增加,测向均方根误差收敛至0. 本文工作提升了基于谐波特征分析的单通道时间调制阵列测向方法的稳定性。 相似文献
3.
详尽讨论了快速傅立叶变换(FFT)应用于有限冲击响应(FIR)数字低通滤波器(DLPF)的设计和分析方法.应用FFT算法,将理想DLPF幅频特性转换到变换域,获得其变换域序列;设计窗函数对该序列开窗,获得FIR有限序列;应用快速傅立叶逆变换(IFFT)对其进行变换,获得相应窗函数可实现DLPF幅频特性.结果发现,FFT算法可获得与传统卷积算法相同的结果;不需要推算窗函数的频谱解析表达式;可以处理Kaiser窗等变换域解析式复杂、频域解析式难以精确求解的窗函数设计与分析.与传统的卷积分析法相比,FFT不仅算法简单、灵活,而且处理能力强,是分析FIR DLPF设计的有力工具. 相似文献
4.
5.
6.
7.
本文运用遗传算法(GA)综合稀疏阵列(单元从规则栅格中稀疏)时,不仅优化单元间距,而且将单元激励也作为优化变量,从而提供了更多的自由度来控制稀疏阵列的性能.其中,单元的幅相加权在数字波束形成天线中可以很容易通过数字方法实现.由于稀疏阵列间隔是栅格的整数倍,因此采用了GA结合快速傅立叶变换的方法加快阵列方向图的评估,提高了优化效率. 相似文献
8.
9.
快速傅立叶变换(FFT)属于数字信号处理中最基础的运算,已广泛应用于通讯、医学电子学、雷达和射电天文学等领域。本文对FFT的主要算法作了概述,并对其特性和运算工作量进行了分析和对比,期望对快速傅立叶变换算法有一个清晰的认识。 相似文献
10.
OFDM系统中多导频的FFT信道估计算法 总被引:5,自引:1,他引:4
论文提出了OFDM系统中基于FFT的信道估计方法,包括基于时域插值及变换域插值方法。时域插值算法的理论基础是利用FFT频域采样定理,可由频域有限频点的采样值经过IFFT/FFT得到整个频域传输函数的估计值,而不发生混叠。变换域插值算法的理论基础是利用FFT时域抽样定理,利用OFDM信号特点和信道特性,经过FFT/IFFT将信号和噪声分离,并在此基础上进行加窗改进算法,以减小插值中的频谱泄漏,提高估计效果。仿真结果说明,加窗的基于FFT变换域的方法性能有了很大改善。 相似文献
11.
12.
In this article, we investigate the multiplicative filtering in the fractional Fourier transform (FRFT) domain based on the generalized convolution theorem which states that the convolution of two signals in time domain results in simple multiplication of their FRFTs in the FRFT domain. In order to efficiently implement multiplicative filtering, we express the generalized convolution structure by the conventional convolution operation. Utilizing the generalized convolution structure, we convert the multiplicative filtering in the FRFT domain easily to the time domain. Based on the model of multiplicative filtering in the FRFT domain, a practical method is proposed to achieve the multiplicative filtering through convolution in the time domain. This method can be realized by classical Fast Fourier transform (FFT) and has the same capability compared with the method achieved in the FRFT domain. As convolution can be performed by FFT, this method is more useful from practical engineering perspective. 相似文献
13.
A novel algorithm for radar imaging is presented. The method comprises two steps. First, a decomposition of the radar data domain into subdomains and computation of pertinent low resolution images. Second, interpolation, phase correction and aggregation of the low resolution images into the final high resolution one. A multilevel algorithm is formulated via a recursive application of the domain decomposition and image aggregation steps. The computational cost of the proposed algorithm is comparable to that of the fast Fourier transform (FFT) based techniques while it appears to be considerably more flexible than the latter 相似文献
14.
为了实时获取化学战剂、大气污染物等待测物的光谱信息,设计了一种基于现场可编程门阵列实现单边干涉图光谱复原的高速数据处理系统。该系统采用将去直流、切趾,快速傅里叶变换、相位校正等光谱复原处理集成在一块现场可编程门阵列芯片内实现的方法,具有集成度高、速度快、成本低等优点。在ISE10.1开发平台上设计了数据处理系统硬件电路,通过WQF-520型傅里叶变换红外光谱仪采集干涉数据传给现场可编程门阵列进行处理,实验结果与MATLAB仿真结果比较,相对误差在1.2%以内。结果表明,该系统可正确复原光谱,适用于时间调制和空间调制的干涉式光谱仪系统。 相似文献
15.
Jo B.G. Sunwoo M.H. 《IEEE transactions on circuits and systems. I, Regular papers》2005,52(5):911-919
The paper proposes a new continuous-flow mixed-radix (CFMR) fast Fourier transform (FFT) processor that uses the MR (radix-4/2) algorithm and a novel in-place strategy. The existing in-place strategy supports only a fixed-radix FFT algorithm. In contrast, the proposed in-place strategy can support the MR algorithm, which allows CF FFT computations regardless of the length of FFT. The novel in-place strategy is made by interchanging storage locations of butterfly outputs. The CFMR FFT processor provides the MR algorithm, the in-place strategy, and the CF FFT computations at the same time. The CFMR FFT processor requires only two N-word memories due to the proposed in-place strategy. In addition, it uses one butterfly unit that can perform either one radix-4 butterfly or two radix-2 butterflies. The CFMR FFT processor using the 0.18 /spl mu/m SEC cell library consists of 37,000 gates excluding memories, requires only 640 clock cycles for a 512-point FFT and runs at 100 MHz. Therefore, the CFMR FFT processor can reduce hardware complexity and computation cycles compared with existing FFT processors. 相似文献
16.
17.
The use of fast Fourier transform (FFT) processing behind the elements in adaptive arrays is often considered as a means of improving the nulling bandwidth of such arrays. However, it is shown that the output signal-to-interference-plus-noise ratio obtained from an adaptive array with FFTs behind the elements is identical to that of an equivalent adaptive array with tapped delay-line processing. The equivalent tapped delay-line array has the same number of taps in each delay line as the number of time samples in the FFTs, and has a delay between taps equal to the delay between samples in the FFTs. Thus, while the bandwidth performance of an adaptive array can be improved by using time-delayed samples of each element signal, no further improvement results from taking FFTs of these sampled signals. The same bandwidth performance is obtained by simply weighting and combining the time-domain samples directly 相似文献