Time-domain characterization of multiwindow Gabor systems on discrete periodic sets

This paper addresses multiwindow Gabor systems on discrete periodic sets, which can model signals to appear periodically but intermittently. We give some necessary and/or sufficient conditions for multiwindow Gabor systems to foe frames on discrete periodic sets, and characterize two multiwindow Gabor Bessel sequences to foe dual frames on discrete periodic sets. For a given multiwindow Gabor frame, we derive all its Gabor duals, among which we obtain an explicit expression of the canonical Gabor dual. In addition, we generalize multiwindow Gabor systems to the case of a different sampling rate for each window, and investigate multiwindow Gabor frames and dual frames in this case. We also show the properties of the multiwindow Gabor systems are essentially not changed by replacing the exponential kernel with other kernels.     

Weighted irregular Gabor tight frames and dual systems using windows in the Schwartz class

We give a characterization for the weighted irregular Gabor tight frames or dual systems in L²(Rn) in terms of the distributional symplectic Fourier transform of a positive Borel measure on R2n naturally associated with the system and the short-time Fourier transform of the windows in the case where the window (or at least one of the windows in the case of dual systems) belongs to S(Rn). This result implies that, for certain classes of windows such as generalized Gaussians or “extreme-value” windows, the only weighted irregular Gabor tight frames (or even dual systems with both windows in the same class) that can be constructed with these windows are the trivial ones, corresponding to the measure μ=1 on R2n. Furthermore, we show that, if a such Gabor system admits a dual which is of Gabor type, then the Beurling density of the associated measure exists and is equal to one.     

Hyperbolic Secants Yield Gabor Frames

We show that (g₂,a,b) is a Gabor frame when a>0, b>0, ab<1, and $\text{g}{}_2\text{(t)=(}\text{1}\text{2}\text{πγ)}{}^{\mathrm{1/2}}\text{(cosh}\text{πγt)}{}^{\mathrm{-1}}$ is a hyperbolic secant with scaling parameter γ>0. This is accomplished by expressing the Zak transform of g₂ in terms of the Zak transform of the Gaussian g₁(t)=(2γ)^1/4 exp (−πγt²), together with an appropriate use of the Ron–Shen criterion for being a Gabor frame. As a side result it follows that the windows, generating tight Gabor frames, that are canonically associated to g₂ and g₁ are the same at critical density a=b=1. Also, we display the “singular” dual function corresponding to the hyperbolic secant at critical density.     

Iterative Algorithms to Approximate Canonical Gabor Windows: Computational Aspects

In this article we investigate the computational aspects of some recently proposed iterative methods for approximating the canonical tight and canonical dual window of a Gabor frame (g, a, b). The iterations start with the window g while the iteration steps comprise the window g, the k-th iterand γ_k, the frame operators S and S_k corresponding to (g, a, b) and (γ_k, a, b), respectively, and a number of scalars. The structure of the iteration step of the method is determined by the envisaged convergence order m of the method. We consider two strategies for scaling the terms in the iteration step: Norm scaling, where in each step the windows are normalized, and initial scaling where we only scale in the very beginning. Norm scaling leads to fast, but conditionally convergent methods, while initial scaling leads to unconditionally convergent methods, but with possibly suboptimal convergence constants. The iterations, initially formulated for time-continuous Gabor systems, are considered and tested in a discrete setting in which one passes to the appropriately sampled-and-periodized windows and frame operators. Furthermore, they are compared with respect to accuracy and efficiency with other methods to approximate canonical windows associated with Gabor frames.     

B-Spline Approximations of the Gaussian,their Gabor Frame Properties,and Approximately Dual Frames

We prove that Gabor systems generated by certain scaled B-splines can be considered as perturbations of the Gabor systems generated by the Gaussian, with a deviation within an arbitrary small tolerance whenever the order N of the B-spline is sufficiently large. As a consequence we show that for any choice of translation/modulation parameters \(a,b>0\) with \(ab<1\), the scaled version of \(B_N\) generates Gabor frames for N sufficiently large. Considering the Gabor frame decomposition generated by the Gaussian and a dual window, the results lead to estimates of the deviation from perfect reconstruction that arise when the Gaussian is replaced by a scaled B-spline, or when the dual window of the Gaussian is replaced by certain explicitly given and compactly supported linear combinations of the B-splines. In particular, this leads to a family of approximate dual windows of a very simple form, leading to “almost perfect reconstruction” within any desired error tolerance whenever the product ab is sufficiently small. In contrast, the known (exact) dual windows have a very complicated form. A similar analysis is sketched with the scaled B-splines replaced by certain truncations of the Gaussian. As a consequence of the approach we prove (mostly known) convergence results for the considered scaled B-splines to the Gaussian in the \(L^p\)-spaces, as well in the time-domain as in the frequency domain.     

