Interference Cancelling Codes for Ultra-Reliable Random Access

Abstract

Combinatorial code designs (CCDs) are proposed as a means for achieving ultra-reliability in the random access channel. In contrast to traditional access protocols that use random repetition coding, we show that by uniquely allocating repetition patterns to users, successful reception may be guaranteed up to a number of simultaneously active users in small frame sizes. Such codes are particularly robust in the low activity region where mission-critical machine-type communication is expected to operate. We also present deterministic codes designed to work in conjunction with successive interference cancellation to further improve reliability. The optimal IC code for frames of 5 access slots is given. Unlike slotted ALOHA, it is shown to limit packet losses to well below the ultra-reliability threshold (10−5). These error performance gains come at the cost of a strict limitation on the supported user population (11 users in the case of 5 slots). We therefore consider larger frames of 24 slots, and analyse heuristic, low-complexity CCDs with fixed repetition factors that support up to 2024 users. While these are sub-optimal IC codes, significant gains are still observed compared to random codes.