CaltechAUTHORS
Published June 1994 | Version Published
Book Section - Chapter Open

The Viterbi decoding complexity of linear block codes

Creators

  • 1. ROR icon California Institute of Technology

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.

Additional Information

© 1994 IEEE. Date of Current Version: 06 August 2002. This work was partially supported by AFOSR grant no. F49620-94-1-005, and by a grant from Pacific Bell. A portion of the work was also done at the Jet Propulsion Laboratory, California Institute of Technology, under contract to the National Aeronautics and Space Administration.

Attached Files

Published - MCEisit94.pdf

Files

MCEisit94.pdf

Files (118.7 kB)

Name Size
md5:5f1f1ab0aba848b287dc4439976830c8
118.7 kB Preview Download

Additional details

Identifiers

Eprint ID
29384
Resolver ID
CaltechAUTHORS:20120221-092955129

Funding

Air Force Office of Scientific Research (AFOSR)
F49620-94-1-005
Pacific Bell
JPL/Caltech/NASA

Dates

Created
2012-02-21
Created from EPrint's datestamp field
Updated
2021-11-09
Created from EPrint's last_modified field