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

Full description

Saved in:
Bibliographic Details
Published in:IEEE Globecom, 1993 Vol. ol. 2; pp. 814 - 818 vol.2
Main Authors: Cheng, Jung-Fu, Chuang, Ching-Hua, Lee, Lin-shan
Format: Conference Proceeding Journal Article
Language:English
Published: IEEE 1993
Subjects:
Amplitude shift keying
Bandwidth
Codecs
Computer simulation
Constellation diagram
Convolutional codes
Decoding
Delay
Modems
Viterbi algorithm
ISBN:9780780309173, 0780309170
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISBN:9780780309173
0780309170
DOI:10.1109/GLOCOM.1993.318193