Performance Bounds for MLSE Equalization and Decoding with Repeat Request for Fading Dispersive Channels

Hiroshi NOGAMI; Gordon L. STÜBER

Performance Bounds for MLSE Equalization and Decoding with Repeat Request for Fading Dispersive Channels

Hiroshi NOGAMI, Gordon L. STÜBER

Full Text Views

0

Share
Cite this

Summary :

Upper bounds on the bit error probability and repeat request probability, and lower bounds on the throughput are derived for a Hybrid-ARQ scheme that employs trellis-coded modulation on a fading dispersive channel. The receiver employs a modified Viterbi algorithm to perform joint maximum likelihood sequence estimation (MLSE) equalization and decoding. Retransmissions are generated by using the approach suggested by Yamamoto and Itoh. The analytical bounds are extended to trellis-coded modulation on fading dispersive channels with code combining. Comparison of the analytical bounds with simulation results shows that the analytical bounds are quite loose when diversity reception is not employed. However, no other analytical bounds exist in the literature for the trellis-coded Hybrid ARQ system studied in this paper. Therefore, the results presented in this paper can provide the basis for comparison with more sophisticated analytical bounds that may be derived in the future.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E77-A No.3 pp.553-562

Publication Date: 1994/03/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Information Theory and Coding Theory

Cite this

Copy

Hiroshi NOGAMI, Gordon L. STÜBER, "Performance Bounds for MLSE Equalization and Decoding with Repeat Request for Fading Dispersive Channels" in IEICE TRANSACTIONS on Fundamentals, vol. E77-A, no. 3, pp. 553-562, March 1994, doi: .
Abstract: Upper bounds on the bit error probability and repeat request probability, and lower bounds on the throughput are derived for a Hybrid-ARQ scheme that employs trellis-coded modulation on a fading dispersive channel. The receiver employs a modified Viterbi algorithm to perform joint maximum likelihood sequence estimation (MLSE) equalization and decoding. Retransmissions are generated by using the approach suggested by Yamamoto and Itoh. The analytical bounds are extended to trellis-coded modulation on fading dispersive channels with code combining. Comparison of the analytical bounds with simulation results shows that the analytical bounds are quite loose when diversity reception is not employed. However, no other analytical bounds exist in the literature for the trellis-coded Hybrid ARQ system studied in this paper. Therefore, the results presented in this paper can provide the basis for comparison with more sophisticated analytical bounds that may be derived in the future.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/e77-a_3_553/_p

Copy

@ARTICLE{e77-a_3_553,
author={Hiroshi NOGAMI, Gordon L. STÜBER, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Performance Bounds for MLSE Equalization and Decoding with Repeat Request for Fading Dispersive Channels},
year={1994},
volume={E77-A},
number={3},
pages={553-562},
abstract={Upper bounds on the bit error probability and repeat request probability, and lower bounds on the throughput are derived for a Hybrid-ARQ scheme that employs trellis-coded modulation on a fading dispersive channel. The receiver employs a modified Viterbi algorithm to perform joint maximum likelihood sequence estimation (MLSE) equalization and decoding. Retransmissions are generated by using the approach suggested by Yamamoto and Itoh. The analytical bounds are extended to trellis-coded modulation on fading dispersive channels with code combining. Comparison of the analytical bounds with simulation results shows that the analytical bounds are quite loose when diversity reception is not employed. However, no other analytical bounds exist in the literature for the trellis-coded Hybrid ARQ system studied in this paper. Therefore, the results presented in this paper can provide the basis for comparison with more sophisticated analytical bounds that may be derived in the future.},
keywords={},
doi={},
ISSN={},
month={March},}

Copy

TY - JOUR
TI - Performance Bounds for MLSE Equalization and Decoding with Repeat Request for Fading Dispersive Channels
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 553
EP - 562
AU - Hiroshi NOGAMI
AU - Gordon L. STÜBER
PY - 1994
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E77-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 1994
AB - Upper bounds on the bit error probability and repeat request probability, and lower bounds on the throughput are derived for a Hybrid-ARQ scheme that employs trellis-coded modulation on a fading dispersive channel. The receiver employs a modified Viterbi algorithm to perform joint maximum likelihood sequence estimation (MLSE) equalization and decoding. Retransmissions are generated by using the approach suggested by Yamamoto and Itoh. The analytical bounds are extended to trellis-coded modulation on fading dispersive channels with code combining. Comparison of the analytical bounds with simulation results shows that the analytical bounds are quite loose when diversity reception is not employed. However, no other analytical bounds exist in the literature for the trellis-coded Hybrid ARQ system studied in this paper. Therefore, the results presented in this paper can provide the basis for comparison with more sophisticated analytical bounds that may be derived in the future.
ER -