基于CORDIC算法的DDS实现

直接数字频率合成(DDS)技术在软件无线电方面有着广泛的应用,而坐标旋转数字计算方法(Coordinate Rotation Digital Computer,CORDIC)通过移位和加减运算代替乘法运算是构造DDS的一种理想的手段。介绍了CORDIC算法的基本原理,采用流水线方法对CORDIC算法进行了设计实现,用以取代传统的ROM查找表法。实验验证,基于CORDIC算法的DDS满足高速、高精度、高分辨率和实时运算的要求。     

CORDIC算法的一种补码实现结构设计

根据CORDIC算法原理,分析了该算法角度旋转范围缺陷,提出360°覆盖的角度旋转算法结构;推导出利用补码实现CORDIC算法的迭代运算单元结构,并根据该补码运算原理设计了CORDIC补码迭代运算单元和方向向量发生器的实现结构.     

基于CORDIC算法的基4DIT-FFT处理器的设计

随着海洋开发和信息产业的发展,高速、大容量、高可靠性的水声通信系统成为研究热点。论述了一种用于水声通信系统中的基4DIT-FFT处理器的设计。该设计利用CORDIC算法优化蝶形运算单元,将复数乘法转换为硬件易于实现的加、减、移位运算,并通过Matlab对伸缩系数与旋转系数进行预处理,大大加快了运算速度且降低了系统复杂性。在此基础上设计了一种1024点12位的基4DIT-FFT处理器。     

高性能HPOR CORDIC算法及实现

CORDIC算法在通信和图像处理等各个领域有着广泛的应用,但是浮点CORDIC由于迭代延时大且实现复杂没有得到很好的应用,本文提出了一种修正浮点CORDIC算法：高精度顺序迭代HPORCORDIC。该算法以接近定点的运算代价完成浮点运算迭代,运算速度和硬件实现规模与定点CORDIC相当,运算精度与浮点CORDIC相当,克服了定点CORDIC运算精度差,浮点CORDIC迭代延时大、实现复杂的问题。该算法既可用于通用微处理器的设计,也可用于高性能DSP的设计。     

基于折叠变换的CORDIC算法实现

在现代数字信号处理领域中,CORDIC算法是一种重要的数学计算方法。该算法采用一种迭代的方式,运算简便,被广泛应用于乘除法、开方以及一些三角函数运算当中。但CORDIC算法需要较高的迭代级数以保证运算精度,在进行FPGA实现时仍然会消耗较多的硬件逻辑资源。为进一步减少CORDIC算法实现时的资源消耗,设计并实现了一种基于折叠变换的CORDIC算法。相比传统的流水结构CORDIC算法,该折叠结构的CORDIC算法消耗的硬件资源大大减少。文中给出了这一方法的实现结构,并给出了仿真结果。     

利用CORDIC算法计算平方根及其FPGA实现

平方根运算作为信号处理的一种基本数据运算,在工程项目中应用广泛,但是在FPGA中直接进行平方根运算较为复杂,需要研究其高效实现方法。当利用CORDIC算法进行双曲线方程求解时,可以高效地完成平方根运算。这里首先介绍了CORDIC算法的原理,迭代结构的实现流程,及其在平方根计算中的应用。设计了两种适合于FPGA实现的CORDIC算法平方根运算的结构,并行结构和位串行结构,比较了两种结构的优缺点,并给出仿真结果。     

基于CORDIC算法的复数除法器FPGA实现

在现代数字信号处理电路设计中,除法器有着广泛的应用。这里阐述一种复数除法器的设计思想和实现方法,引入CORDIC算法到复数的除法运算中,利用CORDIC旋转操作来代替乘、加法操作,然后采用双比特移位操作得到最终运算结果。经CORDIC旋转后数据最多只放大2位位宽,因此可以减少硬件实现中的器件迭代次数。经过FPGA验证结果表明,整个设计运算速度快、节省器件,并且计算精度高。     

基于CORDIC算法的高速直接数字频率合成技术的ASIC实现

