Low-complexity hopping DFT design based on a compact recursive structure

Low-complexity hopping DFT design based on a compact recursive structure

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A novel hopping discrete Fourier transform (DFT) algorithm and its architecture design for efficiently computing time–frequency spectra are presented. Since the sliding process is adopted sample by sample, the spectral bin output data rate is the same as the input data rate. Under the conditions of an M-sample complex input sequence (M = 256), and N-point recursive DFT computation (N = 64) for time hop L (L = 4), the proposed method has the following advantages: (i) the computational complexity of Proposed-I requires only four complex additions and four complex multiplications for each frequency bin, after the first spectral component has been finally calculated; (ii) Proposed-II utilises a re-timing scheme to greatly shorten and balance the critical path; (iii) Proposed-II is less computationally complex than Wang et al.’s method, as the numbers of multiplication and addition operations in the proposed algorithm are 768 and 1024, representing reductions of 50 and 20%, respectively. In addition, the number of coefficients can be reduced by 50% compared with Park et al.’s method. In the FPGA implementation, the proposed design can be operated at 47.26 MHz. It is thus more suitable for use with real-time analytic applications of time–frequency spectra.


    1. 1)
      • 1. Oppenheim, A.V., Schafer, R.W.: ‘Discrete-time signal processing’ (Prentice-Hall, Upper Saddle River, NJ, 2010, 3rd edn.).
    2. 2)
    3. 3)
    4. 4)
    5. 5)
    6. 6)
      • 6. Duda, K.: ‘Accurate, guaranteed stable, sliding discrete Fourier transform’, Signal Process. Mag., 2010, 27, (6), pp. 124127, doi: 10.1109/MSP.2010.938088.
    7. 7)
    8. 8)

Related content

This is a required field
Please enter a valid email address