arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.09119cs.ITmath.IT
收藏

确定性抽样译码:球面译码满足格型高斯分布

Deterministic Sampling Decoding: Where Sphere Decoding Meets Lattice Gaussian Distribution

Zheng Wang, Cong Ling, Shi Jin

摘要:

研究了基于格点高斯分布的球形解码(SD)范式,其中球半径$D>0$由初始剪枝大小$K>1$、标准差$σ>0$和正则项$ρ_{σ,\mathbf{y}}(Λ)>0$($Λ$表示格点,$\mathbf{y}$表示查询点)表征.以这种方式,获得额外的自由度的解码性能和复杂性的分析诊断。在此基础上,首次提出了等效SD(ESD)算法,并证明了该算法与经典Fincke-Pohst SD算法完全相同,只是用$D=σ\sqrt{2\ln K}$来表征球半径。通过适当地固定$σ$,我们表明,ESD的复杂性所衡量的访问节点的数量是上限由$|S|<nK$,从而导致在一个易于处理的解码权衡仅由$K$。为了进一步挖掘解码潜力,提出了基于Klein采样概率的正则化SD(RSD)算法,该算法充分利用正则化项,实现了比等价SD更好的解码折衷。此外,针对小$K$情况下的译码问题,除了设计剪枝阈值准则外,还提出了一种新的译码准则--候选保护准则,将正则化SD和等价SD从最大似然译码推广到有界距离译码。最后,基于MIMO检测的仿真结果证实了所提出的基于格型高斯分布的SD算法的易处理的解码权衡。

英文摘要:

In this paper, the paradigm of sphere decoding (SD) based on lattice Gaussian distribution is studied, where the sphere radius $D>0$ in the sense of Euclidean distance is characterized by the initial pruning size $K>1$, the standard deviation $σ>0$ and a regularization term $ρ_{σ,\mathbf{y}}(Λ)>0$ ($Λ$ denotes the lattice, $\mathbf{y}$ is the query point). In this way, extra freedom is obtained for analytical diagnosis of both the decoding performance and complexity. Based on it, the equivalent SD (ESD) algorithm is firstly proposed, and we show it is exactly the same with the classic Fincke-Pohst SD but characterizes the sphere radius with $D=σ\sqrt{2\ln K}$. By fixing $σ$ properly, we show that the complexity of ESD measured by the number of visited nodes is upper bounded by $|S|<nK$, thus resulting in a tractable decoding trade-off solely determined by $K$. In order to further exploit the decoding potential, the regularized SD (RSD) algorithm based on Klein's sampling probability is proposed, which achieves a better decoding trade-off than the equivalent SD by fully utilizing the regularization terms. Moreover, besides the designed criterion of pruning threshold, another decoding criterion named as candidate protection is proposed to solve the decoding problems in the cases of small $K$, which generalizes both the regularized SD and equivalent SD from maximum likelihood (ML) decoding to bounded distance decoding (BDD). Finally, simulation results based on MIMO detection are presented to confirm the tractable decoding trade-off of the proposed lattice Gaussian distribution-based SD algorithms.

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

↑