The recursive computation of prime length DFTs has very simple structure and needs only one coefficient. The signal-to-noise ratio for fixed-point implementation of this algorithm is discussed. The optimum coefficients with maximum S/N ratio are presened.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimum Coefficients for Recursively Computing DFTs


    Contributors:


    Publication date :

    2021-09-20


    Size :

    6 pages




    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Fast Implementation of Recursive DFTs

    Zhang, Yanzhong | Springer Verlag | 2021


    MTI Improvement Factors for Weighted DFTs

    Ziemer, R.E. / Ziegler, J. A. | IEEE | 1980



    FFT-based frequency domain filter design for multichannel overlap-windowed-DFTs-OFDM signals

    ISHIBASHI, Motoki / UMEHIRA, Masahiro / WANG, Xiaoyan et al. | IEEE | 2021


    Performance of coherent detection for FTN-DFTs-OFDM signal using receiver-side quadrature duobinary shaping

    Xu, Cheng / Gao, Guanjun / Chen, Sai et al. | British Library Online Contents | 2016