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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE Globecom, 1993 Ročník ol. 2; s. 814 - 818 vol.2
Hlavní autoři: Cheng, Jung-Fu, Chuang, Ching-Hua, Lee, Lin-shan
Médium: Konferenční příspěvek Journal Article
Jazyk:angličtina
Vydáno: IEEE 1993
Témata:
Amplitude shift keying
Bandwidth
Codecs
Computer simulation
Constellation diagram
Convolutional codes
Decoding
Delay
Modems
Viterbi algorithm
ISBN:9780780309173, 0780309170
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.< >
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISBN:9780780309173
0780309170
DOI:10.1109/GLOCOM.1993.318193