Implementation of Fractional

Fourier Transform on FPGA

Submitted by:
Supervised by:
Sakshi Gangal Ms.
P. Venkateshwari
(04420902815)
Assistant Professor, ECE
Ishika Garg
(40120902815)
ABSTRACT

 The Fractional Fourier Transform will be implemented on

the FPGA kit by using VHDL (VHSIC Hardware
Description Language).
 The platform used here is the Xilinx Spartan 3E.
 This implementation of Fractional Fourier Transform on the
FPGA can be further used in many real time applications.
Introduction
Difference between Embedded system and VLSI
In Embedded system, analog signal is to be converted into
digital signal by analog and digital converter. But in VLSI
circuits, digital signal can be used directly.
Embedded system consists of less number of transistors while
VLSI circuits consist of large number of transistors.
 FPGA
• The largest and fastest growing
FPDs are Field -Programmable Gate
Arrays where FPDs are Field
Programmable Devices, that can
programmed (and possibly
reprogrammed) after fabrication.
• It is a major type of PLDs i.e
Programmable Logic Devices.
• FPGAs are structured very much
like a gate array ASIC (Application
Specific Integrated Circuit) .
• Architecture include logic blocks,
I/O blocks, and programmable
routing, which are arranged in a
regular pattern.
ADVANTAGES OF FPGA
• FPGA are programmable devices that can be configured for a wide variety of
applications. They enable faster implementation and emulation of circuit
designs on hardware. The flexibility provided by presence of reconfigurable
elements.
• FPGAs are programmable devices that can be directly configured by the end
user without the use of an integrated circuit fabrication facility
• FPGA provide narrow logic resources which means, their logic blocks are
generally small and uncommitted.
• One advantage of an FPGA over other types of FPDs is that they generally
have much higher logic capacities than other FPDs and offer a higher ratio of
flip flops to logic .
• A higher ratio of flip-flops to logic is important because flip-flops are often
the limiting factor in designs.
Design flow of FPGA
Fast Fourier Transform
 FFT stands for Fast Fourier
Transform.
 The Fourier Transform converts
information from the time
domain into the frequency
domain
 Fast Computation Algorithm For
Discrete Fourier Transform
which adopts a divide and
conquer approach depends on the
decomposition of N-point DFT
into successively smaller size
DFTs.
Radix-4 FFT
x(n) represents a sequence of N
values where N=4ᶫ
e.g if N=16 then L=2 ,the sequence
Fractional Fourier Transform
• Fractional transform of Fourier
Transform.
• It is a family of linear transformations
generalizing the Fourier transform.
• It can be thought of as the Fourier
transform to the n-th power,
where n need not be an integer - thus, it
can transform a function to
any intermediate domain between time
and frequency.
• Equation (1) shows fractional fourier
transform.
• Equation (2) shows decomposed kernel
in terms of Hermite-Gaussian function
which are eigen functions of the Fourier
transform.
• The αth order Fractional Fourier
Transform shares the same
eigenfunctions as the Fourier
Transform, but its eigenvalues are the
αth power of the eigenvalues of the
ordinary Fourier Transform .
Discrete Fractional Fourier Transform
(DFrFT)
• Definition used – Where U is discrete Hermite-
“eigenvectors decomposition Gaussian matrix consists of
type” discrete Hermite-Gaussian
• The DfrFT has been proposed functions as in the following
using discrete Hermite- equation
Gaussian functions, for N-
point as given

Where uk[n] is kth discrete

and ‘E’ is a diagonal matrix
Hermite-Gaussian function.
which contains the eigen
The N point DFrFT Matrix for
values.
rotation angle α is defined
Applications
Fractional Fourier Transform has been an emerging
Mathematical Tool
Image Processing Applications like
Biomedical Signal Detection.
Image Registration and Image Encryption.
Security Of Registration Data Of Fingerprint Image.
Broadband Beam Forming Of LFM Signals.
Moving Target Detection And Location Ins pace Borne SAR.
References
• Thamer Muhammed Jamel, “Implementation of FFT algorithm using FPGA
technique”, 6th Jordanian International Electrical & Electronics
Engineering Conference JIEEEC, issue: 2006.
• [Online]. http://www.xilinx.com
• Yousef S. Kavian, Otto Strobel,” Implementing FFT Algorithms on FPGA”,
International Journal of Computer Science and Network Security, VOL.11
No.11, November 2011.