A structured review of sparse fast Fourier transform algorithms
E Rajaby, SM Sayedi - Digital Signal Processing, 2022 - Elsevier
Discrete Fourier transform (DFT) implementation requires high computational resources and
time; a computational complexity of order O (N 2) for a signal of size N. Fast Fourier …
time; a computational complexity of order O (N 2) for a signal of size N. Fast Fourier …
A real-time, 1.89-GHz bandwidth, 175-kHz resolution sparse spectral analysis RISC-V SoC in 16-nm FinFET
A 1.89-GHz bandwidth, 175-kHz resolution spectral analysis system-on-chip (SoC),
integrating a subsampling analog-to-digital converter (ADC) frontend with a digital …
integrating a subsampling analog-to-digital converter (ADC) frontend with a digital …
Low Computational Complexity SAR Imaging Algorithm for Ship Monitoring via Two-Dimensional Band-Limited Sparse Fourier Transform
For synthetic aperture radar (SAR) imaging with big data, traditional fast Fourier transform
(FFT)-based imaging algorithms are no longer fast enough for some real-time applications …
(FFT)-based imaging algorithms are no longer fast enough for some real-time applications …
[图书][B] Agile design of generator-based signal processing hardware
A Wang - 2018 - search.proquest.com
Custom, application-specific implementations of digital signal processing (DSP) systems
offer high performance and high energy efficiency, but require significant design and …
offer high performance and high energy efficiency, but require significant design and …