Soft-in/soft-out Viterbi algorithm (SOVA) originally proposed for rate 1/n code is applied to rate m/(m+1) trellis-coded modulation (TCM). In TCM, 2m branches merge into a node in a code trellis. After pruning the branches on path with less path-metric until two best paths remain, SOVA is applied to the pruned trellis. Based on the pruned trellis, an iterative decoding algorithm of turbo TCM is developed. Effects of path memory length and scaling of a value transferred between decoding stages are investigated through simulation. Turbo TCM over 8 PSK and 16 QAM channel with Gaussian noise realize a bit error rate (BER) of 10-5 within 1 dB from the Shannon limit.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Tadashi MINOWA, Haruo OGIWARA, "Application of Soft-In/Soft-Out Viterbi Algorithm to Turbo Trellis-Coded Modulation" in IEICE TRANSACTIONS on Fundamentals,
vol. E81-A, no. 10, pp. 2047-2054, October 1998, doi: .
Abstract: Soft-in/soft-out Viterbi algorithm (SOVA) originally proposed for rate 1/n code is applied to rate m/(m+1) trellis-coded modulation (TCM). In TCM, 2m branches merge into a node in a code trellis. After pruning the branches on path with less path-metric until two best paths remain, SOVA is applied to the pruned trellis. Based on the pruned trellis, an iterative decoding algorithm of turbo TCM is developed. Effects of path memory length and scaling of a value transferred between decoding stages are investigated through simulation. Turbo TCM over 8 PSK and 16 QAM channel with Gaussian noise realize a bit error rate (BER) of 10-5 within 1 dB from the Shannon limit.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e81-a_10_2047/_p
Copy
@ARTICLE{e81-a_10_2047,
author={Tadashi MINOWA, Haruo OGIWARA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Application of Soft-In/Soft-Out Viterbi Algorithm to Turbo Trellis-Coded Modulation},
year={1998},
volume={E81-A},
number={10},
pages={2047-2054},
abstract={Soft-in/soft-out Viterbi algorithm (SOVA) originally proposed for rate 1/n code is applied to rate m/(m+1) trellis-coded modulation (TCM). In TCM, 2m branches merge into a node in a code trellis. After pruning the branches on path with less path-metric until two best paths remain, SOVA is applied to the pruned trellis. Based on the pruned trellis, an iterative decoding algorithm of turbo TCM is developed. Effects of path memory length and scaling of a value transferred between decoding stages are investigated through simulation. Turbo TCM over 8 PSK and 16 QAM channel with Gaussian noise realize a bit error rate (BER) of 10-5 within 1 dB from the Shannon limit.},
keywords={},
doi={},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Application of Soft-In/Soft-Out Viterbi Algorithm to Turbo Trellis-Coded Modulation
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2047
EP - 2054
AU - Tadashi MINOWA
AU - Haruo OGIWARA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 1998
AB - Soft-in/soft-out Viterbi algorithm (SOVA) originally proposed for rate 1/n code is applied to rate m/(m+1) trellis-coded modulation (TCM). In TCM, 2m branches merge into a node in a code trellis. After pruning the branches on path with less path-metric until two best paths remain, SOVA is applied to the pruned trellis. Based on the pruned trellis, an iterative decoding algorithm of turbo TCM is developed. Effects of path memory length and scaling of a value transferred between decoding stages are investigated through simulation. Turbo TCM over 8 PSK and 16 QAM channel with Gaussian noise realize a bit error rate (BER) of 10-5 within 1 dB from the Shannon limit.
ER -