A. Pantazi, M.A. Lantz, et al.
Nanotechnology
A new reduced-complexity decoding algorithm for low-density parity-check codes that operates entirely in the log-likelihood domain is presented. The computationally expensive check-node updates of the sum-product algorithm are simplified by using a difference-metric approach on a two-state trellis and by employing the dual-max approximation. The dual-max approximation is further improved by using a correction factor that allows the performance to approach that of full sum-product decoding.
A. Pantazi, M.A. Lantz, et al.
Nanotechnology
Giovanni Cherubini, Th. Antonakopoulos, et al.
ESSCIRC 2002
A. Sebastian, A. Pantazi, et al.
ACC 2005
H. Pozidis, W. Häberle, et al.
IEEE Transactions on Magnetics