Preview

Implementing Radix-2 Fft Algorithms on the Tms470R1X

Powerful Essays
Open Document
Open Document
4793 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Implementing Radix-2 Fft Algorithms on the Tms470R1X
Application Report
SPNA071A – November 2006

Implementing Radix-2 FFT Algorithms on the TMS470R1x
.....................................................................................................................................................
ABSTRACT This application report describes implementing Radix-2 FFT algorithms on the TMS470R1x. The FFT is implemented to work with complex input data. The key objective is to get a fast execution time, with obtaining a small code size secondary.

Contents 1 Introduction .......................................................................................... 2 TMS470R1x Architecture .......................................................................... 3 Fourier Transform .................................................................................. 4 FFT ................................................................................................... 5 Implementation ...................................................................................... 6 Results ............................................................................................... Appendix A Creating a COFF .......................................................................... List of Figures 1 2 3

1 2 2 2 6 7 8

Twiddle Factors (W8) .............................................................................. 3 8-Point DIT-Radix2-FFT ........................................................................... 5 Examples of Bit-Reversed Address .............................................................. 6 List of Tables

1 A-1

Radix-2 FFT Algorithm Results ................................................................... 7 Files Needed to Create a COFF .................................................................. 8

1

Introduction
In many applications, specific signals are measured with sensors. These signals contain information necessary for the application to perform its tasks. The signal has

