Computer generation of hardware for linear digital signal processing transforms
Linear signal transforms such as the discrete Fourier transform (DFT) are very widely used in
digital signal processing and other domains. Due to high performance or efficiency …
digital signal processing and other domains. Due to high performance or efficiency …
Modified virtually scaling-free adaptive CORDIC rotator algorithm and architecture
K Maharatna, S Banerjee, E Grass… - IEEE Transactions on …, 2005 - ieeexplore.ieee.org
In this paper, we proposed a novel Coordinate Rotation Digital Computer (CORDIC) rotator
algorithm that converges to the final target angle by adaptively executing appropriate …
algorithm that converges to the final target angle by adaptively executing appropriate …
Enhanced scaling-free CORDIC
FJ Jaime, MA Sánchez, J Hormigo… - … on Circuits and …, 2010 - ieeexplore.ieee.org
Coordinate Rotation DIgital Computer (CORDIC) rotator is a well known and widely used
algorithm within computers due to its way of carrying out some calculations such as …
algorithm within computers due to its way of carrying out some calculations such as …
Efficient VLSI architectures for fast computation of the discrete Fourier transform and its inverse
CH Chang, CL Wang, YT Chang - IEEE Transactions on Signal …, 2000 - ieeexplore.ieee.org
In this paper, we propose two new VLSI architectures for computing the N-point discrete
Fourier transform (DFT) and its inverse (IDFT) based on a radix-2 fast algorithm, where N is …
Fourier transform (DFT) and its inverse (IDFT) based on a radix-2 fast algorithm, where N is …
Design of a pipelined radix 4 CORDIC processor
In this work we develop a generalization of the CORDIC algorithm for any radix in three
coordinate systems, linear, circular and hyperbolic. We carry out a comparative study …
coordinate systems, linear, circular and hyperbolic. We carry out a comparative study …
Partial column FFT pipelines
SF Gorman, JM Wills - … Transactions on Circuits and Systems II …, 1995 - ieeexplore.ieee.org
This paper presents the development of two efficient FFT implementation algorithms which
allow for more parallelization than the standard pipeline. M= 2/sup q/radix r parallel …
allow for more parallelization than the standard pipeline. M= 2/sup q/radix r parallel …
Architecture-oriented regular algorithms for discrete sine and cosine transforms
J Astola, D Akopian - IEEE transactions on signal processing, 1999 - ieeexplore.ieee.org
We propose fast algorithms for a class of trigonometric transforms. These algorithms have a
unified structure and simple data exchange similar to the constant geometry Pease (1968) …
unified structure and simple data exchange similar to the constant geometry Pease (1968) …
Parallel architecture for fast transforms with trigonometric kernel
We present an unified parallel architecture for four of the most important fast orthogonal
transforms with trigonometric kernel: Complex Valued Fourier (CFFT), Real Valued Fourier …
transforms with trigonometric kernel: Complex Valued Fourier (CFFT), Real Valued Fourier …
Unified architecture for divide and conquer based tridiagonal system solvers
J Lopez, EL Zapata - IEEE transactions on computers, 1994 - ieeexplore.ieee.org
The solution of tridiagonal systems is a topic of great interest in many areas of numerical
analysis. Several algorithms have recently been proposed for solving triadiagonal systems …
analysis. Several algorithms have recently been proposed for solving triadiagonal systems …
Application-specific architecture for fast transforms based on the successive doubling method
EL Zapaga, F Arguello - IEEE transactions on signal …, 1993 - ieeexplore.ieee.org
The successive doubling method is an efficient procedure for the design of fast algorithms
for orthogonal transforms of length N= r/sup n/, where the radix r is a power of 2. A …
for orthogonal transforms of length N= r/sup n/, where the radix r is a power of 2. A …