A Practical Regular LDPC Coded Scheme for Physical-Layer Information Security

In this paper,we aim to design a practical low complexity low-density parity-check(LDPC)coded scheme to build a secure open channel and protect information from eavesdropping.To this end,we first propose a punctured LDPC coded scheme,where the information bits in a codeword are punctured and only the parity check bits are transmitted to the receiver.We further propose a notion of check node type distribution and derive multi-edge type extrinsic information transfer functions to estimate the security performance,instead of the well-known weak metric bit error rate.We optimize the check node type distribution in terms of the signal-to-noise ratio(SNR)gap and modify the progressive edge growth algorithm to design finite-length codes.Numerical results show that our proposed scheme can achieve a lower computational complexity and a smaller security gap,compared to the existing scrambling and puncturing schemes.

Analysis of LDPC Code in Hybrid Communication Systems

Free-space optical(FSO)communication is of supreme importance for designing next-generation networks.Over the past decades,the radio frequency(RF)spectrum has been the main topic of interest for wireless technology.The RF spectrum is becoming denser and more employed,making its availability tough for additional channels.Optical communication,exploited for messages or indications in historical times,is now becoming famous and useful in combination with error-correcting codes(ECC)to mitigate the effects of fading caused by atmospheric turbulence.A free-space communication system(FSCS)in which the hybrid technology is based on FSO and RF.FSCS is a capable solution to overcome the downsides of current schemes and enhance the overall link reliability and availability.The proposed FSCS with regular low-density parity-check(LDPC)for coding techniques is deliberated and evaluated in terms of signal-to-noise ratio(SNR)in this paper.The extrinsic information transfer(EXIT)methodology is an incredible technique employed to investigate the sum-product decoding algorithm of LDPC codes and optimize the EXIT chart by applying curve fitting.In this research work,we also analyze the behavior of the EXIT chart of regular/irregular LDPC for the FSCS.We also investigate the error performance of LDPC code for the proposed FSCS.

Optimized LDPC differential-encoded 16QAM scheme for high-speed transmission systems

The 16-ary quadrature amplitude modulation （16QAM） is a high spectral efficient scheme for high-speed transmission systems. To remove the phase ambiguity in the coherent detection system, differential-encoded 16QAM （DE-16QAM） is usually used, however, it will cause performance degradation about 3 dB as compared to the conventional 16QAM. To overcome the performance loss, a serial concatenated system with outer low density parity check （LDPC） codes and inner DE-16QAM is proposed. At the receiver, joint iterative differential demodulation and decoding （ID） is carried out to approach the maximum likelihood performance. Moreover, a genetic evolution algorithm based on the extrinsic information transfer chart is proposed to optimize the degree distribution of the outer LDPC codes. Both theoretical analyses and simulation results indicate that this algorithm not only compensates the performance loss, but also obtains a significant performance gain, which is up to 1 dB as compared to the conventional non-DE-16QAM.

New Applications of EXIT Chart for Iterative Decoding Systems

Applications on iterative control and multiple input multiple output (MIMO) system were developed. Two new charts derived from extrinsic information transfer (EXIT) chart were employed as the designing tools, which are called as output mutual information chart with defined iterative degree (DID) chart and near optimum output mutual information (NOMI) chart respectively. Different from the EXIT chart, they can show the iterative performance on the whole signal-to-noise ratio range with one single curve, whereas computation complexity is greatly reduced compared with conventional bit error ratio (BER) performance curve. The iterative control was implemented according to a near-optimum iterative degree vector determined by NOMI chart, the reasonability of uncertain parameters was analyzed in one MIMO system. The concepts were illustrated based on bit-interleaved coded modulation with iterative decoding (BICM-ID).

A NOVEL ITERATIVE SCHEME FOR PARALLEL INTER-SYMBOL INTERFERENCE CHANNELS

In this paper,we propose a novel iterative scheme for exploiting transmit diversity using parallel independent Inter-Symbol Interference (ISI) channels. In this adaptive iterative scheme,we use EXtrinsic Information Transfer (EXIT) chart tool to choose appropriate iterative method from Itera-tive Combining (IC),used as parallel concatenation turbo-like scheme,and Turbo Equalization (TE),used as serial concatenation turbo-like scheme. It is show that the proposed iterative scheme provides excellent performance both analytically and through simulations without any compute complexity increase comparable to IC.

DESIGN OF LOW-DENSITY PARITY CHECK CODES FOR MIMO SYSTEMS WITH DOUBLY-ITERATIVE RECEIVERS

In this paper, the Multiple Input Multiple Output (MIMO) doubly-iterative receiver which consists of the Probabilistic Data Association detector (PDA) and Low-Density Parity-Check Code (LDPC) decoder is developed. The receiver performs two iterative decoding loops. In the outer loop, the soft information is exchanged between the PDA detector and the LDPC decoder. In the inner loop, it is exchanged between variable node and check node decoders inside the LDPC decoder. On the light of the Extrinsic Information Transfer (EXIT) chart technique, an LDPC code degree profile optimization algorithm is developed for the doubly-iterative receiver. Simulation results show the doubly-receiver with optimized irregular LDPC code can have a better performance than the one with the regular one.

