An iterative decoding algorithm for rate-compatible punctured low-density parity-check codes of high coding rates

An iterative decoding algorithm of rate-compatible punctured low-density parity-check (RCP-LDPC) codes of high coding rates is developed. This algorithm performs a predetermined recovering process of punctured bits sums at the beginning of each iteration of the standard belief-propagation (BP) decod...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2010 International Symposium on Information Theory and Its Applications s. 394 - 399
Hlavní autoři: Hosoya, Gou, Yagi, Hideki, Kobayashi, Manabu
Médium: Konferenční příspěvek
Jazyk:angličtina
japonština
Vydáno: IEEE 01.10.2010
Témata:
Algorithm design and analysis
Channel coding
Complexity theory
Decoding
Iterative decoding
ISBN:9781424460168, 1424460166
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!
Popis
Shrnutí:An iterative decoding algorithm of rate-compatible punctured low-density parity-check (RCP-LDPC) codes of high coding rates is developed. This algorithm performs a predetermined recovering process of punctured bits sums at the beginning of each iteration of the standard belief-propagation (BP) decoding algorithm. By propagating messages of two punctured bits sum, this algorithm can recover much more punctured bits than the standard BP decoding algorithm. It is shown that the proposed algorithm is applicable for RCP-LDPC codes of higher coding rates with little increase of decoding complexity.
ISBN:9781424460168
1424460166
DOI:10.1109/ISITA.2010.5649247