Title :
Universal sequential decoding
Author :
Lapidoth, Amos ; Ziv, Jacob
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., MIT, Cambridge, MA, USA
Abstract :
An algorithm is proposed for universal decoding of convolutional/trellis codes employed over unknown channels. On discrete memoryless channels and at rates below the computational cut-off rate (corresponding to a uniform input distribution), the algorithm achieves an asymptotic complexity-vs.-performance tradeoff similar to the tradeoff achieved by the Viterbi (1979) algorithm, but with the benefit that the algorithm´s implementation does not require knowledge of the channel law. The algorithm is also applicable to finite-state channels and to other families
Keywords :
computational complexity; convolutional codes; memoryless systems; sequential decoding; telecommunication channels; trellis codes; BER; Viterbi algorithm; asymptotic complexity; bit error rate; computational cut-off rate; convolutional codes; discrete memoryless channels; finite-state channels; intersymbol interference memory; performance tradeoff; trellis codes; uniform input distribution; universal sequential decoding; Buffer storage; Career development; Convolutional codes; Distributed computing; Engineering profession; Intersymbol interference; Jacobian matrices; Maximum likelihood decoding; Memoryless systems; Viterbi algorithm;
Conference_Titel :
Information Theory Workshop, 1998
Conference_Location :
Killarney
Print_ISBN :
0-7803-4408-1
DOI :
10.1109/ITW.1998.706427
