A modified Viterbi decoding algorithm for high-rate convolutional codes

It is well‐known that the computational complexity of the Viterbi decoding algorithm for an (n,k,ν) convolutional code grows exponentially with k and the code memory ν, and thus it becomes quickly impractical as the code rate increases. A solution, so far, has been to use punctured convolutional cod...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European transactions on telecommunications Ročník 16; číslo 6; s. 527 - 536
Hlavní autoři: Amat, Alexandre Graell i, Benedetto, Sergio, Siegel, Paul H.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Chichester, UK John Wiley & Sons, Ltd 01.11.2005
Wiley
Témata:
Applied sciences
Coding, codes
Exact sciences and technology
Information, signal and communications theory
Signal and communications theory
Telecommunications and information theory
Signal processing
Convolutional code
Algorithm
Viterbi decoding
ISSN:1124-318X, 1541-8251
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!
Popis
Shrnutí:It is well‐known that the computational complexity of the Viterbi decoding algorithm for an (n,k,ν) convolutional code grows exponentially with k and the code memory ν, and thus it becomes quickly impractical as the code rate increases. A solution, so far, has been to use punctured convolutional codes, which strongly reduces the decoding complexity but leads to a slightly worse performance. Recently, it has been pointed out that every non‐punctured high‐rate convolutional code (with 2k > 2ν) can be viewed as the concatenation of a block code and a simpler convolutional code. In this paper, we exploit this property of high‐rate codes to facilitate the implementation of the Viterbi algorithm. We propose a modification of the Viterbi decoding algorithm for non‐punctured high‐rate convolutional codes which results in very significant computational savings. Copyright © 2005 AEIT.
Bibliografie:ArticleID:ETT1074
MEC (under JdC contract)
ark:/67375/WNG-V99B3CF9-C
istex:43A0FF7462480CC09BEFB70BB9765132539F7BBF
ISSN:1124-318X
1541-8251
DOI:10.1002/ett.1074