Minimax Approximation of Representation Coefficients From Generalized Samples

Abstract

Many sources of information are of analog or continuous-time nature. However, digital signal processing applications rely on discrete data. We consider the problem of approximating L<sub>2</sub> inner products, i.e., representation coefficients of a continuous-time signal, from its generalized samples. Adopting a robust approach, we process these generalized samples in a minimax optimal sense. Specifically, we minimize the worst approximation error of the desired representation coefficients by proper processing of the given sample sequence. We then extend our results to criteria which incorporate smoothness constraints on the unknown function. Finally, we compare our methods with the piecewise-constant approximation technique, commonly used for this problem, and discuss the possible improvements by the suggested schemes.

DOI: 10.1109/TSP.2007.896284

Extracted Key Phrases

12 Figures and Tables

Cite this paper

@article{Dvorkind2007MinimaxAO, title={Minimax Approximation of Representation Coefficients From Generalized Samples}, author={Tsvi G. Dvorkind and Hagai Kirshner and Yonina C. Eldar and Moshe Porat}, journal={IEEE Transactions on Signal Processing}, year={2007}, volume={55}, pages={4430-4443} }