Novel Algorithm and Architecture for FFT and its Inverse for Image Compression

dc.contributor.guideVijayalakshmi, K
dc.coverage.spatial
dc.creator.researcherAnitha, T G
dc.date.accessioned2023-02-09T09:37:28Z
dc.date.available2023-02-09T09:37:28Z
dc.date.awarded2019
dc.date.completed2019
dc.date.registered2015
dc.description.abstractIn the field of Digital Signal Processing, Fast Fourier Transform facilitates signal newlineanalysis with the aid of digital computers. It is also one of the fundamental algorithm families newlinein Digital Image Processing and has wide variety of applications in Image Transformation, newlineSharpening, Smoothing, Edge detection are a few common applications. Fast Fourier newlineTransform is the utilization of algorithms to perform image processing operations on digital newlineimages and also rapidly evolving with the emerging applications of Engineering and Science. newlineThe broad spectrum applications of Digital Image Processing include remote sensing newlineapplications, medical imaging, robotics, acoustic image processing and multimedia newlinetransmission. newlineThe major objective of the effort is developing algorithm for designing VLSI newlinearchitecture for Fast Fourier Transform and itand#8223;s Inverse that follows parallelism, pipelining newlineand regularity methods. These methods are adopted to reduce the large computational time in newlineFFT and its Inverse computation. Further to employ the designed algorithm to achieve newlinecompression of color images and medical images. Look up table method is presented for newlinefinding the Fast Fourier Transform, which forms the part of compression algorithm. The newlinedesigned and developed algorithm as a first part, existing Huffman coding as second part of newlinecompression algorithm is utilized to demonstrate the complete application. The last part the newlinedesign to synthesize the algorithm using Xilinx ISE 14.2 targeted on to Spartan 6 FPGA newlineboard. newlineImage Compression is the vital step in Digital Image Processing used to the reduce newlinestorage or transmission time. The objective of Image Compression is to reduce redundancy of newlineimage data to meet the fast growing developments in Digital Image Processing applications newlineand internet technology. Also to meet the growing requirement of digital image storage and newlinedigital technology, compression is essential for storing more images and for increasing newlinetransmission rate. newlineFast Fourier Transform is a proved algorithm t
dc.description.note
dc.format.accompanyingmaterialDVD
dc.format.dimensions
dc.format.extent170
dc.identifier.urihttp://hdl.handle.net/10603/457392
dc.languageEnglish
dc.publisher.institutionDepartment of Electronics and Communication Engineering
dc.publisher.placeBelagavi
dc.publisher.universityVisvesvaraya Technological University, Belagavi
dc.relation
dc.rightsuniversity
dc.source.universityUniversity
dc.subject.keywordEngineering
dc.subject.keywordEngineering and Technology
dc.subject.keywordEngineering Electrical and Electronic
dc.titleNovel Algorithm and Architecture for FFT and its Inverse for Image Compression
dc.title.alternative
dc.type.degreePh.D.

Files

Original bundle

Now showing 1 - 5 of 14
Loading...
Thumbnail Image
Name:
01_title.pdf
Size:
12.42 KB
Format:
Adobe Portable Document Format
Description:
Attached File
Loading...
Thumbnail Image
Name:
02_prelim pages.pdf
Size:
128.41 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
03_content.pdf
Size:
196.1 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
04_abstract.pdf
Size:
86.58 KB
Format:
Adobe Portable Document Format
Loading...
Thumbnail Image
Name:
05_chapter 1.pdf
Size:
276.76 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.79 KB
Format:
Plain Text
Description: