z-logo
open-access-imgOpen Access
An Improvement of UMP‐BP Decoding Algorithm Using the Minimum Mean Square Error Linear Estimator
Author(s) -
Kim Namshik,
Kim Jaebum,
Park Hyuncheol,
Suh SeungBum
Publication year - 2004
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.04.0703.0019
Subject(s) - algorithm , additive white gaussian noise , mathematics , decoding methods , minimum mean square error , belief propagation , multiplicative function , estimator , mean squared error , berlekamp–welch algorithm , low density parity check code , white noise , statistics , error floor , mathematical analysis
In this paper, we propose the modified uniformly most powerful (UMP) belief‐propagation (BP)‐based decoding algorithm which utilizes multiplicative and additive factors to diminish the errors introduced by the approximation of the soft values given by a previously proposed UMP BP‐based algorithm. This modified UMP BP‐based algorithm shows better performance than that of the normalized UMP BP‐based algorithm, i.e., it has an error performance closer to BP than that of the normalized UMP BP‐based algorithm on the additive white Gaussian noise channel for low density parity check codes. Also, this algorithm has the same complexity in its implementation as the normalized UMP BP‐based algorithm.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here