Functional Kuppinger-Durisi-B\"olcskei Uncertainty Principle

Abstract

Let X be a Banach space. Let \τj\j=1n, \ωk\k=1m⊂eq X and \fj\j=1n, \gk\k=1m⊂eq X* satisfy |fj(τj)|≥ 1 for all 1≤ j ≤ n, |gk(ωk)|≥ 1 for all 1≤ k ≤ m. If x ∈ X \0\ is such that x=θτθf x=θωθg x, then we show that alignFKDB (1) \|θfx\|0\|θgx\|0≥ [1-(\|θfx\|0-1)1≤ j,r ≤ n,j≠ r|fj(τr)|]+[1-(\|θg x\|0-1)1≤ k,s ≤ m,k≠ s|gk(ωs)|]+(1≤ j ≤ n, 1≤ k ≤ m|fj(ωk)|)(1≤ j ≤ n, 1≤ k ≤ m|gk(τj)|). align We call Inequality (1) as Functional Kuppinger-Durisi-B\"olcskei Uncertainty Principle. Inequality (1) improves the uncertainty principle obtained by Kuppinger, Durisi and B\"olcskei [IEEE Trans. Inform. Theory (2012)] (which improved the Donoho-Stark-Elad-Bruckstein uncertainty principle [SIAM J. Appl. Math. (1989), IEEE Trans. Inform. Theory (2002)]). We also derive functional form of the uncertainity principle obtained by Studer, Kuppinger, Pope and B\"olcskei [EEE Trans. Inform. Theory (2012)].

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…