CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Successive cancellation decoding of single parity-check product codes

Mustafa Cemil Coskun ; Gianluigi Liva ; Alexandre Graell i Amat (Institutionen för elektroteknik) ; Michael Lentmaier
IEEE International Symposium on Information Theory (ISIT) p. 1763-1767. (2017)
[Konferensbidrag, refereegranskat]

Abstract: We introduce successive cancellation (SC) decoding of product codes (PCs) with single parity-check (SPC) component codes. Recursive formulas are derived, which resemble the SC decoding algorithm of polar codes. We analyze the error probability of SPC-PCs over the binary erasure channel under SC decoding. A bridge with the analysis of PCs introduced by Elias in 1954 is also established. Furthermore, bounds on the block error probability under SC decoding are provided, and compared to the bounds under the original decoding algorithm proposed by Elias. It is shown that SC decoding of SPC-PCs achieves a lower block error probability than Elias' decoding.



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2017-09-29. Senast ändrad 2017-09-29.
CPL Pubid: 252119

 

Läs direkt!

Lokal fulltext (fritt tillgänglig)