arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2611.06566eess.SP
收藏

Box-Shift:用于软输出MIMO框解码的固定复杂度反假设生成方法

Box-Shift: Fixed-Complexity Counter-Hypothesis Generation for Soft-Output MIMO Box Decoding

Shengchun Yang, Amit Sravan Bora, Emil Matúš, Gerhard Fettweis

AI总结:

针对框解码仅支持硬输出的问题,提出Box-Shift算法,保留其免排序结构,在4×4 MIMO仿真中相比Bit-Flip实现0.7-1.5 dB增益,且乘法量减少75%。

摘要:

框解码(Box Decoding)是一种免排序的树搜索多输入多输出(MIMO)检测器,其每层的计算成本固定,与正交幅度调制(QAM)阶数无关。它的规则数据路径非常适合硬件实现,但迄今为止,该检测器在编码系统中仅能实现硬输出操作。其固定的四点框在每个轴上跨越两个相邻的格雷码QAM电平,导致高阶QAM下大部分比特缺乏反假设。这种缺失反假设(MCH)问题阻碍了有限最大对数似然比(LLR)的直接计算。我们提出了Box-Shift算法,该算法在每个检测层将现有框移动到携带每个格雷码比特互补值的最近节点。与比特翻转(Bit-Flip)不同,Box-Shift通过每个比特使用一个反相器解析识别部分最优反假设,并通过索引域增量更新路径度量。所提方法保留了框解码免排序、与QAM阶数无关的结构。使用5G NR低密度奇偶校验(LDPC)编码的编码4×4 MIMO仿真表明,在误码率为10⁻⁵且软候选预算相同的情况下,带有Box-Shift的框解码相比带有Bit-Flip的相同检测器,在E_b/N₀上实现了0.7至1.5 dB的增益。对于软候选指标,在可比的实数加法数量下,Box-Shift的增量更新相比Bit-Flip的显式评估所需的实数乘法减少了75%。

英文摘要:

Box Decoding is a sort-free tree-search multiple-input multiple-output (MIMO) detector with a fixed per-layer cost independent of the quadrature amplitude modulation (QAM) order. Its regular datapath is well suited to hardware implementation, but the detector has so far been limited to hard-output operation in uncoded systems. Its fixed four-point box spans two adjacent Gray-coded QAM levels per axis, leaving most bits without counter-hypotheses for higher-order QAM. This missing counter-hypothesis (MCH) problem prevents the direct computation of finite max-log log-likelihood ratios (LLRs). We propose the \emph{Box-Shift} algorithm, which shifts the existing box to the nearest node carrying the complementary value of each Gray-coded bit at each detection layer. Unlike Bit-Flip, Box-Shift analytically identifies the partially optimal counter-hypothesis using one inverter per bit and updates the path metric through an index-domain increment. The proposed method preserves the sort-free, QAM-order-independent structure of Box Decoding. Coded $4\times4$ MIMO simulations using 5G~NR low-density parity-check (LDPC) coding show that Box Decoding with Box-Shift achieves a $0.7$--$1.5$\,dB gain in $E_b/N_0$ over the same detector with Bit-Flip at a bit error rate of $10^{-5}$, with equal soft-candidate budgets. For the soft-candidate metrics, the incremental update of Box-Shift needs $75\%$ fewer real multiplications than the explicit evaluation of Bit-Flip at a comparable number of real additions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