Cover Image

Joint source channel coding using arithmetic codes

Based on the encoding process, arithmetic codes can be viewed as tree codes and current proposals for decoding arithmetic codes with forbidden symbols belong to sequential decoding algorithms and their variants. In this monograph, we propose a new way of looking at arithmetic codes with forbidden sy...

Full description

Bibliographic Details
Main Author: Bi, Dongsheng.
Other Authors: Hoffman, Michael W., Sayood, Khalid.
Format: Electronic
Language:English
Published: San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : Morgan & Claypool Publishers, c2010.
Series:Synthesis lectures on communications (Online), # 4.
Subjects:
Coding theory.
Error-correcting codes (Information theory)
Online Access:Abstract with links to full text
Table of Contents:
  • 1. Introduction
  • Introduction
  • Joint source and channel coding schemes
  • Joint source and channel coding with arithmetic codes
  • 2. Arithmetic codes
  • Encoding and decoding processes
  • Integer implementation of encoding and decoding with renormalization
  • Encoding with integer arithmetic
  • Decoding with integer arithmetic
  • Overflow and underflow problems
  • Optimality of arithmetic coding
  • Arithmetic codes are prefix codes
  • Efficiency
  • Efficiency of the integer implementation
  • 3. Arithmetic codes with forbidden symbols
  • Error detection and correction using arithmetic codes
  • Reserved probability space and code rate
  • Error detection capability
  • Error correction with arithmetic codes
  • Viewing arithmetic codes as fixed trellis codes
  • Encoding
  • Decoding
  • Simulations with an iid source
  • Simulations with Markov sources
  • Comparing scenario (a) and (b)
  • Comparing scenario (b) and (c)
  • 4. Distance property and code construction
  • Distance property of arithmetic codes
  • Bound on error events
  • Using the bound to get estimate of error probability
  • Determining the multiplicity Am,l
  • Verification
  • Complexity factors and freedom in the code design
  • Complexity factors
  • Freedom in the code design
  • Arithmetic codes with input memory
  • Memory one arithmetic codes with forbidden symbols
  • Memory two arithmetic codes with forbidden symbols
  • Memory three arithmetic codes with forbidden symbols
  • 5. Conclusion
  • Bibliography.

Similar Items