Cart (Loading....) | Create Account
Close category search window
 

Approximations of One-Dimensional Digital Signals Under the l^\infty Norm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Dalai, M. ; Dept. of Electron. for Autom., Brescia Univ. ; Leonardi, R.

Approximation of digital signals by means of continuous-time functions is often required in many tasks of digital to analog conversion, signal processing, and coding. In many cases the approximation is performed based on an l2 optimality criterion; in this paper we study approximations of one-dimensional signals under the linfin norm. We first introduce approximations in linear spaces, for which linear programming methods are known. For the particular case of linear approximations (i.e., first-order polynomials), we propose a geometric solution that is shown to be computationally more efficient than the linear programming approach. Then, we study the problem of piecewise approximations, i.e., dividing the domain into intervals and approximating the signal in linear spaces within every segment independently, so as to reach an optimal noncontinuous approximation. Given an error bound delta, we establish a strategy to determine the minimum number k of segments for which the approximation is guaranteed to produce an error within delta. We then show how to find the optimal partition that gives the piecewise linfin optimal solution with k segments. The computational complexity of the algorithms is studied, showing that in many practical situations, the number of operations is O(n), with n being the number of samples

Published in:

Signal Processing, IEEE Transactions on  (Volume:54 ,  Issue: 8 )

Date of Publication:

Aug. 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.