文章主要分析了如何利用基于矢量旋转的CORDIC(Coordination Rotation Digital Computer)算法实现高速高精度的直接数字频率合成技术(DDS)。首先推导了CORDIC算法产生正余弦信号的实现过程，然后给出了在FPGA中设计数控振荡器(NCO)的顶层电路结构，并根据算法特点在设计中引入流水线结构设计。     

基于FPGA的一种改进型三角超越函数CORDIC实现方式

CORDIC算法将复杂的算术运算转化为简单的加法和移位操作,然后逐步逼近结果。这种方法很好地兼顾了精度、速度,非常适合三角超越函数的硬件实现,但同时也带来硬件资源占用增加的问题。如何尽可能减少CORDIC算法带来的硬件资源占用增加,是利用CORDIC算法实现三角超越函数的关键。本文提出一种改进型三角超越函数CORDIC硬件实现方案,该方案中CORDIC算法IP核利用VHDL语言进行编写,IP核在Modelsim6.5g上通过功能仿真,并且在XUPV5-LX110T FPGA开发板上通过硬件测试,实验结果表明改进的方案可以有效减少CORDIC算法带来的硬件资源占用增加。     

流水线CORDIC算法的FPGA实现

坐标旋转计算机（CORDIC）算法可以将多种难以用硬件电路直接实现的复杂运算分解为统一的简单移位、加法运算,然后逐次逼近结果。这种方法很好地兼顾了精度、速度和硬件复杂度,因而在数字信号处理领域得到了广泛应用。首先简要介绍了CORDIC算法的原理,然后基于现场可编程门阵列（FPGA）实现了流水线结构的CORDIC算法,仿真结果表明,其输出误差很小,与理论值基本一致。     

基于CORDIC算法并行FFT设计与硬件实现

讨论了复杂128点FFT处理器的并行和旋转结构。VLSI实现FFT适用于超高速数据处理。随着新的VLSI技术的发展，高速处理和低功耗设计成为现实。使用CORDIC旋转处理器可以优化面积和速度的设计，在不降低数据处理速度的基础上，这种FFT仅仅使用了5．3万等效逻辑门。     

Numerical Accuracy of Fast Fourier Transforms with CORDIC Arithmetic

The vector rotation operation in the butterfly of a Fast Fourier Transform (FFT) can be calculated by a complex multiplier as well as a CORDIC (COordinate Rotation DIgital Computer). For these vector rotation blocks, expressions for the maximum numerical error are derived. It is shown that the error introduced by the CORDIC can be reduced by increasing the size of the input vector of the CORDIC and decreasing the size of the output vector by the same amount. This input vector scaling makes the reduction possible of the number of bits in the data path of the CORDIC. The impact on the Signal to Noise Ratio (SNR) of the FFT is evaluated when a CORDIC is applied in the FFT butterfly.     

Mixed-radix,virtually scaling-free CORDIC algorithm based rotator for DSP applications

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.     

Configurable Floating-Point FFT Accelerator on FPGA Based Multiple-Rotation CORDIC

Fast Fourier transform (FFT) accelerator and Coordinate rotation digital computer (CORDIC) algorithm play important roles in signal processing.We propose a conflgurable floating-point FFT accelerator based on CORDIC rotation,in which twiddle direction prediction is presented to reduce hardware cost and twiddle angles are generated in real time to save memory.To finish CORDIC rotation efficiently,a novel approach in which segmentedparallel iteration and compress iteration based on CSA are presented and redundant CORDIC is used to reduce the latency of each iteration.To prove the efficiency of our FFT accelerator,four FFT accelerators are prototyped into a FPGA chip to perform a batch-FFT.Experimental results show that our structure,which is composed of four butterfly units and finishes FFT with the size ranging from 64 to 8192 points,occupies 33230(3％) REGs and 143006(30％)LUTs.The clock frequency can reach 122MHz.The resources of double-precision FFT is only about 2.5 times of single-precision while the theoretical value is 4.What's more,only 13331 cycles are required to implement 8192-points double-precision FFT with four butterfly units in parallel.     

