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

An efficient algorithm for the reconstruction of punctured convolutional codes

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2017年第1期2017卷 1-5页

作者： Chung, Habong Jang, Hwanseok Seong, Jinwoo Hongik Univ Dept Elect Engn Wausan Rd 94 Seoul 04066 South Korea Daumsoft Hannam Rd 21 Seoul South Korea Hongik Univ Elect Informat & Commun Engn Wausan Rd 94 Seoul 04066 South Korea

Puncturing is one of the methods of increasing the code rate, and the original code before puncturing is called the mother code. Any (N,K) convolutional code is obtainable by puncturing some (n,1) mother codes. The objective of a blind recognition of a channel code is to obtain its generator from the intercepted noisy bit stream. The process of the blind recognition of punctured convolutional codes consists of two parts: the reconstruction of the PGM of the (N,K) punctured convolutional code and the searching process of the mother code and its puncturing pattern. The process of finding the mother code is important for designing the optimum channel decoder. In this paper, a new searching algorithm with the computational complexity of O(K-4) polynomial operations is proposed, compared to the existing searching algorithm by M. Cluzeau which requires O(K-6) polynomial operations.

关键词： Punctured convolutional code Mother code Blocked convolutional code polynomial generator matrix

来源：评论

学校读者我要写书评

暂无评论

Sufficient Conditions for an (n, 1) Mother Code and Its Puncturing Pattern to generate a Given Convolutional Code 7

Sufficient Conditions for an (<i>n</i>, 1) Mother Code and I...

引用

7th International Workshop on Signal Design and Its Applications in Communications (IWSDA)

作者： Chung, Habong Jang, Hwanseok Seong, Jinwoo Hongik Univ Seoul South Korea

ISBN: (纸本)9781467383080

Puncturing is the most common way of increasing the rate of convolutional codes. The puncturing process is done to the original code called the mother code by a specific puncturing pattern. In this article, we investigate into the question whether any convolutional code is obtainable by puncturing some (n, 1) mother codes. We present two sufficient conditions for the mother code and the puncturing pattern to satisfy in order that the punctured code is equivalent to the given (N, K) convolutional code.

关键词： Punctured Convolutional Code Mother code Puncturing Pattern polynomial generator matrix

来源：评论

学校读者我要写书评

暂无评论

Structure properties of punctured convolutional codes and their applications

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 1999年第9期E82B卷 1432-1438页

作者： Sun, ZQ Kimura, S Ebihara, Y Univ Tsukuba Doctoral Program Engn Tsukuba Ibaraki 3050005 Japan Univ Tsukuba Inst Informat Sci & Elect Tsukuba Ibaraki 3050005 Japan

This paper presents the generator polynomial matrices and the upper bound on the constraint length of punctured convolutional codes (PCCs), respectively. By virtue of these properties, we provide the puncturing realiz... 详细信息

关键词： polynomial generator matrix punctured convolutional codes constraint length

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：