Abstract: 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 im...
0 Replies
Loading
OpenReview is a long-term project to advance science through improved peer review with legal nonprofit status. We gratefully acknowledge the support of the OpenReview Sponsors. © 2026 OpenReview