Algorithm for computing two-dimensional discrete Hartley transform of size pn×pn
From MaRDI portal
Publication:3201724
DOI10.1049/EL:19901150zbMath0715.65113OpenAlexW2542073924MaRDI QIDQ3201724
P. P. Aidemirski, V. N. Vasil'ev
Publication date: 1990
Published in: Electronics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1049/el:19901150
fast algorithmsignal processinglocal ringlinear congruencetwo- dimensional discrete Hartley transform
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50)
This page was built for publication: Algorithm for computing two-dimensional discrete Hartley transform of size pn×pn