Low power VLSI implementation of paired transform based FFT

dc.contributor.advisorJohn, Eugene
dc.contributor.authorMandava, Bhargavi
dc.contributor.committeeMemberGrigoryan, Artyom
dc.contributor.committeeMemberDuan, Lide
dc.date.accessioned2024-02-12T15:39:56Z
dc.date.available2024-02-12T15:39:56Z
dc.date.issued2014
dc.descriptionThis item is available only to currently enrolled UTSA students, faculty or staff. To download, navigate to Log In in the top right-hand corner of this screen, then select Log in with my UTSA ID.
dc.description.abstractThe Fourier transformation is one of the most widely used tool in digital signal and image processing. In digital signal processing, this transform has led to the development of other fast discrete transforms such as Hartley transform, Hadamard transform, Discrete Fourier Transform etc. Discrete Fourier Transform is equivalent to continuous Fourier Transform defined over discrete time samples. Several efficient computer algorithms were proposed in the past for calculation of Discrete Fourier Transform (DFT) known as Fast Fourier Transform (FFT) algorithms. In Fourier Transform, the structure comprises of a unitary transformation also known Paired Transform. Paired Transform method is an advanced technique where the results are calculated in much earlier stages, making this technique more effective than the Fast Fourier Transform. Paired Transform can be further modified to reduce the computation time by Fast Paired Transform technique, by splitting the DFT differently. This research concentrates on the low power design, implementation and performance analysis comparison of Fast Fourier Transform algorithms. Radix-2, Paired Transform and Fast Paired Transform algorithms are the three algorithms considered in this thesis. HDL implementation of 4-, 8-, 16-, and 32-, 64- and 128-point algorithms for Radix-2 FFT, Paired and Fast Paired Transform with complex inputs is performed. Each N-point (N = 4, 8, 16, 32, 64, 128) design for three transforms is analyzed based on power, area and delay. In this research each design is realized by 180nm technology node. The results of simulation for Radix-2, Paired and Fast Paired algorithms are obtained from Cadence Soc Encounter RTL-to-GDSII. Simulation results shows that the Fast Paired Transform consumes less power, area and delay compared to other transforms investigated in this research. The optimization in the number of arithmetic operations in Fast Paired technique makes it more efficient for computation as well as hardware implementation.
dc.description.departmentElectrical and Computer Engineering
dc.format.extent97 pages
dc.format.mimetypeapplication/pdf
dc.identifier.isbn9781321474497
dc.identifier.urihttps://hdl.handle.net/20.500.12588/4507
dc.languageen
dc.subjectFourier transformation
dc.subjectImage processing
dc.subjectDigital signal processing
dc.subject.classificationComputer engineering
dc.titleLow power VLSI implementation of paired transform based FFT
dc.typeThesis
dc.type.dcmiText
dcterms.accessRightspq_closed
thesis.degree.departmentElectrical and Computer Engineering
thesis.degree.grantorUniversity of Texas at San Antonio
thesis.degree.levelMasters
thesis.degree.nameMaster of Science

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Mandava_utsa_1283M_11522.pdf
Size:
3.63 MB
Format:
Adobe Portable Document Format