Cover

“Implementation of the FFT (Fast Fourier Transform) Transform over a

Field Programmable Gate Array (FPGA).

Rogger Steven Arce Barba.

JULY 2020.

Universidad Técnica Particular de Loja (UTPL)

Ingeniería en Telecomunicaciones.

Tratamiento Digital de Señales.

1
Objectives
• Know the state of the art of FPGA technology.

• Know the state of the art of FFT algorithms.

• Study the procedure for implementing the FFT transform over an FPGA.

2
Resumen

En la actualidad, la densidad de transistores admisible en los dispositivos electrónicos es

tan grande que la integración de sistemas digitales completos en un único circuito
integrado (CI), ha logrado ir poco a poco haciendo que surjan nuevos métodos de hacer
control y a su vez de sistemas. El estado del arte apunta a que se recurre cada vez más a
los sistemas digitales con el fin de dotar de cierto grado de inteligencia y dar capacidad
de operar a los sistemas y controladores bajo ciertas condiciones imprevistas, teniendo
como la principal restricción la respuesta y ejecución en tiempo real. En este artículo se
hace una revisión del estado del arte del uso de la tecnología de los Arreglos de
Compuertas Programables en Campo (FPGAs) para diferentes aplicaciones de
instrumentación y control de convertidores de electrónica de potencia además se realiza
una primera aproximación para desarrollar procesadores en él, haciendo Sistemas sobre
Chip (SoC).
Abstract

Today, the allowable transistor density in electronic devices is so large that the
integration of complete digital systems into a single integrated circuit (CI) has gradually

managed to bring about new methods of control and systems in turn. The state of the
art suggests that digital systems are increasingly used in order to provide a certain
degree of intelligence and give the ability to operate systems and controllers under
certain unforeseen conditions, taking as the main restriction the response and execution
in real time. This article reviews the state of the art of using Field Programmable

Gates Arrangements (FPGAs) technology for different instrumentation and control

applications of power electronics converters and performs a first approximation to
develop processors on it, making Systems on Chip (SoC).

3
Table of contents
Cover ................................................................................................................................ 1
Objectives ........................................................................................................................ 2
Resumen .......................................................................................................................... 3
Abstract ....................................................................................................................... 3
Chapter 1 ......................................................................................................................... 5
Topic 1: Know the state of the art of FPGA technology. ............................................ 5
Chapter 2 ......................................................................................................................... 7
Topic 2: Know the state of the art of FFT algorithms. ................................................ 7
Chapter 3 ....................................................................................................................... 10
Topic 3: Study the procedure for implementing the FFT transform on an FPGA. .... 10
Conclusions ................................................................................................................... 12
Bibliography .................................................................................................................. 13

4
 Chapter 1

Topic 1: Know the state of the art of FPGA technology.

Hawthorn E, and Torres D. State that: With the emergence of FPGAs, there has been

improving and has been making a technological breakthrough for the development

of computing applications, due to the improvements in speed and logical density

contained in such devices. Similarly, the author in [1] cites that the progress of the

architectures of the device itself and the applications developed with himself,

would maintain great progress so that there would be a narrowing in the methods

to design applications due to the change in: speed, costs, time and market.

Hawthorn E, and Torres D. Mention that: In the 1994 analysis of FPGAs for

Development of digital signal processing applications concluded that, these can

be quickly reconfigured to provide different digital logic functions, so that when

an FPGA is incorporated into itself computer-like logic circuits with a stored

program, the result converges on a machine where the designer can program both

the software and describe the hardware that will run such software giving great

versatility. Although it is noted in [4] that the method of computing using

reconfigurable devices and systems covers the space between the two traditional

methods shown in Fig. 2, a way in which hardware processing efficiency and a

high degree of flexibility are available. These systems also have the particularity

that they use hardware whose functionality can be modified at run time, providing

great flexibility without compromising performance.

Hawthorn E, and Torres D, mention that: "FPGAs can be used as microcontrollers where

there is also the ability to have one or more processors with specific peripherals and

5
computation accelerators in hardware, a capability that extends versatility for industrial

applications."

Advantages of using FPGAs are mentioned, arguing that, to implement real-time efficient

