Design and Performance Analysis of Protograph LDPC Codes

1963年，R.Gallager首次提出了一种性能优秀的纠错码—低密度奇偶校验(Low-Density-Parity-Check,LDPC)码。这种码型在信度传播(BeliefPropagation,BP)译码算法下的纠错性能非常接近香农限，并已被广泛应用在各种通信标准之中。然而，传统LDPC码存在一些固有的缺陷，如编译码复杂度高、存在错误地板及码率不可扩展等。最近，美国空气动力实验室(JetPropulsionLaboratory,JPL)提出了一类新型LDPC码—原模图LDPC码。原模图LDPC码克服了传统LDPC码的诸多缺点，不仅具有优秀的纠错性能，而且能够实现线性编译码。基于以上优点，...As a superior error-correction code, low-density-parity-check (LDPC) code was first proposed by R. Gallager in 1963. Exploiting the belief propagation (BP) decoding algorithm, LDPC codes can perform very close to the Shannon limit and hence have been widely used in many communication standards. However, the conventional LDPC codes possess some drawbacks, e.g., relatively high encoding/decoding com...学位：工学博士院系专业：信息科学与技术学院_通信与信息系统学号：2332010015404

Near-capacity fixed-rate and rateless channel code constructions

Fixed-rate and rateless channel code constructions are designed for satisfying conflicting design tradeoffs, leading to codes that benefit from practical implementations, whilst offering a good bit error ratio (BER) and block error ratio (BLER) performance. More explicitly, two novel low-density parity-check code (LDPC) constructions are proposed; the first construction constitutes a family of quasi-cyclic protograph LDPC codes, which has a Vandermonde-like parity-check matrix (PCM). The second construction constitutes a specific class of protograph LDPC codes, which are termed as multilevel structured (MLS) LDPC codes. These codes possess a PCM construction that allows the coexistence of both pseudo-randomness as well as a structure requiring a reduced memory. More importantly, it is also demonstrated that these benefits accrue without any compromise in the attainable BER/BLER performance. We also present the novel concept of separating multiple users by means of user-specific channel codes, which is referred to as channel code division multiple access (CCDMA), and provide an example based on MLS LDPC codes. In particular, we circumvent the difficulty of having potentially high memory requirements, while ensuring that each user’s bits in the CCDMA system are equally protected. With regards to rateless channel coding, we propose a novel family of codes, which we refer to as reconfigurable rateless codes, that are capable of not only varying their code-rate but also to adaptively modify their encoding/decoding strategy according to the near-instantaneous channel conditions. We demonstrate that the proposed reconfigurable rateless codes are capable of shaping their own degree distribution according to the nearinstantaneous requirements imposed by the channel, but without any explicit channel knowledge at the transmitter. Additionally, a generalised transmit preprocessing aided closed-loop downlink multiple-input multiple-output (MIMO) system is presented, in which both the channel coding components as well as the linear transmit precoder exploit the knowledge of the channel state information (CSI). More explicitly, we embed a rateless code in a MIMO transmit preprocessing scheme, in order to attain near-capacity performance across a wide range of channel signal-to-ratios (SNRs), rather than only at a specific SNR. The performance of our scheme is further enhanced with the aid of a technique, referred to as pilot symbol assisted rateless (PSAR) coding, whereby a predetermined fraction of pilot bits is appropriately interspersed with the original information bits at the channel coding stage, instead of multiplexing pilots at the modulation stage, as in classic pilot symbol assisted modulation (PSAM). We subsequently demonstrate that the PSAR code-aided transmit preprocessing scheme succeeds in gleaning more information from the inserted pilots than the classic PSAM technique, because the pilot bits are not only useful for sounding the channel at the receiver but also beneficial for significantly reducing the computational complexity of the rateless channel decoder

New Identification and Decoding Techniques for Low-Density Parity-Check Codes

