Fast discrete extrapolation via the fast Hartley transform

Hsu, Chau-Yun; Liou, Yu-Cyuan

doi:10.1109/82.242339

Cited by 6 publications

(1 citation statement)

References 11 publications

(12 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Among all, the Papoulis-Gerchberg algorithm is famous that the transformation between the time and frequency domains iteratively to recover the lost samples [1]. In addition, because of fast computation for the Papoulis-Gerchberg algorithm, the algorithm with fast Hartley transform is proposed to replace fast Fourier transform in the Papoulis-Gerchberg algorithm [5]. However, it can be proved to solve the Papoulis-Gerchberg algorithm by use of a set of linear equations [2].…”

Section: Introductionmentioning

confidence: 99%

Restoring lost samples with boundary matched

Hsu¹,

Lo²

2005

2005 International Symposium on Intelligent Signal Processing and Communication Systems

View full text Add to dashboard Cite

In various applications of speech transmission and procession, there is always a possibility of loss of samples. The iterative algorithm of Papoulis-Gerchberg is famous algorithm for solving the lost samples recovery problem. The algorithm, however, is usually slowly convergent. This paper presents a new approach for restoring lost samples with preprocess for meeting boundary conditions of discrete Fourier transform (DFT) in the iteration of Papoulis-Gerchberg algorithm. 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.

show abstract

Section: Introductionmentioning

confidence: 99%