Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes

preview-18
  • Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes Book Detail

  • Author : Shu Lin
  • Release Date : 2012-12-06
  • Publisher : Springer Science & Business Media
  • Genre : Technology & Engineering
  • Pages : 290
  • ISBN 13 : 1461557453
  • File Size : 23,23 MB

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes by Shu Lin PDF Summary

Book Description: As the demand for data reliability increases, coding for error control becomes increasingly important in data transmission systems and has become an integral part of almost all data communication system designs. In recent years, various trellis-based soft-decoding algorithms for linear block codes have been devised. New ideas developed in the study of trellis structure of block codes can be used for improving decoding and analyzing the trellis complexity of convolutional codes. These recent developments provide practicing communication engineers with more choices when designing error control systems. Trellises and Trellis-based Decoding Algorithms for Linear Block Codes combines trellises and trellis-based decoding algorithms for linear codes together in a simple and unified form. The approach is to explain the material in an easily understood manner with minimal mathematical rigor. Trellises and Trellis-based Decoding Algorithms for Linear Block Codes is intended for practicing communication engineers who want to have a fast grasp and understanding of the subject. Only material considered essential and useful for practical applications is included. This book can also be used as a text for advanced courses on the subject.

Disclaimer: www.yourbookbest.com does not own Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes books pdf, neither created or scanned. We just provide the link that is already available on the internet, public domain and in Google Drive. If any way it violates the law or has any issues, then kindly mail us via contact us page to request the removal of the link.