Error-correction coding schemes are indispensable for high-capacity high data-rate communication systems nowadays. Among various channel coding schemes, low-density parity-check (LDPC) codes introduced by pioneer Robert G. Gallager are prominent due to the capacity-approaching and superior error-correcting properties. There is no hard constraint on the code rate of LDPC codes. Consequently, it is ideal to incorporate LDPC codes with various code rate and codeword length in the adaptive modulation and coding (AMC) systems which change the encoder and the modulator adaptively to improve the system throughput. In conventional AMC systems, a dedicated control channel is assigned to coordinate the encoder/decoder changes. A questions then rises: if the AMC system still works when such a control channel is absent. This work gives positive answer to this question by investigating various scenarios consisting of different modulation schemes, such as quadrature-amplitude modulation (QAM), frequency-shift keying (FSK), and different channels, such as additive white Gaussian noise (AWGN) channels and fading channels. On the other hand, LDPC decoding is usually carried out by iterative belief-propagation (BP) algorithms. As LDPC codes become prevalent in advanced communication and storage systems, low-complexity LDPC decoding algorithms are favored in practical applications. In the conventional BP decoding algorithm, the stopping criterion is to check if all the parities are satisfied. This single rule may not be able to identify the undecodable blocks, as a result, the decoding time and power consumption are wasted for executing unnecessary iterations. In this work, we propose a new stopping criterion to identify the undecodable blocks in the early stage of the iterative decoding process. Furthermore, in the conventional BP decoding algorithm, the variable (check) nodes are updated in parallel. It is known that the number of iterations can be reduced by the serial scheduling algorithm. The informed dynamic scheduling (IDS) algorithms were proposed in the existing literatures to further reduce the number of iterations. However, the computational complexity involved in finding the update node in the existing IDS algorithms would not be neglected. In this work, we propose a new efficient IDS scheme which can provide better performance-complexity trade-off compared to the existing IDS ones. In addition, the iterative decoding threshold, which is used for differentiating which LDPC code is better, is investigated in this work. A family of LDPC codes, called LDPC convolutional codes, has drawn a lot of attentions from researchers in recent years due to the threshold saturation phenomenon. The IDT for an LDPC convolutional code may be computationally demanding when the termination length goes to thousand or even approaches infinity, especially for AWGN channels. In this work, we propose a fast IDT estimation algorithm which can greatly reduce the complexity of the IDT calculation for LDPC convolutional codes with arbitrary large termination length (including infinity). By utilizing our new IDT estimation algorithm, the IDTs for LDPC convolutional codes with arbitrary large termination length (including infinity) can be quickly obtained

Low-Density Parity-Check Coded High-order Modulation Schemes

In this thesis, we investigate how to support reliable data transmissions at high speeds in future communication systems, such as 5G/6G, WiFi, satellite, and optical communications. One of the most fundamental problems in these communication systems is how to reliably transmit information with a limited number of resources, such as power and spectral. To obtain high spectral efficiency, we use coded modulation (CM), such as bit-interleaved coded modulation (BICM) and delayed BICM (DBICM). To be specific, BICM is a pragmatic implementation of CM which has been largely adopted in both industry and academia. While BICM approaches CM capacity at high rates, the capacity gap between BICM and CM is still noticeable at lower code rates. To tackle this problem, DBICM, as a variation of BICM, introduces a delay module to create a dependency between multiple codewords, which enables us to exploit extrinsic information from the decoded delayed sub-blocks to improve the detection of the undelayed sub-blocks. Recent work shows that DBICM improves capacity over BICM. In addition, BICM and DBICM schemes protect each bit-channel differently, which is often referred to as the unequal error protection (UEP) property. Therefore, bit mapping designs are important for constructing pragmatic BICM and DBICM. To provide reliable communication, we have jointly designed bit mappings in DBICM and irregular low-density parity-check (LDPC) codes. For practical considerations, spatially coupled LDPC (SC-LDPC) codes have been considered as well. Specifically, we have investigated the joint design of the multi-chain SC-LDPC and the BICM bit mapper. In addition, the design of SC-LDPC codes with improved decoding threshold performance and reduced rate loss has been investigated in this thesis as well. The main body of this thesis consists of three parts. In the first part, considering Gray-labeled square M-ary quadrature amplitude modulation (QAM) constellations, we investigate the optimal delay scheme with the largest spectrum efficiency of DBICM for a fixed maximum number of delayed time slots and a given signal-to-noise ratio. Furthermore, we jointly optimize degree distributions and channel assignments of LDPC codes using protograph-based extrinsic information transfer charts. In addition, we proposed a constrained progressive edge growth-like algorithm to jointly construct LDPC codes and bit mappings for DBICM, taking the capacity of each bit-channel into account. Simulation results demonstrate that the designed LDPC-coded DBICM systems significantly outperform LDPC-coded BICM systems. In the second part, we proposed a windowed decoding algorithm for DBICM, which uses the extrinsic information of both the decoded delayed and undelayed sub-blocks, to improve the detection for all sub-blocks. We show that the proposed windowed decoding significantly outperforms the original decoding, demonstrating the effectiveness of the proposed decoding algorithm. In the third part, we apply multi-chain SC-LDPC to BICM. We investigate various connections for multi-chain SC-LDPC codes and bit mapping designs and analyze the performance of the multi-chain SC-LDPC codes over the equivalent binary erasure channels via density evolution. Numerical results demonstrate the superiority of the proposed design over existing connected-chain ensembles and over single-chain ensembles with the existing bit mapping design

