A new derivation method of the weighted majority-logic(WMLG)decoding for low-density parity-check(LDPC)codes is proposed based on the maximum-logarithm(max-log)maximum a posteriori(MAP)decoding to illustrate the physical significance of WMLG decoding. The logarithm likelihood ratio(LLR)of information bit is approximated using the logarithm approximation to the sum of powers. Then it is theoretically proved that the WMLG decoding is identical to the max-log MAP decoding. Furthermore
the simulation results show that the max-log MAP decoding has almost the same error performance as the MAP decoding has
while the complexity is greatly reduced. The equivalence between the WMLG decoding and the max-log MAP decoding shows that all WMGL-based hybrid decoding algorithms can be regarded as revised versions of the max-log MAP decoding
which gives a guide to devise new hybrid decoding algorithms of LDPC codes.
关键词
Keywords
references
GALLAGER R G. Low density parity check codes [J]. IRE Transactions on Information Theory, 1962, 8(1): 21-28.
KOU Y, LIN S, FOSSORIER M. Low density parity check codes based on finite geometries: a rediscovery and more [J]. IEEE Transactions on Information Theory, 2001, 47(11): 2711-2736.
ZHANG Juntan, FOSSORIER M. A Modified weighted bit-flipping decoding of low-density parity-check codes [J]. IEEE Communications Letters, 2004, 8(3): 165-167.
LIU Minghua, ZHANG Lijun. Iterative hybrid decoding algorithm for LDPC codes based on attenuation factor [J]. Frontiers of Electrical and Electronic Engineering, 2012, 7(3): 279-285.
KANG Jingyu, HUANG Qin, LIN Shu, et al. An iterative decoding algorithm with backtracking to lower the error-floors of LDPC codes [J]. IEEE Transactions on Communications, 2011, 59(1): 64-73.
DONG Guiqiang, LI Yanan, XIE Ningde, et al. Candidate bit based bit-flipping decoding algorithm for LDPC codes [C]∥Proceedings of IEEE International Symposium on Information Theory. Piscataway, NJ, USA: IEEE, 2009: 2166-2168.
HUANG Qin, KANG Jingyu, ZHANG Li, et al. Two reliability-based iterative majority-logic decoding algorithms for LDPC codes [J]. IEEE Transactions on Information Theory, 2009, 57(12): 3597-3606.
HUANG Qin, KANG Jingyu, ZHANG Li, et al. Two efficient and low-complexity iterative reliability-based majority-logic decoding algorithms for LDPC codes [C]∥Proceedings of IEEE Information Theory Workshop. Piscataway, NJ, USA: IEEE, 2009: 253-257.
CHEN Chaoyu, HUANG Qin, CHAO Chichao, et al. Two low-complexity reliability-based message-passing algorithms for decoding non-binary LDPC codes [J]. IEEE Transactions on Communications, 2010, 58(11): 3140-3147.
LIU Bing, GAO Jun, DOU Gaoqi. Hybrid weighted bit-flipping decoding algorithm for LDPC codes [J]. Systems Engineering and Electronics, 2010, 32(10): 2252-2256.
MASSEY J L. Threshold decoding [M]. Cambridge, MA, USA: MIT Press, 1963.
ROBERTSON P, VILLEBMN E, HOEHER P. A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain [C]∥Proceedings of IEEE International Conference on Communications. Piscataway, NJ, USA: IEEE, 1995: 1009-1013.
MACKAY D J C. Encyclopedia of sparse graph codes [EB/OL].(2008-08-15)[2012-05-18]. http:∥www.inference.phy.cam.ac.uk/mackay/codes/data.html.