|
Problemy Peredachi Informatsii, 1987, Volume 23, Issue 4, Pages 35–40
(Mi ppi828)
|
|
|
|
Information Theory and Coding Theory
Optimal Decoding of Convolutional Codes in Channels with Additive Markov Noise
V. I. Korzhik, Yu. P. Lopato
Abstract:
We formulate the conditions when the maximum of a certain function can be found by a generalized Viterbi algorithm (GVA). We prove that GVA can be used for optimal decoding of convolutional codes in channels with additive Markov noise. The complexity of the algorithm is estimated. Some simulation results supporting the efficiency of GVA are presented.
Received: 05.08.1985
Citation:
V. I. Korzhik, Yu. P. Lopato, “Optimal Decoding of Convolutional Codes in Channels with Additive Markov Noise”, Probl. Peredachi Inf., 23:4 (1987), 35–40; Problems Inform. Transmission, 23:4 (1987), 276–280
Linking options:
https://www.mathnet.ru/eng/ppi828 https://www.mathnet.ru/eng/ppi/v23/i4/p35
|
Statistics & downloads: |
Abstract page: | 299 | Full-text PDF : | 176 | First page: | 1 |
|