• DocumentCode
    1204663
  • Title

    Designing structured tight frames via an alternating projection method

  • Author

    Tropp, Joel A. ; Dhillon, Inderjit S. ; Heath, Robert W., Jr. ; Strohmer, Thomas

  • Author_Institution
    Inst. for Comput. Eng. & Sci., Univ. of Texas, Austin, TX, USA
  • Volume
    51
  • Issue
    1
  • fYear
    2005
  • Firstpage
    188
  • Lastpage
    209
  • 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
    code division multiple access; eigenvalues and eigenfunctions; inverse problems; sparse matrices; spread spectrum communication; vectors; CDMA; algebraic construction; alternating projection method; code-division multiple-access; convergence property; general Welch-bound-equality sequences; generalize orthonormal system; inverse eigenvalue problem; inverse problem; lEP; matrix nearness problem; sparse approximation; structured tight frames; vector norms; Algorithm design and analysis; Convergence; Dictionaries; Eigenvalues and eigenfunctions; Geometry; Inverse problems; Mathematics; Multiaccess communication; Peak to average power ratio; Sparse matrices; Algorithms; code-division multiple access (CDMA); eigenvalues and eigenfunctions; extremal problems; frames; geometry; inverse problems; sequences;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2004.839492
  • Filename
    1377501