Gaussian Identification in MIMO Channels

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\mathrm{.}$ The number of reliably identifiable messages can grow super-exponentially with blocklength $n,$ following $M_n(R)=2^{(n\log 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.