Novel algorithms for 2-D FFT and its inverse for image compression

Anitha, T. G. and Ramachandran, S. (2013) Novel algorithms for 2-D FFT and its inverse for image compression. In: 2013 International Conference on Signal Processing, Image Processing, and Pattern Recognition (ICSIPR), Coimbatore.

Full text not available from this repository.

Abstract

High performance Fast Fourier Transform (FFT) and Inverse FFT (IFFT) are essential in Digital Signal Processing for applications like biosignal compression, radar, image and voice processing. FFT is computationally intensive and requires real-time processing. This paper presents novel 2-D FFT and IFFT algorithms optimized for VLSI hardware implementation. Algorithms coded in MATLAB were tested on 2D color images. Reconstructed images were visually indistinguishable from original, with reconstructed quality >35 dB. © 2013 IEEE. © 2013 Elsevier B.V., All rights reserved.

Item Type: Conference or Workshop Item (Paper)
Subjects: Computer Science > Computer Graphics and Computer-Aided Design
Computer Science > Computer Vision and Pattern Recognition
Divisions: Medicine > Vinayaka Mission's Kirupananda Variyar Medical College and Hospital, Salem > Orthopaedics
Depositing User: Unnamed user with email techsupport@mosys.org
Last Modified: 10 Dec 2025 06:52
URI: https://ir.vmrfdu.edu.in/id/eprint/4205

Actions (login required)

View Item
View Item