Skip to main content
SpringerLink
Log in

Split-radix algorithms for length-p m DHT

  • Published:
Journal of Electronics (China)

Abstract

The split-radix 2/4 algorithm for discrete hartley transform (DHT) of length-2m is now very popular. In this paper, the split-radix approach is generalized to length-p m DHT. It is shown that the radix-p/p 2 algorithm, is superior to both the radix-p and the radix-p 2 algorithms in the number of multiplications. As an example, a radix-3/9 fast algorithm for length-3m DHT is developed. And its diagram of butterfly operation is given.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. W. Cooley, J. W. Tukey,Math. Comput.,19(1964)4, 297–301.

    MathSciNet  Google Scholar 

  2. Soo-cheng Pei, Ja-ling Wu,Electron. Lett.,22(1986)1, 20–27.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Southeast University, Nanjing

    Mao Yimin

Authors
  1. Mao Yimin
    View author publications

    You can also search for this author in PubMed Google Scholar

About this article

Cite this article

Yimin, M. Split-radix algorithms for length-p m DHT. J. of Electron.(China) 8, 97–103 (1991). https://doi.org/10.1007/BF02778768

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02778768

Key words

Search

Navigation