Gaussian Multiple Access via Compute-and-Forward

DOI10.1109/TIT.2016.2605121MaRDI QIDQ5347965zbMATH OpenOpenAlexFDO

Authors Zhihui Zhu, Michael B. Wakin

Publication date 25 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1608.04820

Mathematics Subject Classification ID

Sampling theory in information and communication theory (94A20)

Abstract: Any sequence of uniformly bounded $NimesN$ Hermitian Toeplitz matrices $$ is asymptotically equivalent to a certain sequence of $NimesN$ circulant matrices $$ derived from the Toeplitz matrices in the sense that $$ as $Nightarrowinfty$. This implies that certain collective behaviors of the eigenvalues of each Toeplitz matrix are reflected in those of the corresponding circulant matrix and supports the utilization of the computationally efficient fast Fourier transform (instead of the Karhunen-Lo`{e}ve transform) in applications like coding and filtering. In this paper, we study the asymptotic performance of the individual eigenvalue estimates. We show that the asymptotic equivalence of the circulant and Toeplitz matrices implies the individual asymptotic convergence of the eigenvalues for certain types of Toeplitz matrices. We also show that these estimates asymptotically approximate the largest and smallest eigenvalues for more general classes of Toeplitz matrices.

Cited in

(4)

• Approximating inverses of Toeplitz matrices by circulant matrices
• Circulant approximations of the inverses of Toeplitz matrices and related quantities with applications to stationary random processes
• On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms
• Asymptotic behavior of the condition number of two-level Toeplitz matrix sequences

This page was built for publication: Gaussian Multiple Access via Compute-and-Forward

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347965)