Sökning: "Radix- 2 FFT"

Visar resultat 1 - 5 av 14 uppsatser innehållade orden Radix- 2 FFT.

  1. 1. Latency Bounds for Memory-Based FFTs with Applications in OFDM Communication

    Master-uppsats, Linköpings universitet/Institutionen för systemteknik

    Författare :Xiangbin Tan; Tadesse Hadush Negash; [2023]
    Nyckelord :FFT; scheduling; memory-based architecture; latency;

    Sammanfattning : Future communication systems require low latency Fast Fourier transform (FFT)computation with a small cost of area. In this study, a memory-based FFT processorwith low latency is designed. LÄS MER

  3. 2. FFT Implemention on FPGA for 5G Networks

    Master-uppsats, Linköpings universitet/Datorteknik

    Författare :Vlad Valentin Vasilica; [2019]
    Nyckelord :FFT; OFDMA; Physical design; FPGA; 5G; VHDL; CP-OFDMA; Radix-2; 2048-Point;

    Sammanfattning : The main goal of this thesis will be the design and implementation of a 2048-point FFT on an FPGA through the use of VHDL code.The FFT will use a butterfly Radix-2 architecture with focus on the comparison of the parameters between the system with different Worlengths, Coefficient Wordlengths and Symbol Error rates as well as different modulation types, comparing 64QAM and 256QAM for the 5Gsystem. LÄS MER

  4. 3. Minimising Memory Access Conflicts for FFT on a DSP

    Master-uppsats, Linköpings universitet/Datorteknik

    Författare :Sofia Jonsson; [2019]
    Nyckelord :FFT; DSP; memory access conflict;

    Sammanfattning : The FFT support in an Ericsson's proprietary DSP is to be improved in order to achieve high performance without disrupting the current DSP architecture too much. The FFT:s and inverse FFT:s in question should support FFT sizes ranging from 12-2048, where the size is a multiple of prime factors 2, 3 and 5. LÄS MER

  5. 4. Program för frekvensanalys

    Uppsats för yrkesexamina på grundnivå, Örebro universitet/Institutionen för naturvetenskap och teknik

    Författare :Stephan Rodesten; [2017]
    Nyckelord :frequency; analyzer; analyze; spectrum; signal; processing; discrete; fourier; transform; fast; radix-2-fft; radix-2; cooley; tukey; window; function; magnitude; normalize; hamming; hann; hanning; complex; number; sampling; sample; sound; wave; microphone; rate; size; format; audio; byte; frekvensanalys; spektrum; dsp; digital; signalbehandling; fouriertransform; dft; fft; cooley-tukey; fönsterfunktion; amplitud; decibel; normalisering; komplex; komplexa; tal; sampel; bit; ljud; våg; mikrofon; analys; samplingshastighet; samplingsstorlek; ljudformat; frekvenser; frekvens; spektra; analog;

    Sammanfattning : Denna rapport täcker arbetsprocessen bakom att skapa en spektrumanalysator. Läsaren kommer att få läsa om den valda metoden men även alternativa metoder. Utöver detta kommer även de teoretiska delarna bakom varje moment att undersökas samt jämföras med potentiella alternativa lösningar. LÄS MER

  7. 5. Hardware Implementation of a 32-point Radix-2 FFT Architecture

    Master-uppsats, Lunds universitet/Institutionen för elektro- och informationsteknik

    Författare :Ying Gao; [2015]
    Nyckelord :Radix- 2 FFT; Hardware Implementation; synthesis; place route; prime time; power consumption; Technology and Engineering;

    Sammanfattning : The Fast Fourier Transform (FFT) algorithm has been widely used in the Digital Signal Processing industry as a rudimentary operation to select the specific frequency components of a signal, which has been involved with other time domain signals. In order to fulfill the requirements of executing precise calculations and less power & area consumption, an algorithm with less number of adders and multipliers is used. LÄS MER