On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes (Q3604863)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes |
scientific article |
Statements
On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes (English)
0 references
24 February 2009
0 references
coding complexity
0 references
Viterbi algorithm (VA)
0 references
convolutional code
0 references
hidden Markov model
0 references
maximum-likelihood (ML) decoding
0 references
0.8190178275108337
0 references
0.7922661900520325
0 references
0.7918544411659241
0 references
0.7781916856765747
0 references
