OPEN ACCESS
Discrete Fourier Transform (DFT) is a very useful algorithms, playing an important role in various Digital Signal Processing (DSP) applications from sonar, image processing, telecommunication, radar, etc. This paper presents architecture for computing DFT of discrete time sequences using the CORDIC algorithm. The twiddle factors, i.e. the phase rotation factors, required in DFT computations are calculated by CORDIC algorithm. Moreover, by utilizing some trigonometric identities in the DFT calculation CORDIC rotators are effectively used. The proposed architecture can be reconfigured to calculate DFT for any point discrete time sequence.
CORDIC, DFT, FPGA, ASM, Architecture
[1] J.G. Proakis, D.G. Manolakis, Digital signal processing, principles, algorithms and applications, Prentice Hall India Publication, pp. 459-462.
[2] J.E. Volder, The CORDIC trigonometric computing technique, 1959, IRE Transactions on Electronic Computers, no. 3, pp. 330-334.
[3] R. Andraka, A survey of CORDIC algorithms for FPGA based computers, February1998, Proc. of the 1998 CM/SIGDA Sixth International Symposium on FPGAs, Monterey, CA, pp. 191-200.
[4] B. Parhami, Computer Arithmetic, Oxford University Press, pp. 361-371.
[5] J. Duprat, J.M. Muller, The CORDIC Algorithm: New results for fast VLSI Implementation, 1993, IEEE Transactions on Computers, Vol. 42, pp. 168-178.
[6] R.J. Andraka, Building a high performance bit serial processor in an FPGA, Jan 1996, Proceedings of Design Super Con '96, pp. 5.1-5.21
[7] A.V. Oppenheim, Digital signal processing, 1975, Prentice Hall, pp. 541-582.
[8] P.P. Chu, FPGA prototyping by Verilog examples, John Wiley & Sons, pp. 139-141.