On the feasibility of impulse reflection response data from one-dimensional multilayered lossy media
Jeff Frolík
Abstract
Jeff Frolík
Abstract
Solving inverse scattering problems using layer stripping algorithms is known to be fast and effective when the data are noise-free. However, layer stripping algorithms have a reputation of being unstable when applied to noisy time-domain reflection response data. The reason is that the noisy data may be infeasible; i.e., could not have been produced by an actual media. In this paper, three feasibility conditions are introduced for data from absorbing (lossy) one-dimensional (1-D) media. Satisfying these conditions is both necessary and sufficient for the data to have been produced by an actual lossy media. That is, layer stripping algorithms applied such noisy but feasible data are stable. A methodology for correcting infeasible data is also proposed. Numerical examples illustrate key points and the correction method.
OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Solving inverse scattering problems using layer stripping algorithms is known to be fast and effective when the data are noise-free. However, layer stripping algorithms have a reputation of being unstable when applied to noisy time-domain reflection response data. The reason is that the noisy data may be infeasible; i.e., could not have been produced by an actual media. In this paper, three feasibility conditions are introduced for data from absorbing (lossy) one-dimensional (1-D) media. Satisfying these conditions is both necessary and sufficient for the data to have been produced by an actual lossy media. That is, layer stripping algorithms applied such noisy but feasible data are stable. A methodology for correcting infeasible data is also proposed. Numerical examples illustrate key points and the correction method.
Key concepts: Lossy compression, Computer science, Impulse response, Reflection (computer programming), Impulse noise, Algorithm, Noise (video), Mathematics