Improved Papoulis-Gerchberg algorithm for restoring lost samples

Author

Hsu, Chau-Yun ; Lo, Tsung-Ming

Author_Institution

Inst. of Commun. Eng., Tatung Univ., Taipei

fYear

2005

fDate

21-21 Dec. 2005

Firstpage

717

Lastpage

721

Abstract

The iterative algorithm of Papoulis-Gerchberg is famous for solving the lost samples recovery problem, however, is usually slowly convergent. In this paper, we propose an efficient approach for restoring lost samples with a preprocess for meeting boundary conditions in the iteration method. The simulation indicates the mean square error (MSE) of the recovery and the convergence rate with the preprocess concept is much better and faster than that without preprocess concept. The improved scheme can also be applied to other cases of signal restoration, which admit Cadzow ´s iterative processing method

Keywords

iterative methods; mean square error methods; signal restoration; Papoulis-Gerchberg algorithm; iterative processing method; lost sample restoration; mean square error; signal restoration; Bandwidth; Discrete Fourier transforms; Fourier transforms; Frequency domain analysis; Iterative algorithms; Iterative methods; Mean square error methods; Signal processing; Signal processing algorithms; Signal restoration;

fLanguage

English

Publisher

ieee

Conference_Titel

Signal Processing and Information Technology, 2005. Proceedings of the Fifth IEEE International Symposium on

Conference_Location

Athens

Print_ISBN

0-7803-9313-9

Type

conf

DOI

10.1109/ISSPIT.2005.1577186

Filename

1577186