Papers
Topics
Authors
Recent
Search
2000 character limit reached

Beyond Wiener's Lemma: Nuclear Convolution Algebras and the Inversion of Digital Filters

Published 10 Nov 2017 in math.FA | (1711.03999v1)

Abstract: A convolution algebra is a topological vector space $\mathcal{X}$ that is closed under the convolution operation. It is said to be inverse-closed if each element of $\mathcal{X}$ whose spectrum is bounded away from zero has a convolution inverse that is also part of the algebra. The theory of discrete Banach convolution algebras is well established with a complete characterization of the weighted $\ell_1$ algebras that are inverse-closed and referred to as the Gelfand-Raikov-Shilov (GRS) spaces. Our starting point here is the observation that the space $\mathcal{S}(\mathbb{Z}d)$ of rapidly decreasing sequences, {which is not Banach but nuclear}, is an inverse-closed convolution algebra. This property propagates to the more constrained space of exponentially decreasing sequences $\mathcal{E}(\mathbb{Z}d)$ that we prove to be nuclear as well. Using a recent extended version of the GRS condition, we then show that $\mathcal{E}(\mathbb{Z}d)$ is actually the smallest inverse-closed convolution algebra. This allows us to describe the hierarchy of the inverse-closed convolution algebras from the smallest, $\mathcal{E}(\mathbb{Z}d)$, to the largest, $\ell_{1}(\mathbb{Z}d)$. In addition, we prove that, in contrast to $\mathcal{S}(\mathbb{Z}d)$, all members of $\mathcal{E}(\mathbb{Z}d)$ admit well-defined convolution inverses in $\mathcal{S}'(\mathbb{Z}d)$ with the "unstable" scenario (when some frequencies are vanishing) giving rise to inverse filters with slowly-increasing impulse responses. Finally, we use those results to reveal the decay and reproduction properties of an extended family of cardinal spline interpolants.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.