Characterization and computation of canonical tight windows for Gabor frames

Let $(g_{nm})_{n,m\in Z}$ be a Gabor frame for $L_2(R)$ for given window $g$. We show that the window $h^0=S^{-1/2} g$ that generates the canonically associated tight Gabor frame minimizes $\|g-h\|$ among all windows $h$ 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 $h^0$ 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 is presented. We analyze the convergence behavior of this method and demonstrate the efficiency of the proposed algorithm by some numerical examples

On Lerch's transcendent and the Gaussian random walk

Let $X_1,X_2,...$ be independent variables, each having a normal distribution with negative mean $-\beta<0$ and variance 1. We consider the partial sums $S_n=X_1+...+X_n$, with $S_0=0$, and refer to the process $\{S_n:n\geq0\}$ as the Gaussian random walk. We present explicit expressions for the mean and variance of the maximum $M=\max\{S_n:n\geq0\}.$ These expressions are in terms of Taylor series about $\beta=0$ with coefficients that involve the Riemann zeta function. Our results extend Kingman's first-order approximation [Proc. Symp. on Congestion Theory (1965) 137--169] of the mean for $\beta\downarrow0$. We build upon the work of Chang and Peres [Ann. Probab. 25 (1997) 787--802], and use Bateman's formulas on Lerch's transcendent and Euler--Maclaurin summation as key ingredients.Comment: Published at http://dx.doi.org/10.1214/105051606000000781 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

Zernike circle polynomials and infinite integrals involving the product of Bessel functions

Several quantities related to the Zernike circle polynomials admit an expression as an infinite integral involving the product of two or three Bessel functions. In this paper these integrals are identified and evaluated explicitly for the cases of (a) the expansion coefficients of scaled-and-shifted circle polynomials, (b) the expansion coefficients of the correlation of two circle polynomials, (c) the Fourier coefficients occurring in the cosine representation of the circle polynomials, (d) the transient response of a baffled-piston acoustical radiator due to a non-uniform velocity profile on the piston

Optimal Tradeoff Between Exposed and Hidden Nodes in Large Wireless Networks

Wireless networks equipped with the CSMA protocol are subject to collisions due to interference. For a given interference range we investigate the tradeoff between collisions (hidden nodes) and unused capacity (exposed nodes). We show that the sensing range that maximizes throughput critically depends on the activation rate of nodes. For infinite line networks, we prove the existence of a threshold: When the activation rate is below this threshold the optimal sensing range is small (to maximize spatial reuse). When the activation rate is above the threshold the optimal sensing range is just large enough to preclude all collisions. Simulations suggest that this threshold policy extends to more complex linear and non-linear topologies