Detailed Information

Cited 0 time in webofscience Cited 2 time in scopus
Metadata Downloads

The Schur algorithm applied to the one-dimensional continuous inverse scattering problem

Authors
Choi, Y.Chun, J.Kim, T.Bae, J.
Issue Date
2013
Keywords
Inverse scattering; reflection coefficient; Richardson extrapolation; Schur algorithm
Citation
IEEE Transactions on Signal Processing, v.61, no.13, pp 3311 - 3320
Pages
10
Journal Title
IEEE Transactions on Signal Processing
Volume
61
Number
13
Start Page
3311
End Page
3320
URI
https://www.kriso.re.kr/sciwatch/handle/2021.sw.kriso/992
DOI
10.1109/TSP.2013.2259487
ISSN
1053-587X
1941-0476
Abstract
The one-dimensional continuous inverse scattering problem can be solved by the Schur algorithm in the discrete-time domain using sampled scattering data. The sampling rate of the scattering data should be increased to reduce the discretization error, but the complexity of the Schur algorithm is proportional to the square of the sampling rate. To improve this tradeoff between the complexity and the accuracy, we propose a Schur algorithm with the Richardson extrapolation (SARE). The asymptotic expansion of the Schur algorithm, necessary for the Richardson extrapolation, is derived in powers of the discretization step, which shows that the accuracy order (with respect to the discretization step) of the Schur algorithm is 1. The accuracy order of the SARE with the N-step Richardson extrapolation is increased to N+1 with comparable complexity to the Schur algorithm. Therefore, the discretization error of the Schur algorithm can be decreased in a computationally efficient manner by the SARE. ? 1991-2012 IEEE.
Files in This Item
There are no files associated with this item.
Appears in
Collections
ETC > 1. Journal Articles

qrcode

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher Choi, Young chol photo

Choi, Young chol
해양공공디지털연구본부
Read more

Altmetrics

Total Views & Downloads

BROWSE