FPGA Realization of the Observer-Based Sliding Discrete Fourier Transform
Discrete Fourier transform (DFT) is a widely used method of signal analysis in digital signal processing. The DFT converts a signal from time domain to frequency domain for further processing. For fixed-size sliding window applications of the DFT, the observer-based sliding DFT (oSDFT) algorithm has...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2022-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9718061/ |
| _version_ | 1811271231489441792 |
|---|---|
| author | Peter Plesznik Zsolt Kollar Daejin Park |
| author_facet | Peter Plesznik Zsolt Kollar Daejin Park |
| author_sort | Peter Plesznik |
| collection | DOAJ |
| description | Discrete Fourier transform (DFT) is a widely used method of signal analysis in digital signal processing. The DFT converts a signal from time domain to frequency domain for further processing. For fixed-size sliding window applications of the DFT, the observer-based sliding DFT (oSDFT) algorithm has been shown to be stable, accurate, and theoretically faster, than the well-known block-oriented fast Fourier transforms (FFT). However, no hardware implementation of the oSDFT has been proposed yet. In this paper, a hardware optimized implementation of two variants of the algorithm for FPGA is presented. Such implementation is compared with the Xilinx FFT Intellectual Property in terms of processing speed and hardware requirements. The structure is implemented in Verilog HDL using Vivado IDE, with the aim of maximizing the processing speed and minimizing the required hardware resources. The analysis of the FPGA-based oSDFT and FFT circuits in a sample-by-sample processing scenario, reveals that the latency and energy usage of the oSDFT are smaller relative to the FFT. The latency and energy usage per sample processed of the implemented structures are up to 9 and 10 times lower than those of FFT respectively. The required resources for these methods are also presented and analyzed. |
| first_indexed | 2024-04-12T22:17:31Z |
| format | Article |
| id | doaj.art-7e6233af1b524990bd273111cee2724a |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-04-12T22:17:31Z |
| publishDate | 2022-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-7e6233af1b524990bd273111cee2724a2022-12-22T03:14:30ZengIEEEIEEE Access2169-35362022-01-0110294322944210.1109/ACCESS.2022.31530509718061FPGA Realization of the Observer-Based Sliding Discrete Fourier TransformPeter Plesznik0https://orcid.org/0000-0001-8713-4869Zsolt Kollar1https://orcid.org/0000-0001-6384-265XDaejin Park2https://orcid.org/0000-0002-5560-873XSchool of Electronic and Electrical Engineering, Kyungpook National University, Daegu, South KoreaDepartment of Measurement and Information Systems, Budapest University of Technology and Economics, Budapest, HungarySchool of Electronic and Electrical Engineering, Kyungpook National University, Daegu, South KoreaDiscrete Fourier transform (DFT) is a widely used method of signal analysis in digital signal processing. The DFT converts a signal from time domain to frequency domain for further processing. For fixed-size sliding window applications of the DFT, the observer-based sliding DFT (oSDFT) algorithm has been shown to be stable, accurate, and theoretically faster, than the well-known block-oriented fast Fourier transforms (FFT). However, no hardware implementation of the oSDFT has been proposed yet. In this paper, a hardware optimized implementation of two variants of the algorithm for FPGA is presented. Such implementation is compared with the Xilinx FFT Intellectual Property in terms of processing speed and hardware requirements. The structure is implemented in Verilog HDL using Vivado IDE, with the aim of maximizing the processing speed and minimizing the required hardware resources. The analysis of the FPGA-based oSDFT and FFT circuits in a sample-by-sample processing scenario, reveals that the latency and energy usage of the oSDFT are smaller relative to the FFT. The latency and energy usage per sample processed of the implemented structures are up to 9 and 10 times lower than those of FFT respectively. The required resources for these methods are also presented and analyzed.https://ieeexplore.ieee.org/document/9718061/Sliding DFToSDFTFFTFPGAlow latency |
| spellingShingle | Peter Plesznik Zsolt Kollar Daejin Park FPGA Realization of the Observer-Based Sliding Discrete Fourier Transform IEEE Access Sliding DFT oSDFT FFT FPGA low latency |
| title | FPGA Realization of the Observer-Based Sliding Discrete Fourier Transform |
| title_full | FPGA Realization of the Observer-Based Sliding Discrete Fourier Transform |
| title_fullStr | FPGA Realization of the Observer-Based Sliding Discrete Fourier Transform |
| title_full_unstemmed | FPGA Realization of the Observer-Based Sliding Discrete Fourier Transform |
| title_short | FPGA Realization of the Observer-Based Sliding Discrete Fourier Transform |
| title_sort | fpga realization of the observer based sliding discrete fourier transform |
| topic | Sliding DFT oSDFT FFT FPGA low latency |
| url | https://ieeexplore.ieee.org/document/9718061/ |
| work_keys_str_mv | AT peterplesznik fpgarealizationoftheobserverbasedslidingdiscretefouriertransform AT zsoltkollar fpgarealizationoftheobserverbasedslidingdiscretefouriertransform AT daejinpark fpgarealizationoftheobserverbasedslidingdiscretefouriertransform |