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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IET communications Ročník 7; číslo 1; s. 65 - 70
Hlavní autoři:	Hareedy, Ahmed H, Khairy, Mohamed M
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Stevenage The Institution of Engineering and Technology 01.01.2013 John Wiley & Sons, Inc
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!