## Introduction

A **Fast Fourier transform** (**FFT**) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex-number arithmetic to group theory and number theory; this article gives an overview of the available techniques and some of their general properties, while the specific algorithms are described in subsidiary articles linked below.

A DFT decomposes a sequence of values into components of different frequencies. This operation is useful in many fields (see discrete Fourier transform for properties and applications of the transform), but computing it directly from the definition is often too slow to be practical. An FFT is a way to compute the same result more quickly: computing a DFT of *N* points in the obvious way, using the definition, takes O(*N* ^{2}) arithmetical operations, while an FFT can compute the same result in only O(*N* log *N*) operations. The difference in speed can be substantial, especially for long data sets where *N* may be in the thousands or millions—in practice, the computation time can be reduced by several orders of magnitude in such cases, and the improvement is roughly proportional to *N*/log(*N*). This huge improvement made many DFT-based algorithms practical; FFTs are of great importance to a wide variety of applications, from digital signal processing and solving partial differential equations to algorithms for quick multiplication of large integers.

## Cooley–Tukey algorithm

By far the most common FFT is the Cooley–Tukey algorithm. This is a divide and conquer algorithm that recursively breaks down a DFT of any composite size N = N_{1}N_{2} into many smaller DFTs of sizes N_{1} and N_{2}, along with O(N) multiplications by complex roots of unity traditionally called twiddle factors.

This method (and the general idea of an FFT) was popularized by a publication of J. W. Cooley and J. W. Tukey in 1965, but it was later discovered (Heideman & Burrus, 1984) that those two authors had independently re-invented an algorithm known to Carl Friedrich Gauss around 1805 (and subsequently rediscovered several times in limited forms).

The most well-known use of the Cooley–Tukey algorithm is to divide the transform into two pieces of size *N* / 2 at each step, and is therefore limited to power-of-two sizes, but any factorization can be used in general (as was known to both Gauss and Cooley/Tukey). These are called the **radix-2** and **mixed-radix** cases, respectively (and other variants such as the split-radix FFT have their own names as well). Although the basic idea is recursive, most traditional implementations rearrange the algorithm to avoid explicit recursion. Also, because the Cooley–Tukey algorithm breaks the DFT into smaller DFTs, it can be combined arbitrarily with any other algorithm for the DFT, such as those described below.

## Using the code

First, we read the selected image into a 2D array of integers; we are using a pointer based image reading for the same. The code is as follows:

private void ReadImage()
{
int i, j;
GreyImage = new int[Width, Height]; Bitmap image = Obj;
BitmapData bitmapData1 =
image.LockBits(new Rectangle(0, 0, image.Width, image.Height),
ImageLockMode.ReadOnly, PixelFormat.Format32bppArgb);
unsafe
{
byte* imagePointer1 = (byte*)bitmapData1.Scan0;
for (i = 0; i < bitmapData1.Height; i++)
{
for (j = 0; j < bitmapData1.Width; j++)
{
GreyImage[j, i] = (int)((imagePointer1[0] +
imagePointer1[1] + imagePointer1[2]) / 3.0);
imagePointer1 += 4;
} imagePointer1 += bitmapData1.Stride - (bitmapData1.Width * 4);
} } image.UnlockBits(bitmapData1);
return;
}

FFT of an image will be a complex array; we need to store this thing, so we define a complex structure for the same.

struct COMPLEX
{
public double real, imag;
public COMPLEX(double x, double y)
{
real = x;
imag = y;
}
public float Magnitude()
{
return ((float)Math.Sqrt(real * real + imag * imag));
}
public float Phase()
{
return ((float)Math.Atan(imag / real));
}
}

The FFT is implemented using the separability property of a Fourier transform. We find the FFT of the rows of an image and then the columns.

## Points of interest

The Fourier plot is generated, frequency shifting is performed on the complex Fourier coefficients array, and using dynamic range compression, we generate the Fourier plot.

Original C++ code used for Reference can be found Here (Thank to Paul Bourke)

http://local.wasp.uwa.edu.au/~pbourke/miscellaneous/dft/

##

## History

This is my first article on FFT, any suggestions and modifications are welcome.