基于并行级联LDPC码的递增冗余HARQ方案及性能分析

并行级联LDPC码是由多个码率不同的子码,经并行级联后得到的码率可变的LDPC码.本文提出了基于并行级联:LDPC码的递增冗余HARQ方案,给出了这种方案的吞吐量性能封闭解.在AWGN信道和Rayleigh衰落信道下,通过仿真将新方案的性能和随机LDPC码的性能进行了比较.结果显示,并行级联LDPC码的递增冗余HARQ方案性能接近随机LDPC码,但编、译码更简单,参数选择范围更广.     

几种LDPC码的性能比较

重点比较基于MacKay方法构造的随机LDPC码、具有准循环特点的LDPC码,以及π-旋转LDPC码的性能。通过计算机仿真比较可看出,这几种码在构造中都未考虑优化情况下,其性能差异不大。但是从编译码复杂度角度来看,π-旋转LDPC码和准循环LDPC码可以分别利用其奇偶校验矩阵中的双对角结构和移位循环结构来简化编译码,因而这两种较随机构造的码更易于硬件实现,更具有实际应用价值。     

几种LDPC码的性能比较

重点比较基于MacKay方法构造的随机LDPC码、具有准循环特点的LDPC码,以及π-旋转LDPC码的性能.通过计算机仿真比较可看出,这几种码在构造中都未考虑优化情况下,其性能差异不大.但是从编译码复杂度角度来看,π-旋转LDPC码和准循环LDPC码可以分别利用其奇偶校验矩阵中的双对角结构和移位循环结构来简化编译码,因而这两种较随机构造的码更易于硬件实现,更具有实际应用价值.     

一种半随机半代数的非正则LDPC码构造方法

LDPC码由于其卓越的纠错性能引起了学术界的广泛重视，当前LDPC所面临的一个主要问题是其编码复杂性的问题。本文给出了一种半代数半随机的非正则LDPC码构造方法，由该方法所构造的校验矩阵具有近似下三角特性，从而可以大大降低LDPC的编译码复杂性，同时具有与完全随机LDPC码相匹配的性能。     

低复杂度的LDPC码联合编译码构造方法研究

LDPC码因为其具有接近香农限的译码性能和适合高速译码的并行结构,已经成为纠错编码领域的研究热点。LDPC码校验矩阵的构造是基于稀疏的随机图,所以该类码字编码和译码的硬件实现比较复杂。以单位阵的循环移位阵为基本单元,构造LDPC码的校验矩阵,降低了LDPC码在和积算法下的译码复杂度。同时考虑到LDPC码的编码复杂度,给出了一种可以简化编码的结构。针对该方案构造的LDPC码,提出了消除其二分图上的短圈的方法。通过大量的仿真和计算分析,本文比较了这种LDPC码和随机构造的LDPC码在误码率性能,圈长分布以及最小码间距估计上的差异。     

基于矩阵分块的LDPC码快速编码结构研究

低密度奇偶校验(LDPC)码由于具有接近香农限的性能和高速并行的译码结构而成为研究热点。然而,当码长很长时,编译码器的硬件实现变得很困难。文章从编译码实际实现的角度出发,提出一种基于分块的LDPC码下三角形校验矩阵结构,降低了编译码复杂度,不仅可以实现线性时间编码,同时还可以实现部分并行译码。仿真结果表明,具有这种结构的LDPC码和随机构造的LDPC码相比具有同样好的纠错性能。     

一种伪随机LDPC码构造方法与性能研究

低密度校验(Low-Density Parity-Check)码作为迄今为止性能最好的纠错码之一, 目前已经被许多数字通信标准广泛采用。伪随机低密度校验码(Pseudo-Random)是 LDPC 码的一个子类,已被应用于空间通信和无线网络技术。本文给出了一种基于有限域的伪随机 LDPC 码构造方法,并采用理论分析和仿真结果分析相结合的方法,对伪随机 LDPC 码的构造和编译码方法进行了研究,并给出了实现中适合的译码算法及量化方案。     

一种新的终止LDPC迭代译码算法

在传统的卫星广播系统中,信道纠错通常采用BCH码级联LDPC码的方案以达到良好的误码率性能,例如DVB-S2系统。作为内码的LDPC码通常采用迭代译码,且迭代次数较高才能实现比较好的系统性能。借助BCH级联LDPC的结构,文中提出了将BCH检错嵌套进LDPC每一次迭代译码过程中的新的迭代译码结构。仿真结果表明,新算法以较低的BCH码检错运算复杂度换取了LDPC码迭代次数的明显下降,从而极大降低了迭代译码总体复杂度和译码时延,且整体纠错性能与原始LDPC译码后BCH纠错的算法相比基本保持不变。     

一种低码率的LDPC码在LTE-A中的性能研究

