DocumentCode
2618694
Title
The Viterbi decoding complexity of linear block codes
Author
Mceliece, Robert J.
Author_Institution
California Inst. of Technol., Pasadena, CA, USA
fYear
1994
fDate
27 Jun-1 Jul 1994
Firstpage
341
Abstract
A given linear block code can be represented by many different trellises. In this paper, we will show that if these trellises are scored according to the complexity of implementing the Viterbi decoding algorithm on them, there is a uniquely optimal one, viz. The “Wolf (1978)-Massey (1978)-Muder (1988)” trellis. We will also introduce “minimal-span” generator matrices, which permit easy construction of WMM trellises
Keywords
Viterbi decoding; block codes; computational complexity; linear codes; matrix algebra; trellis codes; Viterbi decoding complexity; Wolf-Massey-Muder trellis; linear block codes; minimal-span generator matrices; trellis decoding; Block codes; Contracts; Decoding; IEL; Joining processes; Linear code; Propulsion; Viterbi algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location
Trondheim
Print_ISBN
0-7803-2015-8
Type
conf
DOI
10.1109/ISIT.1994.394677
Filename
394677
Link To Document