SearcharxivSearch

arXiv subjects

Brad Osgood

Publications and source records attributed to Brad Osgood.

14 recordsLinked to original sources

Numerical Stability of DFT Computation for Signals with Structured Support

We consider the problem of building numerically stable algorithms for computing Discrete Fourier Transform (DFT) of $N$- length signals with known frequency support of size $k$. A typical algorithm, in this case, would involve solving (possibly poorly conditioned) system of equations, causing numerical instability. When $N$ is a power of 2, and the frequency support is a random subset of $\mathbb{Z}_N$, we provide an algorithm that has (a possibly optimal) $O(k \log k)$ complexity to compute the DFT while solving system of equations that are $O(1)$ in size.

eess.SP

Best Möbius approximations of convex and concave mappings

We study the best Möbius approximations (BMA) to convex and concave conformal mappings of the disk, including the special case of mappings onto convex polygons. The crucial factor is the location of the poles of the BMAs. Finer details are possible in the case of polygons through special properties of Blaschke products and the prevertices of the mapping function.

math.CV

Fast DFT Computation for Signals with Structured Support

Suppose an $N-$length signal has known frequency support of size $k$. Given sample access to this signal, how fast can we compute the DFT? The answer to this question depends on the structure of the frequency support. We first identify some frequency supports for which (an ideal) $O(k \log k)$ complexity is achievable, referred to as homogeneous sets. We give a generalization of radix-2 that enables $O(k\log k)$ computation of signals with homogeneous frequency support. Using homogeneous sets as building blocks, we construct more complicated support structures for which the complexity of $O(k\log k)$ is achievable. We also investigate the relationship of DFT computation with additive structure in the support and provide partial converses.

eess.SP

Computing the Discrete Fourier Transform of signals with spectral frequency support

We consider the problem of finding the Discrete Fourier Transform (DFT) of $N-$ length signals with known frequency support of size $k$. When $N$ is a power of 2 and the frequency support is a spectral set, we provide an $O(k \log k)$ algorithm to compute the DFT. Our algorithm uses some recent characterizations of spectral sets and is a generalization of the standard radix-2 algorithm.

eess.SP

Convolution Idempotents with a given Zero-set

We investigate the structure of N-length discrete signals h satisfying h*h=h that vanish on a given set of indices. We motivate this problem from examples in sampling, Fuglede's conjecture, and orthogonal interpolation of bandlimited signals. When N is a prime power, we characterize all such h with a prescribed zero set in terms of digit expansions of nonzero indices in the inverse DFT of h.

cs.IT

Discrete Sampling: A graph theoretic approach to Orthogonal Interpolation

We study the problem of finding unitary submatrices of the $N \times N$ discrete Fourier transform matrix, in the context of interpolating a discrete bandlimited signal using an orthogonal basis. This problem is related to a diverse set of questions on idempotents on $\mathbb{Z}_N$ and tiling $\mathbb{Z}_N$. In this work, we establish a graph-theoretic approach and connections to the problem of finding maximum cliques. We identify the key properties of these graphs that make the interpolation problem tractable when $N$ is a prime power, and we identify the challenges in generalizing to arbitrary $N$. Finally, we investigate some connections between graph properties and the spectral-tile direction of the Fuglede conjecture.

cs.IT

On convex mappings

We establish a new characterization for a conformal mapping of the unit disk $\mathbb{D}$ to be convex, and identify the mappings onto a half-plane or a parallel strip as extremals. We also show that, with these exceptions, the level sets of $λ$ of the Poincaré metric $λ|dw|$ of a convex domain are strictly convex.

math.CV

Quasiconformal Extensions to Space of Weierstrass-Enneper Lifts

We derive a quasiconformal extension to 3-space of the Weierstrass-Enneper lifts of a class of harmonic mappings defined in the unit disk. The extension is based on fibrations of space by circles in domain and image that correspond to each other in a natural way. Convexity plays an essential role in the analysis. As a corollary we derive a sufficient condition for the underlying harmonic mapping to be univalent in the disk, with an explicit quasiconformal extension to the extended plane that generalizes the well known formula by Ahlfors-Weill.

math.CV

Discrete Sampling and Interpolation: Universal Sampling Sets for Discrete Bandlimited Spaces

We study the problem of interpolating all values of a discrete signal f of length N when d<N values are known, especially in the case when the Fourier transform of the signal is zero outside some prescribed index set J; these comprise the (generalized) bandlimited spaces B^J. The sampling pattern for f is specified by an index set I, and is said to be a universal sampling set if samples in the locations I can be used to interpolate signals from B^J for any J. When N is a prime power we give several characterizations of universal sampling sets, some structure theorems for such sets, an algorithm for their construction, and a formula that counts them. There are also natural applications to additive uncertainty principles.

cs.IT

Two-Point Distortion Theorems for Harmonic Mappings

In earlier work the authors have extended Nehari's well-known Schwarzian derivative criterion for univalence of analytic functions to a univalence criterion for canonical lifts of harmonic mappings to minimal surfaces. The present paper develops some quantitative versions of that result in the form of two-point distortion theorems. Along the way some distortion theorems for curves in ${\Bbb R}^n$ are given, thereby recasting a recent injectivity criterion of Chuaqui and Gevirtz in quantitative form.

math.CV

Ahlfors-Weill Extensions for a Class of Minimal Surfaces

The Ahlfors-Weill extension of a conformal mapping of the disk is generalized to the lift of a harmonic mapping of the disk to a minimal surface, producing homeomorphic and quasiconformal extensions. The extension is obtained by a reflection across the boundary of the surface using a family of Euclidean circles orthogonal to the surface. This gives a geometric generalization of the Ahlfors-Weill formula and extends the minimal surface. Thus one obtains a homeomorphism of $\overline{\mathbb{C}}$ onto a toplological sphere in $\overline{\mathbb{R}^3} = \mathbb{R}^3 \cup \{\infty\}$ that is real-analytic off the boundary. The hypotheses involve bounds on a generalized Schwarzian derivative for harmonic mappings in term of the hyperbolic metric of the disk and the Gaussian curvature of the minimal surface. Hyperbolic convexity plays a crucial role.

math.CV

Falling Factorials, Generating Functions, and Conjoint Ranking Tables

We investigate the coefficients generated by expressing the falling factorial $(xy)_k$ as a linear combination of falling factorial products $(x)_l (y)_m$ for $l,m =1,...,k$. Algebraic and combinatoric properties of these coefficients are discussed, including recurrence relations, closed-form formulae, relations with Stirling numbers, and a combinatorial characterization in terms of conjoint ranking tables.

math.CO

Schwarzian Derivatives and Uniform Local Univalence

Quantitative estimates are obtained for the (finite) valence of functions analytic in the unit disk with Schwarzian derivative that is bounded or of slow growth. A harmonic mapping is shown to be uniformly locally univalent with respect to the hyperbolic metric if and only if it has finite Schwarzian norm, thus generalizing a result of B. Schwarz for analytic functions. A numerical bound is obtained for the Schwarzian norms of univalent harmonic mappings.

math.CV