Many communication applications incorporate event-triggered behavior, where the conventional Shannon capacity may not effectively gauge performance. Consequently, we advocate for the concept of identification capacity as a more suitable metric for assessing these systems. We consider deterministic identification codes for the Gaussian AWGN, the slow fading, and the fast fading channels with power constraints. We prove lower bounds on capacities for the slow and the fast fading channels with side information for a wide range of fading distributions. Additionally, we present the code construction with efficient encoding which achieves the lower bound on capacity both for the slow and the fast fading channels. At last, we prove the same lower bound on the capacity of the fast fading channel without side information, i.e. the same lower bound holds even when the receiver doesn't know the fading coefficients. As a result we show that compared with Shannon's message transmission paradigm we achieved completely different capacity scaling for deterministic identification codes for all relevant fading channels.

翻译：许多通信应用涉及事件触发行为，传统的香农容量可能无法有效衡量其性能。因此，我们提出将识别容量作为评估这些系统更合适的指标。我们考虑具有功率约束的高斯加性白噪声信道、慢衰落信道和快衰落信道的确定性识别码。对于具有边信息的慢衰落和快衰落信道，我们在广泛的衰落分布范围内证明了容量的下界。此外，我们提出了一种具有高效编码的码字构造方法，该方法在慢衰落和快衰落信道上均能达到容量下界。最后，我们证明了无边信息快衰落信道的相同容量下界，即即使接收端不知道衰落系数，该下界仍然成立。结果表明，与香农的消息传输范式相比，我们在所有相关衰落信道的确定性识别码上实现了完全不同的容量缩放规律。