This paper presents the results of the search for optimum punctured recursive convolutional codes (RCCs) of rate + 1, for = 2 . . . 8, suitable for concatenated channel codes whose constituent encoders are recursive, systematic convolutional codes. The mother codes that are punctured are rate-1/2 RCCs proposed for use in parallel and/or serial concatenation schemes. Extensive tables of systematic and nonsystematic puncturing patterns, optimized relative to various objective functions suitable for concatenated channel codes, are presented for several mother codes.
High Rate Recursive Convolutional Codes for Concatenated Channel Codes / Laddomada, Massimiliano; Mondin, Marina. - In: IEEE TRANSACTIONS ON COMMUNICATIONS. - ISSN 0090-6778. - STAMPA. - 52:11(2004), pp. 1846-1850. [10.1109/TCOMM.2004.836590]
High Rate Recursive Convolutional Codes for Concatenated Channel Codes
LADDOMADA, Massimiliano;MONDIN, Marina
2004
Abstract
This paper presents the results of the search for optimum punctured recursive convolutional codes (RCCs) of rate + 1, for = 2 . . . 8, suitable for concatenated channel codes whose constituent encoders are recursive, systematic convolutional codes. The mother codes that are punctured are rate-1/2 RCCs proposed for use in parallel and/or serial concatenation schemes. Extensive tables of systematic and nonsystematic puncturing patterns, optimized relative to various objective functions suitable for concatenated channel codes, are presented for several mother codes.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/1506780
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo