Performance of Viterbi Decoding on Interleaved Rician Fading Channels

摘要

In this paper, we investigate the performance of the Viterbi decodingalgorithm with/without automatic repeat request (ARQ) over a Rician flat fadingchannel with unlimited interleaving. We show that the decay rate of the averagebit error probability with respect to the bit energy to noise ratio is of orderbetween $d_f$ and $d_f+1$ at high bit energy to noise ratio for both cases(with ARQ and without ARQ), where $d_f$ is the free distance of theconvolutional code. The Yamamoto-Itoh flag helps to reduce the average biterror probability by a factor of $4^{d_f}$ with a negligible retransmissionrate. We also prove an interesting result that the average bit errorprobability decays exponentially fast with respect to the Rician factor for anyfixed bit energy per noise ratio. In addition, the error exponent with respectto the Rician factor is equal to $d_f$ at high bit energy to noise ratio.