The existence of tight Gabor duals for Gabor frames and subspace Gabor frames

Let K and L be two full-rank lattices in Rd. We give a complete characterization for all the Gabor frames that admit tight dual of the same type. The characterization is given in terms of the center-valued trace of the von Neumann algebra generated by the left regular projective unitary representations associated with the time-frequency lattice K×L. Two applications of this characterization were obtained: (i) We are able to prove that every Gabor frame has a tight dual if and only if the volume of K×L is less than or equal to . (ii) We are able to obtain sufficient or necessary conditions for the existence of tight Gabor pseudo-duals for subspace Gabor frames in various cases. In particular, we prove that every subspace Gabor frame has a tight Gabor pseudo-dual if either the volume or v(K×L)?2. Moreover, if K=αZd, L=βZd with αβ=1, then a subspace Gabor frame G(g,L,K) has a tight Gabor pseudo-dual only when G(g,L,K) itself is already tight.     

Density results for subspace multiwindow Gabor systems in the rational case

Let S be a periodic set in R and L2(S) be a subspace of L2 (R). This paper investigates the density problem for multiwindow Gabor systems in L2(S) for the case that the product of time-frequency shift parameters is a rational number. We derive the density conditions for a multiwindow Gabor system to be complete (a frame) in L2(S). Under such conditions, we construct a multiwindow tight Gabor frame for L2(S) with window functions being characteristic functions. We also provide a characterization of a multiwindow Gabor frame to be a Riesz basis for L2(S), and obtain the density condition for a multiwindow Gabor Riesz basis for L2(S).     

Characterization and Computation of Canonical Tight Windows for Gabor Frames

Let (\gnm)_{n,m ? \Zst}(\gnm)_{n,m\in\Zst} be a Gabor frame for \LtR\LtR for given window gg. We show that the window \ho = \SQI g\ho=\SQI g that generates the canonically associated tight Gabor frame minimizes ||g-h||\|g-h\| among all windows hh generating a normalized tight Gabor frame. We present and prove versions of this result in the time domain, the frequency domain, the time-frequency domain, and the Zak transform domain, where in each domain the canonical \ho\ho is expressed using functional calculus for Gabor frame operators. Furthermore, we derive a Wiener--Levy type theorem for rationally oversampled Gabor frames. Finally, a Newton-type method for a fast numerical calculation of \ho\ho is presented. We analyze the convergence behavior of this method and demonstrate the efficiency of the proposed algorithm by some numerical examples.     

A duality principle for groups

The duality principle for Gabor frames states that a Gabor sequence obtained by a time-frequency lattice is a frame for L²(Rd) if and only if the associated adjoint Gabor sequence is a Riesz sequence. We prove that this duality principle extends to any dual pairs of projective unitary representations of countable groups. We examine the existence problem of dual pairs and establish some connection with classification problems for II₁ factors. While in general such a pair may not exist for some groups, we show that such a dual pair always exists for every subrepresentation of the left regular unitary representation when G is an abelian infinite countable group or an amenable ICC group. For free groups with finitely many generators, the existence problem of such a dual pair is equivalent to the well-known problem about the classification of free group von Neumann algebras.     

Subspace dual super wavelet and Gabor frames

Due to its potential applications in multiplexing techniques, the study of superframes has interested some researchers. This paper addresses dual super wavelet and Gabor frames in the subspace setting. We obtain a basic-equation characterization for subspace dual super wavelet and Gabor frames. In addition, applying this characterization, we derive a procedure that allows for constructing subspace dual super wavelet frames based on certain subspace dual super Gabor frames, and vice versa. Our results are new even in L²(R;C ^L ) setting.     

A multiplicative inequality for vertex Folkman numbers

Let G be a graph and a₁,…,a_r be positive integers. The symbol G→(a₁,…,a_r) denotes that in every r-coloring of the vertex set V(G) there exists a monochromatic a_i-clique of color i for some i∈{1,…,r}. The vertex Folkman numbers F(a₁,…,a_r;q)=min{|V(G)|:G→(a₁,…,a_r) and K_q?G} are considered. Let a_i, b_i, c_i, i∈{1,…,r}, s, t be positive integers and c_i=a_ib_i, 1?a_i?s,1?b_i?t. Then we prove that

