Selective max-min algorithm for low-density parity-check decoding

With the growing importance of error correction in different communication systems, using an efficient and easily implementable code is always appreciated. One of the most important codes is the low-density parity-check (LDPC) code. Two main iterative decoding algorithms are usually used, namely the...

Full description

Saved in:

Bibliographic Details
Published in:	IET communications Vol. 7; no. 1; pp. 65 - 70
Main Authors:	Hareedy, Ahmed H, Khairy, Mohamed M
Format:	Journal Article
Language:	English
Published:	Stevenage The Institution of Engineering and Technology 01.01.2013 John Wiley & Sons, Inc
Subjects:	Algorithms Communication systems Complexity Decoding error correction code error correction codes Expenses Handles iterative decoding iterative decoding algorithm LDPC code low density parity check matrix algebra min‐sum algorithm MS algorithm Parity parity check codes parity check matrix Performance degradation selective max‐min algorithm SMM SP algorithm sum‐product algorithm iterative decoding algorithm sum-product algorithm error correction codes SP algorithm selective max-min algorithm parity check codes MS algorithm parity check matrix min-sum algorithm error correction code low density parity check matrix algebra SMM iterative decoding LDPC code
ISSN:	1751-8628, 1751-8636
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!