The Fast Hartley Transform Algorithm

DOI10.1109/TC.1987.1676877zbMath0621.65037MaRDI QIDQ3757265

Hsieh S. Hou

Publication date: 1987

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

zbMATH Keywords

fast Fourier transformfast Hartley transformdiscrete Fourier transformparallel processingdiscrete cosine transformdiscrete Hartley transform

Mathematics Subject Classification ID

Related Items (8)

Generalized orthogonal discrete W transform and its fast algorithm ⋮ Identification of a class of nonlinear continuous-time systems using Hartley modulating functions ⋮ A fast, accurate, and smooth planetary ephemeris retrieval system ⋮ The approximating capability of fast forms ⋮ Fast computation of the discrete Hartley transform ⋮ A structured dual split-radix algorithm for the discrete Hartley transform of length \(2^{N}\) ⋮ Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications ⋮ Fast discrete transforms by means of eigenpolynomials

This page was built for publication: The Fast Hartley Transform Algorithm