Fast Algorithms for the Computation of Sliding Discrete Hartley Transforms

DOI10.1109/TSP.2007.893960zbMath1390.65170OpenAlexW2048478441MaRDI QIDQ4564656

Vitaly Kober

Publication date: 12 June 2018

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (3)

Generalized orthogonal discrete W transform and its fast algorithm ⋮ Fast computation of the discrete Hartley transform ⋮ Difference operators, Green's matrix, sampling theory and applications in signal processing

This page was built for publication: Fast Algorithms for the Computation of Sliding Discrete Hartley Transforms