On Generalized Minimum Distance Decoding Thresholds for the AWGN Channel

On Generalized Minimum Distance Decoding Thresholds for the AWGN Channel
复制标题

AWGN 信道的广义最小距离解码阈值

DOI:
--
复制
发表时间:
2009
期刊:
arXiv.org
影响因子:
--
通讯作者:
V. Zyablov
V. Zyablov
中科院分区:
--
文献类型:
--
作者:
C. Senger;V. Sidorenko;V. Zyablov

文献摘要

被引文献

相似文献

我们考虑采用二进制相移键控调制的加性高斯白噪声信道。我们的目标是使一个二进制分组码的代数硬判决有界最小距离解码器能够利用从解调器获得的软信息。这个想法可以追溯到福尼(Forney),它基于将可靠性低的接收符号视为删除符号。在解码器处的这种删除是使用一个阈值来完成的,每个可靠性低于阈值的接收符号都被删除。根据解码器的目标总体复杂度,这种伪软判决解码可以从一个阈值\(T\)扩展到\(z>1\)个阈值\(T_1\)(此处可能原文有遗漏,推测可能是\(T_1, T_2,\cdots\))。对于一个阈值的情况,从最优阈值位置问题的几何解释开始,并使用兹亚布洛夫(Zyablov)的一种方法。
We consider the Additive White Gaussian Noise channel with Binary Phase Shift Keying modulation. Our aim is to enable an algebraic hard decision Bounded Minimum Distance decoder for a binary block code to exploit soft information obtained from the demodulator. This idea goes back to Forney and is based on treating received symbols with low reliability as erasures. This erasing at the decoder is done using a threshold, each received symbol with reliability falling below the threshold is erased. Depending on the target overall complexity of the decoder this pseudo-soft decision decoding can be extended from one threshold T to z>1 thresholds T_1 1 thresholds case, starting with a geometric interpretation of the optimal threshold location problem and using an approach from Zyablov.