Network Coding Based on Linear Block Codes for Multi-source Cooperative Relaying Networks

In order to improve link performance of future wireless relay networks,a network coding scheme with linear block codes was proposed,which could be deployed in a relay network consisting of multi-source sending data to a common base station(BS) with the assistance of one relay node.At BS,an iterative decoding structure between one cooperative decoder and a number of single-source decoders was established using the relayed network codes and source codes.Further,the extrinsic information transfer(EXIT) chart technique was used to predict and analyze the convergence behavior of iterative decoder.The analysis and simulation results show that the bit error ratio(BER) performance of the proposed scheme outperforms reference scheme under different relay network coding matrices.Compared with a reference scheme without the multisource cooperation,the proposed scheme can obtain network coding gain from the relay network while not reduce its code rate.

DESIGN OF LDPC-CODED BICM USING A SEMI-GAUSSIAN APPROXIMATION

This paper investigates analysis and design of Low-Density Parity-Check （LDPC） coded Bit Interleaved Coded Modulation （BICM） over Additive White Gaussian Noise （AWGN） channel. It focuses on Gray-labeled 8-ary Phase-Shift-Keying （8PSK） modulation and employs a Maximum A Posteriori （MAP） symbol-to-bit metric calculator at the receiver. An equivalent model of a BICM communication channel with ideal interleaving is presented. The probability distribution function of log-likelihood ratio messages from the MAP receiver can be approximated by a mixture of symmetric Gaussian densities. As a result semi-Gaussian approximation can be used to analyze the decoder. Extrinsic information transfer charts are employed to describe the convergence behavior of LDPC decoder. The design of irregular LDPC codes reduces to a linear programming problem on two-dimensional variable edge-degree distribution. This method allows irregular code design in a wider range of rates without any limit on the maximum node degree and can be used to design irregular codes having rates varying from 0.5275 to 0.9099. The designed convergence thresholds are only a few tenths, even a few hundredths of a decibel from the capacity limits. It is shown by Monte Carlo simulations that, when the block length is 30,000, these codes operate about 0.62-0.75 dB from the capacity limit at a bit error rate of 10s.

Improved iterative convergence method in Q-ary LDPC coded high order PR-CPM

The Q-ary low-density parity-check（LDPC） coded high order partial response continuous phase modulation（PR-CPM） with double iterative loops is investigated. This scheme shows significant improvements in power and bandwidth efficiency, but at the expense of long iterative decoding delay and computational complexity induced by the improper match between the demodulator and the decoder. To address this issue, the convergence behavior of Q-ary LDPC coded CPM is investigated for the Q=2 and Q〉2 cases, and an optimized design method based on the extrinsic information transfer chart is proposed to improve the systematic iterative efficiency. Simulation results demonstrate that the proposed method can achieve a perfect tradeoff between iterative decoding delay and bit error rate performance to satisfy real-time applications.

Spatially Coupled Codes via Bidirectional Block Markov Superposition Transmission

In this paper,we present a new class of spatially coupled codes obtained by using both non-recursive and recursive block-oriented superposition.The resulting codes are termed as bidirectional block Markov superposition transmission(BiBMST)codes.Firstly,we perform an iterative decoding threshold analysis according to protograph-based extrinsic information transfer(PEXIT)charts for the BiBMST codes over the binary erasure channels(BECs).Secondly,we derive the generator and parity-check matrices of the BiBMST codes.Thirdly,extensive numerical results are presented to show the advantages of the proposed BiBMST codes.Particularly,our numerical results show that,under the constraint of an equal decoding latency,the BiBMST codes perform better than the recursive BMST(rBMST)codes.However,the simulation results show that,in finite-length regime,negligible performance gain is obtained by increasing the encoding memory.We solve this limitation by introducing partial superposition,and the resulting codes are termed as partially-connected BiBMST(PC-BiBMST)code.Analytical results have confirmed the advantages of the PC-BiBMST codes over the original BiBMST codes.We also present extensive simulation results to show the performance advantages of the PC-BiBMST codes over the spatially coupled low-density parity-check(SC-LDPC)codes,spatially coupled generalized LDPC(SC-GLDPC)codes,and the original BiBMST codes in the finite-length regime.

Efficient Helicopter-Satellite Communication Scheme Based on Check-Hybrid LDPC Coding

When implementing helicopter-satellite communications, periodical interruption of the received signal is a challenging problem because the communication antenna is intermittently blocked by the rotating blades of the helicopter. The helicopter-satellite channel model and the Forward Error Control（FEC） coding countermeasure are presented in this paper. On the basis of this model, Check-Hybrid（CH） Low-Density Parity-Check（LDPC）codes are designed to mitigate the periodical blockage over the helicopter-satellite channels. The CH-LDPC code is derived by replacing part of single parity-check code constraints in a Quasi-Cyclic LDPC（QC-LDPC） code by using more powerful linear block code constraints. In particular, a method of optimizing the CH-LDPC code ensemble by searching the best matching component code among a variety of linear block codes using extrinsic information transfer charts is proposed. Simulation results show that, the CH-LDPC coding scheme designed for the helicopter-satellite channels in this paper achieves more than 25% bandwidth efficiency improvement, compared with the FEC scheme that uses QC-LDPC codes.