CORDIC算法的FPGA与DSP实现的优劣分析

介绍了坐标旋转数字计算机（CORDIC）的算法原理,分析了算法中旋转迭代次数、操作数位宽与精度的关系,在现场可编程门阵列（FPGA）芯片和数字信号处理器（DSP）芯片上用全流水、高并行结构分别实现了旋转模式下的CORDIC算法,并将两者的精度、时间效率、空间效率的优劣进行比较。结果表明,DSP数值精度比FPGA高且设计更灵活,可移植性更强;而FPGA速度远远快于DSP,消耗硬件资源更少。     

基于正余弦计算的CORDIC旋转算法的改进与分析

该文提出了一种基于正余弦流水线CORDIC的模校正因子和级数部分的改进旋转算法,在FPGA仿真中给出了相关实验数据,结果证明了该方法可以有效减少流水级数,降低硬件复杂度,满足计算精度,改进引起的误差精度很小,在实际应用中可以忽略不计。     

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

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

CORDIC算法在跟踪环中的应用与FPGA实现

主要介绍了坐标旋转数字计算（CORDIC）算法在跟踪环鉴别器中的应用,包括码跟踪环、锁频环和锁相环鉴别器,并进行了FPGA实现。在设计中,采用统一CORDIC算法优化方法减少硬件开销,用非流水方式在一个CORDIC运算基本单元中实现了码跟踪环、锁频环和锁相环三种鉴别器。同时对CORDIC运算的精度和位宽进行分析,在保证环路功能的情况下尽量减少硬件资源的使用。在Virtex5lx220上测试使用了该鉴别器的GPS跟踪环,取得了满意的跟踪效果。     

改进型CORDIC算法的研究与实现

CORDIC的运算速度问题是研究的热点。为了解决CORDIC运算速度慢的问题,采用跳过零点思想,跳过输入相位值中为0的位,有效的减少了迭代次数。利用ISE仿真技术多次仿真综合。验证出改进型的CORDIC算法,在保证算法的运算精度基础上,明显地改善了CORDIC的运算速度,尤其针对于一些特殊的旋转角度,利用极少的旋转就达到结果。最终利用FPGA实现改进后CORDIC算法。     

免缩放因子双步旋转CORDIC算法

集成电路设计中经常使用CORDIC算法实现高效的向量旋转操作.当前对该算法的研究热点集中在减少该算法的迭代次数、扩展其收敛范围以及降低缩放因子补偿操作的代价等问题上.本文提出免缩放因子的双步旋转CORDIC算法使用双步旋转策略,减少了免缩放因子CORDIC算法的迭代次数,将收敛区间扩展到了整个圆周区间.实验结果表明,该算法保持高计算精度的同时减少了迭代次数和面积消耗.     

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

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

基于FPGA的CORDIC算法实现

针对传统CORDIC算法延时大,消耗资源多的缺点,在平行CORDIC算法的基础上提出了一种优化的平行算法,利用二进制转两极算法和微旋转角度编码对低部和高部的旋转方向进行预测,并在高部旋转中利用正反旋转抵消的策略来进一步减少旋转次数,提高运算速度。采用FPGA对提出的算法进行了硬件设计和验证,结果表明,计算迭代次数少,资源消耗少,精度较传统算法来说都有了明显改善。     

高速高精度固定角度旋转CORDIC算法的设计与实现

固定角度旋转的CORDIC(Coordinate Rotation Digital Computer)算法已经广泛的应用于高速数字信号处理、图像处理、机器人学等领域.针对固定角度旋转CORDIC算法在相位旋转过程中,存在数据吞吐率较高、占用硬件资源较多且资源消耗量大等缺点,提出了利用混合CORDIC算法,将角度旋转分为单向角度旋转和一次角度估计旋转两部分.本文根据欠阻尼理论,将固定角度旋转采用单向旋转CORDIC算法实现,减少了流水线的级数和迭代符号位的判决,然后通过对角度估计旋转的二进制表示,修正常数因子,再根据角度映射关系进行相关处理,完成高速高精度坐标旋转.最后在硬件平台上进行了仿真实验.实验结果表明,在误差范围一定的前提下,混合算法进一步的减少了迭代次数,并且资源消耗较低,提高了数据吞吐率.     

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

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

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.     

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.     

High-Speed CORDIC Based on an Overlapped Architecture and a Novel σ-Prediction Method