F(c₁,c₂,…,c_r;st+1)?F(a₁,a₂,…,a_r;s+1)F(b₁,b₂,…,b_r;t+1).     

Gabor dual spline windows

A method is presented for constructing dual Gabor window functions that are polynomial splines. The spline windows are supported in [−1,1], with a knot at x=0, and can be taken C^m smooth and symmetric. The translation and modulation parameters satisfy a=1 and 0<b1/2. The full range 0<ab<1 is handled by introducing an additional knot. Many explicit examples are found.     

Stability of Gabor frames with arbitrary sampling points

Summary We study the stability of Gabor frames with arbitrary sampling points in the time-frequency plane, in several aspects. We prove that a Gabor frame generated by a window function in the Segal algebra S₀(R^d) remains a frame even if (possibly) all the sampling points undergo an arbitrary perturbation, as long as this is uniformly small. We give explicit stability bounds when the window function is nice enough, showing that the allowed perturbation depends only on the lower frame bound of the original family and some qualitative parameters of the window under consideration. For the perturbation of window functions we show that a Gabor frame generated by any window function with arbitrary sampling points remains a frame when the window function has a small perturbation in S₀(R^d) sense. We also study the stability of dual frames, which is useful in practice but has not found much attention in the literature. We give some general results on this topic and explain consequences to Gabor frames.     

Dilations and Completions for Gabor Systems

Let be a full rank time-frequency lattice in ℝ ^d ×ℝ ^d . In this note we first prove that any dual Gabor frame pair for a Λ-shift invariant subspace M can be dilated to a dual Gabor frame pair for the whole space L ²(ℝ ^d ) when the volume v(Λ) of the lattice Λ satisfies the condition v(Λ)≤1, and to a dual Gabor Riesz basis pair for a Λ-shift invariant subspace containing M when v(Λ)>1. This generalizes the dilation result in Gabardo and Han (J. Fourier Anal. Appl. 7:419–433, [2001]) to both higher dimensions and dual subspace Gabor frame pairs. Secondly, for any fixed positive integer N, we investigate the problem whether any Bessel–Gabor family G(g,Λ) can be completed to a tight Gabor (multi-)frame G(g,Λ)∪(∪ _j=1 ^N G(g _j ,Λ)) for L ²(ℝ ^d ). We show that this is true whenever v(Λ)≤N. In particular, when v(Λ)≤1, any Bessel–Gabor system is a subset of a tight Gabor frame G(g,Λ)∪G(h,Λ) for L ²(ℝ ^d ). Related results for affine systems are also discussed. Communicated by Chris Heil.     

Gabor frames, unimodularity, and window decay

We study time-continuous Gabor frame generating window functions g satisfying decay properties in time and/or frequency with particular emphasis on rational time-frequency lattices. Specifically, we show under what conditions these decay properties of g are inherited by its minimal dual γ⁰ and by generalized duals γ. We consider compactly supported, exponentially decaying, and faster than exponentially decaying (i.e., decay like |g(t)|≤Ce^{−α|t| 1/α} for some 1/2≤α<1) window functions. Particularly, we find that g and γ⁰ have better than exponential decay in both domains if and only if the associated Zibulski-Zeevi matrix is unimodular, i.e., its determinant is a constant. In the case of integer oversampling, unimodularity of the Zibulski-Zeevi matrix is equivalent to tightness of the underlying Gabor frame. For arbitrary oversampling, we furthermore consider tight Gabor frames canonically associated to window functions g satisfying certain decay properties. Here, we show under what conditions and to what extent the canonically associated tight frame inherits decay properties of g. Our proofs rely on the Zak transform, on the Zibulski-Zeevi representation of the Gabor frame operator, on a result by Jaffard, on a functional calculus for Gabor frame operators, on results from the theory of entire functions, and on the theory of polynomial matrices.     

On finite x-decomposable groups for X = {1, 2, 4}

A normal subgroup N of a finite group G is called an n-decomposable subgroup if N is a union of n distinct conjugacy classes of G. Each finite nonabelian nonperfect group is proved to be isomorphic to Q ₁₂, or Z ₂ × A ₄, or G = ??a, b, c | a ¹¹ = b ⁵ = c ² = 1, b ^?1 ab = a ⁴, c ^?1 ac = a ^?1, c ^?1 bc = b ^?1?? if every nontrivial normal subgroup is 2- or 4-decomposable.     

Medial groupoid varieties defined by infinite cyclic groups

