基于Turbo码的非理想中继协作性能研究

基于Turbo码的非理想中继信道协作方式是在加性高斯白噪声(AWGN)的环境下提出的一种协作通信方式。源节点将编码并调制后的信息分别传送给中继节点和目的节点,中继节点对接收到的码字进行译码、传送,目的节点接收2路不同的信号(一路是来自源节点未经过交织的信息比特和校验比特,另一路是来自中继信道经过交织后来的校验比特)并采用联合迭代的译码方式对其进行译码。仿真结果表明,同等条件下,基于Turbo码的非理想中继信道协作方式在纠错方面的性能远胜于点对点的Turbo码非协作方式。     

速率无损失的空间耦合LDPC码

空间耦合（spatially coupled）LDPC码为通信系统提供了一种全新的接近容量限的方式,但在耦合过程中需要额外添加校验节点,因此存在一定的码率损失.为了消除码率损失,提出了一种新型的耦合方式,首位置变量节点的边展开方式不变,中间位置的边连接到前一个位置的校验节点并依次向后展开,末位置的边与首位置的边成对称分布,从而得到了一种无需添加额外校验节点,码率无损失的SC-LDPC码变体结构.在AWGN信道中通过外部信息转移（extrinsic information transfer）理论分析及误比特率性能仿真,结果表明：相对于SC-LDPC码的传统结构,本文提出的SC-LDPC码变体结构在链长较短时不仅能避免码率损失,并且具有更优的阈值和译码性能,在未来通信系统中更具优势.     

解码前传半双工中继信道下协作LDPC码设计

为逼近解码前传半双工中继信道容量,该文提出一种协作LDPC编码结构及度分布优化方法。与双层删除LDPC码不同,该结构将中继校验比特视为协作LDPC码的一部分,目的端利用从信源和中继接收的消息进行联合译码获得信源信息。为了分析协作LDPC码性能,拓展传统外信息转移(EXIT)图,推导了基于消息错误概率的双层EXIT图噪声门限分析方法。在此基础上,提出了协作LDPC码度分布优化方法,采用差分进化算法搜索了一组具有最大噪声门限的协作LDPC码。实验仿真证明,与双层删除LDPC码相比,协作LDPC码的性能得到了不同程度的改善。     

协作分集技术AF模式下反馈延迟随机性分析

该文采用一个三节点协作分集放大中继网络为研究模型.在Nakagami-m衰落信道条件下,对源节点发送-帧数据的反馈延迟的随机性进行了研究.数据帧在三节点协作网络中可以通过直接链路和中继链路到达目的节点,在物理层源节点根据信道条件不同,采用自适应调制编码技术,选择不同调制编码模式发送数据帧.结合以上原因,对数据帧的反馈延...     

一种低复杂度的多元LDPC译码算法

针对多元低密度奇偶校验(LDPC)码译码复杂度高、时延大等问题,提出了一种基于硬信息的低复杂度多元LDPC译码算法.来自信道的接收信号在初始化时,先进行非均匀量化预处理.在迭代过程中,校验节点端只需传输单个比特的二进制硬可靠度信息至变量节点.在变量节点端,可靠度信息按比特位进行简单的累加和更新,无需任何的系数修正操作.同时,变量节点使用了全信息的方式将信息传输至与其相邻的校验节点.仿真结果显示,与基于比特可靠度(BRB)的多元LDPC译码算法相比,提出的算法在较低量化比特情况下,能获得约0.3 dB的译码性能增益,且译码复杂度更低.     

基于重复累积码的BICM系统译码算法

重复累积码(RA)由于其编译码复杂度低、性能接近香农限的优点,目前得到学术界的广泛关注。文中研究了RA码及其译码算法,并将其应用于比特交织编码调制(BICM)系统。针对低信噪比下基于RA码的编码调制系统误码率较高的问题,提出了一种改进算法,该算法通过在解调器和译码器之间引入迭代处理,利用译码器输出的外信息改善解映射结果,从而降低了系统误码率。仿真结果表明,在加性高斯白噪声(AWGN)信道、瑞利(Rayleigh)衰落信道下,BICM系统使用迭代的译码算法与原算法相比,误码性能有较明显提高。     

基于分布式奇偶校验码的低复杂度极化码SCLF译码算法

