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^κ$ with $κ\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$ is the coding rate.

翻译：针对无线通信中典型模型——受符号间干扰（ISI）的高斯信道，我们建立了离散时间高斯信道辨识容量的上下界。本分析考虑了峰值功率约束下的确定性编码器。主要发现是：即便ISI抽头数随码字长度$n$以亚线性速率增长，满足$\sim n^κ$（其中$κ\in [0,1/2)$），可可靠辨识的消息数量仍以超指数速率增长，达到$\sim 2^{(n \log n)R}$，其中$R$为编码率。