Optimization and Applications of Modern Wireless Networks and Symmetry

Due to the future demands of wireless communications, this book focuses on channel coding, multi-access, network protocol, and the related techniques for IoT/5G. Channel coding is widely used to enhance reliability and spectral efficiency. In particular, low-density parity check (LDPC) codes and polar codes are optimized for next wireless standard. Moreover, advanced network protocol is developed to improve wireless throughput. This invokes a great deal of attention on modern communications

Design and analysis of a new index-modulation-aided DCSK system with frequency-and-time resources

We propose a new index-modulation-aided differential chaos shift keying (DCSK) system using frequency-and-time resources, referred to as CTIM-DCSK system, to achieve high-data-rate transmissions. In the proposed system, the orthogonal sinusoidal carriers are used to transmit both the reference-chaotic and the information-bearing signals. Moreover, the frequency-and-time resources are considered as indices to carry additional information bits. To simultaneously boost the bit error rate (BER) performance and reduce the system complexity, this paper proposes a new CTIM-DCSK signal based on the frequency-and-time resources, in which the time slots used by the selected subcarriers convey the same index bits. We employ a noise-reduction method at the receiver to further improve the BER performance of the proposed CTIM-DCSK system. We also derive the theoretical BER expressions of the CTIM-DCSK system over two different channels, i.e., additive white Gaussian noise (AWGN) channel and multipath Rayleigh fading channel. We analyze the data rate, complexity and spectral efficiency of the CTIM-DCSK system in comparison with the state-of-the-art counterparts. Analytical and simulation results verify the accuracy of the theoretical analysis and the advantage of the proposed CTIM-DCSK system. Consequently, the proposed CTIM-DCSK system appears to be a competitive candidate for low-complexity Internet-of-Things applications

On the performance of video resolution, motion and dynamism in transmission using near-capacity transceiver for wireless communication

This article investigates the performance of various sophisticated channel coding and transmission schemes for achieving reliable transmission of a highly compressed video stream. Novel error protection schemes including Non-Convergent Coding (NCC) scheme, Non-Convergent Coding assisted with Differential Space Time Spreading (DSTS) and Sphere Packing (SP) modulation (NCDSTS-SP) scheme and Convergent Coding assisted with DSTS and SP modulation (CDSTS-SP) are analyzed using Bit Error Ratio (BER) and Peak Signal to Noise Ratio (PSNR) performance metrics. Furthermore, error reduction is achieved using sophisticated transceiver comprising SP modulation technique assisted by Differential Space Time Spreading. The performance of the iterative Soft Bit Source Decoding (SBSD) in combination with channel codes is analyzed using various error protection setups by allocating consistent overall bit-rate budget. Additionally, the iterative behavior of SBSD assisted RSC decoder is analyzed with the aid of Extrinsic Information Transfer (EXIT) Chart in order to analyze the achievable turbo cliff of the iterative decoding process. The subjective and objective video quality performance of the proposed error protection schemes is analyzed while employing H.264 advanced video coding and H.265 high efficient video coding standards, while utilizing diverse video sequences having different resolution, motion and dynamism. It was observed that in the presence of noisy channel the low resolution videos outperforms its high resolution counterparts. Furthermore, it was observed that the performance of video sequence with low motion contents and dynamism outperforms relative to video sequence with high motion contents and dynamism. More specifically, it is observed that while utilizing H.265 video coding standard, the Non-Convergent Coding assisted with DSTS and SP modulation scheme with enhanced transmission mechanism results in Eb/N0 gain of 20 dB with reference to the Non-Convergent Coding and transmission mechanism at the objective PSNR value of 42 dB. It is important to mention that both the schemes have employed identical code rate. Furthermore, the Convergent Coding assisted with DSTS and SP modulation mechanism achieved superior performance with reference to the equivalent rate Non-Convergent Coding assisted with DSTS and SP modulation counterpart mechanism, with a performance gain of 16 dB at the objective PSNR grade of 42 dB. Moreover, it is observed that the maximum achievable PSNR gain through H.265 video coding standard is 45 dB, with a PSNR gain of 3 dB with reference to the identical code rate H.264 coding scheme.Web of Science235art. no. 56