针对极化码串行抵消列表比特翻转(Successive Cancellation List Bit-Flip, SCLF)译码算法复杂度较高的问题,提出一种基于分布式奇偶校验码的低复杂度极化码SCLF译码(SCLF Decoding Algorithm for Low-Complexity Polar Codes Based on Distributed Parity Check Codes, DPC-SCLF)算法。与仅采用循环冗余校验(Cyclic Redundancy Check, CRC)码校验的SCLF译码算法不同,该算法首先利用极化信道偏序关系构造关键集,然后采用分布式奇偶校验(Parity Check, PC)码与CRC码结合的方式对错误比特进行检验、识别和翻转,提高了翻转精度,减少了重译码次数。此外,在译码时利用路径剪枝操作,提高了正确路径的竞争力,改善了误码性能,且利用提前终止译码进程操作,减少了译码比特数。仿真结果表明,与D-Post-SCLF译码算法和RCS-SCLF译码算法相比,所提出算法具有更低的译码复杂度且在中高信噪比下具有更好的误码性能。     

基于软门限LDPC码的中继信道容量实现

LDPC（Lowdensity parity code）码是逼近香农界的信道码。为了逼近香农界,其优化一般采用硬门限准则。但当信道容量小于编码码率时,LDPC无法正确译码。因此,提出从软门限的角度优化LDPC码,使得在码率超过信道容量时,接收端仍可以部分译码,并将该LDPC码用于单中继信道中,解决使用解码前传（DF,decode and forward）的中继信道容量瓶颈问题,进而提高信道容量。还考虑中继节点使用Slepian-Wolf信源编码,降低中继节点到目的节点的信道质量要求的同时,仍能保证无失真译码。     

半双工中继信道下联合LDPC码设计

为了提高解码前传半双工中继通信系统的编码增益,提出了一种联合LDPC码编码结构及其度分布优化方法。该结构视信源和中继子码为联合LDPC码的一部分,目的端根据从信源和中继接收的消息进行联合译码,同时获得信源和中继的信息。为了分析联合LDPC码的渐进性能,推导了AWGN信道下联合LDPC码的高斯近似密度进化算法。结合译码收敛条件和度分布约束关系,提出联合LDPC码的度分布优化问题。仿真结果表明：联合LDPC码的渐进性能及误码性能优于BE-LDPC码和独立处理（SP）码。     

Turbo码OFDM系统性能仿真研究

非二进制Turbo码是无线城域网标准IEEE802.16物理层规范中WirelessMan-OFDM信道编码的可选方案之一。采用基于SISO的Turbo译码方法,基于比特似然比,对WirelessMan-OFDM非二进制Turbo码的性能进行了仿真研究;译码时首次采用了一种简化的软解映射方法,其误码性能与传统方法相差很小,而计算量却大大降低,解映射的同时对信道进行了均衡,因此该方法具有很大的实用价值。     

Decode and forward polar coding for Half-duplex two-relay channels based on multilevel construction

Polar codes represent an emerging class of error-correcting codes with power to approach the capacity of the physically degraded relay channel and relevant coding schemes have been proposed in the literature. This paper aims to design new cooperative decode-and-forward (DF) polar coding schemes for half-duplex two-relay channel based on the Plotkin’s construction illustrating their performances gain. In these schemes, we consider the use of time-division process in transmission. The source node transmits its polar-coded information to both relays and the destination nodes during the first time slot. Each relay node receives the data from the source and processes it using the DF protocol. For the second transmission period, each relay first decodes the source signal then after reconstruction of the information reduction matrix based on the multilevel characteristics of polar codes, the extracted data at each relay are recoded using another polar code and transmitted to the destination. At destination node, the signals received from each relay and source nodes are processed by using multi-joint successive cancellation decoding for retrieving the original information bits. We demonstrate via simulation results that by carefully constructed polarisation matrix at each relay node, we can achieve the theoretical capacity in the half-duplex relay channel.     

采用LDPC码的分布式联合信源信道网络编码

提出了采用低密度奇偶校验码的分布式联合信源信道网络编码方案,应用于两源一中继一目的节点的无线传感器网络中.在方案中,信源节点通过传输系统信道码的校验位与部分信息位,同时实现了信源压缩与信道纠错.中继节点有效利用数据的相关性进行译码,并进行部分数据比特删余,减少因中继端网络编码引起的错误传播,仿真验证了方案的有效性.应用了不等差错保护思想,更贴近实际应用场景,利于目的节点进行更好的低误差解码.     

Capacity Approaching Turbo Coding For Half-Duplex Relaying

