.png){kind=icon}
返回
Computing upper bounds to error probability of coded modulation schemes
.png){kind=icon}
PRE
AI
DOI：10.1109/26.508297.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
To evaluate an upper bound on error probabilities of signal constellations used for transmission over the additive white Gaussian noise (AWGN) channel, enumeration of all the constellation intradistances is required, These may be infinite in number, for example, when convolutional codes are used and the constellations are lattices, Truncation of the series does not necessarily provide a bound anymore, and must be done with care, Yet the union bound is very simple, as it does not require any further knowledge about the signal constellation than the distance enumerator, In this paper, we describe some methods that can be used to evaluate error probabilities of infinite signal constellations, and that require only a finite number of terms, These methods are applicable, for example, to convolutional codes decoded with a finite-depth Viterbi algorithm and to signal constellations carved from lattices, Coded modulations based on lattices and convolutional or block codes can also be dealt viith. As an example of application, we analyze a variable-rate 3-stage coded modulation encoder/decoder, which has been built and is based on a combination of convolutional codes with a single-parity-check block code.
Keyword:
TRUNCATION
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
暂无机构信息
引用论文
分享收藏The effect of cytochalasin-B concentration on the frequency of micronuclei induced by four standard mutagens. Results from two laboratories.png)
Mutagenesis
MutagenesisIF0
PREAI
分享收藏
没有更多内容
没有更多内容