DOCSLIB.ORG

A Novel High-Throughput Fft Architecture for Wireless

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Novel High-Throughput Fft Architecture for Wireless A NOVEL HIGH-THROUGHPUT FFT ARCHITECTURE FOR WIRELESS COMMUNICATION SYSTEMS A Thesis Presented to the Faculty of San Diego State University In Partial Fulfillment of the Requirements for the Degree Master of Science in Electrical Engineering by Nikhilesh Vinayak Bhagat Spring 2016 iii Copyright c 2016 by Nikhilesh Vinayak Bhagat iv DEDICATION To Aai and Pappa. v ABSTRACT OF THE THESIS A Novel High-Throughput FFT Architecture for Wireless Communication Systems by Nikhilesh Vinayak Bhagat Master of Science in Electrical Engineering San Diego State University, 2016 The design of the physical layer (PHY) of Long Term Evolution (LTE) standard is heavily influenced by the requirements for higher data transmission rate, greater spectral efficiency, and higher channel bandwidths. To fulfill these requirements, orthogonal frequency division multiplex (OFDM) was selected as the modulation scheme at the PHY layer. The discrete Fourier transform (DFT) and the inverse discrete Fourier transform (IDFT) are fundamental building blocks of an OFDM system. Fast Fourier transform (FFT) is an efficient implementation of DFT. This thesis focuses on a novel high-throughput hardware architecture for FFT computation utilized in wireless communication systems, particularly in the LTE standard. We implement a fully-pipelined FFT architecture that requires fewer number of computations. Particularly, we discuss a novel approach to implement FFT using the combined Good-Thomas and Winograd algorithms. It is found that the combined Good-Thomas and Winograd FFT algorithms provides a significantly more efficient FFT solution for a wide range of applications. A detailed analysis and comparison between different FFT algorithms and potential architectures suitable for the requirements of the LTE standard is presented. Theoretical results have been validated by the implementation of the proposed approach on a field-programmable gate array (FPGA). As demonstrated by the mathematical analysis, a significant reduction has been achieved in all the design parameters, such as computational delay and the number of arithmetic operations as compared to conventional FFT architectures currently used in various wireless communication standards. It is concluded that the proposed algorithm and its hardware architecture can be efficiently used as an enhanced alternative in the LTE wireless communication systems. vi TABLE OF CONTENTS PAGE ABSTRACT .................................................................................... v LIST OF TABLES.............................................................................. viii LIST OF FIGURES ............................................................................ ix ACKNOWLEDGMENTS ..................................................................... xi CHAPTER 1 INTRODUCTION ..................................................................... 1 1.1 Review of the FFT Algorithms ................................................. 1 1.2 Motivation ....................................................................... 2 1.3 Contribution of Thesis .......................................................... 3 1.4 Organization of Thesis .......................................................... 3 2 FAST FOURIER TRANSFORM ALGORITHMS................................... 4 2.1 Mapping to Two Dimensions ................................................... 4 2.2 The Cooley-Tukey FFT Algorithm ............................................. 5 2.2.1 Workload Computation.................................................... 7 2.3 Radix-2 Cooley-Tukey FFT .................................................... 9 2.3.1 Architecture of the Radix-2 FFT.......................................... 11 2.3.2 Workload Computation.................................................... 13 2.4 Radix-4 Cooley-Tukey FFT .................................................... 14 2.4.1 Architecture of Radix-4 FFT .............................................. 16 2.4.2 Workload Computation.................................................... 18 2.5 The Good-Thomas Prime-Factor Algorithm ................................... 19 2.5.1 Workload Computation.................................................... 22 2.5.2 Comparison and Summary of the FFT Algorithms ...................... 24 3 FAST FOURIER TRANSFORMS via CONVOLUTION ........................... 26 3.1 Rader’s Algorithm............................................................... 26 3.1.1 Workload Computation.................................................... 30 3.2 Winograd Short Convolution ................................................... 31 3.3 Winograd Fourier Transform Algorithm ....................................... 33 vii 3.4 Summary ........................................................................ 41 4 GOOD-THOMAS AND WINOGRAD PRIME-FACTOR FFT ALGORITHMS .. 44 4.1 Introduction...................................................................... 44 4.2 Data Format ..................................................................... 45 4.3 The Winograd FFT modules .................................................... 46 4.4 The Prime-Factor FFT Algorithm .............................................. 46 4.5 Architecture ..................................................................... 47 4.6 Hardware Design ................................................................ 47 4.6.1 Design Considerations..................................................... 51 4.6.2 Parallel Processing Architecture .......................................... 52 4.6.3 Matlab Design ............................................................. 53 4.6.4 Verilog Design ............................................................. 55 4.7 Testing ........................................................................... 57 4.8 Hardware Cost and Implementation Results ................................... 58 4.8.1 Latency and Throughput .................................................. 60 4.9 Analysis and Comparison....................................................... 61 5 APPLICATION OF FFT IN WIRELESS COMMUNICATION SYSTEMS ....... 63 5.1 Overview ........................................................................ 63 5.2 OFDM Technique ............................................................... 63 5.3 LTE Physical Layer ............................................................. 65 5.3.1 Generic Frame Structure .................................................. 65 5.3.2 LTE Parameters ............................................................ 66 6 CONCLUSION ........................................................................ 69 6.1 Future Work ..................................................................... 69 6.1.1 VLSI layout ................................................................ 70 BIBLIOGRAPHY .............................................................................. 71 viii LIST OF TABLES PAGE Table 2.1. Cooley-Tukey multiplications compared to one-dimensional DFT calculation . 9 Table 2.2. Comparison of the radix-2 and radix-4 algorithms ............................... 19 Table 2.3. Good-Thomas products savings ratio with respect to direct DFT calculation. .. 22 Table 2.4. Comparison of the Cooley-Tukey, Radix-2, Radix-4, and Good- Thomas FFT algorithms ............................................................... 25 Table 3.1. Determination of N k(x)............................................................ 32 Table 3.2. Multiplier coefficients for the 3-point WFT. ...................................... 34 Table 3.3. Multiplier coefficients for the 5-point WFT. ...................................... 35 Table 3.4. Multiplier coefficients for the 7-point WFT. ...................................... 36 Table 3.5. Multiplier coefficients for the 8-point WFT. ...................................... 36 Table 3.6. Multiplier coefficients for the 9-point WFT. ...................................... 38 Table 3.7. Multiplier coefficients for the 16-point WFT. ..................................... 39 Table 3.8. Computational requirements of Radix-2 and Winograd FFT algorithms ........ 41 Table 4.1. Resource utilization of the Winograd FFT algorithms ........................... 60 Table 4.2. Resource utilization of the combined Good-Thomas and Winograd FFT algorithm ......................................................................... 60 Table 4.3. Performance of the Winograd FFT algorithms ................................... 60 Table 4.4. Performance of the combined Good-Thomas and Winograd FFT algorithms .............................................................................. 61 Table 4.5. Resource utilization comparison with other fixed-point FFT proces- sors ..................................................................................... 61 Table 4.6. Performance comparison with other fixed-point FFT processors ................ 62 Table 5.1. FFT sizes and other physical parameters used in the current LTE standard ..... 66 Table 5.2. Available resource blocks and occupied sub-carriers ............................. 67 Table 5.3. Minimum required FFT lengths and other physical parameters for LTE ........ 67 Table 5.4. Possible FFT lengths using Good-Thomas algorithm and other phys- ical parameters for LTE ................................................................ 67 Table 5.5. Maximum possible FFT lengths using Good-Thomas algorithm and other physical parameters for LTE .................................................... 68 ix LIST OF FIGURES PAGE Figure 2.1. The two-dimensional
Load more

