Two-dimensional discrete Hilbert transform and computational complexity aspects in its implementation

DOI10.1109/TASSP.1979.1163261MaRDI QIDQ3048247zbMATH OpenOpenAlexFDO

Authors N. K. Bose, K. A. Prabhu

Publication date 1979

Published in IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

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

zbMATH Keywords

computational complexitytwo-dimensional discrete Hilbert transform

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Analysis of algorithms and problem complexity (68Q25) Application of orthogonal and other special functions (94A11)

Cited in

(2)

• On the approximation of the magnitude response of two-dimensional IIR digital filters using linear programming
• Optimum signal and image recovery by the method of alternating projections in fractional Fourier domains

This page was built for publication: Two-dimensional discrete Hilbert transform and computational complexity aspects in its implementation

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