基于FPGA的高速高阶流水线工作FFT设计

为了提高快速傅里叶变换(FFT)处理数据的实时性,本文利用现场可编程阵列(FPGA)逻辑资源丰富、运算速度快的特点以及FFT算法的分级特性,实现了高速、高阶FFT的流水线工作方式设计。通过本文介绍的设计方法,在Xilinx公司Virtex-II系列FPGA上实现了工作频率50MHz以上、数据流水输入、输出的1 024点按时间抽取FFT。     

基于嵌入式的CORDIC算法的改进及实现

介绍了CORDIC算法的基本原理,分析了CORDIC算法的具体计算方法.针对利用CORDIC流水线实现FFT蝶形运算耗费资源多的问题,依据CORDIC计算迭代系数的方法改进了CORDIC流水线的结构形式,使其适应FFT算法.整个FFT处理器的实现主要利用了Cyclone Ⅱ系列的EP2C35F672C6.并通过时序仿真和硬件仿真来进行比较.它们的计算结果基本一致.     

一种OFDM调制解调器的FPGA实现

OFDM技术在高速数据传输中得到了广泛的应用，根据OFDM的特点，提出了一种基于IFFT/FFT的OFDM调制解调器的低成本FPGA实现方法，最后给出了FPGA上的15点FFT运算单元的计算结果。实践证明，该方法具有设计简单、快速、高效和实时性好等特点。     

FPGA implementation of high-performance,resource-efficient Radix-16 CORDIC rotator based FFT algorithm

The fast Fourier transform (FFT) is an algorithm widely used to compute the discrete Fourier transform (DFT) in real-time digital signal processing. High-performance with fewer resources is highly desirable for any real-time application. Our proposed work presents the implementation of the radix-2 decimation-in-frequency (R2DIF) FFT algorithm based on the modified feed-forward double-path delay commutator (DDC) architecture on FPGA device. Need for a complex multiplier to carry out the multiplication of complex twiddle factors and large memory to store the twiddle factors are the main concerns for FFT implementation. Propose work aims to address these issues. In this work, a high-performance radix-16 COordinate Rotational DIgital Computer (CORDIC) algorithm based rotator is proposed to carry out the complex twiddle factor multiplication. Further, CORDIC needs only rotational angles to carry out complex multiplication, which reduces the need for large memory to store the twiddle factors. To compute the total rotation for n-bit precision, our proposed radix-16 CORDIC algorithm takes n/4 iteration as compared to n iteration of the radix-2 CORDIC algorithm. Our proposed architecture of the radix-2 decimation-in-frequency (R2DIF) algorithm is implemented on a Virtex−7 series FPGA. Further, the detailed comparison is presented between our proposed FFT implementation and other recently proposed FFT implementations. Experimental results suggest that proposed implementation has less latency and hardware utilization as compared to recently proposed implementations.     

基于CORDIC算法的流水线型FFT处理器设计

首先分析了基二FFT算法的原理以及在FPGA上实现FFT处理器的硬件结构。其次详细研究了在FPGA上实现FFT的具体过程,利用CORDIC算法实现了旋转因子乘法器,解决了整体设计过程中主要面对的几个关键问题,最终利用Verilog编程实现了基二流水线型FFT处理器,利用MATLAB与MODELSIM结合仿真结果表明该设计满足FFT处理器的基本要求,在10 MHz的采样率下完成32点FFT只需要14.45μs,设计方法也简单易行,具有一定的推广价值。     

大点数FFT设计中提高资源利用率的方法

应用系统对于高速大点数快速傅里叶变换(FFT)处理器的需求越来越大,但大点数FFT意味着资源、面积和功耗的大幅提高,因此如何减少资源和芯片面积成为了在FFT设计中需要考虑的重要问题之一。介绍了适合于大点数FFT设计的基16蝶形算法,并基于此算法针对如何在设计中提高运算单元和存储单元利用率的问题进行了探讨,提出了相应的解决方法。在FFT电路设计中进行了功能验证和资源比较,证实了方法的可行性。