FPGA implementation

FPGA Implementation of 1024-point FFT/IFFT Processor

I. Introduction Fast Fourier transform (FFT), an efficient technique to perform discrete Fourier transform (DFT), is the most important block in the signal processing domain. FFT is used to convert a signal in time domain to its frequency domain. On the other hand, inverse FFT (IFFT) block is used to convert the signal in frequency …

FPGA Implementation of 1024-point FFT/IFFT Processor Read More »

FPGA Implementation

In this Tutorial, a detailed discussion on FPGA implementation of complex digital circuits is discussed. First, a brief overview on FPGA is given then the steps involved in implementing a circuit are illustrated. Specific examples are shown to illustrate the steps. +20

FPGA: Basic Overview

An FPGA is a device that contains a matrix of reconfigurable gate array logic circuitry. When a FPGA is configured, the internal circuitry is connected in a way that creates a hardware implementation of the software application. Unlike processors, FPGAs use dedicated hardware for processing logic and do not have an operating system. FPGAs are …

FPGA: Basic Overview Read More »

FPGA Implementation of 8-Point FFT

Previously many tutorials are published on how to design the basic building blocks of a complex digital system. In this tutorial, we are going to implement a digital system to demonstrate the techniques involved in implementing a system. Fast Fourier Transform (FFT) is a very popular transform technique used in many fields of signal processing. …

FPGA Implementation of 8-Point FFT Read More »


The basic building blocks of digital systems are explained in the previous tutorials. In this tutorial section, we will go through designing the complex architectures. We will start by implementing the basic designs and then we will implement more complex designs. Concurrently we will evaluate the performance of the designs in terms of timing, hardware …

Architectures Read More »

Shopping Basket