Buffer control for variable complexity Fano decoders
Fano sequential decoders are variable complexity convolutional decoders, which have the desirable property of operating with very low computation at high SNR. In portable mobile communications, it is often desirable to trade BER with decoder complexity/power consumption. However, the variable comple...
Uloženo v:
| Vydáno v: | 2001 IEEE Global Telecommunications Conference - Globecom Ročník 1; s. 176 - 180 vol.1 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
2001
|
| Témata: | |
| ISBN: | 0780372069, 9780780372061 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | Fano sequential decoders are variable complexity convolutional decoders, which have the desirable property of operating with very low computation at high SNR. In portable mobile communications, it is often desirable to trade BER with decoder complexity/power consumption. However, the variable complexity nature of the Fano algorithm means that buffers are required for the Fano decoder due to large variations in processing delays. In this paper, we formulate the buffer control problem as one that seeks to minimize the overall probability of block loss, subject to a finite buffer size constraint. The overall probability of block loss is comprised of two terms, corresponding to loss due to excessive bit errors and decoder buffer overflow, respectively. This leads to an interesting trade-off, as faster decoding often means higher bit error rate. Based on the joint distribution of decoding complexity and BER, at each decoding stage, we find an optimal Fano decoder parameter (/spl Delta/) to minimize block loss. In addition, we propose a simple real-time table lookup algorithm that implements the /spl Delta/ control policy. Simulation results demonstrate the superior performance of the proposed algorithm. |
|---|---|
| ISBN: | 0780372069 9780780372061 |
| DOI: | 10.1109/GLOCOM.2001.965102 |

