A serial concatenation of an outer non-binary turbo code with different inner binary codes is introduced and an- alyzed. The turbo code is based on memory-1 time-variant recursive convolutional codes over high order fields. The resulting codes possess low rates and capacity-approaching performance, thus representing an appealing solution for spread spectrum communications. The performance of the scheme is investigated on the additive white Gaussian noise channel with coherent and noncoherent detection via density evolution analysis. The pro- posed codes compare favorably w.r.t. other low rate constructions in terms of complexity/performance trade-off. Low error floors and performances close to the sphere packing bound are achieved down to small block sizes (k = 192 information bits).
G. Liva, B. Matuz, E. Paolini, M. Chiani (2012). Short Low-Rate Non-Binary Turbo Codes. PISCATAWAY, NJ : IEEE [10.1109/ISTC.2012.6325195].
Short Low-Rate Non-Binary Turbo Codes
PAOLINI, ENRICO;CHIANI, MARCO
2012
Abstract
A serial concatenation of an outer non-binary turbo code with different inner binary codes is introduced and an- alyzed. The turbo code is based on memory-1 time-variant recursive convolutional codes over high order fields. The resulting codes possess low rates and capacity-approaching performance, thus representing an appealing solution for spread spectrum communications. The performance of the scheme is investigated on the additive white Gaussian noise channel with coherent and noncoherent detection via density evolution analysis. The pro- posed codes compare favorably w.r.t. other low rate constructions in terms of complexity/performance trade-off. Low error floors and performances close to the sphere packing bound are achieved down to small block sizes (k = 192 information bits).I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.