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...
Saved in:
| Main Authors: | , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2013
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/96402 http://hdl.handle.net/10220/9839 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|