Two Effective Scheduling Schemes for Layered Belief Propagation of 5G LDPC Codes

Wang, Bingbing; Zhu, Yaguang; Kang, Jing

doi:10.1109/lcomm.2020.2991473

Cited by 19 publications

(13 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…So the greedy phenomenon can be alleviated and the convergence performance of error correction is than RBP. Aiming at the slow convergence speed of NR LDPC codes in 5G, a residual based hierarchical confidence propagation algorithm is proposed in [15] by dynamically rearranging the layers between different iterations. This algorithm reduces the decoding complexity with a small BER performance loss.…”

Section: Introductionmentioning

confidence: 99%

A Reliability Profile Based Low-Complexity Dynamic Schedule LDPC Decoding

2022

View full text Add to dashboard Cite

In order to improve the error correction performance of Low-Density Parity-Check (LDPC) codes, In this paper, we propose a Reliability Profile (RP) Based Low-Complexity Dynamic Schedule, called RPD. In terms of dynamic scheduling, the new RPD method is distinct from the existing residual belief propagation (RBP) and its variations, since RPD is based on residual criterion. Reliability divides nodes message into two categories: reliable and unreliable. By using as many messages as possible from the latest available current iteration instead of the previous iteration to update unreliable messages multiple times to speed up the convergence speed and increase the total number of updates of effective nodes message, so as to improve the Bit Error Rate (BER) performance. By not updating the reliable message, the number of ineffective nodes message updates is reduced, thereby reducing the decoding complexity. Besides, the more iterations increase, the fewer calculations of these reliable nodes. Moreover, based on reliability profile, RPD has an advantage over RBP for dynamic scheduling in that the former only needs integer operations, while the latter requires float operations. Therefore, the RPD algorithm not only accelerates the convergence speed of LDPC decoding and but also improves the BER performance while reducing the complexity.The analysis and simulation results show that the RPD strategy not only retains the fast-convergence advantage of RBP, but also has a better convergence BER performance compared to that of node-wise residual belief propagation (NW RBP). Furthermore, the simulation results show that the RPD can significantly improve the convergence speed of protograph LDPC decoding.

show abstract

Section: Introductionmentioning

confidence: 99%

A Reliability Profile Based Low-Complexity Dynamic Schedule LDPC Decoding

2022

View full text Add to dashboard Cite

show abstract

“…Hybrid automatic re‐transmission integrates gain at the receiver by adjusting redundant information and performing re‐transmission [23]. According to the wireless channel measurement, channel scheduling selects a better channel for data transmission [24].…”

Section: Introductionmentioning

confidence: 99%

Floop: An efficient video coding flow for unmanned aerial vehicles

Cheng

Wang

et al. 2022

ETRI Journal

View full text Add to dashboard Cite

Under limited transmission conditions, many factors affect the efficiency of video transmission. During the flight of an unmanned aerial vehicle (UAV), frequent network switching often occurs, and the channel transmission condition changes rapidly, resulting in low‐video transmission efficiency. This paper presents an efficient video coding flow for UAVs working in the 5G nonstandalone network and proposes two bit controllers, including time and spatial bit controllers, in the flow. When the environment fluctuates significantly, the time bit controller adjusts the depth of the recursive codec to reduce the error propagation caused by excessive network inference. The spatial bit controller combines the spatial bit mask with the channel quality multiplier to adjust the bit allocation in space to allocate resources better and improve the efficiency of information carrying. In the spatial bit controller, a flexible mini graph is proposed to compute the channel quality multiplier. In this study, two bit controllers with end‐to‐end codec were combined, thereby constructing an efficient video coding flow. Many experiments have been performed in various environments. Concerning the multi‐scale structural similarity index and peak signal‐to‐noise ratio, the performance of the coding flow is close to that of H.265 in the low bits per pixel area. With an increase in bits per pixel, the saturation bottleneck of the coding flow is at the same level as that of H.264.

show abstract

“…As is well known, scheduling decoding algorithms can efficiently reduce the number of iterations in the SSCC system. There are various scheduling methods, such as shuffled scheduling method [32]- [41], layer scheduling method [36]- [38], informed dynamic scheduling method [39], [40], and so on, but they were all designed for the SSCC system, not suitable for the JSCC system.…”

Section: Introductionmentioning

confidence: 99%

Generalized Joint Shuffled Scheduling Decoding Algorithm for the JSCC System Based on Protograph-LDPC Codes

Wang

Hong

et al. 2021

IEEE Access

View full text Add to dashboard Cite

The joint shuffled scheduling decoding (JSSD) algorithm can reduce the decoding complexity of the joint source-channel coding system (JSCC) based on double protograph low-density parity-check (P-LDPC) codes. However, the JSSD algorithm will not work when the linking matrix between check nodes (CNs) of the source P-LDPC and variable nodes (VNs) of the channel P-LDPC is adopted in such a system, and this linking matrix has a significant influence on the system performance. In this paper, a generalized joint shuffled scheduling decoding (GJSSD) algorithm is designed to work for the system, and the JSSD algorithm can be regarded as a special case of this algorithm. Simulations show that the proposed GJSSD algorithm can reduce the decoding complexity with performance improvement when compared with the joint belief-propagation (JBP) algorithm.INDEX TERMS Joint source-channel coding, P-LDPC code, shuffled decoding.

show abstract

Two Effective Scheduling Schemes for Layered Belief Propagation of 5G LDPC Codes

Cited by 19 publications

References 8 publications

A Reliability Profile Based Low-Complexity Dynamic Schedule LDPC Decoding

A Reliability Profile Based Low-Complexity Dynamic Schedule LDPC Decoding

Floop: An efficient video coding flow for unmanned aerial vehicles

Generalized Joint Shuffled Scheduling Decoding Algorithm for the JSCC System Based on Protograph-LDPC Codes

Contact Info

Product

Resources

About