Near Optimal Decoding for TCM Using the BIVA and Trellis Shaping

Authors:
Qi Wang;Lei Wei;Rodney A. Kennedy
Affiliations:
-;-;-
Venue:
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Year:
1999

Citing 3
Cited 0

Introduction to Trellis-Coded Modulation with Applications

Introduction to Trellis-Coded Modulation with Applications
Sequential decoding with trellis shaping

IEEE Transactions on Information Theory - Part 2
Near-optimal limited-search detection on ISI/CDMA channels and decoding of long convolutional codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a bootstrap iterative decoding technique concatenated with the Viterbi algorithm (BIVA) and trellis shaping for trellis-coded modulation (TCM) is proposed. The concept of a bootstrap decoding is introduced first and then the new metric functions which take into account the bootstrap iterative decoding algorithm for TCM systems are derived. One and two dimensional bootstrap decoding are proposed for packet transmission. Furthermore, the trellis shaping technique is also considered to combine with such TCM schemes using the BIVA. The simulation results show that the performance of 1.25 dB away from Shannon limit can be achieved by the BIVA and trellis shaping for 256-state 6 bits/T TCM scheme, with low complexity and reasonable computation.