In-place in-order mixed radix fast Hartley transforms

DOI10.1016/0165-1684(95)00129-8MaRDI QIDQ672118zbMATH OpenOpenAlexFDO

Authors Soo-Chang Pei, Sy-Been Jaw

Publication date 27 February 1997

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL http://ntur.lib.ntu.edu.tw/bitstream/246246/142439/1/27.pdf

zbMATH Keywords

fast algorithmfast Winograd transformFHT algorithmsFortran programsmixed radix discrete Hartley transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• The Fast Hartley Transform Algorithm
• Conversion of FFT’s to Fast Hartley Transforms
• Fast DHT algorithms for length N=q*2ᵐ
• Fast computation of the discrete Hartley transform
• Moment-based fast discrete Hartley transform

Cited in

(2)

• Prefolding in FHT algorithms
• Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization

This page was built for publication: In-place in-order mixed radix fast Hartley transforms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672118)