Optimal Envelope Approximation in Fourier Basis with Applications in TV White Space

06/03/2017
by   Animesh Kumar, et al.
0

Lowpass envelope approximation of smooth continuous-variable signals are introduced in this work. Envelope approximations are necessary when a given signal has to be approximated always to a larger value (such as in TV white space protection regions). In this work, a near-optimal approximate algorithm for finding a signal's envelope, while minimizing a mean-squared cost function, is detailed. The sparse (lowpass) signal approximation is obtained in the linear Fourier series basis. This approximate algorithm works by discretizing the envelope property from an infinite number of points to a large (but finite) number of points. It is shown that this approximate algorithm is near-optimal and can be solved by using efficient convex optimization programs available in the literature. Simulation results are provided towards the end to gain more insights into the analytical results presented.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/10/2014

Signal Reconstruction Framework Based On Projections Onto Epigraph Set Of A Convex Cost Function (PESC)

A new signal processing framework based on making orthogonal Projections...
research
05/25/2021

Practical Schemes for Finding Near-Stationary Points of Convex Finite-Sums

The problem of finding near-stationary points in convex optimization has...
research
01/28/2023

Convergence and Near-optimal Sampling for Multivariate Function Approximations in Irregular Domains via Vandermonde with Arnoldi

Vandermonde matrices are usually exponentially ill-conditioned and often...
research
11/21/2022

Toeplitz Low-Rank Approximation with Sublinear Query Complexity

We present a sublinear query algorithm for outputting a near-optimal low...
research
06/15/2022

Streaming Algorithms for Ellipsoidal Approximation of Convex Polytopes

We give efficient deterministic one-pass streaming algorithms for findin...
research
05/12/2021

Optimal pointwise sampling for L^2 approximation

Given a function u∈ L^2=L^2(D,μ), where D⊂ℝ^d and μ is a measure on D, a...
research
03/28/2023

Understanding and Exploring the Whole Set of Good Sparse Generalized Additive Models

In real applications, interaction between machine learning model and dom...

Please sign up or login with your details

Forgot password? Click here to reset