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

スポンサーリンク

概要

• 論文の詳細を見る

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

• 社団法人電子情報通信学会の論文
• 1994-03-25

著者

• Stuber Gordon

  School Of Electrical And Computer Engineering Georgia Institute Of Technology

• Nogami H

  Hitachi Ltd. Yokohama‐shi Jpn

• Nogami Hiroshi

  Image & Media System Laboratory, Hitachi, Ltd.

• Stueber G

  Georgia Inst. Technol. Georgia Usa

• Nogami Hiroshi

  Image & Media System Laboratory Hitachi Ltd.

関連論文

• Performance Bounds for MLSE Equalization and Decoding with Repeat Request for Fading Dispersive Channels
• Design of phase Shifters for a Group Type Unidirectional Transducer : SAW and Communication Devices
• New Error Probability Upper Bound on Maximum Likelihood Sequence Estimation for Intersymbol Interference Channels

スポンサーリンク