2006Unpublished venueRequires access

Novel scheme for compact orthogonal modified-prony representation of signals

Mohamed F. M. Fahmy, Yassin M. Y. Hasan

Open publisher page 5 citations

Abstract

In this paper, an algorithm is developed to construct a set of M orthogonal basis along which signals, whether noisy or noise-free, can be decomposed. Combining a modified Prony signal approximation and Gram-Schmidt orthogonalization schemes (to obtain the orthogonal bases), the proposed method represents the processed signal as the sum of M damped exponentials. It is shown that the employed bases are closely related to the roots of an Mthorder forward linear prediction polynomial, satisfying the system. In addition, an optimization procedure is described to optimally adjust these bases to accurately represent the signal under consideration. The proposed procedure finds applications in signal compression and signal de-noising, where it is only necessary to specify the orthogonal basis, as well as the decomposition weights rather than sending the complete signal batch. Illustrative examples are given

About this research paper

What this paper is about

In this paper, an algorithm is developed to construct a set of M orthogonal basis along which signals, whether noisy or noise-free, can be decomposed. Combining a modified Prony signal approximation and Gram-Schmidt orthogonalization schemes (to obtain the orthogonal bases), the proposed method represents the processed signal as the sum of M damped exponentials. It is shown that the employed bases are closely related to the roots of an Mthorder forward linear prediction polynomial, satisfying the system. In addition, an optimization procedure is described to optimally adjust these bases to accurately represent the signal under consideration. The proposed procedure finds applications in signal compression and signal de-noising, where it is only necessary to specify the orthogonal basis, as well as the decomposition weights rather than sending the complete signal batch. Illustrative examples are given

Why it matters

OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, an algorithm is developed to construct a set of M orthogonal basis along which signals, whether noisy or noise-free, can be decomposed. Combining a modified Prony signal approximation and Gram-Schmidt orthogonalization schemes (to obtain the orthogonal bases), the proposed method represents the processed signal as the sum of M damped exponentials. It is shown that the employed bases are closely related to the roots of an Mthorder forward linear prediction polynomial, satisfying the system. In addition, an optimization procedure is described to optimally adjust these bases to accurately represent the signal under consideration. The proposed procedure finds applications in signal compression and signal de-noising, where it is only necessary to specify the orthogonal basis, as well as the decomposition weights rather than sending the complete signal batch. Illustrative examples are given

Key concepts: Orthogonalization, Orthogonal basis, Algorithm, SIGNAL (programming language), Basis (linear algebra), Signal reconstruction, Polynomial, Noise (video)

Related papers

Back to paper searchBrowse research topicsOriginal source
Novel scheme for compact orthogonal modified-prony representation of signals — Research Paper | ScholarLens