← 研踪 PaperTrailarXiv:2609.12631 · v2
Confusion-Erasure Bounds of Error-Bounded Decoders under QAM
首次提交 2026-09-11 17:29
版本更新 2026-11-03 15:48
雷达观测 2026-11-04 23:40
摘要
6G is expected to push ultra-reliable low-latency communication (URLLC) toward stringent residual-error tar- gets for mission-critical services, where undetected errors and erasures carry fundamentally different costs. Block error rate (BLER) conflates block confusions (undetected errors) and block erasures, which have fundamentally different impacts on system reliability. To characterize the confusion rate analyt- ically, we consider an error-bounded decoder with spherical decision regions. We focus on square quadrature amplitude modulation (QAM) constellations in the finite blocklength (FBL) regime. The confusion rate is governed by the Euclidean distances between modulated codewords, whereas the code structure constrains their Hamming distances. To bridge the two metrics, we introduce a typical distance, which represents the Euclidean distance of a codeword pair at a given Hamming distance on average, and relate it to the Hamming distance through a per-symbol squared-distance coefficient. On this basis, we derive a lower bound on the block confusion rate for random codes and an upper bound for codebooks whose minimum Euclidean distance reaches the typical distance at the non-overlapping threshold. We further characterize how both bounds evolve with the average symbol energy and the block- length. Numerical results, validated by an exact computation for short codes, confirm that as the signal-to-noise ratio (SNR) or redundancy increases, the confusion rate falls many orders of magnitude below the reliability target, leaving detectable erasures as the dominant residual error.
作者备注：Submitted to IEEE ICC 2027
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v2 · 2026-11-03 15:48 · 最新观测版本
Confusion-Erasure Bounds of Error-Bounded Decoders under QAM
6G is expected to push ultra-reliable low-latency communication (URLLC) toward stringent residual-error tar- gets for mission-critical services, where undetected errors and erasures carry fundamentally different costs. Block error rate (BLER) conflates block confusions (undetected errors) and block erasures, which have fundamentally different impacts on system reliability. To characterize the confusion rate analyt- ically, we consider an error-bounded decoder with spherical decision regions. We focus on square quadrature amplitude modulation (QAM) constellations in the finite blocklength (FBL) regime. The confusion rate is governed by the Euclidean distances between modulated codewords, whereas the code structure constrains their Hamming distances. To bridge the two metrics, we introduce a typical distance, which represents the Euclidean distance of a codeword pair at a given Hamming distance on average, and relate it to the Hamming distance through a per-symbol squared-distance coefficient. On this basis, we derive a lower bound on the block confusion rate for random codes and an upper bound for codebooks whose minimum Euclidean distance reaches the typical distance at the non-overlapping threshold. We further characterize how both bounds evolve with the average symbol energy and the block- length. Numerical results, validated by an exact computation for short codes, confirm that as the signal-to-noise ratio (SNR) or redundancy increases, the confusion rate falls many orders of magnitude below the reliability target, leaving detectable erasures as the dominant residual error.
查看此版本解读 →查看此版本原文 ↗