**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**30075

##### Modified Scaling-Free CORDIC Based Pipelined Parallel MDC FFT and IFFT Architecture for Radix 2^2 Algorithm

**Authors:**
C. Paramasivam,
K. B. Jayanthi

**Abstract:**

^{2}FFT algorithm is presented. Multipliers and adders are the most important data paths in FFT and IFFT architectures. Multipliers occupy high area and consume more power. In order to optimize the area and power overhead, modified scaling-free CORDIC based complex multiplier is utilized in the proposed design. In general twiddle factor values are stored in RAM block. In the proposed work, modified scaling-free CORDIC based twiddle factor generator unit is used to generate the twiddle factor and efficient switching units are used. In addition to this, four point FFT operations are performed without complex multiplication which helps to reduce area and power in the last two stages of the pipelined architectures. The design proposed in this paper is based on multipath delay commutator method. The proposed design can be extended to any radix 2

^{n}based FFT/IFFT algorithm to improve the throughput. The work is synthesized using Synopsys design Compiler using TSMC 90-nm library. The proposed method proves to be better compared to the reference design in terms of area, throughput and power consumption. The comparative analysis of the proposed design with Xilinx FPGA platform is also discussed in the paper.

**Keywords:**
Coordinate Rotational Digital Computer(CORDIC),
Complex multiplier,
Fast Fourier transform (FFT),
Inverse fast Fourier transform (IFFT),
Multipath delay Commutator (MDC),
modified scaling free CORDIC,
complex multiplier,
pipelining,
parallel processing,
radix-2^2.

**Digital Object Identifier (DOI):**
doi.org/10.5281/zenodo.1111797

**References:**

[1] S. He and M. Torkelson, “A new approach to pipeline FFT processor,” in Proc. of IPPS, 1996, pp. 766–770.

[2] J. Lee, H. Lee, S. I. Cho, and S. S. Choi, “A high-speed two parallel radix-24 FFT/IFFT processor for MB-OFDM UWB systems,” in Proc. IEEE Int. Symp. Circuits Syst., May 2006, pp. 4719–4722.

[3] M. Ayinala, M. Brown, and K. K. Parhi, “Pipelined parallel FFT architectures via folding transformation,” IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 20, no. 6, pp. 1068–1081, Jun. 2012.

[4] S. He and M. Torkelson, “Design and implementation of a 1024-point pipeline FFT processor,” in Proc. IEEE Custom Integr. Circuits Conf., 1998, pp. 131–134.

[5] L. Yang, K. Zhang, H. Liu, J. Huang, and S. Huang, “An efficient locally pipelined FFT processor,” IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 53, no. 7, pp. 585–589, Jul. 2006.

[6] A. M. Despain, “Fourier transform computers using CORDIC iterations,” IEEE Trans. Comput., vol. C-23, pp. 993–1001, Oct. 1974.

[7] M. A. Sánchez, M. Garrido, M. L. López, and J. Grajal, “Implementing FFT-based digital channelized receivers on FPGA platforms,” IEEETrans. Aerosp. Electron. Syst., vol. 44, no. 4, pp. 1567–1585, Oct. 2008.

[8] A. Cortés, I. Vélez, and J. F. Sevillano, “Radix r k FFTs: Matricial representation and SDC/SDF pipeline implementation,” IEEE Trans. Signal Process., vol. 57, no. 7, pp. 2824–2839, Jul. 2009.

[9] H. L. Groginsky and G. A.Works, “A pipeline fast Fourier transform,” IEEE Trans. Comput., vol. C-19, no. 11, pp. 1015–1019, Oct. 1970.

[10] E. H. Wold and A. M. Despain, “Pipeline and parallel-pipeline FFT processors for VLSI implementation,” IEEE Trans. Comput., vol. C-33, no. 5, pp. 414–426, May 1984.

[11] S.-N. Tang, J.-W. Tsai, and T.-Y. Chang, “A 2.4-GS/s FFT processor for OFDM-based WPAN applications,” IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 57, no. 6, pp. 451–455, Jun. 2010.

[12] H. Liu and H. Lee, “A high performance four-parallel 128/64-point radix-24 FFT/IFFT processor for MIMO-OFDM systems,” in Proc. EEE Asia Pacific Conf. Circuits Syst., 2008, pp. 834–837.

[13] L. Liu, J. Ren, X. Wang, and F. Ye, “Design of low-power, 1 GS/s throughput FFT processor for MIMO-OFDM UWB communication system,” in Proc. IEEE Int. Symp. Circuits Syst., 2007, pp. 2594–2597.