computing and control, designers have had a wide variety of devices of high flexibility,

good efficiency and low cost. Some of them have been microprocessors, microcontrollers,

digital signal processors (DSPs) and even digital signal controllers (DSCs).

6
 Chapter 2

Topic 2: Know the state of the art of FFT algorithms.

Algoritmo de Cooley-Tukey

Elliott, Douglas F.; Rao, K. Ramamohan (1982). He states that: By far the FFT

most often is the Cooley-Tukey algorithm. This is a split-and-conquer algorithm

that recursively breaks a DFT of any compound size N'N 1 N 2 into many

smaller DFT sizes N 1 and N 2, along with O N (N) multiplications by complex

unit roots traditionally called twiddle factors (after Knight and Sande, 1966).

This method (and the general idea of an FFT) was popularized by a publication

by Cooley and Tukey in 1965, but it was later discovered that these two authors

had independently re-invented an algorithm known to Carl Friedrich Gauss

around 1805 (and subsequently rediscovered several times in limited forms).

The best known use of the Cooley-Tukey algorithm is N to split the transform into

two pieces of N/2 size at each step, and therefore is limited to power-of-two sizes,

but any factorization can be used in general (as was known 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 reorganize

the algorithm to avoid explicit repetition. Also, because the Cooley-Tukey

algorithm breaks the DFT into smaller FTTs, it can be arbitrarily combined with

any other algorithm for the DFT, such as those described below.

7
Other FFT algorithms

Main articles: primary FFT-factor algorithm, Bruun's FFT algorithm, FFT Rader

algorithm, Bluestein's FFT algorithm, and Fast Fourier Transform hexagonal

There are other FFT algorithms other than Cooley-Tukey.

Cornelius Lanczos did pioneering work on FFT and ECA (Fast Sampling of Fourier

method) with GC Danielson (1940).

For N N'N 1 N 2 with cousins with each other, N 1 and N 2, you can use the first

factor (Good-Thomas) algorithm (PFA), based on the Chinese theorem of the rest, which

factor the DFT in a similar way aey Cool-Tukey but without the rotation factors. The

Rader-Brenner algorithm (1976) is a Cooley-Tukey-like factorization but with purely

imaginary rotation factors, reducing multiplication at the cost of increased additions and

reducing numerical stability; which was later replaced by the split-radix variant of

Cooley-Tukey (which achieves the same multiplication count but with a lower number of

additions and without sacrificing accuracy). Algorithms that will recurrently factor DFT

into smaller operations other than DFT include the Bruun and QFT algorithms. (The

Rader-Brenner and QFT algorithms were proposed by power-of-two sizes, but may be

adapted to the general compound of n . Bruun's algorithm applies to even arbitrary

compound sizes.) Bruun's algorithm, in particular, is based on the interpretation of FFT

N
as a recursive factorization of polynomial z - 1, here in polynomials of actual
- 2 M M
coefficients of the form z 1 and z + az + 1.

Another polynomial point of view is exploited by the Winograd FFT algorithm, which
N
factors z - 1 into cyclonomials -these often have coefficients of 1, 0 or -1, and therefore

require few (if any) multiplications, so Winograd can be used to obtain a minimum of

FFT-multiplication and is often used to find efficient algorithms for small factors. In fact,

Winograd showed that the DFT can be calculated with only O (N N ) irrational

8
multiplications, leading to a proven achievable bound for the number of multiplications

for the lower two power sizes; Unfortunately, this comes at the cost of many more

additions, an unre favorable compromise solution in modern processors with hardware

multipliers. In, Winograd also makes use of PFA, as well as a Prime Size FFT Rader

algorithm. prime

Rader's algorithm, exploiting the existence of a generator for the multiplicative group

first module N, expresses a prime n size DFT as a cyclic convolution of (compound)

size N-1, which can then be computed by a pair of ordinary FTFs through the convolution

theorem N (although Winograd uses other convolution methods). Another first size FFT

is due to LI Bluestein, and sometimes it is called the chirp-z algorithm; It also re-

expresses a DFT as a convolution, but this time the same size (which can be filled with

zeros at a power of two and evaluated by radix-2 FFT Cooley-Tukey, for example),

through identity

Hexagonal Fast Fourier Transform objetivos en el cálculo de una FFT eficiente para los

datos muestreados hexagonal mediante el uso de un nuevo esquema de direccionamiento

para las redes hexagonales, llamada matriz de conjuntos de direccionamiento (ASA).

9
 Chapter 3

Topic 3: Study the procedure for implementing the FFT transform on an

FPGA.

There is no doubting the developmental openness from the appearance and demonstration

of the series and the transformation of Fourier (Barbu, Kaminsky, and Trahan, 2005;

Donnelly, 2006; Jutamulia, Song, and Zhang, 2007).

Riaño J, Ladino C, Martinez F.(2012, Vol. 9, 21–32). They mention that: In several of its

applications, especially in engineering, it has currently allowed to develop a large number

of solutions to different problems and demands that are imposed in the analysis of

electronic signals. For this reason it is completely justifiable to give at least a general look

at this tool and more precisely to one of the possible applications.

The calculation or processing of the Fourier transform manually is somewhat

cumbersome and inefficient in terms of time and resources, even when it is

implemented by software using the FFT (Fast Fourier Transform) algorithm (Bian,

Zhou, and Li, 2008; Yanhui Liu, Nie, and Liu, 2008) given the particular requisitions

of applications. Therefore, given the importance and analytical capacity of the

strategy, the need arises to perform such calculation efficiently, then opting for

dedicated implementations embedded in a certain hardware (Hori, 2008; Kauker,

Sanftmann, Frey, and Ertl, 2010; Prasad, Ray, and Dhar, 2010; van der Byl,

Wilkinson, and Inggs, 2011).

The evolution of control schemes for converters is electronic power requires ever higher

processing capabilities, with high time and resource consumption. In terms of

compatibility, one of the most important challenges is the one related to harmonic

distortion and power factor. In design

10
electronic systems for measurement and correction, one of the most important algorithms

is that of the FFT (Fast Fourier Transform). The FFT is an efficient algorithm that allows

you to calculate the discrete Fourier transform (TFD) and its inverse. Given the

characteristics of the transform, it is possible to analyze a signal seen from its frequency

spectrum. This article documents the design of an FFT embedded in an FPGA (Field

Programmable Gate Array) for the analysis of harmonic content on low-power current

signals.

Given the characteristics of the transform, it is possible to analyze a signal seen from its

frequency spectrum, which will yield accurate information to determine its quality factor

and then be corrected if necessary. It is this research, an efficient and rapid

implementation of the FFT is sought for use in measurement equipment and active

correction of the power factor, applications in which the analysis of the harmonic content

of the currents is important (Vasquez and Martínez, 2011). To do this, a dedicated parallel

implementation is chosen on an FPGA (Calderón and Parra, 2010), which is fed directly

by the current samples from a microcontroller.

11
Conclusions

1. Through this research I was able to understand that the FPGA is a semiconductor

silicon device with the ability to be able to program a desired operation.

2. Thanks to this research I was able to understand that FFT is most often used is the

Cooley-Tukey algorithm. This is an algorithm divides and you will conquer that

recursively breaks a DFT of any size compound. .

3. FPGAs have been improving and technological advances have been made for the

development of computing applications, due to improvements in speed and logical

density contained in such devices.

12
Bibliography

1. Riaño, J., Ladino, C., & Martínez, F. (2012). Implementation of the FFT transform

on an FPGA oriented to your application in electronic power converters. Tekhn,

9,21-32.

2. Hawthorn, E., & Torres, State of the Art of FPGAs for Application Control.

3. Riaño, J., Ladino, C., & Martínez, F. (2012). Implementation of the FFT transform on an FPGA

oriented to your application in electronic power converters. Tekhn, 9,21-32.

4. Elliott, Douglas F.; Rao, K. Ramamohan (1982). Quick transforms: algorithms, analysis,

applications. New York, USA: Academic Press .

5. Brigham, E. Orán (2002). "El Fast Fourier Transform". Nueva York, EE. UU.: Prentice-Hall .

13