This paper introduces an efficient modification to one of the most successful complexity reduction techniques of the Viterbi decoding algorithm; the adaptive Viterbi algorithm. Although the use of the adaptive algorithm made it practically visible to use convolutional codes with large constraint lengths, the decoding complexity reduction at lower signal-to-noise ratios is not as good as that at higher signal-to-noise ratios. In this work we have modified the elimination rule for the adaptive Viterbi algorithm based on minimum free distance threshold. The proposed algorithm can preserve the same error performance as the adaptive Viterbi algorithm while requiring a substantially smaller average number of computations at wider range of signal-to-noise ratios.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Modified adaptive Viterbi algorithm for convolutional codes decoding


    Contributors:
    Mahran, Ashraf (author) / Samy, Ramy (author)


    Publication date :

    2017-03-01


    Size :

    378287 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    A circular Viterbi algorithm for decoding tailbiting convolutional codes

    Cox,R.V. / Sindberg,C.E. / AT and T Bell Labs.,US | Automotive engineering | 1993


    Software Method to Implement Convolutional Code and Its Viterbi Decoding Algorithm

    Chaoying, X. / Guoan, Y. / Yongguang, S. | British Library Online Contents | 2003


    Simulation results for the Viterbi decoding algorithm

    Batson, Bartus H. / Moorehead, Robert W. / Taqvi, S. Zafar H. | TIBKAT | 1972