Asymptotic frame theory for analog coding

Marina Haikin, Matan Gavish, Dustin G. Mixon, Ram Zamir

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

Over-complete systems of vectors, or in short, frames, play the role of analog codes in many areas of communication and signal processing. To name a few, spreading sequences for code-division multiple access (CDMA), over-complete representations for multiple-description (MD) source coding, space-time codes, sensing matrices for compressed sensing (CS), and more recently, codes for unreliable distributed computation. In this survey paper we observe an informationtheoretic random-like behavior of frame subsets. Such subframes arise in setups involving erasures (communication), random user activity (multiple access), or sparsity (signal processing), in addition to channel or quantization noise. The goodness of a frame as an analog code is a function of the eigenvalues of a sub-frame, averaged over all subframes (e.g., harmonic mean of the eigenvalues relates to least-square estimation error, while geometric mean to the Shannon transform, and condition number to the restricted isometry property). Within the highly symmetric class of Equiangular Tight Frames (ETF), as well as other "near ETF"families, we show a universal behavior of the empirical eigenvalue distribution (ESD) of a randomly-selected sub-frame: (i) the ESD is asymptotically indistinguishable from Wachter's MANOVA distribution; and (ii) it exhibits a convergence rate to this limit that is indistinguishable from that of a matrix sequence drawn from MANOVA (Jacobi) ensembles of corresponding dimensions. Some of these results follow from careful statistical analysis of empirical evidence, and some are proved analytically using random matrix theory arguments of independent interest. The goodness measures of the MANOVA limit distribution are better, in a concrete formal sense, than those of the Marchenko-Pastur distribution at the same aspect ratio, implying that deterministic analog codes are better than random (i.i.d.) analog codes. We further give evidence that the ETF (and near ETF) family is in fact superior to any other frame family in terms of its typical sub-frame goodness.

Original languageAmerican English
Pages (from-to)526-645
Number of pages120
JournalFoundations and Trends in Communications and Information Theory
Volume18
Issue number4
DOIs
StatePublished - 18 Nov 2021

Bibliographical note

Publisher Copyright:
© 2021 M. Haikin, M. Gavish, D.G. Mixon and R. Zamir.

Fingerprint

Dive into the research topics of 'Asymptotic frame theory for analog coding'. Together they form a unique fingerprint.

Cite this