Fast discrete extrapolation via the fast Hartley transform

DOI10.1109/82.242339MaRDI QIDQ4307883zbMATH OpenOpenAlexFDO

Authors Chau-Yun Hsu, Yunn-Feng Liou

Publication date 2 January 1995

Published in IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/82.242339

zbMATH Keywords

band-limited functionfast algorithmfast Fourier transformHartley transformiterative extrapolationlow-pass filteringsignal reconstruction

Mathematics Subject Classification ID

Trigonometric approximation (42A10) Numerical methods for trigonometric approximation and interpolation (65T40) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• The Fast Hartley Transform Algorithm
• Interpolation using Hartley transform
• Conversion of FFT’s to Fast Hartley Transforms
• scientific article; zbMATH DE number 3926793
• Fast computation of the discrete Hartley transform

Cited in

(7)

• The approximating capability of fast forms
• A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions
• A multivariate fast discrete Walsh transform with an application to function interpolation
• Interpolation using Hartley transform
• Implementation and performance study of a generalized iterative algorithm for image reconstruction from the Hartley transform intensity
• Fast Algorithms for the Computation of Sliding Discrete Hartley Transforms
• Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization

This page was built for publication: Fast discrete extrapolation via the fast Hartley transform

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