A comparison of SISO algorithms for iterative decoding of multidimensional product codes

In this paper, we consider iterative decoding of multidimensional product codes (MPC). Such codes, also called iterated codes, were first introduced by Elias (1954). After a formal definition of MPG, we compute their low-weight distribution. Using this distribution, we derive an improved asymptotic...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:VTC2000-Spring. 2000 IEEE 51st Vehicular Technology Conference Proceedings (Cat. No.00CH37026) Ročník 2; s. 1021 - 1025 vol.2
Hlavní autori: Berthet, A., Fang, J., Buda, F., Lemois, E., Tortelier, P.
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 2000
Predmet:
Bit error rate
Distributed computing
Error analysis
Gaussian channels
Iterative algorithms
Iterative decoding
Maximum likelihood decoding
Multidimensional systems
Product codes
Telecommunications
ISBN:9780780357181, 0780357183
ISSN:1090-3038
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, we consider iterative decoding of multidimensional product codes (MPC). Such codes, also called iterated codes, were first introduced by Elias (1954). After a formal definition of MPG, we compute their low-weight distribution. Using this distribution, we derive an improved asymptotic union bound on maximum likelihood (ML) decoding of such codes over a Gaussian channel. The main part of the paper is devoted to a comparison of efficient SISO algorithms, used as basic tools in the iterative decoding process. Simulation results show that MPC may be more suitable than any other schemes for packet wireless transmission involving packet sizes of less than 1000 information bits and requiring very low packet error rates (PER).
ISBN:9780780357181
0780357183
ISSN:1090-3038
DOI:10.1109/VETECS.2000.851279