ETRI Journal
- 제28권3호
- /
- Pages.301-310
- /
- 2006
- /
- 1225-6463(pISSN)
- /
- 2233-7326(eISSN)
Fano Decoding with Timeout: Queuing Analysis
- Pan, W. David (Department of Electrical and Computer Engineering, University of Alabama in Huntsville) ;
- Yoo, Seong-Moo (Department of Electrical and Computer Engineering, University of Alabama in Huntsville)
- 투고 : 2005.05.17
- 발행 : 2006.06.30
초록
In mobile communications, a class of variable-complexity algorithms for convolutional decoding known as sequential decoding algorithms is of interest since they have a computational time that could vary with changing channel conditions. The Fano algorithm is one well-known version of a sequential decoding algorithm. Since the decoding time of a Fano decoder follows the Pareto distribution, which is a heavy-tailed distribution parameterized by the channel signal-to-noise ratio (SNR), buffers are required to absorb the variable decoding delays of Fano decoders. Furthermore, since the decoding time drawn by a certain Pareto distribution can become unbounded, a maximum limit is often employed by a practical decoder to limit the worst-case decoding time. In this paper, we investigate the relations between buffer occupancy, decoding time, and channel conditions in a system where the Fano decoder is not allowed to run with unbounded decoding time. A timeout limit is thus imposed so that the decoding will be terminated if the decoding time reaches the limit. We use discrete-time semi-Markov models to describe such a Fano decoding system with timeout limits. Our queuing analysis provides expressions characterizing the average buffer occupancy as a function of channel conditions and timeout limits. Both numerical and simulation results are provided to validate the analytical results.