Abstract

In this paper we discuss two kinds of ill-posed problems in signal processing, that is, in detail, reconstructing compactly supported signals in the Fourier transform and solving the convolution equation with analytic kernel. Having analyzed the essential reason of ill-posedness for these problems, we present some stabilized algorithms, which cure the ill-posedness, to recover the approximate solution. Finally numerical experiments show the efficiency and fast convergence of these algorithms.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.