On viterbi-like algorithms and their application to Reed–Muller codes
For a Viterbi-like algorithm over a sectionalized trellis of a linear block code, the decoding procedure consists of three parts: computingthe metrics of the edges, selectingthe survivor edge between each pair of adjacent vertices and determining the survivor path from the origin to each vertex. In...
| Principais autores: | , |
|---|---|
| Outros Autores: | |
| Formato: | Journal Article |
| Idioma: | English |
| Publicado em: |
2013
|
| Assuntos: | |
| Acesso em linha: | https://hdl.handle.net/10356/96402 http://hdl.handle.net/10220/9839 |