Comparative study of time efficiency of several algorithms for discrete W transform and discrete Hartley transform

Access Full Text

Comparative study of time efficiency of several algorithms for discrete W transform and discrete Hartley transform

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

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

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
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
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.

© The Institution of Electrical Engineers
Published

Subroutines for several algorithms for the computation of the discrete W transform and the discrete Hartley transform are implemented in a YNC-M240D computer for testing of their time efficiency. Results show that the subroutines for the fast W transform algorithm reported recently are more efficient than subroutines for radix-2, radix-4 and the split radix fast Hartley transform algorithms.

Inspec keywords: algorithm theory; transforms; spectral analysis; computerised signal processing

Other keywords: FWT; discrete Hartley transform; algorithms; FHT; time efficiency; YNC-M240D computer; subroutines; fast W transform algorithm; discrete W transform; split radix fast Hartley transform algorithms

Subjects: Information theory; Signal processing and detection; Digital signal processing; Communications computing

References

    1. 1)
      • R.N. Bracewell . The fast Hartley transform. Proc. IEEE. , 1010 - 1018
    2. 2)
      • R.N. Bracewell . The discrete Hartley transform. J. Opt. Soc. Am. , 1832 - 1835
    3. 3)
      • Z. Wang . Fast algorithms for the discrete W transform and for the discrete Fourier transform. IEEE Trans. , 803 - 816
    4. 4)
      • N. Suchiro , M. Hatori . Fast algorithms for the DFT and other sinusoidal transforms. IEEE. Trans. , 642 - 645
    5. 5)
      • H.V. Sorensen . On computing the discrete Hartley transform. IEEE. Trans. , 1231 - 1238
    6. 6)
      • Z.D. Wang , B.R. Hunt . The discrete W transform. Appl. Math. Comput. , 19 - 48
    7. 7)
      • Z. Wang . The fast W transform. Acta Elektron. Sin.
    8. 8)
      • Z. Wang . The fast W transform—algorithms and programs. Sci. Sin.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19870154
Loading

Related content

content/journals/10.1049/el_19870154
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading