• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 3
  • 3
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Frames Generated by Actions of Locally Compact Groups

Iverson, Joseph 27 October 2016 (has links)
Let $G$ be a second countable, locally compact group which is either compact or abelian, and let $\rho$ be a unitary representation of $G$ on a separable Hilbert space $\mathcal{H}_\rho$. We examine frames of the form $\{ \rho(x) f_j \colon x \in G, j \in I\}$ for families $\{f_j\}_{j \in I}$ in $\mathcal{H}_\rho$. In particular, we give necessary and sufficient conditions for the joint orbit of a family of vectors in $\mathcal{H}_\rho$ to form a continuous frame. We pay special attention to this problem in the setting of shift invariance. In other words, we fix a larger second countable locally compact group $\Gamma \supset G$ containing $G$ as a closed subgroup, and we let $\rho$ be the action of $G$ on $L^2(\Gamma)$ by left translation. In both the compact and the abelian settings, we introduce notions of Zak transforms on $L^2(\Gamma)$ which simplify the analysis of group frames. Meanwhile, we run a parallel program that uses the Zak transform to classify closed subspaces of $L^2(\Gamma)$ which are invariant under left translation by $G$. The two projects give compatible outcomes. This dissertation contains previously published material.
2

Alternate Duals of Gabor Subspace Frames

Akinlar, Mehmet Ali 08 1900 (has links)
<p> In this thesis we mainly give a characterization of dual frames of Gabor subspace frames. We give necessary and sufficient conditions for the existence and the uniqueness of a function h (called window) in the closed linear span of a Gabor subspace frame {EmbTnak}m,n∈Z such that the Bessel collection {EmbTnah}m,n∈Z serves as the dual frame of the original frame {EmbTnag}m,n∈Z. We solve the problem for three cases, first ab = 1, second ab = p ∈ N, and third ab = p/q, gcd(p, q) = 1. In each case, we first find the conditions for upper frame bound (known as Bessel collection). Secondly, we characterize the functions which are orthogonal to {EmbTnag}m,n∈Z in terms of the Zak transform, and then obtain necessary and sufficient conditions for lower frame bound. Here we state obtained conditions for normalized tight frame as a corollary. Finally, using all this information we solve the duality problem.</p> / Thesis / Master of Science (MSc)
3

Modulation spaces, BMO and the Zak transform, and minimizing IPH functions over the unit simplex

Tinaztepe, Ramazan 07 July 2010 (has links)
This thesis consists of two parts. In the first chapter, we give some results on modulation spaces. First the relationship between the classical spaces and the modulation spaces is established. It is proved that certain modulation spaces defined on R² lie in the BMO space. Another result is that the Zak transform, a discrete time-frequency transform, maps a modulation space into a higher dimensional modulation space. And by using these results, an uncertainty principle for Gabor frames via modulation spaces is obtained. In the second part, we deal with optimization of an increasing positively homogeneous functions on the unit simplex. The class of increasing positively homogeneous functions is one of the function classes obtained via min-type functions in the context of abstract convexity. The cutting angle method is used for the minimization of this type functions. The most important step of this method is the minimization of a function which is the maximum of a number of min-type functions on the unit simplex. We propose a numerical algorithm for the minimization of such functions on the unit simplex and we mathematically prove that this algorithm finds the exact solution of the minimization problem. Some experiments have been carried out and the results of the experiments have been presented.

Page generated in 0.4252 seconds