Error Performance of Channel Coding in Random-Access Communication
Error Performance of Channel Coding in Random-Access Communication
复制标题
随机接入通信中信道编码的误码性能
DOI：
10.1109/tit.2012.2190580
复制
发表时间：
2010
影响因子：
2.5
通讯作者：
Jie Luo
中科院分区：
文献类型：
--
作者：
Zheng Wang;Jie Luo
针对离散时间无记忆信道上的随机多址通信，Luo和Ephremides提出了一种新的信道编码方法。编码方法允许用户独立地选择他们的通信速率，而无需在彼此之间或与接收机共享速率信息。接收器将解码消息或报告冲突，这取决于可靠的消息恢复是否可能。结果表明，随着码字长度逐渐趋于无穷大，支持可靠消息恢复的通信速率集的特征在于可以由一个可实现的区域，该区域等于香农的信息速率区域，而无需凸船体操作。在本文中，我们推导出可实现的边界上的错误概率，包括解码错误概率和碰撞检测失败的概率，随机多址系统与有限的码字长度。通过将码字长度取为无穷大来获得可量化的误差指数。
A new channel coding approach was proposed by Luo and Ephremides for random multiple-access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the rate information among each other or with the receiver. The receiver will either decode the messages or report a collision depending on whether reliable message recovery is possible. It was shown that, asymptotically as the codeword length goes to infinity, the set of communication rates supporting reliable message recovery can be characterized by an achievable region which equals Shannon's information rate region without a convex hull operation. In this paper, we derive achievable bounds on error probabilities, including the decoding error probability and the collision miss detection probability, of random multiple-access systems with a finite codeword length. Achievable error exponents are obtained by taking the codeword length to infinity.