Publication
Faster Decoding of rank metric convolutional codes
| Summary: | A new construction of maximum rank distance systematic rank metric convolutional codes is presented, which permits to reduce the computational complexity of the decoding procedure, i.e., of the underlying Viterbi algorithm. This result is achieved by lowering the number of branch metrics to be calculated and by setting to the highest value the metric of the remaining edges in the trellis. |
|---|---|
| Main Authors: | Napp, Diego |
| Other Authors: | Pinto, Raquel; Rosenthal, Joachim; Vettori, Paolo |
| Subject: | Convolutional codes Rank metric |
| Year: | 2018 |
| Country: | Portugal |
| Document type: | conference output |
| Access type: | open access |
| Associated institution: | Universidade de Aveiro |
| Language: | English |
| Origin: | RIA - Repositório Institucional da Universidade de Aveiro |
| Summary: | A new construction of maximum rank distance systematic rank metric convolutional codes is presented, which permits to reduce the computational complexity of the decoding procedure, i.e., of the underlying Viterbi algorithm. This result is achieved by lowering the number of branch metrics to be calculated and by setting to the highest value the metric of the remaining edges in the trellis. |
|---|
Funded activities
No funded projects found.