PreprintarXiv licencearXiv
Gaussian Identification in MIMO Channels
Abstract
We study the identification capacity of discrete-time Gaussian multiple-input multiple-output (MIMO) channels under per-antenna, per-symbol peak-amplitude constraints. We establish upper and lower bounds on the identification capacity that scale linearly with the channel rank r. The number of reliably identifiable messages can grow super-exponentially with blocklength n, following Mn(R)=2(nlog n)R, where R is an achievable rate. The channel rank provides a spatial-multiplexing advantage, enabling higher achievable rates and, consequently, stronger super-exponential codebook growth. These results characterize the rank-dependent gain in achievable identification performance.
Related
- Identification for Inverse Gaussian Channels
- Commitment over Gaussian channels with deterministic identification codes
- Deterministic Identification over Additive Gaussian Channels
- Exact Degrees of Freedom of Spatially Sparse MIMO Channels Without Prior CSI
- A Unified Framework for Characterizing General MIMO Channels
BibTeX
@misc{salariseddigh2026gaussian,
title = {{Gaussian Identification in MIMO Channels}},
author = {Mohammad Javad Salariseddigh and Christian Deppe},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.22931},
eprint = {2610.22931},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.22931},
}
RIS
TY - UNPB
TI - Gaussian Identification in MIMO Channels
AU - Mohammad Javad Salariseddigh
AU - Christian Deppe
PY - 2026
DA - 2026/10/16
PB - arXiv
DO - 10.48550/arxiv.2610.22931
UR - https://arxiv.org/abs/2610.22931
AB - We study the identification capacity of discrete-time Gaussian multiple-input multiple-output (MIMO) channels under per-antenna, per-symbol peak-amplitude constraints. We establish upper and lower bounds on the identification capacity that scale linearly with the channel rank r. The number of reliably identifiable messages can grow super-exponentially with blocklength n, following M_n(R)=2^(nlog n)R, where R is an achievable rate. The channel rank provides a spatial-multiplexing advantage, enabling higher achievable rates and, consequently, stronger super-exponential codebook growth. These results characterize the rank-dependent gain in achievable identification performance.
ER -