This paper presents architectural and algorithmic approaches for achieving high-speed CORDIC processing in both of the two operating modes: vectoring and rotation. For vectoring mode CORDIC processing, a modified architecture is proposed, which aims at reduction of computation time by overlapping the stages for redundant addition and selection of rotation direction. In addition, a novel rotation direction prediction scheme for rotation mode CORDIC is presented. The method is based on approximation of the binary angle input to a number with the arctangent weights (tan^–1 2^–i). The implementation is designed to keep the fast timing characteristics of redundant arithmetic in the x/y path of the CORDIC processing. The characteristics are analyzed with respect to latency time and area, and compared with those obtained by conventional CORDIC implementations. The results show that the proposed techniques reduce not only the block latency but also the overall computation time. Thus, they achieve higher throughput in pipelining.     

基于改进CORDIC算法的数字预失真实现

针对传统CRODIC算法存在的角度扩展、迭代复杂度等问题,在旋转模式下提出一种改进型CORDIC算法。对于旋转角度范围的扩展,采取将向量限制在第一和第四象限,旋转最后再根据输入向量符号判断旋转角度值;对于迭代复杂度,采用跳跃旋转方式来减少迭代次数。最后在Quartus软件上实现了该改进算法,并且将改进后的CORDIC算法应用于数字预失真技术,在FPGA上设计实现。仿真与实验结果表明:与传统的CORDIC算法相比,改进算法减少了硬件的开销,运算速度和精度都有很大改进,能够快速提取预失真参数,显著提高功率放大器的线性度。     

High-performance CORDIC rotation algorithm based on look-ahead techniques

The Coordinate Rotation Digital Computer (CORDIC) algorithm is a well-known iterative method for the computation of vector rotation. However, the major disadvantage is its relatively slow computational speed. In this article, a high-performance CORDIC rotation algorithm is proposed. Using the look-ahead techniques, the rotation directions can be predicted directly from the input angle. The proposed method can increase performance under maintaining the precision. The experimental results show the efficiency of the proposed methods.     

一种基于SystemVerilog的CORDIC算法IP核实现方案

CORDIC是一种坐标旋转算法,常用来计算向量旋转、三角与反三角函数以及数乘、除法等初等函数值。但是,由于它的形式多样,在FPGA硬件实现时,常规做法是根据不同计算需求设计特定的RTL代码,导致灵活性和可移植性受到了极大限制。因此,根据CORDIC各种运算形式的特点,利用SystemVerilog语言实现了CORDIC算法通用IP核制作,大大提高了代码的灵活性和可移植性,并且在FPGA中得到了仿真验证。     

Design, Implementation and Analysis of a New Redundant CORDIC Processor with Constant Scaling Factor and Regular Structure

A new high-speed redundant CORDIC processor is designed and implemented based on the double rotation method, which turns out to be the two-dimensional (2D) Householder CORDIC, a special case of the generalized Householder CORDIC in the 2D Euclidean vector space. The new processor has the advantages of regular structure and high throughput rate. The pipelined structure with radix-2 signed-digit (SD) redundant arithmetic is adopted to reduce the carry-propagation delay of the adders while the digit-serial structure alleviates the burden of the hardware cost and I/O requirement. Compared to previously proposed designs, the new CORDIC processor preserves the constant scaling factor, an important merit of the original CORDIC, and thus does not require any complicated division or square-root operations for variable scaling factor calculation. Furthermore, the processor is well suited to VLSI implementation since it does not call for any irregularly inserted correcting iterations. Both angle calculation mode for computing trigonometric function and vector rotation mode for plane rotations are supported. Practical VLSI chip implementation of the fixed-point redundant CORDIC processor using 0.6 m standard cell library is given including detailed numerical error analysis.     

Fixed-point error analysis of CORDIC processor based on the variance propagation formula

This paper presents a fixed-point mean-square error (MSE) analysis of coordinate rotation digital computer (CORDIC) processors based on the variance propagation method, whereas the conventional approaches provide only the error bound which results in large discrepancy between the analysis and actual implementation. The MSE analysis is aimed at obtaining a more accurate analysis of digital signal processing systems with CORDIC processor, especially when the design specification is given by the signal-to-noise ratio or MSE. For the MSE analysis, the error source and models are first defined and the output error is derived in terms of MSE in the rotation mode of the conventional CORDIC processor. It is shown that the proposed analysis can also be applied to the modified CORDIC algorithms. As an example of practical application, a fast Fourier transform processor using the CORDIC processor is presented in this paper, and its output error variance is analyzed with respect to the wordlength of CORDIC. The results show a close match between the analysis and simulation.