Algorithm for computing two-dimensional discrete Hartley transform of size pn×pn

DOI10.1049/EL:19901150MaRDI QIDQ3201724zbMATH OpenOpenAlexFDO

Authors V. N. Vasil'ev, P. P. Aidemirski

Publication date 1990

Published in Electronics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/el:19901150

zbMATH Keywords

fast algorithmsignal processinglinear congruencelocal ringtwo- dimensional discrete Hartley transform

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Fast algorithm for multi-dimensional discrete Hartley transform with size \(q^{l_{1}}\times q^{l_{2}}\times \cdots \times q^{l_{r}}\)
• Fast computation of the discrete Hartley transform
• Split-radix algorithm for 2-D discrete Hartley transform
• New algorithms for multidimensional discrete Hartley transform
• An array architecture for computing two-dimensional discrete Hartley transforms

Cited in

(2)

• Fast algorithm for multi-dimensional discrete Hartley transform with size \(q^{l_{1}}\times q^{l_{2}}\times \cdots \times q^{l_{r}}\)
• scientific article; zbMATH DE number 4216708 (Why is no real title available?)

This page was built for publication: Algorithm for computing two-dimensional discrete Hartley transform of size pn×pn

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