Techniques of bounding the probability of decoding error for block coded modulation structures
Techniques of bounding the probability of decoding error for block coded modulation structures
复制标题
DOI：
10.1109/18.335901
复制
发表时间：
1994-05
期刊：
影响因子：
--
通讯作者：
H. Herzberg;G. Poltyrev
中科院分区：
文献类型：
--
作者：
H. Herzberg;G. Poltyrev
提出了两种编码调制结构中平均译码错误概率上界的方法。第一个界适用于加性白色高斯噪声（AWGN）信道，比众所周知的联合界和最小距离界更紧，特别是对于低信噪比。结果表明，对于Leech格这个上限是非常接近的球下界。对于第二个上界，这是适用于任何无记忆信道（不一定是AWGN），随机陪集编码的方法。在AWGN信道下，利用随机陪集编码的方法计算码的平均距离谱，得到了一个更严格的上界，这是计算第一个上界所必需的。>
Two techniques for upper bounding the average probability of decoding error in coded modulation structures are presented. The first bound, which is applicable to the additive white Gaussian noise (AWGN) channel, is tighter than the well-known union bound and the minimum distance bound, especially for low signal to noise ratio. It is shown that for the Leech lattice this upper bound is very close to a sphere lower bound. For the second upper bound, which is applicable to any memoryless channel (not necessarily AWGN), a method of random coset coding is presented. For the AWGN channel, a tighter upper bound is obtained by employing the method of random coset coding for calculating the average spectrum of distances of the code, which is required for the computation of the first upper bound. >