The Fast Hartley Transform Algorithm
From MaRDI portal
Publication:3757265
DOI10.1109/TC.1987.1676877zbMath0621.65037MaRDI QIDQ3757265
Publication date: 1987
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
fast Fourier transform; fast Hartley transform; discrete Fourier transform; parallel processing; discrete cosine transform; discrete Hartley transform
65T40: Numerical methods for trigonometric approximation and interpolation
Related Items
Identification of a class of nonlinear continuous-time systems using Hartley modulating functions, A fast, accurate, and smooth planetary ephemeris retrieval system, Fast discrete transforms by means of eigenpolynomials, The approximating capability of fast forms, Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications, Fast computation of the discrete Hartley transform