Initial Synchronisation in the Multiple-Input Multiple-Output Aided Single- and Multi-Carrier DS-CDMA as well as DS-UWB Downlink

In this thesis, we propose and investigate code acquisition schemes employing both colocated and cooperative Multiple Input/Multiple Output (MIMO) aided Single-Carrier (SC) and Multi-Carrier (MC) Code Division Multiple Access (CDMA) DownLink (DL) schemes. We study their characteristics and performance in terms of both Non-Coherent (NC) and Differentially Coherent (DC) MIMO scenarios. Furthermore, we also propose iterative code acquisition schemes for the Direct Sequence-Ultra WideBand (DS-UWB) DL. There is a paucity of code acquisition techniques designed for transmit diversity aided systems. Moreover, there are no in-depth studies representing the fundamental characteristics of code acquisition schemes employing both co-located and cooperative MIMOs. Hence we investigate both NC and DC code acquisition schemes in the co-located and cooperative MIMO aided SC and MC DS-CDMA DL, when communicating over spatially uncorrelated Rayleigh channels. The issues of NC initial and post-initial acquisition schemes as well as DC schemes are studied as a function of the number of co-located antennas by quantifying the attainable correct detection probability and mean acquisition time performances. The research of DS-UWB systems has recently attracted a significant interest in both the academic and industrial community. In the DS-UWB DL, initial acquisition is required for both coarse timing as well as code phase alignment. Both of these constitute a challenging problem owing to the extremely short chip-duration of UWB systems. This leads to a huge acquisition search space size, which is represented as the product of the number of legitimate code phases in the uncertainty region of the PN code and the number of legitimate signalling pulse positions. Therefore the benefits of the iterative code acquisition schemes are analysed in terms of the achievable correct detection probability and mean acquisition time performances. Hence we significantly reduce the search space size with the aid of a Tanner graph based Message Passing (MP) technique, which is combined with the employment of beneficially selected generator polynomials, multiple receive antennas and appropriately designed multiple-component decoders. Finally, we characterise a range of two-stage iterative acquisition schemes employing iterative MP designed for a multiple receive antenna assisted DS-UWB DL scenario

Initial synchronisation in the multiple-input multiple-output aided single- and multi-carrier DS-CDMA as well as DS-UWB downlink

In this thesis, we propose and investigate code acquisition schemes employing both colocated and cooperative Multiple Input/Multiple Output (MIMO) aided Single-Carrier (SC) and Multi-Carrier (MC) Code Division Multiple Access (CDMA) DownLink (DL) schemes. We study their characteristics and performance in terms of both Non-Coherent (NC) and Differentially Coherent (DC) MIMO scenarios. Furthermore, we also propose iterative code acquisition schemes for the Direct Sequence-Ultra WideBand (DS-UWB) DL. There is a paucity of code acquisition techniques designed for transmit diversity aided systems. Moreover, there are no in-depth studies representing the fundamental characteristics of code acquisition schemes employing both co-located and cooperative MIMOs. Hence we investigate both NC and DC code acquisition schemes in the co-located and cooperative MIMO aided SC and MC DS-CDMA DL, when communicating over spatially uncorrelated Rayleigh channels. The issues of NC initial and post-initial acquisition schemes as well as DC schemes are studied as a function of the number of co-located antennas by quantifying the attainable correct detection probability and mean acquisition time performances. The research of DS-UWB systems has recently attracted a significant interest in both the academic and industrial community. In the DS-UWB DL, initial acquisition is required for both coarse timing as well as code phase alignment. Both of these constitute a challenging problem owing to the extremely short chip-duration of UWB systems. This leads to a huge acquisition search space size, which is represented as the product of the number of legitimate code phases in the uncertainty region of the PN code and the number of legitimate signalling pulse positions. Therefore the benefits of the iterative code acquisition schemes are analysed in terms of the achievable correct detection probability and mean acquisition time performances. Hence we significantly reduce the search space size with the aid of a Tanner graph based Message Passing (MP) technique, which is combined with the employment of beneficially selected generator polynomials, multiple receive antennas and appropriately designed multiple-component decoders. Finally, we characterise a range of two-stage iterative acquisition schemes employing iterative MP designed for a multiple receive antenna assisted DS-UWB DL scenario.EThOS - Electronic Theses Online ServiceGBUnited Kingdo