This correspondence presents results of code search for convolutional codes over block-fading channels (BFCs). Search criteria are based on a union bound approach which exploits the concept of generalized transfer function (GTF) of the error trellis diagram. A new asymptotic bound is derived, and the performance of the codes found using our search criterion is compared analytically and by numerical simulation with already existing codes.
Further Results on Convolutional Code Search for Block-Fading Channels
M Chiani;A Conti;V Tralli
2004
Abstract
This correspondence presents results of code search for convolutional codes over block-fading channels (BFCs). Search criteria are based on a union bound approach which exploits the concept of generalized transfer function (GTF) of the error trellis diagram. A new asymptotic bound is derived, and the performance of the codes found using our search criterion is compared analytically and by numerical simulation with already existing codes.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
