Outage-Limit-Approaching Channel Coding for Future Wireless Communications: Root-Protograph Low-Density Parity-Check Codes

Fang, Yi; Chen, Pingping; Cai, Guofa; Lau, Francis C. M.; Liew, Soung Chang; Han, Guangjie

doi:10.1109/mvt.2019.2903343

Cited by 116 publications

(46 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These codes can achieve capacity-approaching performance with a high code rate. An extension to these codes for block fading channels are known as Root-Photographs LDPC Codes [41].…”

Section: Standards Including Ldpc Codes and Recent Protograph Codesmentioning

confidence: 99%

A New Construction of High Performance LDPC Matrices for Mobile Networks

Sarvaghad-Moghaddam

Ullah

Jayakody

et al. 2020

Sensors

View full text Add to dashboard Cite

Secure and reliable information flow is one of the main challenges in social IoT and mobile networks. Information flow and data integrity is still an open research problem. In this paper, we develop new methods of constructing systematic and regular Low-Density Parity-Check Matrices (LDPCM), inspired by the structure of the Sarrus method and geometric designs. Furthermore, these codes have cyclic structure and therefore, are less complex in computation and also require less memory in hardware implementation. Besides, an optimal method of post-processing for deleting girths four is presented. Numerical results show that the codes constructed by these methods perform well over the additive white Gaussian noise (AWGN) channel when decoded with the sum-product LDPC iterative algorithms. The proposed methods can be very efficient in terms of reducing memory consumption and improving the convergence speed of the decoder particularly in IoT and mobile networks. of 24gained attention recently and substantial research work has been done in designing the parity check matrices, low complexity encoding and decoding algorithms and numerous practical applications [7][8][9][10][11][12].The bit error performance of the LDPC code primarily depends on the construction [13] of LDPCM and on parameters such as row and column weights, rate, girth, and code size. Constructions of LDPCM can be categorized into two broad groups: random (irregular) and algebraic constructions (regular). The computer search method is generally used for random construction of LDPCM with a predefined set of design rules based on the Tanner graphs [14] which gives connectivity of the bit (variable) nodes and the check nodes. Randomly constructed irregular LDPC codes can perform within 0.0045 dB of Shannon limit [15] but these codes are very complex to implement in hardware. Methods of algebraic construction are used to construct cyclic or quasi-cyclic LDPC codes with combination methods. This structured LDPC codes [16][17][18], in general, are simple to encode and decode as compared with the random codes. The LDPC codes have shown the capacity approaching performance, but at the expense of high complexity which is the main hurdle to be adopted, these codes in many real-world applications and implementations. Recently LDPC codes have been adopted by digital video broadcasting and IEEE standards like DVB-S2, DVB-X2, WiFI and WiMax [19,20]. Case Study LDPC User Cases in 5GCellular networks and the Internet of Things are the main market drivers for 5G and beyond. There is a large number of use cases for cellular networks and the Internet of Things, such as virtual reality, augmented reality and remote sensing, eHealth services, automotive driving and many more.Keeping in view the IoT enabled devices, 5G is meant to operate at higher speeds and make the delay nearly non-existent, giving way to a seamless information flow [21]. Mobile IoT-based devices offer the low-cost, low-power consumption solution in comparison with the existing 4G. This 5G enabled mobile netw...

show abstract

“…These codes can achieve capacity-approaching performance with a high code rate. An extension to these codes for block fading channels are known as Root-Photographs LDPC Codes [41].…”

Section: Standards Including Ldpc Codes and Recent Protograph Codesmentioning

confidence: 99%

A New Construction of High Performance LDPC Matrices for Mobile Networks

Sarvaghad-Moghaddam

Ullah

Jayakody

et al. 2020

Sensors

View full text Add to dashboard Cite

show abstract

“…Proof. If there exists a Tanner graph with girth 6, there exist 3 sets and the unions of intersections of every 2 sets out of the 3 sets must have no less than 3 elements, e.g., |(L 6 ∩ L 8 ) ∪ (L 6 ∩ L 10 ) ∪ (L 8 ∩ L 10 )| = 3 for H in (2). Therefore, the girth of the LDPC code is at least 8.…”

Section: A Definition and Theoremsmentioning

confidence: 99%

“…LDPC codes belong to the class of linear block codes with implementable decoders, which bring near-capacity performance on a variety of channels, e.g., binary-input additive white Gaussian noise (AWGN) channels in [1]. In [2], a novel family of protograph LDPC codes has been proposed, which can achieve not only linear complexity encoding and high-speed decoding by means of a quasi-cyclic (QC) structure but also near-interruption performance over different block fading channels. LDPC codes was also used to design bit-interleaved coded modulation (BICM) with iterative demapping and decoding functions, which bring improved throughput under the constraints of limited bandwidth [3].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Design of High-Rate LDPC Codes Based on Matroid Theory

2019

IEEE Commun. Lett.

View full text Add to dashboard Cite

In this letter, sufficient conditions for the determination of the girth are studied from the perspective of matroid theory. The girth of a Tanner graph is at least 2(t1 + 2) if t1 specific conditions are simultaneously met. A novel method of constructing high-rate low-density parity-check (LDPC) codes is proposed based on the matroid theory. The parity-check matrices of the constructed LDPC codes are in the form of H = [I|H2] with H2 constructed under the conditions of a given girth and a fixed column weight (e.g., Wc = 4 or Wc = 6). Simulation results verify that the proposed LDPC codes outperform those in the literature over additive white Gaussian noise channels in terms of bit error rate performance.

show abstract

“…Its drawback is higher computational complexity and consumption of more frequency resources. 33 Therefore, RC root-protograph (RCRP) codes were considered to attain performance very close to the outage limit over single relay and multiple relay block fading channels. 34,35 Polar codes introduced by Erdal Arikan 36 outperform other channel codes due to the Shannon capacity achievement in the physically degraded relay channel.…”

Section: Introductionmentioning

confidence: 99%

Outage analysis of opportunistic‐based hybrid decode‐amplify‐forward relaying in polar code environment

Madhusudhanan

Venkateswari

2019

Int J Communication

View full text Add to dashboard Cite

Outage analysis plays a vital role in wireless systems to determine reliable transmission and effective communication. Incremental hybrid decodeamplify-forward (IHDAF) relay offers a way of meeting the challenges of capacity and coverage improvement with great potential in cooperative communication networks. Therefore, opportunistic incremental hybrid relaying must be integrated with coding schemes to achieve full diversity. In this paper, the outage behavior of polar coded and distributed coded cooperative relaying schemes is analyzed. Simulation results show that opportunistic incremental HDAF using polar code offers an outage capacity of 17 b/s/Hz for 4 × 4 multiantenna and 45 b/s/Hz in 8 × 8 multiantenna systems with an outage of 10 −8 and 10 −13 , respectively. Moreover, the polar coded opportunistic IHDAF system in 8 × 8 MIMO achieves 2 and 6 dB higher gains compared with amplify-and-forward (AF) and decode-and-forward (DF) relaying schemes. The closed-form expression for outage probability has been derived through Marcum-Q approximations and processed through Monte Carlo simulations.

show abstract

Outage-Limit-Approaching Channel Coding for Future Wireless Communications: Root-Protograph Low-Density Parity-Check Codes

Cited by 116 publications

References 15 publications

A New Construction of High Performance LDPC Matrices for Mobile Networks

A New Construction of High Performance LDPC Matrices for Mobile Networks

Design of High-Rate LDPC Codes Based on Matroid Theory

Outage analysis of opportunistic‐based hybrid decode‐amplify‐forward relaying in polar code environment

Contact Info

Product

Resources

About