Design of Novel FFT Based Image Compression Algorithms and Architectures

Anitha T.G, K Vijayalakshmi


Image Compression is a pivotal step in Digital Image Processing area. Image Fourier Transform is long established algorithm which converts an Image from spatial domain to frequency domain. New Algorithms for FFT, Quantization and their inverses have been developed using Algorithmic State Machine Charts. Subsequently, novel Architectures have been designed using massively parallel and highly pipelined circuits. These Architectures have been coded using Verilog Hardware Description language conforming to RTL coding guidelines, simulated and tested for color images. The quality of the reconstructed images is better than 35 dB. The reconstructed images are indistinguishable from the original images. The target clock rate is 50 MHz and compression achieved is greater than 15.


Compression, FFT, IFFT, Inverse Quantization, Quantization and Verilog RTL Coding

Full Text:



S Jayaraman, S Esakkirajan and T Veerakumar ,“Digital Image Processing” by Tata McGraw Hill l Publications.

Rafael C. Gonzalez, Richard E. Woods, “Digital Image Processing “ by II Edition Prentice Hall Publications.

S.Uzun and A. Amira A. Bouridane “FPGA Implementations of Fast Fourier Transforms for Real-Time Signal and Image Processing “.

More T. V. and Panat A. R., “Comparative Study of Pipelined Reconfigurable FFT Processor”, International Journal of Knowledge Engineering, Volume 3, Issue 1, pp. 107-110, 2012

Gokhan Polat, Sıtkı Ozturk, and Mehmet Yakut, “Design and Implementation of 256

Point Radix-4 100 Gbit/s FFT Algorithm into FPGA for High Speed Applications”,

ETRI Journal, Vol. 37, pp. 667-676, Aug. 2015

G A Jullien, “High performance Arithmetic processor for DSP systems,” VLSI Signal Processing Technology, Kluwer Academic Publishers, 1994.

Enis Çerri and Marsida Ibro , “FFT Implementation on FPGA using Butterfly Algorithm” International Journal of Engineering Research & Technology, Vol.4-Issue 02, February 2014.

Mohammad Nazmul Haque, Mohammad Shorif Uddin, “Accelerating Fast Fourier Transformation for Image Processing using Graphics Processing Unit” ,Journal of Emerging Trends in Computing and Information Sciences, Volume 2 No.8, August 2011.

Anitha R, Bagyaveereswaran V, “Braun’s Multiplier Implementation using FPGA with Bypassing Techniques” International Journal of VLSI design & Communication Systems

Juanli Hu, Jiabin Deng and Juebo Wu “Image Compression Based on Improved FFT Algorithm”, Journal of Networks, VOL. 6, NO. 7, JULY 2011

Anitha T G and S. Ramachandran , “Novel Algorithms for 2-D FFT and their Inverses for Image Compression,” Signal Processing, Image Processing & Pattern Recognition (ICSIPR), IEEE Publishers, pp 62-65. Feb 2013

Riya Saini, R.D.Daruwala, “Efficient Implementation of Pipelined Double Precision Floating Point Multiplier” IJERA Vol. 3, Issue 1, January -February 2013, pp.1676-1679

Zou Wen, Qiu Zhongpan and Song Zhijun, “FPGA Implementation of efficient FFT algorithm based on complex sequence” by 2010 IEEE pp 614-617

N. Keshaveni, S. Ramachandran and K. S. Gurumurthy, “Design and FPGA Implementation of Integer Transform and Quantization Processor and Their Inverses for H.264 Video Encoder”, International Journal of Computer Science and Communication, pp. 43-50, Vol. 1,No. 1,January- June 2010.

Dr.Thamer M Jamel “Implementation of FFT algorithm using FPGA technique”, Jordanian International Electrical & Electronics Engineering Conference JIEEEC” 2006.

Nick Mehta “Design how to design Xilinx 7 series FPGA User Guide Lite”,19/4/2011

Tutorial on FPGA Design Flow based on Xilinx ISE WebPack and ISim version 2.0 “Implementation And Analysis Of FPGA-Based Design Of 32-Bit FPAU” in Spring Publishers 2014, pp .80

Chu Chao, Zhang Qin,Xie Yingke1 Han Chengde ” Design of a High Performance FFT Processor Based on FPGA” ,2005 IEEE. pp 920-923.


Dr. S. Ramachandran, “Digital VLSI Systems Design”, Published by Springer.



  • There are currently no refbacks.

Copyright (c) 2017 Anitha T.G, K Vijayalakshmi

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.