1-2hit |
Performance of turbo codes over an impulsive noise channel is analyzed by extending an evaluation method over AWGN channels. Burst noise generation is considered with respect to the noise model by applying a hidden Markov model (HMM). A bound calculation method is derived by using a combined trellis which consists of code trellis and HMM trellis. In the simulation, an iterative decoder using the combined trellis into each component decoder is proposed. By using this method, the simulation results show the expectation of the coincidence with the calculated bounds at larger Eb/N0 for various conditions. Search results of optimum component code using proposed bound are shown.
Hiroshi NOGAMI Gordon L. STÜBER
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.