Abstract:We establish lower and upper bounds for the identification capacity of discrete-time Gaussian channels subject to inter-symbol interference (ISI), a canonical model in wireless communication. Our analysis accounts for deterministic encoders under peak power constraint. A principal finding is that, even when the number of ISI taps scales sub-linearly with the codeword length $n$ as $\sim n^{\kappa}$ with $\kappa \in [0,1/2),$ the number of messages that can be reliably identified grows super-exponentially in $n$ as $\sim 2^{(n \log n)R},$ where $R$ denotes the coding rate.
From: Mohammad Javad Salariseddigh [view email]
[v1]
Sun, 15 Mar 2026 06:40:10 UTC (21 KB)
[v2]
Fri, 1 May 2026 01:06:00 UTC (26 KB)
[v3]
Mon, 31 Aug 2026 00:07:04 UTC (27 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。