Deterministic Identification over Channels without CSI

TL;DR

This paper demonstrates that deterministic identification over block fading channels without CSI can achieve higher capacity than traditional transmission, using combined channel estimation and user identification codes, with verified finite-length performance.

Contribution

It extends deterministic identification to channels without CSI, showing capacity gains and providing theoretical and numerical analysis of finite-length performance.

Findings

Identification capacity exceeds transmission capacity without CSI.

Proposed blind deterministic identification is feasible in finite blocklength regimes.

Simulation confirms theoretical results and practical viability.

Abstract

Identification capacities of randomized and deterministic identification were proved to exceed channel capacity for Gaussian channels \emph{with} channel side information (CSI). In this work, we extend deterministic identification to the block fading channels without CSI by applying identification codes for both channel estimation and user identification. We prove that identification capacity is asymptotically higher than transmission capacity even in the absence of CSI. And we also analyze the finite-length performance theoretically and numerically. The simulation results verify the feasibility of the proposed blind deterministic identification in finite blocklength regime.