Reliability-Based Windowed Decoding for Spatially Coupled LDPC Codes

Kang, Peng; Xie, Yuan; Yang, Lei; Yuan, Jinhong

doi:10.1109/lcomm.2018.2835466

Cited by 19 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Fortunately, our associated sectors can request 20% of new LLRs from the previous sector to improve the decoding performance of the current sector when decoding failure (remaining erroneous bits) is encountered. In this paper, we use the results from the parity-check equation, as introduced for the SC-LDPC window decoder by Kang et al [23], to detect erroneous bits in any sector. As a result, the BERs of SC-LDPC codes with associated sectors are improved when information from the previous sector is requested.…”

Section: Non-associated Sectors Vs Associated Sectorsmentioning

confidence: 99%

Associated Sectors of Magnetic Recording Systems Using Spatially Coupled LDPC Codes

Khittiwitchayakul¹,

Phakphisut²,

Supnithi³

2022

ECTI-EEC

View full text Add to dashboard Cite

In traditional magnetic recording systems, non-associated sectors are mainly adopted, whereby two consecutive sectors are decoded independently by the low-density parity-check (LDPC) codes. In this paper, we propose a magnetic recording system with associated sectors, constructed using spatially coupled low-density parity-check (SC-LDPC) codes. If the SC-LDPC decoder cannot correct the erroneous bits in the current sector, it can request information stored in previous sectors to improve decoding performance. Moreover, we modify protograph-based extrinsic information transfer (P-EXIT) charts to examine the theoretical performance of SC-LDPC codes applied to both non-associated and associated sectors. Our theoretical results show that the associated sectors achieve significant performance gains compared to the traditional non-associated sectors.

show abstract

Section: Non-associated Sectors Vs Associated Sectorsmentioning

confidence: 99%

Associated Sectors of Magnetic Recording Systems Using Spatially Coupled LDPC Codes

Khittiwitchayakul¹,

Phakphisut²,

Supnithi³

2022

ECTI-EEC

View full text Add to dashboard Cite

show abstract

“…We finally evaluate the FER performance of the proposed MIM-QBP decoders and MIM-QMS decoders for the irregular LDPC code in [31] with the degree distributions specified as ρ(x) = 0.32338x 7 + 0.67662x 8 , θ(x) = 0.13805x + 0.40104x 2 + 0.02659x 8 + 0.43433x 16 .…”

Section: B the Ieee 80211n Standard Ldpc Codementioning

confidence: 99%

Generalized Mutual Information-Maximizing Quantized Decoding of LDPC Codes with Layered Scheduling

Peng¹,

Cai²,

He³

et al. 2020

Preprint

Self Cite

View full text Add to dashboard Cite

In this paper, we propose a general framework of the mutual infomration-maximizing (MIM) quantized decoding for low-density parity-check (LDPC) codes, which can outperform the state-of-the-art lookup table (LUT) decoder by using simple mappings and fixed-point additions for the node updates. Our decoding method is generic in the sense that it can be applied to LDPC codes with arbitrary degree distributions, and it can be implemented based on either the belief propagation (BP) algorithm or the min-sum (MS) algorithm, leading to the MIM quantized BP (MIM-QBP) decoder and the MIM quantized MS (MIM-QMS) decoder, respectively. In particular, we approximate the check node (CN) update of the MIM-QBP decoder by a max-product operation and obtain the MIM-QMS decoder, which simplifies the decoder design and requires less resource consumption. To avoid the precision degradation, we introduce a dynamic reconstruction method to optimize the variable node update for different iterations. Some practical aspects of the proposed decoders such as the design and decoding complexity are also discussed. Simulation results show that the MIM-QBP decoder outperforms the LUT decoders in the waterfall region with both 3-bit and 4-bit precision. Moreover, the 4-bit MIM-QMS decoder can even surpass the floating-point BP decoder in the error-floor region.

show abstract

“…Based on these classical channel codes, several modern codes have been developed over the past years, which include the polar codes [113][114][115], turbo codes [116][117][118], and low-density parity check (LDPC) codes [119][120][121]. Polar codes are a class of linear block codes, whose encoding construction is based on a multiple recursive concatenation of a short kernel code to transform the physical channel into virtual outer channels.…”

Section: Convolutional Codesmentioning

confidence: 99%

“…Iterative decoding is a generic term to refer to decoding algorithms that proceed in iterations [115,117,121]. An important subclass of iterative algorithms are message-passing algorithms, which obey the rule that an outgoing message along an edge only depends on the incoming messages along all edges other than this edge itself [125].…”

Section: Iterative Decoding Algorithm On Code Graphmentioning

confidence: 99%

Random Access for Massive Machine-Type Communications

Sun

2019

Preprint

View full text Add to dashboard Cite

As a key enabler for the Internet-of-Things (IoT), machine-type communications (MTC) has emerged to be an essential part for future communications. In MTC, a number of machines (called users or devices) ubiquitously communicate to a base station or among themselves with no or minimal human interventions. It is envisioned that the number of machines to be connected will reach tens of billions in the near future. In order to accommodate such a massive connectivity, random access schemes are deemed as a natural and efficient way. Different from scheduled multiple access schemes in existing cellular networks, users with transmission demands will access the channel in an uncoordinated manner via random access schemes, which can substantially reduce the signalling overhead. However, the reduction in signalling overhead may sacrifice the system reliability and efficiency, due to the unknown user activity and the inevitable interference from contending users. This seriously hinders the application of random access schemes in MTC.Therefore, this thesis is dedicated to studying methods to improve the efficiency of random access schemes and to facilitate their deployment in MTC. Rank(•)Rank of a matrix mod(x, y) Modulo operation of x and y lim Limit

show abstract

Reliability-Based Windowed Decoding for Spatially Coupled LDPC Codes

Cited by 19 publications

References 13 publications

Associated Sectors of Magnetic Recording Systems Using Spatially Coupled LDPC Codes

Associated Sectors of Magnetic Recording Systems Using Spatially Coupled LDPC Codes

Generalized Mutual Information-Maximizing Quantized Decoding of LDPC Codes with Layered Scheduling

Random Access for Massive Machine-Type Communications

Contact Info

Product

Resources

About