Let G be the abelian group generated by α and β. We write Σ(G; α, β) for the set of groupoid identities that are satisfied in the group ring ${\mathbb{Z}[G]}$ when the binary operation is α x + β y. When the constant e, representing the zero of ${\mathbb{Z}}$ , is added to the type, we write Σ ^e (G; α, β) for the corresponding set of identities. In this paper, we assume that G is an infinite cyclic group with generator δ. We write Σ _a,b for Σ(G; δ ^a , δ ^b ) and ${\Sigma^{e}_{a,b}}$ for Σ ^e (G; δ ^a , δ ^b ). For each pair of relatively prime integers a and b, we determine whether Σ _a,b is finitely based and whether ${\Sigma^{e}_ {a,b}}$ is finitely based. One of our results implies that Σ ^e (G; α, β) is finitely based whenever G is finite.     

On the existence of super P-groups

A finite group (G, ·) is said to be sequenceable if its elements can be arranged in a sequence a₀ = e, a₁, a₂,…, a_n?1 in such a way that the partial products b₀ = a₀, b₁ = a₀a₁, b₂ = a₀a₁a₂,…, b_n?1 = a₀a₁a₂ ··· a_n?1 are all distinct (and consequently are the elements of G in a new order). It is said to be R-sequenceable if its elements can be ordered in such a way that the partial products b₀ = a₀, b₁ = a₀a₁, b₂ = a₀a₁a₂,…, b_n?2 = a₀a₁a₂ ··· a_n?2 are all different and so that b_n?1 = a₀a₁a₂ ··· a_n?1 = b₀ = e. (in the first case, the ordering a₀,a₁,…,a_n?1 of the elements is said to be a sequencing of G and, in the second case, an R-sequencing of G.) It is a super P-group if every element of one particular coset hG′ of the derived group can be expressed as the product of the n elements of G in such a way that the orderings of the elements in these products are sequencings of G with the exception that, in the case that h = e, the element e of G′ must be expressed as a product of the n elements of G which forms an R-sequencing of G. It is proved that every non-Abelian group of order pq such that p has 2 as a primitive root, where p and q are distinct odd primes with p < q, is a super P-group. Also provided is evidence for the conjectures that all Abelian groups and all dihedral groups of doubly even order (except those of orders 4 and 8) are super P-groups.     

New series expansions of the Gauss hypergeometric function

The Gauss hypergeometric function ₂ F ₁(a,b,c;z) can be computed by using the power series in powers of $z, z/(z-1), 1-z, 1/z, 1/(1-z),~\textrm{and}~(z-1)/z$ . With these expansions, ₂ F ₁(a,b,c;z) is not completely computable for all complex values of z. As pointed out in Gil et al. (2007, §2.3), the points z?=?e ^±iπ/3 are always excluded from the domains of convergence of these expansions. Bühring (SIAM J Math Anal 18:884–889, 1987) has given a power series expansion that allows computation at and near these points. But, when b???a is an integer, the coefficients of that expansion become indeterminate and its computation requires a nontrivial limiting process. Moreover, the convergence becomes slower and slower in that case. In this paper, we obtain new expansions of the Gauss hypergeometric function in terms of rational functions of z for which the points z?=?e ^±iπ/3 are well inside their domains of convergence. In addition, these expansions are well defined when b???a is an integer and no limits are needed in that case. Numerical computations show that these expansions converge faster than Bühring’s expansion for z in the neighborhood of the points e ^±iπ/3, especially when b???a is close to an integer number.     

Wide diameter of Cartesian graph bundles

Fault tolerance and transmission delay of networks are important concepts in network design. The notions are strongly related to connectivity and diameter of a graph, and have been studied by many authors. Wide diameter of a graph combines studying connectivity with the diameter of a graph. Diameter with width k of a graph G, k-diameter, is defined as the minimum integer d for which there exist at least k internally disjoint paths of length at most d between any two distinct vertices in G. Denote by D_c(G) the c-diameter of G and κ(G) the connectivity of G. In the context of computer networks, wide diameters of Cartesian graph products have been recently studied by many authors. Cartesian graph bundles is a class of graphs that is a generalization of the Cartesian graph products. Let G be a Cartesian graph bundle with fiber F over base B, 0<a≤κ(F), and 0<b≤κ(B). We prove that D_a+b(G)≤D_a(F)+D_b(B)+1. Moreover, if G is a graph bundle with fiber F≠K₂ over base B≠K₂, then D_a+b(G)≤D_a(F)+D_b(B). The bounds are tight.