In this paper, we develop capacity approaching turbo coding schemes for half-duplex relay systems as an extension of our previous work on coding for full-duplex relays. We consider the use of specific signal constellations (e.g., binary phase-shift keying) in transmission, develop practical coding schemes to be used at the source and the relay nodes, and describe a suitable information combining technique at the destination node. Unlike the full-duplex relay systems, the destination node does not perform joint decoding of multiple consecutive blocks; instead, it works with one frame at a time. Furthermore, for the half-duplex relaying scheme, the optimization of the length of the listening period for the relay node is an issue. By utilizing the information theoretical tools, we perform this optimization, and use it in our development of capacity approaching coding/decoding schemes. Specifically, when the fraction of time turns out to be less than the transmission rate, the relay node is unable to decode all the information bits transmitted, and a partial decoding approach has to be used. Through a comprehensive set of examples, we observe that the proposed scheme is promising to approach the corresponding information theoretical limits (bounds). In particular, for all the cases studied, we have obtained bit error rates of $10^{-5}$ or lower within 1–1.5 dB (in most cases, around within 1.2 dB) of the constrained capacity under a variety of channel conditions. Extensions of the proposed scheme to coded modulation and to multiple-input multiple-output systems are also described.      

Bilayer expurgated LDPC codes with uncoded relaying

Bilayer low-density parity-check (LDPC) codes are an effective coding technique for decode-and-forward relaying, where the relay forwards extra parity bits to help the destination to decode the source bits correctly. In the existing bilayer coding scheme, these parity bits are protected by an error correcting code and assumed reliably available at the receiver. We propose an uncoded relaying scheme, where the extra parity bits are forwarded to the destination without any protection. Through density evolution analysis and simulation results, we show that our proposed scheme achieves better performance in terms of bit erasure probability than the existing relaying scheme. In addition, our proposed scheme results in lower complexity at the relay.     

Capacity-approaching turbo coding and iterative decoding for relay channels

In this paper, we design turbo-based coding schemes for relay systems together with iterative decoding algorithms. In the proposed schemes, the source node sends coded information bits to both the relay and the destination nodes, while the relay simultaneously forwards its estimate for the previous coded block to the destination after decoding and re-encoding. The destination observes a superposition of the codewords and uses an iterative decoding algorithm to estimate the transmitted messages. Different from the block-by-block decoding techniques used in the literature, this decoding scheme operates over all the transmitted blocks jointly. Various encoding and decoding approaches are proposed for both single-input single-output and multi-input multi-output systems over several different channel models. Capacity bounds and information-rate bounds with binary inputs are also provided, and it is shown that the performance of the proposed practical scheme is typically about 1.0-1.5 dB away from the theoretical limits, and a remarkable advantage can be achieved over the direct and multihop transmission alternatives.     

Distributed Space-Time Trellis Codes for a Cooperative System

In this paper, we propose a novel distributed spacetime trellis code (DSTTC) structure, and analyze its error performance in both slow and quasi-slow Rayleigh fading channels. The protocol adopted is decode-and-forward (DAF) with a single relay between the source and destination. Both scenarios with perfect and imperfect decoding at the relay are investigated. For imperfect decoding at the relay node, we consider an equivalent one-hop link model for the source-relay-destination path, and use it to modify the maximum likelihood detection metric by taking into account the equivalent signal-to-noise ratio (SNR) of the link model. The upper bounds of pairwise error probability (PEP) are derived for slow and quasi-slow Rayleigh fading channels, and the DSTTC design criteria are formulated accordingly. Based on the proposed design criteria, new DSTTCs are constructed by computer search. Simulation results demonstrate the superiority of the designed codes.     

Impact of Implicit Feedback Channel in Cooperative Relay Networks

In a multi-node network, cooperation among nodes is an effective means to enhance coverage and potentially increase the capacity. For such systems, schemes based on incremental relaying have great potential to improve the spectral efficiency by adapting the transmission to time varying channel conditions. The performance enhancement brought about by the presence of relays in such incremental relaying based cooperative systems is dependent on the level of cooperation (based on the relay information quality) and on coordination among the nodes. Coordination is achieved through the use of feedback channels, which incurs significant bandwidth penalty and brings down the spectral efficiency. In order to mitigate this, one can exploit an implicit feedback channel available due to broadcast nature of relay transmissions. Instead of using dedicated feedback channels, the implicit feedback channel is used to measure the relay information quality. Based on this information, the transmitter (source/relay) for the additional coded (redundancy) bits is determined. Such a mechanism enhances the reliability as it ensures the availability of correct information at the destination node for decoding. This paper studies the impact of such an implicit feedback channel by employing powerful codes which exhibit inherent incremental redundancy features, such as rate-compatible codes (rate-compatible punctured convolutional (RCPC) codes and punctured low-density parity-check (LDPC) codes) and rateless codes (Luby Transform (LT) codes). Theoretical analyses of the proposed scheme are presented, and supported with results from extensive simulation studies.