本文通过分析LTE-Advanced系统中准循环LDPC码校验矩阵的构造方法,在不改变母码矩阵的基础上,采用一种灵活的扩展方法,构造了一种低码率的LDPC码。采用一种很实用的编码算法和差分译码算法,在MATLAB仿真平台下,比较了这种LDPC码和Turbo码的性能。结果表明：在短码情况下,这种LDPC码在低信噪比下性能略低于Turbo码,但随着信噪比的增加,LDPC码性能优于Turbo码;在长码情况下,LDPC码的性能明显优于Turbo码。为LTE-Advanced系统的信道编解码器的硬件设计提供了一套有效的编译码算法方案,具有较好的实用价值。     

LDPC码原理和应用综述

随着LDPC码的"再次发现",LDPC码以其译码复杂度低、结构灵活、性能优良等特点顿时轰动整个编码界,成为自信息论提出以来最重大的研究进展之一。目前已广泛应用于深空通信、光纤通信、卫星数字视频和音频广播等领域。本文主要介绍了LDPC的编译码原理和各种解决方案,重点推导了编码方案中Richardson算法(近似下三角型算法)和译码方案中的基于对数似然比的BP算法;其次列举了LDPC在不同领域的应用,主要包括在DVB-S2标准,IEEE802.16标准中的应用。最后对LDPC的发展前景作了简要分析。     

可分解的RC-LDPC码以及HARQ的设计

该文提出了一种可分解的码率兼容LDPC码的构造方法, 该方法构造所得到的一个高码率LDPC码的校验矩阵中包含有若干低码率LDPC码的校验矩阵,而且一个高码率的LDPC码又可以分解成多个性能优异的低码率的LDPC码进行编译码;结合该特性设计了一种基于可分解的码率兼容LDPC码的混合自动重传方案。与普通的ARQ方案相比,该重传方案不单能够通过重传获得更多的信息,而且能够通过降低纠错码的码率来提高纠错码的性能。仿真结果表明,当所采用LDPC码的码长为2000左右,码率为1/2和2/3时,与一般的ARQ相比,该方案的误帧率以及吞吐量(小于0.5的时候)均能获得近1.5dB的增益。     

关于非规则LDPC码的基于度分布HARQ性能研究

该文提出了一种非规则LDPC码字基于度分布HARQ技术的改进方案。该方案在选择重传信息的过程中,不仅考虑了节点度分布的影响,而且考虑了非规则LDPC码字自身的不均等错误保护特性。与原始的基于度分布的HARQ方案相比,该方案使系统的误比特率和吞吐量指标得到了明显改善。     

Application of Rate Compatible Punctured Turbo Coded Hybrid ARQ to MC‐CDMA Mobile Radio

MC‐CDMA, a multicarrier (MC) modulation scheme based on code division multiple access (CDMA), is the most likely candidate for the next generation of mobile radio communications. The rate compatible punctured turbo (RCPT) coded hybrid automatic repeat request (HARQ) has been found to give improved throughput performance in a direct sequence (DS) CDMA system. However, the extent to which the RCPT HARQ improves the throughput performance of an MC‐CDMA system has not been fully understood. In this paper, we apply the RCPT HARQ to MC‐CDMA and evaluate by computer simulations its performance in a frequency selective Rayleigh fading channel. We found that the performance of RCPT HARQ MC‐CDMA is almost insensitive to channel characteristics. The performance can be drastically improved with receive diversity combined with space‐time transmit diversity. In addition, the comparison of RCPT HARQ MC‐CDMA, orthogonal frequency division multiplexing, and DS‐CDMA shows that under similar conditions the throughput of MC‐CDMA is the best in a frequency selective fading channel.     

Low density parity check codes for the relay channel

We propose Low Density Parity Check (LDPC) code designs for the half-duplex relay channel. Our designs are based on the information theoretic random coding scheme for decode-and-forward relaying. The source transmission is decoded with the help of side information in the form of additional parity bits from the relay. We derive the exact relationships that the component LDPC code profiles in the relay coding scheme must satisfy. These relationships act as constraints for the density evolution algorithm which is used to search for good relay code profiles. To speed up optimization, we outline a Gaussian approximation of density evolution for the relay channel. The asymptotic noise thresholds of the discovered relay code profiles are a fraction of a decibel away from the achievable lower bound for decode-and-forward relaying. With random component LDPC codes, the overall relay coding scheme performs within 1.2 dB of the theoretical limit     

Novel Construction and Optimization of LDPC Codes for NC-OFDM Cognitive Radio Systems

