编码协作MARC上全分集LDPC码的实现与性能分析

本文研究了多接入中继信道(MARC)上全分集LDPC码的实现与性能。首先,分析了MARC模型及其固有分集,然后构造了在MARC上能取得全分集的LDPC码,新构造的码字采用根校验节点把源节点传输与中继节点传输联系起来,从而获得全分集。接着,研究了所构造码字的密度演化过程,在密度演化的基础上,进一步分析了全分集LDPC码校验矩阵的结构,给出了通过提高全分集校验比特的比例,改善全分集LDPC码在MARC上编码增益的方法。仿真结果表明,本文所提算法在MARC信道上不仅能实现全分集,而且能取得较高的编码增益。     

一种高性能全分集LDPC码的构造方法

块衰落信道上全分集LDPC的构造与性能分析成为近期研究的热点。ML译码算法下全分集LDPC码可以通过设计列满秩的校验子矩阵来实现。然而,基于ML准则的全分集码字,采用迭代译码算法时,不能保证全分集。因此,该文通过设计特定结构的校验矩阵,实现了在迭代译码算法下能取得全分集的LDPC码,分析了其密度演化过程。 在此基础上,进一步研究了全分集LDPC码字结构与性能的关系,提出了提高全分集LDPC码编码增益的方法。仿真结果表明,该文构造的LDPC码不仅能够取得全分集,并且具有较高的编码增益。     

非规则全分集LDPC码的构造方法

提出一种基于渐进边增长（Progressive Edge．Growth,PEG）算法的非规则全分集低密度奇偶校验（Low—Density Parity—Check,LDPC）码的构造方法。首先根据度分布和码率,对非规则全分集LDPC码中的节点进行度分配;然后对PEG算法中校验节点的选择标准加以约束,生成消除短环的非规则全分集LDPC码;进一步,通过改变局部校验节点剩余度的方法,解决在特殊度分布下算法失效的问题。仿真结果表明,构造的非规则全分集LDPC码在瑞利块衰落信道下能够实现全分集;在码长、码率相同的情况下与规则全分集LDPC码相比,非规则全分集LD—PC码能够获得更高的编码增益。     

分簇无线传感器网络中根校验全分集LDPC码设计与能效分析

高效的差错控制编码技术(ECC)可以增强无线传感器网络传输稳定性、网络的能量利用效率。为了充分利用无线传感器网络中蕴含的分集资源应对恶劣信道环境导致的高差错概率,该文研究了基于根校验全分集LDPC码的差错控制编码技术。首先,提出在分簇无线传感器网络中,基于根校验全分集LDPC码的编码方案;其次,设计了适用于所提方案的速率兼容全分集LDPC码字结构。最后,分析了所提编码系统的能效。仿真结果表明,在信道条件较差的环境中(仿真中,信道噪声大于410-4 mW),采用该文的编码方案,能够显著提高无线传感器网络的能效。     

非规则LDPC码的不等错误保护性能研究

提出了一种具有不等错误保护性能的非规则低密度校验(LDPC,low-density parity-check)码信道编码方案, 构造了重量递增校验(weight-increasing parity-check)矩阵,系统编码时,重要信息比特映射到LDPC码的“精华”比特上。AWGN和Rayliegh衰落信道的仿真结果表明,与随机构造的非规则LDPC码相比,WICP-LDPC码具有好的UEP性能。     

高频谱效率LDPC编码调制系统

低密度校验(low-density parity-check,LDPC)码近年来成为纠错码领域的研究热点。基于LDPC码以及比特交织编码调制(bit-interleaved coded modulation,BICM)的概念,针对无线带宽受限信道,提出了一种具有较高编码增益和频谱效率的联合编码调制方案。高斯信道和瑞利衰落信道下的仿真均显示了该方案的良好性能。     

基于低密度校验码编码的MIMO系统方案

该文采用数值仿真的方法探讨了MIMO系统中采用低密度校验(LDPC)码作为信道编码后的系统性能,针对LDPC码的置信度传播译码算法,提出了基于因子图(Factor graph)的联合迭代检测译码最大后验概率(MAP)算法,分析比较了发射端分别采用独立编码和联合编码对系统性能的影响,仿真结果表明,LDPC码可以充分利用MIMO系统中空间分集和时间分集性能提高系统的有效分集增益,并且联合迭代检测译码算法对这两种发射端编码结构的系统性能增益有较大差别。     

瑞利衰落信道下基于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的编码增益.     

采用高阶QAM的LDPC编码OFDM系统

正交频分复用(orthogonal frequency division multiplexing,OFDM)已成为多径环境下实现高速数据传输的主流技术之一,包括LDPC码在内的各种纠错编码技术被运用到其中以提高误码性能。文中提出了采用高阶QAM的LDPC编码OFDM(LDPC-COFDM)系统,在提高传输效率的同时取得了较好的编码增益。AWGN信道及频率选择性衰落信道下的仿真显示了该方案的良好性能。     

