Fast Algorithms for the Computation of Sliding Discrete Hartley Transforms

DOI10.1109/TSP.2007.893960zbMATH Open1390.65170OpenAlexW2048478441MaRDI QIDQ4564656FDOQ4564656

Authors: 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

Recommendations

• Fast Algorithms for the Computation of Sliding Discrete Sinusoidal Transforms
• Fast computation of the discrete Hartley transform
• New fast discrete Hartley transform algorithm
• The Fast Hartley Transform Algorithm
• Fast Algorithms for the Computation of Sliding Sequency-Ordered Complex Hadamard Transform
• New Parametric Discrete Fourier and Hartley Transforms, and Algorithms for Fast Computation
• Fast discrete extrapolation via the fast Hartley transform
• Fast computation of the discrete Walsh and Hadamard transforms
• Fast and numerically stable algorithms for discrete Hartley transforms and applications to preconditioning

Mathematics Subject Classification ID

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

Cited In (6)

• Difference operators, Green's matrix, sampling theory and applications in signal processing
• Fast computation of the discrete Hartley transform
• The Fast Hartley Transform Algorithm
• Generalized orthogonal discrete W transform and its fast algorithm
• Title not available (Why is that?)
• Sliding transforms for efficient implementation of transform domain adaptive filters

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

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