Further results on convolutional code search for block-fading channels

Further results on convolutional code search for block-fading channels

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 th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 2004-06, Vol.50 (6), p.1312-1318
Hauptverfasser: Chiani, M., Conti, A., Tralli, V.
Format: Artikel
Sprache:eng
Schlagworte:
Asymptotic properties
Blocking
Channels
Codes
Computer simulation
Convolutional codes
Criteria
Fading
Filtering theory
Information systems
Interleaved codes
Mathematical analysis
Mobile communication
Numerical simulation
Performance analysis
Searching
Tail
Transfer functions
Unions
Wireless communication
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2004.828146