[14] J. Lee, H. Lee, S. I. Cho, and S.-S. Choi, “A high-speed, low-Complexity radix-24 FFT processor for MB-OFDM UWB systems,” in Proc. IEEE Int.Symp. Circuits Syst., 2006, pp. 210–213.

[15] N. Li and N. P. van der Meijs, “A radix 22 based parallel pipeline FFT processor for MB-OFDM UWB system,” in Proc. IEEE Int. SOC Conf.,2009, pp. 383–386.

[16] S.-I. Cho, K.-M. Kang, and S.-S. Choi, “Implemention of 128-pointfast Fourier transform processor for UWB systems,” in Proc. Int.Wirel. Commun. Mobile Comput. Conf., 2008, pp. 210–213.

[17] W. Xudong and L. Yu, “Special-purpose computer for 64-point FFT based on FPGA,” in Proc. Int. Conf. Wirel. Commun. Signal Process., 2009, pp. 1–3.

[18] Y. Chen, Y. Tsao, Y. Wei, C. Lin, and C. Lee, “An indexed-scaling pipelined FFT processor for OFDM-basedWPAN applications,” IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 55, no. 2, pp. 146–150, Feb. 2008.

[19] Pushparaj, B and Paramasivam, C., "High performance and low power modified radix-25 FFT architecture for high rate WPAN application," in Emerging Trends in VLSI, Embedded System, Nano Electronics and Telecommunication System (ICEVENT), 2013 International Conference on, vol., no., pp.1-4, 7-9 Jan. 2013.

[20] C. Cheng and K.K. Parhi, “High-throughputVLSI architecture for FFT computation,” IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 54, no. 10, pp. 863–867, Oct. 2007.

[21] J. A. Johnston, “Parallel pipeline fast Fourier transformer,” IEE Proc. F Commun. Radar Signal Process., vol. 130, no. 6, pp. 564–572, Oct. 1983.

[22] B. Gold and T. Bially, “Parallelism in fast Fourier transform hardware,” IEEE Trans. Audio Electroacoust., vol. 21, no. 1, pp. 5–16, Feb. 1973.

[23] E. E. Swartzlander, W. K. W. Young, and S. J. Joseph, “A radix 4 delay commutator for fast Fourier transform processor implementation,” IEEE J. Solid-State Circuits, vol. 19, no. 5, pp. 702–709, Oct.1984.

[24] J. H. McClellan and R. J. Purdy, “Applications of digital signal processing to radar,” in Applications of Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1978, ch. 5.

[25] E. E. Swartzlander, W. K. W. Young, and S. J. Joseph, “A radix-4 delay commutator for fast Fourier transform processor implementation,” IEEE J. Solid-State Circuits, vol. SC-19, no. 5, pp. 702–709, Oct. 1984.

[26] E. E. Swartzlander, V. K. Jain, and H. Hikawa, “A radix-8 wafer scale FFT processor,” J. VLSI Signal Process., vol. 4, no. 2/3, pp. 165–176, May 1992.

[27] G. Bi and E. V.Jones, “A pipelined FFT processor for word sequential data,” IEEE Trans. Acoust., Speech, Signal Processing, 37(12):1982-1985, Dec. 1989. ^^28] E. Bidet, D. Castelain, C. Joanblanq, and P. Stenn, “A fast singlechip implementation of 8192 complex point FFT,” IEEE J. Solid-State Circuits, 30(3):300-305, Mar. 1995.

[29] Erdal Oruklu., Xin Xiao., Jafar Saniie, “Reduced memory and Low Power architecture for CORDIC-based FFT Processor,” Journal of Signal Processing, volume 66 issue2 (2012) 129-134.

[30] Malashri, A and Paramasivam, C, "Low power and memory efficient FFT architecture using modified CORDIC algorithm," in Information Communication and Embedded Systems (ICICES), 2013 International Conference on, vol., no., pp.1041-1046, 21-22 Feb. 2013.

[31] Paramasivam, C and Dr.K.B. Jayanthi, "Modified Scaling-Free CORDIC based in Place FFT and IFFT architecture for Radix 22 Algorithm," in Innovations in Computer Science and Information Technology (ICICSIT), 2015 International Conference on, pp 114-118,28-29 August,2015.

[32] A. V. Oppenheim, R.W. Schafer, and J.R. Buck, Discrete-Time Signal Processing, 2nd ed. Englewood Cliffs, NJ, USA: Prentice Hall, 1998.