共查询到19条相似文献,搜索用时 15 毫秒
1.
FFT是数字信号处理最重要的算法之一,论文分析了常规的2N点按时间抽选的实序列FFT运算的基本原理,介绍了一种改进的算法,算法将奇数序列和偶数序列部分开计算,并提取旋转因子的公因子,大大减少了计算过程中的加法和乘法的个数和旋转因子的引用次数,并在实际的DSP平台上进行了实现,实验数据表明,该算法在运算效率和复杂度上都较传统FFT算法有较大的改进。 相似文献
2.
目前,研究资源节约型的低复杂度混合基快速傅里叶变换(FFT)设计技术具有重要的应用价值。本文基于现场可编程逻辑门阵列(FPGA)平台提出并实现了一种新型混合基FFT分解算法。该算法基于原位存储结构设计,采用素数因子分解与库利-图基分解相结合的混合分解模式,在省去了一步旋转因子乘法运算的同时也有效减小了存储空间和运算量,并采用通用蝶形单元模块设计使得算法能够同时适应基2、基3、基4的FFT运算。仿真结果表明,该算法可以极大提高FFT处理点数的灵活性,有效节省运算资源。 相似文献
3.
4.
5.
6.
针对基8算法提出一种无冲突地址生成方法,设计了802.11a专用FFT处理器,整体采用流水处理,实现了一种高性能FFT硬件架构,各级RAM采用乒乓操作,每个RAM均由8个独立的SRAM存储体组成,通过对循环移位寄存器译码,蝶算单元并行无冲突读写RAM操作数,8通道输入数据并行处理,每级运算所需的时钟周期大幅度降低.FFT运算连续输入、输出,数据运算精度通过块浮点得到保证.整体具有高速、高精度的特征.本文提出的无冲突地址生成方法也可以扩展至高点数FFT的应用. 相似文献
7.
长序列信号快速相关及卷积的算法研究 总被引:9,自引:2,他引:7
文章通过对快速傅立叶变换(FFT)的算法原理分析,根据线性相关和卷积的数学特征及物理含义,针对长序列信号,提出了一种基于FFT的长序列快速相关及卷积算法,用C++进行了算法编程,在计算机上得到较好的实验效果,提高了运行速度,并结合算术傅立叶变换进行了改进。 相似文献
8.
9.
10.
11.
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. 相似文献
12.
Fast Fourier transform (FFT) plays an important role in the orthogonal frequency division multiplexing (OFDM) communication
systems. In this paper, we propose an area-efficient design of variable-length FFT processor which can perform various FFT
lengths of 512/1,024/2,048/4,096/8,192 points used in OFDM-based communication systems, such as digital audio broadcasting
(DAB), digital video broadcasting-terrestrial (DVB-T) and digital video broadcasting-handheld (DVB-H). To reduce computational
complexity and chip area, we develop a new variable-length FFT architecture by devising a mixed-radix algorithm that consist
of radix-2, radix-22 and radix-2/4/8 algorithms and optimizing the realization by substructure sharing. Based on this architecture, an area-efficient
design of variable-length FFT processor is presented. By synthesized using the UMC 0.18 μm process, the area of the processor
is 2.9 mm2 and the 8,192-point FFT can be performed correctly up to 50 MHz with power consumption 823 mW under a 1.8 V supply voltage.
相似文献
Shuenn-Shyang WangEmail: |
13.
In this work, we proposed a novel Coordinate Rotation DIgital Computer (CORDIC) rotator algorithm that converges faster by performing radix-2,4 and 16 CORDIC iterations while maintaining the scale factor implicitly constant. A mixed-radix is used to achieve convergence faster to reduce the computational latency of the CORDIC algorithm. The main concern of the higher radix CORDIC algorithm is the compensation of a variable scale factor. To solve this problem, the Taylor series approximation of sine and cosine is proposed for a higher radix CORDIC algorithm to achieve the scaling-free rotation of the two-dimensional vector. The scaling-free rotation of the proposed CORDIC algorithm removes the read-only memory (ROM) needed to store scale factor of higher radix CORDIC algorithm. Further, the proposed CORDIC algorithm is designed in rotation mode and optimized by removing the Z datapath for the digital signal processing (DSP) applications for which the angle of rotation is known in advance. Finally, the multipath delay commutator (MDC) fast Fourier transform (FFT) algorithm is implemented with the proposed CORDIC algorithm based rotator on FPGA. The proposed design is compared with existing designs. In a comparison between the radix-16 CORDIC rotator based FFT implementation and our proposed implementation, it has been found out that implementation proposed in this article has used 17% fewer resources. 相似文献
14.
Chin-Teng Lin Yuan-Chu Yu Lan-Da Van 《Very Large Scale Integration (VLSI) Systems, IEEE Transactions on》2008,16(8):1058-1071
This investigation proposes a novel radix-42 algorithm with the low computational complexity of a radix-16 algorithm but the lower hardware requirement of a radix-4 algorithm. The proposed pipeline radix-42 single delay feedback path (R42SDF) architecture adopts a multiplierless radix-4 butterfly structure, based on the specific linear mapping of common factor algorithm (CFA), to support both 256-point fast Fourier transform/inverse fast Fourier transform (FFT/IFFT) and 8times8 2D discrete cosine transform (DCT) modes following with the high efficient feedback shift registers architecture. The segment shift register (SSR) and overturn shift register (OSR) structure are adopted to minimize the register cost for the input re-ordering and post computation operations in the 8times8 2D DCT mode, respectively. Moreover, the retrenched constant multiplier and eight-folded complex multiplier structures are adopted to decrease the multiplier cost and the coefficient ROM size with the complex conjugate symmetry rule and subexpression elimination technology. To further decrease the chip cost, a finite wordlength analysis is provided to indicate that the proposed architecture only requires a 13-bit internal wordlength to achieve 40-dB signal-to-noise ratio (SNR) performance in 256-point FFT/IFFT modes and high digital video (DV) compression quality in 8 times 8 2D DCT mode. The comprehensive comparison results indicate that the proposed cost effective reconfigurable design has the smallest hardware requirement and largest hardware utilization among the tested architectures for the FFT/IFFT computation, and thus has the highest cost efficiency. The derivation and chip implementation results show that the proposed pipeline 256-point FFT/IFFT/2D DCT triple-mode chip consumes 22.37 mW at 100 MHz at 1.2-V supply voltage in TSMC 0.13-mum CMOS process, which is very appropriate for the RSoCs IP of next-generation handheld devices. 相似文献
15.
In this paper, a processor architecture tailored for radix-4 and mixed-radix FFT computations is described. The processor
has native support for power-of-two transform sizes. Several optimizations have been used to improve the energy-efficiency
of the processor and experiments show that a programmable solution can possess energy-efficiency comparable to fixed-function
ASICs. 相似文献
16.
流水线结构FFT/IFFT处理器的设计与实现 总被引:1,自引:0,他引:1
针对实时高速信号处理的要求,设计并实现了一种高效的FFT处理器。在分析了FFT算法的复杂度和硬件实现结构的基础上,处理器采用了按频率抽取的基—4算法,分级流水线以及定点运算结构。可以根据要求设置成4P点的FFT或IFFT。处理器可以对多个输入序列进行连续的FFT运算,消除了数据的输入输出对延时的影响。平均每完成一次N点FFT运算仅需要Ⅳ个时钟周期。整个设计基于Verilog HDL语言进行模块化设计。并在Altera公司的Cyclone Ⅱ器件上实现。 相似文献
17.
The fixed-point error performance of the various fast Hartley transform (FHT) algorithms have been investigated. Scaling schemes have been proposed for each of the algorithms. However, due to their better error performance, only the decimation-in-time (DIT) FHT algorithms have been examined. The fixed-point error analysis of the radix-4 DIT algorithm is discussed first and is shown to agree closely with the simulation results. These results are then compared with the simulation results for radix-2 and split-radix algorithms. The scaling schemes are then optimised and the simulation results of the three algorithms are compared. It is concluded that the radix-4 DIT algorithm has the best error performance 相似文献
18.
19.
Designing Fast Fourier Transform Accelerators for Orthogonal Frequency-Division Multiplexing Systems
Waqar Hussain Fabio Garzia Tapani Ahonen Jari Nurmi 《Journal of Signal Processing Systems》2012,69(2):161-171
Designing accelerators for the real-time computation of Fast Fourier Transform (FFT) algorithms for state-of-the-art Orthogonal Frequency-Division Multiplexing (OFDM) demodulators has always been challenging. We have scaled-up a template-based Coarse-Grain Reconfigurable Array device for faster FFT processing that generates special purpose accelerators based on the user input. Using a basic and a scaled-up version, we have generated a radix-4 and mixed-radix (2, 4) FFT accelerator to process different length and types of algorithms. Our implementation results show that these accelerators satisfy not only the execution time requirements of FFT processing for Single Input Single Output (SISO) wireless standards that are IEEE-802.11 a/g and 3GPP-LTE but also for Multiple Input Multiple Output (MIMO) IEEE-802.11n standard. 相似文献