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

ldpc convolutional codes Based on Parity Check Polynomials with a Time Period of 3

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2009年第10期E92A卷 2479-2483页

作者： Murakami, Yutaka Okamura, Shutai Okasaka, Shozo Kishigami, Takaaki Orihashi, Masayuki Panasonic Corp Kadoma Osaka 5718501 Japan

We newly design time-varying low-density parity-check convolutional codes (ldpc-CCs) based on parity check polynomials of the convolutional codes with a time period of 3. and show that BER (Bit Error Rate) performance in the time-varying ldpc-CCs with a time period of 3 is better than that in the conventional time-varying ldpc-CCs with a time period of 2 in the same coding rate with the nearly equal constraint length.

关键词： ldpc convolutional codes time-varying time period of 3

来源：评论

学校读者我要写书评

暂无评论

ldpc convolutional codes Coded Cooperation Based on Puncturing 19

LDPC Convolutional Codes Coded Cooperation Based on Puncturi...

引用

19th International Conference on Advanced Communication Technology (ICACT)

作者： Jin, Wenhe Wu, Shaohua Yang, Erpeng Jiao, Jian Harbin Inst Technol Shenzhen Grad Sch Shenzhen 518055 Peoples R China

ISBN: (纸本)9788996865094

Coded cooperation is a kind of virtual MIMO transmission technology that can achieve both coding gain and diversity gain, which is very promising in 5G communication. To design a scheme that can be used for near-capacity transmission and can be generalized for slow and fast fading channels, this paper studies the coding cooperation based on convolutional ldpc codes. Firstly, channel coding the original information by ldpc convolutional codes, then divided the coded words into two parts by puncturing algorithm;secondly, introducing space-time transmission into the second frame of coded cooperation, so the diversity gain can be obtained under different fading scenarios. Simulation results show that the system performance can be improved generally.

关键词： coded cooperation ldpc convolutional codes space-time transmission puncturing

来源：评论

学校读者我要写书评

暂无评论

Distance Bounds for Periodically Time-Varying and Tail-Biting ldpc convolutional codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2010年第9期56卷 4301-4308页

作者： Truhachev, Dmitri Zigangirov, Kamil Sh. Costello, Daniel J., Jr. Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada USSR Acad Sci Inst Problems Informat Transmiss Moscow Russia Univ Notre Dame Dept Elect Engn Notre Dame IN 46556 USA Lund Univ Dept Elect & Informat Technol Lund Sweden

Existence type lower bounds on the free distance of periodically time-varying ldpc convolutional codes and on the minimum distance of tail-biting ldpc convolutional codes are derived. It is demonstrated that the bound on free distance of periodically time-varying ldpc convolutional codes approaches the bound on free distance of general (nonperiodic) time-varying ldpc convolutional codes as the period increases. The proof of the bound is based on lower bounding the minimum distance of corresponding tail-biting ldpc convolutional codes, which is of interest in its own right.

关键词： Free distance low-density parity-check (ldpc) codes ldpc convolutional codes lower bounds minimum distance tail-biting ldpc convolutional codes

来源：评论

学校读者我要写书评

暂无评论

Design and Performance of Rate-Compatible Non-binary ldpc convolutional codes

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2011年第11期E94A卷 2135-2143页

作者： Uchikawa, Hironori Kasai, Kenta Sakaniwa, Kohichi Tokyo Inst Technol Dept Commun & Integrated Syst Tokyo 1528550 Japan

In this paper, we present a construction method of nonbinary low-density parity-check (ldpc) convolutional codes. Our construction method is an extension of Felstrom and Zigangirov construction [1] for non-binary ldpc convolutional codes. The rate-compatibility of the non-binary convolutional code is also discussed. The proposed rate-compatible code is designed from one single mother (2,4)-regular nonbinary ldpc convolutional code of rate 1/2. Higher-rate codes are produced by puncturing the mother code and lower-rate codes are produced by multiplicatively repeating the mother code. Simulation results show that non-binary ldpc convolutional codes of rate 1/2 outperform state-of-the-art binary ldpc convolutional codes with comparable constraint bit length. Also the derived low-rate and high-rate non-binary ldpc convolutional codes exhibit good decoding performance without loss of large gap to the Shannon limits.

关键词： non-binary ldpc codes ldpc convolutional codes rate-compatibility

来源：评论

学校读者我要写书评

暂无评论

Iterative Decoding Threshold Analysis for ldpc convolutional codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2010年第10期56卷 5274-5289页

作者： Lentmaier, Michael Sridharan, Arvind Costello, Daniel J., Jr. Zigangirov, Kamil Sh. Univ Notre Dame Dept Elect Engn Notre Dame IN 46556 USA Russian Acad Sci Inst Problems Informat Transmiss Moscow Russia Lund Univ Lund Sweden

An iterative decoding threshold analysis for terminated regular ldpc convolutional (ldpcC) codes is presented. Using density evolution techniques, the convergence behavior of an iterative belief propagation decoder is analyzed for the binary erasure channel and the AWGN channel with binary inputs. It is shown that for a terminated ldpcC code ensemble, the thresholds are better than for corresponding regular and irregular ldpc block codes.

关键词： Belief propagation density evolution iterative decoding low-density parity-check (ldpc) codes ldpc convolutional codes message passing threshold analysis

来源：评论

学校读者我要写书评

暂无评论

Distance bounds for an ensemble of ldpc convolutional codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2007年第12期53卷 4537-4555页

作者： Sridharan, Arvind Truhachev, Dmitri Lentmaier, Michael Costello, Daniel J., Jr. Zigangirov, Kamil Sh. Univ Notre Dame Dept Elect Engn Notre Dame IN 46556 USA Seagate Technol Longmont CO 80503 USA Univ Alberta Res Fac Dept Elect & Comp Engn ECERF Edmonton AB T6G 2M7 Canada Inst Problems Informat Transmiss Moscow Russia