You May Also Find These Documents Helpful

  • Satisfactory Essays

    OSI Model Key Terms Table

    • 552 Words
    • 3 Pages

    | Electrical signals are possibly the most typical. They can understand data by the current state or the transition method.…

    • 552 Words
    • 3 Pages
    Satisfactory Essays
  • Powerful Essays

    Some Like It Hot

    • 1312 Words
    • 6 Pages

    CHOOSE ONE OF THE SELECTIONS BELOW. These sequences have been preselected for you. They are all available on YouTube/Daily Motion and on a DVD entitled ‘FTVMS 101 Assignment # 1, 2013’ in the AV Library.…

    • 1312 Words
    • 6 Pages
    Powerful Essays
  • Better Essays

    Understanding Fft Windows

    • 2447 Words
    • 10 Pages

    The Fast Fourier Transform (FFT) is the Fourier Transform of a block of time data points. It represents the frequency composition of the time signal. Figure 2 shows a 10 Hz sine waveform (top) and the FFT of the sine waveform (bottom). A sine wave is composed of one pure tone indicated by the single discrete peak in the FFT with height of 1.0 at 10 Hz.…

    • 2447 Words
    • 10 Pages
    Better Essays
  • Powerful Essays

    Abstract In this note we make a critical comparison of some matlab programs for the digital computation of the fractional Fourier transform that are freely available and we describe our own implementation that filters the best out of the existing ones. Two types of transforms are considered: First the fast approximate fractional Fourier transform algorithm for which two algorithms are available. The method is described in H.M. Ozaktas, M.A. Kutay, and G. Bozda˘i. Digital computation of the fractional Fourier transform. g IEEE Trans. Signal Process., 44:2141–2150, 1996. There are two implementations: one is written by A.M. Kutay the other is part of package written by J. O’Neill. Secondly the discrete fractional Fourier transform algorithm described in the master thesis C. Candan. The discrete fractional Fourier transform, ¸ Bilkent Univ., 1998 and an algorithm described by S.C. Pei, M.H. Yeh, and C.C Tseng: Digital fractional Fourier transform based on orthogonal projections IEEE Trans. Signal Process., 47:1335–1348, 1999. Key words: Fractional Fourier transform…

    • 9669 Words
    • 39 Pages
    Powerful Essays
  • Satisfactory Essays

    The SN54 / 74LS83A is a high-speed 4-Bit binary Full Adder with internal carry lookahead. It accepts two 4-bit binary words (A1 – A4, B 1 – B4) and a Carry Input (C0). It generates the binary Sum outputs ∑1 – ∑4) and the Carry Output (C4) from the most significant bit. The LS83A operates with either active HIGH or active LOW operands (positive or negative logic). The SN54 / 74LS283 is recommended for new designs since it is identical in function with this device and features standard corner power pins. CONNECTION DIAGRAM DIP (TOP VIEW)…

    • 1095 Words
    • 5 Pages
    Satisfactory Essays
  • Powerful Essays

    Fast Fourier Transform

    • 2163 Words
    • 9 Pages

    In 1965, Cooley and Turkey were two persons who discussed the FFT (Fast Fourier Transform) for the first time in history. In past years, researchers believed that a discrete Fourier transform can also be calculated and classified as FFT by using the Danielson-Lanczos lemma theorem. By using this theorem, this process is slower than other, as it is slightly tainted in speed due to the power of N (exponent of N) are not 2. Therefore, if the number of points i.e. N is not a power of two, then the transform will only gives you the sets of points matching to the prime factors of N [1]. FFT (Fast Fourier Transform) is a type of algorithm commonly known as discrete Fourier transform algorithm. This algorithm has much significance in the reduction of number of computations that governs for N points from the arithmetic expressions i.e. 2N2 to (2N log2 N), in this expression the ‘N’ is the number of computations and log2 is the logarithm having base 2. In Fourier analysis, if the above function is about to be transferred, not harmonically associated with the sampling frequency, then at this point, the reaction for this FFT behaves just like a sinc function i.e. commonly known as the sampling function, defined as a function used to rise the frequency in the signal processing and propagation, classified as Fourier transforms[4] . However, the other components such as integrated power and aliasing have different variations as the integrated power still gives you the correct values but aliasing can be reduced by using apodization function. This aliasing reduction will be spent for the expansion of the spectral response [1].…

    • 2163 Words
    • 9 Pages
    Powerful Essays
  • Powerful Essays

    MATLAB is used in wide range of applications, including signal and image processing, communications, control design, test and measurement, financial modeling and analysis, and computational biology. Add-on toolboxes (collections of special-purpose MATLAB functions, available separately) extend the MATLAB environment to solve particular classes of problems in these application…

    • 814 Words
    • 4 Pages
    Powerful Essays
  • Powerful Essays

    Abstract:- A convolutional code is a type of error-correcting code in which each m-bit information symbol (each m-bit string) to be encoded is transformed into an n-bit symbol, where m/n is the code rate (n ≥ m) and the transformation is a function of the last k information symbols, where k is the constraint length of the code. The Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of hidden states – called the Viterbi path – that results in a sequence of observed events. The terms Viterbi path and Viterbi algorithm are also applied to related dynamic programming algorithms that discover the single most likely explanation for an observation. For example, in statisticalparsing a dynamic programming algorithm can be used to discover the single most likely context-free derivation (parse) of a string, which is sometimes called the Viterbi parse.…

    • 1848 Words
    • 7 Pages
    Powerful Essays
  • Good Essays

    Fft Algo

    • 824 Words
    • 4 Pages

    NEHA SINGH ELECTRONICS AND COMMUNICATION ENGINEERING DEPTT BACHELOR OF TECHNOLOGY, PRE-FINAL YEAR BIPIN TRIPATHI KUMAON INSTITUTE OF TECHNOLOGY, DWARAHAT, DISTTALMORA, STATE-UTTARAKHAND, INDIA OMIKA ADHIKARI ELECTRONICS AND COMMUNICATION ENGINEERING DEPTT BACHELOR OF TECHNOLOGY, PRE-FINAL YEAR BIPIN TRIPATHI KUMAON INSTITUTE OF TECHNOLOGY, DWARAHAT, DISTTALMORA, STATE-UTTARAKHAND, INDIA KEYWORDS- Algorithm, DFT, FFT, Signal, Sparse. In digital signal processing, any irregular signal ( such as the voltage fluctuations in the wire that connects an mp3 player to a loudspeaker ), can be represented in Discrete Fourier Transform(DFT), as a combination of pure frequencies. It's universal in signal processing as well as can be used for applications such as the compression of images and audio files. The DFT is so prevalent due to the FFT algorithm which makes it possible to calculate Fourier transforms dynamically. Even then efforts to improve the calculation of DFT have a long and generally overlooked history, as today’s scenario demands increased speed of signal processing to meet some desired specific applications. In this regard, this paper presents a research about an even faster algorithm to compute the DFT of a sparse signal, which can speed up the original FFT by tenfold. The key idea behind the research is the division of signals into narrower slices of bandwidth, sized so that a slice will generally contain only one frequency with a heavy weight. Identification of the most heavily weighted frequency in that slice is done by repeatedly cutting the slice of spectrum into smaller pieces and keeping only those in which most of signal power is concentrated. Signals in which the DFT include a relatively small number of heavily weighted frequencies are called 'sparse' and the new algorithm determines the weights of a signal's most heavily weighted frequencies. The sparser the signal, greater the speed up can be provided by…

    • 824 Words
    • 4 Pages
    Good Essays
  • Powerful Essays

    My Final Year Project

    • 5460 Words
    • 22 Pages

    Prepared in partial fulfillment of the requirements of the Course No. BITS C412 (Practice School II)…

    • 5460 Words
    • 22 Pages
    Powerful Essays
  • Good Essays

    experiment are given in Waidmann et al. [7-9]. For reducing the computational cost and design…

    • 984 Words
    • 4 Pages
    Good Essays
  • Good Essays

    digital communication

    • 9177 Words
    • 37 Pages

    2.1 FSK Modulation . . . . . . . . . . . . . . . . . . . . . . . . . .…

    • 9177 Words
    • 37 Pages
    Good Essays
  • Powerful Essays

    Biosensors

    • 2395 Words
    • 10 Pages

    1. The sensor is a transducer that converts the measurand (a quantity or a parameter) into a signal carrying information.…

    • 2395 Words
    • 10 Pages
    Powerful Essays
  • Satisfactory Essays

    Cse Cycle Sheet Programs

    • 384 Words
    • 2 Pages

    i)Various Data types ii)Input, Output(scanf,printf) i)Assignment Operator ii)Arithmetic Operator i)Arithmetic Operators ii)Decimal Display i)Expression Solving ii)Electronics Concepts…

    • 384 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    sensors in electronics

    • 443 Words
    • 2 Pages

    Sensors are sophisticated devices that are frequently used to detect and respond to electrical or optical signals. A Sensor converts the physical parameter (for example: temperature, blood pressure, humidity, speed, etc.) into a signal which can be measured electrically.…

    • 443 Words
    • 2 Pages
    Satisfactory Essays