Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes - Info and Reading Options

Google Books:

Decoding algorithms based on the trellis representation of a code (block or convolutional) drastically reduce decoding complexity. The best known and most commonly used trellis-based decoding algorithm is the Viterbi algorithm. It is a maximum likelihood decoding algorithm. Convolutional codes with the Viterbi decoding have been widely used for error control in digital communications over the last two decades. This chapter is concerned with the application of the Viterbi decoding algorithm to linear block codes. First, the Viterbi algorithm is presented. Then, optimum sectionalization of a trellis to minimize the computational complexity of a Viterbi decoder is discussed and an algorithm is presented. Some design issues for IC (integrated circuit) implementation of a Viterbi decoder are considered and discussed. Finally, a new decoding algorithm based on the principle of compare-select-add is presented. This new algorithm can be applied to both block and convolutional codes and is more efficient than the conventional Viterbi algorithm based on the add-compare-select principle. This algorithm is particularly efficient for rate 1/n antipodal convolutional codes and their high-rate punctured codes. It reduces computational complexity by one-third compared with the Viterbi algorithm. Lin, Shu Goddard Space Flight Center NAG5-931; NAG5-2938...

Search for “Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes” downloads:

Visit our Downloads Search page to see if downloads are available.

Find “Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes” in Libraries Near You:

Read or borrow “Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes” from your local library.

• The WorldCat Libraries Catalog: Find a copy of “Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes” at a library near you.