In this paper, a random Low-Density Parity-Check (LDPC) code is proposed for Noncontiguous Orthogonal Frequency Division Multiplexing (NC-OFDM) Cognitive Radio (CR) systems. Unlike other encoding schemes which achieve a system code rate of only 1/4 when half of the subcarriers are active, the proposed scheme achieves a system code rate of 1/2. The LDPC code is used to enhance the data transmission rate. A new channel model comprised of a binary erasure channel concatenated with an uncorrelated fading channel and an AWGN channel is adopted for NC-OFDM CR systems. Moreover, the adopted channel model is employed with density evolution algorithm to obtain good degree distribution pairs for the LDPC code. Thereafter, a modified shortest-path algorithm is used to construct the parity-check matrix for the LDPC code. Simulation results show that the proposed LDPC code performs well in terms of both error rate and data transmission rate.     

LTE下行链路中基于网络编码的多进程联合HARQ

长期演进系统的下行链路物理层采用了以传输块为基本单元的混合自动重传请求机制,保证移动终端在各种测试场景下都能获得较好的数据通过率。在对传输块的每次接收处理过程中,单个传输块中的多路独立码块数据解码结果差异较大。接收端可以通过对各个码块数据做循环冗余校验测试,标志各个码块的译码结果。然而由于传统重传机制中反馈链路的容量限制,即便只有一个码块解码错误,接收端也将反馈请求发送端重传整个传输块。网络编码技术通过对不同传输块数据做组合编码,可以有效地提高整个网络的传输效率。针对长期演进系统下行链路的传输机制,我们提出一种基于网络编码的多进程联合重传方案。新的重传方案联合多个传输块的重传进程,在每个传输块完成首次传输后,新增一个网络编码重传反馈比特,指示后续是否启动一个新进程传输多个传输块的网络编码数据包。我们给出了具体的重传协议流程,收发端都可以高效地根据网络编码重传反馈比特指示,完成相应的发送和接收操作。结合长期演进系统标准中的典型测试场景,我们给出了数据通过率的仿真结果比较。在仅新增一个反馈比特的条件下,采用网络编码技术的多进程联合重传方案在数据通过率方面有较为明显的性能增益。      

Performance analysis of ARQ schemes with code combining over Nakagami-m fading channel

This article investigates the performance of hybrid automatic repeat request (HARQ) with code combining over the ideally interleaved Nakagami-m fading channel. Two retransmission protocols with coherent equal gain code combining are adopted, where the entire frame and several selected portions of the frame are repeated in protocols Ⅰ and Ⅱ, respectively. Protocol Ⅱ could be viewed as a generalization of the recently proposed reliability-based HARQ. To facilitate performance analysis, an approximation of the product of two independent Nakagami-m distributed random variables is first developed. Then the approximate analysis is utilized to obtain exact frame error probability (FEP) for protocol Ⅰ, and the upper bound of the FEP for protocol Ⅱ. Furthermore, the throughput performance of both two protocols is presented. Simulation results show the reliability of the theoretical analysis, where protocol Ⅱ outperforms protocol Ⅰ in the throughput performance due to the reduced amount of transmitted information.     

Incremental redundancy hybrid ARQ schemes based on low-density parity-check codes

We study the throughput of hybrid automatic retransmission request (H-ARQ) schemes based on incremental redundancy (IR) over a block-fading channel. We provide an information-theoretic analysis assuming binary random coding and typical-set decoding. Then, we study the performance of low-density parity-check (LDPC) code ensembles with iterative belief-propagation decoding, and show that, under the hypothesis of infinite-length codes, LDPCs yield almost optimal performance. Unfortunately, standard finite-length LDPC ensembles incur a considerable performance loss with respect to their infinite-length counterpart, because of their poor frame-error rate (FER) performance. In order to recover part of this loss, we propose two simple yet effective methods: using a modified LDPC ensemble designed to improve the FER; and using an outer selective-repeat protocol acting on smaller packets of information bits. Surprisingly, these apparently very different methods yield almost the same performance gain and recover a considerable fraction of the optimal throughput, thus making practical finite-length LDPC codes very attractive for data wireless communications based on IR H-ARQ schemes.     

瑞利衰落信道下基于LDPC码USTM的MIMO系统

研究了一种联合低密度校验(LDPC,Low-Density Parity-Check)码和酉空时调制(USTM,Unitary Space-Time Modulation)技术在不相关瑞利平坦衰落(Rayleigh flat fading)下的多输入多输出信道(MIMO,Multiple-Input Multiple-Output)系统的性能.在无信道状态信息下,采用可并行操作的和积译码算法(SPA,Sum-Product Algorithm)的LDPCC-USTM级联系统具有优异的性能,并分析了不同LDPC码集下对系统性能的影响.仿真结果表明LDPCC-USTM级联系统比与未级联的相比有近23dB的编码增益,与基于Turbo码的USTM[6]系统相比有5dB多的编码增益,且基于非规则的LDPC码的级联系统比基于规则码有近1dB的编码增益.