Flexible LDPC Decoder Architectures

Table 1

Check node update for LDPC decoding algorithms.

Algorithm	Formulation: 𝑗′⊗≠𝑗(𝛼^(𝑛−1)𝑖,𝑗′)
SP	Φ(∑𝑗′∈𝒩(𝑖)⧵𝑗Φ(|𝛼^(𝑛−1)𝑖𝑗′|)
	Φ(𝑥)=−log(tanh(𝑥/2))
MS	min𝑗′∈𝒩(𝑖)⧵𝑗{|𝛼^(𝑛−1)𝑖,𝑗′|}
OMS	max{min𝑗′∈𝒩(𝑖)⧵𝑗{|𝛼^(𝑛−1)𝑖,𝑗′|}−𝛽,0}
	𝛽≥0
NMS	𝜆⋅min𝑗′∈𝒩(𝑖)⧵𝑗{|𝛼^(𝑛−1)𝑖,𝑗′|}
	𝜆<1