Fast computation of the discrete Hartley transform

DOI10.1002/CTA.574zbMATH Open1191.65191OpenAlexW4234987225MaRDI QIDQ3563602FDOQ3563602

Authors: Priyanka Jain, Balbir Kumar, S. B. Jain 

Publication date: 31 May 2010

Published in: International Journal of Circuit Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/cta.574

Recommendations

• The Fast Hartley Transform Algorithm
• Moment-based fast discrete Hartley transform
• New algorithms for multidimensional discrete Hartley transform
• New fast discrete Hartley transform algorithm
• Fast DHT algorithms for length \(N=q*2^m\)

zbMATH Keywords

discrete cosine transformdiscrete Hartley transformrecursive structures

Mathematics Subject Classification ID

Computer aspects of numerical algorithms (65Y99) Numerical methods for discrete and fast Fourier transforms (65T50)

Cites Work

• Title not available (Why is that?)
• The Fast Hartley Transform Algorithm
• A New Radix-<tex>$2/8$</tex>FFT Algorithm for Length-<tex>$qtimes 2^m$</tex>DFTs
• Fast Algorithms for the Computation of Sliding Discrete Hartley Transforms
• Split-radix fast Hartley transform in one and two dimensions
• Efficient Recursive Structures for Forward and Inverse Discrete Cosine Transform
• Split-radix algorithm for 2-D discrete Hartley transform
• New fast discrete Hartley transform algorithm
• Fast algorithms for generalized discrete Hartley transform of composite sequence lengths.
• Fast DHT algorithms for length \(N=q*2^m\)
• Title not available (Why is that?)
• Discrete sine transform and its inverse - realization through recursive algorithms
• A Split Vector-Radix Algorithm for the 3-D Discrete Hartley Transform

Cited In (33)

• Fast and numerically stable algorithms for discrete Hartley transforms and applications to preconditioning
• An efficient design for one-dimensional discrete Hartley transform using parallel additions
• A fast Hermite transform
• Object oriented approach for computation of two dimensional Hartley transform
• The vector split-radix algorithm for 2D DHT
• New fast discrete Hartley transform algorithm
• Fast algorithm for discrete fractional Hadamard transform
• Generalized discrete Hartley transforms
• Split-radix fast Hartley transform in one and two dimensions
• The Fast Hartley Transform Algorithm
• Prime factor fast Hartley transform
• Fast discrete extrapolation via the fast Hartley transform
• Conversion of FFT’s to Fast Hartley Transforms
• Parallel prime-factor discrete Hartley transform on the orthogonal multiprocessor
• On prime factor mapping for the discrete Hartley transform
• Fast Discrete Curvelet Transforms
• Hartly transform for symmetrical components measurement in a power system
• Title not available (Why is that?)
• Fast Algorithms for the Computation of Sliding Discrete Hartley Transforms
• Binary Discrete Cosine and Hartley Transforms
• Title not available (Why is that?)
• Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization
• A new structure for the running discrete Hartley transform
• New algorithms for multidimensional discrete Hartley transform
• Title not available (Why is that?)
• Algorithm for computing two-dimensional discrete Hartley transform of size pn×pn
• A structured dual split-radix algorithm for the discrete Hartley transform of length \(2^{N}\)
• Polynomial transform fast Hartley transform
• Fast 3-D decimation-in-frequency algorithm for 3-D Hartley transform
• Fast algorithm for multi-dimensional discrete Hartley transform with size \(q^{l_{1}}\times q^{l_{2}}\times \cdots \times q^{l_{r}}\)
• Moment-based fast discrete Hartley transform
• Multidimensional polynomial transform algorithm for multidimensional discrete Hartley transform
• In-place in-order mixed radix fast Hartley transforms

This page was built for publication: Fast computation of the discrete Hartley transform

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