Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Alexander M. Powell is active.

Publication


Featured researches published by Alexander M. Powell.


IEEE Transactions on Information Theory | 2006

Sigma-delta (/spl Sigma//spl Delta/) quantization and finite frames

John J. Benedetto; Alexander M. Powell; Ozgur Yilmaz

The K-level Sigma-Delta (/spl Sigma//spl Delta/) scheme with step size /spl delta/ is introduced as a technique for quantizing finite frame expansions for /spl Ropf//sup d/. Error estimates for various quantized frame expansions are derived, and, in particular, it is shown that /spl Sigma//spl Delta/ quantization of a unit-norm finite frame expansion in /spl Ropf//sup d/ achieves approximation error where N is the frame size, and the frame variation /spl sigma/(F,p) is a quantity which reflects the dependence of the /spl Sigma//spl Delta/ scheme on the frame. Here /spl par//spl middot//spl par/ is the d-dimensional Euclidean 2-norm. Lower bounds and refined upper bounds are derived for certain specific cases. As a direct consequence of these error bounds one is able to bound the mean squared error (MSE) by an order of 1/N/sup 2/. When dealing with sufficiently redundant frame expansions, this represents a significant improvement over classical pulse-code modulation (PCM) quantization, which only has MSE of order 1/N under certain nonrigorous statistical assumptions. /spl Sigma//spl Delta/ also achieves the optimal MSE order for PCM with consistent reconstruction.


international conference on acoustics, speech, and signal processing | 2004

Sigma-delta quantization and finite frames

John J. Benedetto; Ozgur Yilmaz; Alexander M. Powell

It is shown that sigma-delta (/spl Sigma//spl Delta/) algorithms can be used effectively to quantize finite frame expansions for R/sup d/. Error estimates for various quantized frame expansions are derived, and, in particular, it is shown that /spl Sigma//spl Delta/ quantizers outperform the standard PCM schemes.The K-level Sigma-Delta (/spl Sigma//spl Delta/) scheme with step size /spl delta/ is introduced as a technique for quantizing finite frame expansions for /spl Ropf//sup d/. Error estimates for various quantized frame expansions are derived, and, in particular, it is shown that /spl Sigma//spl Delta/ quantization of a unit-norm finite frame expansion in /spl Ropf//sup d/ achieves approximation error where N is the frame size, and the frame variation /spl sigma/(F,p) is a quantity which reflects the dependence of the /spl Sigma//spl Delta/ scheme on the frame. Here /spl par//spl middot//spl par/ is the d-dimensional Euclidean 2-norm. Lower bounds and refined upper bounds are derived for certain specific cases. As a direct consequence of these error bounds one is able to bound the mean squared error (MSE) by an order of 1/N/sup 2/. When dealing with sufficiently redundant frame expansions, this represents a significant improvement over classical pulse-code modulation (PCM) quantization, which only has MSE of order 1/N under certain nonrigorous statistical assumptions. /spl Sigma//spl Delta/ also achieves the optimal MSE order for PCM with consistent reconstruction.


Foundations of Computational Mathematics | 2013

Sobolev Duals for Random Frames and ΣΔ Quantization of Compressed Sensing Measurements

C. S. Güntürk; Mark Lammers; Alexander M. Powell; Rayan Saab; Ozgur Yilmaz

Quantization of compressed sensing measurements is typically justified by the robust recovery results of Candès, Romberg and Tao, and of Donoho. These results guarantee that if a uniform quantizer of step size δ is used to quantize m measurements y=Φx of a k-sparse signal x∈ℝN, where Φ satisfies the restricted isometry property, then the approximate recovery x# via ℓ1-minimization is within O(δ) of x. The simplest and commonly assumed approach is to quantize each measurement independently. In this paper, we show that if instead an rth-order ΣΔ (Sigma–Delta) quantization scheme with the same output alphabet is used to quantize y, then there is an alternative recovery method via Sobolev dual frames which guarantees a reduced approximation error that is of the order δ(k/m)(r−1/2)α for any 0<α<1, if m≳r,αk(logN)1/(1−α). The result holds with high probability on the initial draw of the measurement matrix Φ from the Gaussian distribution, and uniformly for all k-sparse signals x whose magnitudes are suitably bounded away from zero on their support.


Advances in Computational Mathematics | 2010

Alternative dual frames for digital-to-analog conversion in sigma-delta quantization

Mark Lammers; Alexander M. Powell; Ozgur Yilmaz

We design alternative dual frames for linearly reconstructing signals from sigma–delta (ΣΔ) quantized finite frame coefficients. In the setting of sampling expansions for bandlimited functions, it is known that a stable rth order sigma–delta quantizer produces approximations where the approximation error is at most of order 1 / λr, and λ > 1 is the oversampling ratio. We show that the counterpart of this result is not true for several families of redundant finite frames for


Journal of Mathematical Physics | 2006

Gabor Schauder bases and the Balian-Low theorem

Christopher Heil; Alexander M. Powell

\mathbb{R}^d


Journal of Geometric Analysis | 2003

The Balian-Low theorem and regularity of Gabor systems

John J. Benedetto; Wojciech Czaja; Przemystaw Gadziński; Alexander M. Powell

when the canonical dual frame is used in linear reconstruction. As a remedy, we construct alternative dual frame sequences which enable an rth order sigma–delta quantizer to achieve approximation error of order 1/Nr for certain sequences of frames where N is the frame size. We also present several numerical examples regarding the constructions.


conference on information sciences and systems | 2010

Sigma delta quantization for compressed sensing

C. Sinan Güntürk; Mark Lammers; Alexander M. Powell; Rayan Saab; Ozgur Yilmaz

The Balian-Low Theorem is a strong form of the uncertainty principle for Gabor systems that form orthonormal or Riesz bases for L2(R). In this paper we investigate the Balian-Low Theorem in the setting of Schauder bases. We prove that new weak versions of the Balian-Low Theorem hold for Gabor Schauder bases, but we constructively demonstrate that several variants of the BLT can fail for Gabor Schauder bases that are not Riesz bases. We characterize a class of Gabor Schauder bases in terms of the Zak transform and product A2 weights; the Riesz bases correspond to the special case of weights that are bounded away from zero and infinity.The Balian-Low Theorem is a strong form of the uncertainty principle for Gabor systems that form orthonormal or Riesz bases for L2(R). In this paper we investigate the Balian-Low Theorem in the setting of Schauder bases. We prove that new weak versions of the Balian-Low Theorem hold for Gabor Schauder bases, but we constructively demonstrate that several variants of the BLT can fail for Gabor Schauder bases that are not Riesz bases. We characterize a class of Gabor Schauder bases in terms of the Zak transform and product A2 weights; the Riesz bases correspond to the special case of weights that are bounded away from zero and infinity.


Journal of Functional Analysis | 2007

Uncertainty principles for orthonormal sequences

Philippe Jaming; Alexander M. Powell

AbstractFor any positive real numbers A, B, and d satisfying the conditions


Archive | 2006

Recent Developments in the Balian-Low Theorem

Wojciech Czaja; Alexander M. Powell


Siam Journal on Mathematical Analysis | 2006

An optimal example for the balian-low uncertainty principle

John J. Benedetto; Wojciech Czaja; Alexander M. Powell

\frac{1}{A} + \frac{1}{B} = 1

Collaboration


Dive into the Alexander M. Powell's collaboration.

Top Co-Authors

Avatar

Ozgur Yilmaz

University of British Columbia

View shared research outputs
Top Co-Authors

Avatar

Mark Lammers

University of North Carolina at Wilmington

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

C. Sinan Güntürk

Courant Institute of Mathematical Sciences

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Christopher Heil

Georgia Institute of Technology

View shared research outputs
Top Co-Authors

Avatar

James E. Blum

University of North Carolina at Wilmington

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Yang Wang

Hong Kong University of Science and Technology

View shared research outputs
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge