Fast algorithms for generalized discrete Hartley transform of composite sequence lengths.

DOI10.1109/82.868457zbMATH Open1064.65545OpenAlexW2165170319MaRDI QIDQ2732950FDOQ2732950

Authors: Guoan Bi, Yanqiu Chen, Yonghong Zeng 

Publication date: 2000

Published in: IEEE Transactions on Circuits and Systems. II: Analog and Digital Signal Processing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Cited In (3)

• Difference operators, Green's matrix, sampling theory and applications in signal processing
• Fast computation of the discrete Hartley transform
• A structured dual split-radix algorithm for the discrete Hartley transform of length \(2^{N}\)

This page was built for publication: Fast algorithms for generalized discrete Hartley transform of composite sequence lengths.

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