Recommended publications
  • Fourier Transforms and the Fast Fourier Transform (FFT) Algorithm Paul Heckbert Feb
    Notes 3, Computer Graphics 2, 15-463 Fourier Transforms and the Fast Fourier Transform (FFT) Algorithm Paul Heckbert Feb. 1995 Revised 27 Jan. 1998 We start in the continuous world; then we get discrete. De®nition of the Fourier Transform The Fourier transform (FT) of the function f (x) is the function F(ω), where: ∞ iωx F(ω) f (x)e− dx = Z−∞ and the inverse Fourier transform is 1 ∞ f (x) F(ω)eiωx dω = 2π Z−∞ Recall that i √ 1andeiθ cos θ i sin θ. = − = + Think of it as a transformation into a different set of basis functions. The Fourier trans- form uses complex exponentials (sinusoids) of various frequencies as its basis functions. (Other transforms, such as Z, Laplace, Cosine, Wavelet, and Hartley, use different basis functions). A Fourier transform pair is often written f (x) F(ω),orF ( f (x)) F(ω) where F is the Fourier transform operator. ↔ = If f (x) is thought of as a signal (i.e. input data) then we call F(ω) the signal's spectrum. If f is thought of as the impulse response of a ®lter (which operates on input data to produce output data) then we call F the ®lter's frequency response. (Occasionally the line between what's signal and what's ®lter becomes blurry). 1 Example of a Fourier Transform Suppose we want to create a ®lter that eliminates high frequencies but retains low frequen- cies (this is very useful in antialiasing). In signal processing terminology, this is called an ideal low pass ®lter. So we'll specify a box-shaped frequency response with cutoff fre- quency ωc: 1 ω ω F(ω) | |≤ c = 0 ω >ωc | | What is its impulse response? We know that the impulse response is the inverse Fourier transform of the frequency response, so taking off our signal processing hat and putting on our mathematics hat, all we need to do is evaluate: 1 ∞ f (x) F(ω)eiωx dω = 2π Z−∞ for this particular F(ω): 1 ωc f (x) eiωx dω = 2π ωc Z− 1 eiωx ωc = 2π ix ω ωc =− iωc x iωcx 1 e e− − = πx 2i iθ iθ sin ω x e e− c since sin θ − = πx = 2i ω ω c sinc( c x) = π π where sinc(x) sin(πx)/(πx).
    [Show full text]
  • Fourier and Hilbert Transforms
    International Conference on Computer Systems and Technologies - CompSysTech’2005 Fourier and Hilbert Transforms Bozhan Zhechev Abstract: In the paper two types of discrete transforms - Fourier transform and Hilbert transform are analysed. These transforms are useful for many applications. It is shown that the analysing filters of the Discrete Fourier Transform (DFT) can be constructed applying the Hilbert transform. This approach gives us a new representation of the full recursive form of the Fast Fourier Transform (FFT). The results give new possibilities for fast realizations of the DFT. Key words: Discrete transforms, Fast Fourier transform (FFT), Hilbert transform, signal processing, fast transforms, filter banks, characters of groups and theory of groups. INTRODUCTION Signal processing has entered a period of comprehending its different parts in more coherent structure. In our age of fast progress in computer sciences “what brings these parts together and integrates them is hard to be overestimated”. Abstract harmonic analysis, which underlies linear signal processing technology, provides us with the tools we need. We are not only interested in the computational aspects of the algorithms, but also in their algebraical, geometrical and physical representations, which is the basis for further development. We present in this paper relations between the Fourier Transform and Hilbert Transform in connection with the fast realizations of these transforms. CIRCULAR CONVOLUTION The input and output signals of a linear time-invariant system are connected by the convolution operation [1]: y = x*h. (1) Here h is the impulse response of the system. The sets of the real numbers R, integer numbers Z and the integer numbers – multiple of some integer number n (i.e.
    [Show full text]
  • Lecture 13: Practical Fourier Transforms Foundations of Digital Signal Processing
    Lecture 13: Practical Fourier Transforms Foundations of Digital Signal Processing Outline • The Discrete Fourier Transform (DFT) • Circular Convolution • The DTFT and the DFT: The Relationship • The Fast Fourier Transform Foundations of Digital Signal Processing Lecture 13: Practical Fourier Transforms 1 News Homework #5 . Due today . Submit via canvas Coding Problem #4 . Due today . Submit via canvas Foundations of Digital Signal Processing Lecture 13: Practical Fourier Transforms 2 Lecture 13: Practical Fourier Transforms Foundations of Digital Signal Processing Outline • The Discrete Fourier Transform (DFT) • Circular Convolution • The DTFT and the DFT: The Relationship • The Fast Fourier Transform Foundations of Digital Signal Processing Lecture 13: Practical Fourier Transforms 3 Deriving Transforms Consider the Inverse Discrete-Time Fourier Transform…. What happens if we sample X ? 1 = +n � 2 2 Foundations of Digital Signal Processing Lecture 13: Practical Fourier Transforms 4 Deriving Transforms Consider the Inverse Discrete-Time Fourier Transform…. What happens if we sample X ? 1 = +n � 1 2 2 = ∞ +n � 2 � − 2 2 =−∞ Foundations of Digital Signal Processing Lecture 13: Practical Fourier Transforms 5 Deriving Transforms Consider the Inverse Discrete-Time Fourier Transform…. What happens if we sample X ? 1 = +n � 1 2 2 = 2 ∞ +n � 2 � − 2 0 =−∞ 0 < 0 ≥ < 2 ≥ 2 Foundations of Digital Signal Processing Lecture 13: Practical Fourier Transforms 6 Deriving Transforms Consider the Inverse Discrete-Time Fourier Transform…. What happens if we sample X ? 1 = +n � 1 2 2 = 2 ∞ +n � 2 � − 2 0 =−∞ 2 Let 2 / = −1 = = 2 / +n � =0 Foundations of Digital Signal Processing Lecture 13: Practical Fourier Transforms 7 Deriving Transforms Consider the Inverse Discrete-Time Fourier Transform….
    [Show full text]
  • DSP Exercises
    Exercises in Digital Signal Processing 1 The Discrete Fourier Transform Ivan W. Selesnick 1.1 Compute the DFT of the 2-point signal by hand (without a calculator or computer). January 27, 2015 x = [20; 5] Contents 1.2 Compute the DFT of the 4-point signal by hand. 1 The Discrete Fourier Transform1 x = [3; 2; 5; 1] 2 The Fast Fourier Transform 16 1.3 The even samples of the DFT of a 9-point real signal x(n) are given by 3 Filters 18 X(0) = 3:1; 4 Linear-Phase FIR Digital Filters 29 X(2) = 2:5 + 4:6 j; 5 Windows 38 X(4) = −1:7 + 5:2 j; X(6) = 9:3 + 6:3 j; 6 Least Square Filter Design 50 X(8) = 5:5 − 8:0 j; 7 Minimax Filter Design 54 Determine the missing odd samples of the DFT. Use the properties of the DFT to solve this problem. 8 Spectral Factorization 56 1.4 The DFT of a 5-point signal x(n), 0 ≤ n ≤ 4 is 9 Minimum-Phase Filter Design 58 X(k) = [5; 6; 1; 2; 9]; 0 ≤ k ≤ 4: 10 IIR Filter Design 64 A new signal g(n) is defined by 11 Multirate Systems 68 −2 n g(n) := W5 x(n); 0 ≤ n ≤ 4: 12 Quantization 74 What are the DFT coefficients G(k) of the signal g(n), for 0 ≤ k ≤ 4? 13 Spectral Estimation 75 1.5 Compute by hand the circular convolution of the following two 4-point signals (do not use MATLAB, etc.) 14 Speech Filtering 82 g = [1; 2; 1; −1] 15 More Exercises 86 h = [0; 1=3; −1=3; 1=3] 16 Old Exercises 91 1.6 What is the circular convolution of the following two sequences? x = [1 2 3 0 0 0 0]; h = [1 2 3 0 0 0 0]; 1.7 What is the circular convolution of the following two sequences? 1 x = [1 2 3 0 0 0 0]; This vectors X1, X2, X3, X4 are shown below out of order.
    [Show full text]
  • Lecture 06: Finite Length Signals, DFT, and FFT January 28, 2019 Lecturer: Matthew Hirn
    Math 994-002: Applied and Computational Harmonic Analysis, MSU, Spring 2020 Lecture 06: Finite Length Signals, DFT, and FFT January 28, 2019 Lecturer: Matthew Hirn 3.3 Finite Length Signals In practice we cannot store an infinite number of samples f(n) n Z of a signal f;insteadwe { } 2 can only keep a finite number of samples, say f(n) 0 n<N .Wethusmustamendourdefini- { } tion of the Fourier transform as well as convolution, which will lead to the Discrete Fourier Transform (DFT) and circular convolution. One thing that will arise is that regardless of whether the original signal f is periodic, we will be forced to think of the finite sampling (f(n))0 n<N as a discrete periodic signal with period N. This will lead to border effects which must be accounted for. However, the circular convolution theorem and Fast Fourier Transform will allow for fast computations of convolution operators. Let x, y CN , which are vectors of length N,e.g.,N samples of a signal f such that 2 x[n]=f(n) for 0 n<N. The inner product between x and y is: N 1 − x, y = x[n]y⇤[n] h i n=0 X We must replace the sinusoids eit! (t R)andein! (n Z), which are continuous in the 2 2 frequency variable !, with discrete counterparts. The variable ! is replaced with an index k with 0 k<N: 2⇡ikn ek[n]=exp , 0 n, k < N (14) N ✓ ◆ The Discrete Fourier Transform (DFT) of x is defined as: N 1 − 2⇡ikn x[k]= x, e = x[n]exp , 0 k<N h ki − N n=0 X ✓ ◆ The following theoremb shows that the set of vectors ek 0 k<N is an orthogonal basis for { } CN .
    [Show full text]
  • Efficient Convolution Using the Fast Fourier Transform, Application In
    Efficient convolution using the Fast Fourier Transform, Application in C++ Jeremy Fix May 30, 2011 Contents 1 Introduction 2 1.1 Convolution product : linear and circular . .2 1.1.1 Definition . .2 1.1.2 Linear convolutions as particular cases of circular convolution . .4 1.2 Discrete Fourier Transform . 10 1.2.1 Introduction . 10 1.2.2 Computing a 2D Fourier transform from 1D Fourier transforms . 11 1.2.3 Computing 2 DFT of real sequences at once . 11 1.2.4 The symmetry of DFT of real sequences . 12 1.2.5 Fast Fourier Transform . 12 1.2.6 Computational complexity . 13 2 Convolution product using the Fast Fourier Transform 15 2.1 Introduction . 15 2.1.1 Convolution theorem : circular convolution and fourier transform . 15 2.1.2 Convolutions and Fourier Transform . 16 2.1.3 Speeding-up by padding . 17 2.2 Benchmarks . 17 2.2.1 Convolutions with a direct implementation . 17 2.2.2 Convolutions with FFTW . 17 2.3 Comparison between FFT based and standard convolution . 19 3 C++ codes 20 2 Efficient convolution using the Fast Fourier Transform, Application in C++ 1 Introduction Convolution products are often encountered in image processing but also in other works such as evaluating a con- volutive neural network. A naive implementation of a convolution product of signals of size N involves an order of N 2 operations. An efficient implementation of convolution product can be designed by making use of the Fast Fourier Transform and mathematical properties linking convolution products and Fourier transforms. This can boil down the complexity of computing a convolution product to an order of N log N operations.
    [Show full text]