An ensemble of (J, K) -regular low-density parity-check (ldpc) convolutional codes is introduced and existence-type lower bounds on the minimum distance d(L) of code segments of finite length L and on the free distance d(free) are derived. For sufficiently large constraint lengths nu, the distances are shown to grow linearly with v and the ratio d(L)/nu approaches the ratio d(free)/nu for large L. Moreover, the ratio of free distance to constraint length is several times larger than the ratio of minimum distance to block length for Gallager's ensemble of (J, K) -regular ldpc block codes.

关键词： free distance lower bounds low-density paritycheck (ldpc) codes ldpc convolutional codes minimum-distance lower bounds

来源：评论

学校读者我要写书评

暂无评论

Systematic ldpc convolutional codes: Asymptotic and Finite-Length Anytime Properties

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2014年第12期62卷 4165-4183页

作者： Grosjean, Leefke Rasmussen, Lars Kildehoj Thobaben, Ragnar Skoglund, Mikael Royal Inst Technol KTH ACCESS Linnaeus Ctr S-10044 Stockholm Sweden

Here we propose an ensemble of non-terminated systematic ldpc convolutional codes with increasing memory, and show that, over the binary erasure channel (BEC), these codes achieve anytime reliability asymptotically when decoded with an expanding-window message-passing decoder. The corresponding anytime exponents are determined through protograph-based extrinsic information transfer charts. Fundamental complications arising when transmitting with finite block lengths are identified and a combinatorial performance analysis, when transmitting over a static BEC with a fixed number of erasures per code-word block, is developed. Based on the performance analysis, we explore the use of feedback for achieving anytime behavior with constraints on block length. To meet complexity constraints, with or without feedback, the code memory can be limited at the cost of an error floor emerging with a delay proportional to the memory constraint. Although the analysis is developed for a static BEC we show numerically that we can design efficient low-complexity finite-length codes with anytime properties even for the conventional BEC.

关键词： ldpc convolutional codes anytime reliable codes delay finite-length analysis

来源：评论

学校读者我要写书评

暂无评论

Bilayer ldpc convolutional codes for Decode-and-Forward Relaying

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2013年第8期61卷 3086-3099页

作者： Si, Zhongwei Thobaben, Ragnar Skoglund, Mikael Royal Inst Technol KTH Sch Elect Engn Stockholm Sweden Royal Inst Technol KTH ACCESS Linnaeus Ctr Stockholm Sweden

In this paper we present bilayer ldpc convolutional codes for half-duplex relay channels. Two types of codes, bilayer expurgated ldpc convolutional codes and bilayer lengthened ldpc convolutional codes, are proposed for decode-and-forward (DF) relaying. In the case of the binary erasure relay channel, we prove analytically that both code constructions achieve the capacities of the source-relay link and the source-destination link simultaneously, provided that the channel conditions are known when designing the codes. Meanwhile, both codes enable the highest transmission rate possible with DF relaying for a wide range of channel parameters. In addition, the regular degree distributions can easily be computed from the channel parameters, which significantly simplifies the code optimization. The code construction and performance analysis are extended to the general binary memoryless symmetric channel, where a capacity-achieving performance is conjectured. Numerical results are provided for both types of codes with finite node degrees over binary erasure channels and binary-input additive white Gaussian noise channels, which verify the aforementioned theoretical analysis.

关键词： Low-density parity-check (ldpc) codes ldpc convolutional codes relay channel decode-and-forward cooperative communication

来源：评论

学校读者我要写书评

暂无评论

On coded modulation using ldpc convolutional codes

引用

AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS 2005年第4期59卷 254-257页

作者： Pittermann, J Lentmaier, M Zigangirov, KS Univ Notre Dame Dept Elect Engn Notre Dame IN 46556 USA Univ Ulm Dept Informat Technol D-89081 Ulm Germany

A new construction combining ldpc convolutional codes and multilevel coding/modulation is suggested and analyzed. In the case of QPSK, we demonstrate that it has a better performance than an ldpc convolutional code co... 详细信息

关键词： ldpc convolutional codes multilevel coding gray mapping combined demodulation/decoding

来源：评论

学校读者我要写书评

暂无评论

Anytime Characteristics of Protograph-Based ldpc convolutional codes

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2016年第10期64卷 4057-4069页

作者： Zhang, Nan Noor-A-Rahim, Md. Vellambi, Badri N. Nguyen, Khoa D. Univ South Australia Inst Telecommun Res Adelaide SA 5095 Australia Nanyang Technol Univ Ctr Infocomm Technol INFINITUS Singapore 639798 Singapore New Jersey Inst Technol Dept Elect & Comp Engn Newark NJ 07102 USA

Anytime transmission has been shown to be an effective means of stabilizing an unstable system over noisy channels. A crucial issue in implementing anytime transmission strategies is the design of anytime codes that offer good finite-length performance and asymptotic anytime properties. This paper introduces an efficient anytime code derived from protograph-based low-density parity-check convolutional codes known as extended S-ldpcC (XS-ldpcC) codes. The asymptotic anytime properties of XS-ldpcC codes over both the binary erasure channel (BEC) and the binary-input additive white Gaussian noise (BIAWGN) channel are demonstrated through density evolution. By means of certain observations verified by simulations, we provide accurate estimates of the delay exponents of XS-ldpcC codes over the BEC and the BIAWGN channel. Through simulations, the finite-length performance of XS-ldpcC codes and the effects of different code design parameters are quantified.

关键词： Anytime codes protograph-based codes ldpc convolutional codes density evolution delay exponent

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：