检索结果-内蒙古大学图书馆

Polarization of a Point-to-Point Channel by a Multiple Access Channel: A New Method for Different Channel Polarization

引用

IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY-TRANSACTIONS OF ELECTRICAL ENGINEERING 2017年第2期41卷 115-122页

作者： Tavakoli, Hassan Univ Guilan Dept Elect Engn Fac Engn Rasht Iran

The polar coding method which was proposed by Arikan is mentioned. In this article, we will apply this method for the polarization of a general Multiple Access Channel. It will be shown that the polarization of a general Multiple Access Channel with a point-to-point channel can be given a more achievable rate region in the general form. The encoding and decoding complexity for these codes are O(N . log N) and error probability for them is O(2(-(N)beta)) like the original channel polarization method. Some numerical examples for the proposed method and the competitors are also given.

关键词： Channel polarization Multiple Access channel Polarization of multiple access channel Polar coding capacity achieving code

来源：评论

学校读者我要写书评

暂无评论

Optimal Coding for the Binary Deletion Channel With Small Deletion Probability

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2013年第10期59卷 6192-6219页

作者： Kanoria, Yashodhan Montanari, Andrea Stanford Univ Dept Elect Engn Stanford CA 94305 USA Stanford Univ Dept Stat Stanford CA 94305 USA

The binary deletion channel is the simplest point-to-point communication channel that models lack of synchronization. Input bits are deleted independently with probability d, and when they are not deleted, they are not affected by the channel. Despite significant effort, little is known about the capacity of this channel and even less about optimal coding schemes. In this paper, we develop a new systematic approach to this problem, by demonstrating that capacity can be computed in a series expansion for small deletion probability. We compute three leading terms of this expansion, and find an input distribution that achieves capacity up to this order. This constitutes the first optimal random coding result for the deletion channel. The key idea employed is the following: We understand perfectly the deletion channel with deletion probability d=0. It has capacity 1 and the optimal input distribution is iid Bernoulli(1/2). It is natural to expect that the channel with small deletion probabilities has a capacity that varies smoothly with d, and that the optimal input distribution is obtained by smoothly perturbing the iid Bernoulli(1/2) process. Our results show that this is indeed the case.

关键词： capacity achieving code channel capacity deletion channel series expansion

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：