Modified Min Sum Decoding Algorithm for Low Density Parity Check Codes

Shrinidhi, J; Krishna, P. Sri; Yamuna, B.; Pargunarajan, K

doi:10.1016/j.procs.2020.04.230

Cited by 7 publications

(4 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reduced non-linear functions [6,7] and logarithmic functions [8,15] further simplify these check nodes by lowering implementation complexity. Although decoding performance is compromised, the Min-Sum (MS) approach [7,11] further simplifies SPA's check-node procedures. In order to establish a balance between complexity and effectiveness, the MS algorithm has gone through a number of improvements [9,12], including normalised MS and offset MS decoding.…”

Section: Figure2 Evaluation Of Error Correcting Codesmentioning

confidence: 99%

A Quasi-Cyclic LDPC Based Low Complexity and Area-Efficient Communication System for IEEE 802.11n

Yashika Gaidhani, Tejaswini Panse

2024

jes

View full text Add to dashboard Cite

Low-density parity-check (LDPC) code, which has an excellent error-correcting performance that is close to the Shannon limit, is the most often used error correction code (ECC) for reliable and effective communication. Despite higher performance and lower decoding complexity, the main disadvantage of LDPC codes is their high encoding complexity. A significant problem is the VLSI implementation of the LDPC encoder and decoder. In this paper, structured LDPC codes—also known as quasi-cyclic low-density parity check codes—have been used since it is good bit error ratio (BER) performance and adaptable hardware execution characteristics. The Complete (Encoder-Channel-Decoder) communication system with a 1/2 code rate, 648 bits codeward length, and sub-block size of z = 27 has been constructed for the IEEE 802.11n wireless standard.

show abstract

Section: Figure2 Evaluation Of Error Correcting Codesmentioning

confidence: 99%

A Quasi-Cyclic LDPC Based Low Complexity and Area-Efficient Communication System for IEEE 802.11n

Yashika Gaidhani, Tejaswini Panse

2024

jes

View full text Add to dashboard Cite

show abstract

“…The min-sum algorithm is a soft-decision algorithm that consists of message passing between variable and check nodes [45]; the iterative steps of the min-sum algorithm, for each iteration, are according to [46].…”

Section: Ldpc Codesmentioning

confidence: 99%

Iterative Equalization and Decoding over an Additive White Gaussian Noise Channel with ISI Using Low-Density Parity-Check Codes

Cuc,

Morgoș,

Grava

et al. 2023

Applied Sciences

View full text Add to dashboard Cite

In this article we present an iterative system of equalization and decoding to manage the intersymbol interference over an additive white Gaussian noise (AWGN) channel. Following the classic turbo equalization scheme, the proposed system consists of low-density parity-check (LDPC) coding at the transmitter side; we applied a Log maximum a posteriori probability (Log-MAP) equalizer and min-sum LDPC decoding at the receiver side. The equalizer and decoder, linked through interleaving and deinterleaving, iteratively update each other’s information. We performed the performance analysis of the proposed system, bit error rate (BER) vs. signal-to-noise ratio (SNR), considering three different impulse responses of the channel (h). Our experimental results indicated that increasing the number of iterations performed by the LDPC decoder from 10 to 20 during the iterative process of equalization and decoding leads to better outcomes. The proposed system was compared with turbo equalization and separate equalization, performed before the decoding process with minimum mean-square error (MMSE) and LDPC decoding, in terms of BER vs. SNR, considering the three different h. Based on the analyzed results, it can be concluded that the equalization performance depends on both the impulse responses of the channel and the chosen decoding and equalization method; therefore, the equalization method does not always offer good results for any h.

show abstract

“…where 𝑠 𝑛 0 and 𝑠 𝑛 1 is described as nth bit probabilities of '0' or '1' respectively. The mother code with the speed: systematic segment and parity segment are sent, where Log Likelihood ratio of all the segments can be captured out of the signal collected [23]- [25]. For daughter code: few parity segments are not sent, where Nth segment is large positive constant which is not sent and assigned to 𝑍 𝑛 with value 0.…”

Section: Zero Filling Decoding Algorithmmentioning

confidence: 99%

An efficient reconfigurable code rate cooperative low-density parity check codes for gigabits wide code encoder/decoder operations

Venkatesh,

Mallikarjunaiah,

Srikantaswamy

2023

IJECE

View full text Add to dashboard Cite

In recent days, extensive digital communication process has been performed. Due to this phenomenon, a proper maintenance of authentication, communication without any overhead such as signal attenuation code rate fluctuations during digital communication process can be minimized and optimized by adopting parallel encoder and decoder operations. To overcome the above-mentioned drawbacks by using proposed reconfigurable code rate cooperative (RCRC) and low-density parity check (LDPC) method. The proposed RCRC-LDPC is capable to operate over gigabits/sec data and it effectively performs linear encoding, dual diagonal form, widens the range of code rate and optimal degree distribution of LDPC mother code. The proposed method optimize the transmission rate and it is capable to operate on 0.98 code rate. It is the highest upper bounded code rate as compared to the existing methods. The proposed method optimizes the transmission rate and is capable to operate on a 0.98 code rate. It is the highest upper bounded code rate as compared to the existing methods. the proposed method's implementation has been carried out using MATLAB and as per the simulation result, the proposed method is capable of reaching a throughput efficiency greater than 8.2 (1.9) gigabits per second with a clock frequency of 160 MHz.

show abstract

Modified Min Sum Decoding Algorithm for Low Density Parity Check Codes

Cited by 7 publications

References 9 publications

A Quasi-Cyclic LDPC Based Low Complexity and Area-Efficient Communication System for IEEE 802.11n

A Quasi-Cyclic LDPC Based Low Complexity and Area-Efficient Communication System for IEEE 802.11n

Iterative Equalization and Decoding over an Additive White Gaussian Noise Channel with ISI Using Low-Density Parity-Check Codes

An efficient reconfigurable code rate cooperative low-density parity check codes for gigabits wide code encoder/decoder operations

Contact Info

Product

Resources

About