Complexity-reduced multilevel coding with rate-compatible punctured convolutional codes

A new coding design with large coding gains and complexity-reduced decoders is proposed. The coding strategy is based on a multilevel coding construction with rate-compatible punctured convolutional codes as building blocks. A new sub-optimal decoding is proposed where only one decoder using Viterbi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE Globecom, 1993 Jg. ol. 2; S. 814 - 818 vol.2
Hauptverfasser: Cheng, Jung-Fu, Chuang, Ching-Hua, Lee, Lin-shan
Format: Tagungsbericht Journal Article
Sprache:Englisch
Veröffentlicht: IEEE 1993
Schlagworte:
Amplitude shift keying
Bandwidth
Codecs
Computer simulation
Constellation diagram
Convolutional codes
Decoding
Delay
Modems
Viterbi algorithm
ISBN:9780780309173, 0780309170
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A new coding design with large coding gains and complexity-reduced decoders is proposed. The coding strategy is based on a multilevel coding construction with rate-compatible punctured convolutional codes as building blocks. A new sub-optimal decoding is proposed where only one decoder using Viterbi algorithm is drafted. Typical example codes for quadrature amplitude shift keying (QASK) constellations an constructed and shown to outperform Ungerboeck's codes, but with higher decoding delay. Computer simulation is also performed to verify the results.< >
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISBN:9780780309173
0780309170
DOI:10.1109/GLOCOM.1993.318193