一种全速率高阶分集2×1空时码

在2×1（两发一收）MIMO、时间选择性衰落信道条件下,Alamouti码的最大分集增益近似为2。为提高分集增益、增强抗信道衰落能力,提出一种适用于时间选择性衰落信道的全速率空时码（STC-TS,Space-time Code for Time-selective Fading）,通过延长发送时间,提高了信道快速变化条件下的分集增益。分析了高分集增益时编码矩阵中参数应满足的约束条件,并以＂成对错误概率上界最小＂为目标对编码矩阵进行了参数优化。仿真结果表明,当信道衰落速度足够快时,STC-TS编码获得了更多分集增益,进一步提高了传输的可靠性。     

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比特翻转译码算法研究

提出一种基于循环检测的低密度奇偶校验码的比特翻转(BF)译码算法,采用对译码翻转比特的循环检测和对接受符号可靠性信息的软判决,使译码性能大大改善.理论分析表明,该译码运算复杂度低,仿真结果表明,改进的算法优于加权比特翻转译码LP-WBF算法约0.3 dB,误码性能改善明显.     

Analysis of LDPC with optimum combining

Low density parity check (LDPC) codes have shown exceptionally good performance for single antenna systems over a wide class of channels. LDPC when implemented with a single input multiple output system with maximum ratio combining is optimum from the standpoint of maximising signal-to-noise ratio at combiner output without the presence of interferer. Optimum combining outperforms maximal ratio combining (MRC) in the presence of interferer(s). In this article, the performance of the LDPC codes with multiple receiver antennas with optimum combining in the presence of single interferer is investigated. The simulation results showed that LDPC codes of irregular construction are able to give high coding and diversity gain with optimum combining. The proposed LDPC optimum combined (LDPC–OC) system in Rayleigh fading channel in the presence of a single interferer improves the signal to interferer plus noise ratio by 2.62 dB with four receiver antennas and by 1.98 dB when the number of receiver antennas is three.     

Performance evaluation of multicast relay network using LDPC and convolutional channel codes along-with XOR network coding

In this paper,we have compared the performance of joint network channel coding(JNCC) for multicast relay network using low density parity check(LDPC) codes and Convolutional codes as channel codes while exclusive or(XOR) network coding used at the intermediate relay nodes.Multicast relay transmission is a type of transmission scheme in which two fixed relay nodes contribute in the second hop of end-to-end transmission between base transceiver station(BTS) and a pair of mobile stations.We have considered one way and two way multicast scenarios to evaluate the bit error rate(BER) and throughput performance.It has been shown that when using XOR network coding at the intermediate relay nodes,the same transmission becomes possible in less time slots hence throughput performance can be improved.Moreover we have also discussed two possible scenarios in the proposed system model,in which both diversity and multiplexing gain has been considered.It is worth notifying that BER and throughput achieved for LDPC codes is better than Convolutional codes for all the schemes discussed.     

A high‐performance belief propagation decoding algorithm for codes with short cycles

The simplicity of decoding is one of the most important characteristics of the low density parity check (LDPC) codes. Belief propagation (BP) decoding algorithm is a well‐known decoding algorithm for LDPC codes. Most LDPC codes with long lengths have short cycles in their Tanner graphs, which reduce the performance of the BP algorithm. In this paper, we present 2 methods to improve the BP decoding algorithm for LDPC codes. In these methods, the calculation of the variable nodes is controlled by using “multiplicative correction factor” and “additive correction factor.” These factors are obtained for 2 separate channels, namely additive white Gaussian noise (AWGN) and binary symmetric channel (BSC), as 2 functions of code and channel parameters. Moreover, we use the BP‐based method in the calculation of the check nodes, which reduces the required resources. Simulation results show the proposed algorithm has better performance and lower decoding error as compared to BP and similar methods like normalized‐BP and offset‐BP algorithms.     

一种利用大衍数列构造多码率原模图QC-LDPC码的方法

针对准循环低密度奇偶校验(Quasi-Cyclic Low-Density Parity-Check,QC-LDPC)码存在码长码率不能灵活选择的问题,提出了一种基于大衍数列构造多码率的原模图QC-LDPC码的新颖方法,该方法利用计算机搜索算法得到原模图基矩阵,然后基于大衍数列的循环移位矩阵对原模图基矩阵进行循环扩展,以此得到校验矩阵.该方法构造的校验矩阵围长至少为6,只需要简单的移位寄存器就可以实现编码,并且具有良好的纠错性能.仿真结果表明,在误码率(BitError Rate,BER)为10-6时,所构造的码率为0.5的P-DY-QC-LDPC(4000,2000)码和码率为0.75的P-DY-QC-LDPC(4000,3000)码与同码率近似码长的其他码型相比较,其净编码增益均有一定提高.