Designing structured tight frames via an alternating projection method
Top Cited Papers
- 10 January 2005
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 51 (1), 188-209
- https://doi.org/10.1109/tit.2004.839492
Abstract
Tight frames, also known as general Welch-bound- equality sequences, generalize orthonormal systems. Numerous applications - including communications, coding, and sparse approximation- require finite-dimensional tight frames that possess additional structural properties. This paper proposes an alternating projection method that is versatile enough to solve a huge class of inverse eigenvalue problems (IEPs), which includes the frame design problem. To apply this method, one needs only to solve a matrix nearness problem that arises naturally from the design specifications. Therefore, it is the fast and easy to develop versions of the algorithm that target new design problems. Alternating projection will often succeed even if algebraic constructions are unavailable. To demonstrate that alternating projection is an effective tool for frame design, the paper studies some important structural properties in detail. First, it addresses the most basic design problem: constructing tight frames with prescribed vector norms. Then, it discusses equiangular tight frames, which are natural dictionaries for sparse approximation. Finally, it examines tight frames whose individual vectors have low peak-to-average-power ratio (PAR), which is a valuable property for code-division multiple-access (CDMA) applications. Numerical experiments show that the proposed algorithm succeeds in each of these three cases. The appendices investigate the convergence properties of the algorithm.Keywords
This publication has 80 references indexed in Scilit:
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraintCommunications on Pure and Applied Mathematics, 2004
- Computing the nearest correlation matrix--a problem from financeIMA Journal of Numerical Analysis, 2002
- Packing Lines, Planes, etc.: Packings in Grassmannian SpacesExperimental Mathematics, 1996
- Signal enhancement-a composite property mapping algorithmIEEE Transactions on Acoustics, Speech, and Signal Processing, 1988
- Closest normal matrix finally found!BIT Numerical Mathematics, 1987
- An Algorithm for Restricted Least Squares RegressionJournal of the American Statistical Association, 1983
- Sufficient conditions for the convergence of monotonic mathematicalprogramming algorithmsJournal of Computer and System Sciences, 1976
- Lower bounds on the maximum cross correlation of signals (Corresp.)IEEE Transactions on Information Theory, 1974
- Computation of channel capacity and rate-distortion functionsIEEE Transactions on Information Theory, 1972
- On the approximation of a function of several variables by the sum of functions of fewer variablesPacific Journal of Mathematics, 1951