An illustration of a magnifying glass. An illustration of a magnifying glass.
Abstract: Discrete Fourier transforms (DFTs) over finite fields have widespread applications in various communication and storage systems. Hence reducing the computational complexities of DFTs is of ...
Abstract: This paper presents a novel method to obtain non-power-of-two (NP2) fast Fourier transform (FFT) flow graphs based on a new prime factor algorithm (PFA). The FFT flow graph is crucial for ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback