An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Submitted to the IEEE Transactions on Information Theory (40 pages, 10 figures)

Scientific paper

This paper derives an improved sphere-packing (ISP) bound for finite-length codes whose transmission takes place over symmetric memoryless channels. We first review classical results, i.e., the 1959 sphere-packing (SP59) bound of Shannon for the Gaussian channel, and the 1967 sphere-packing (SP67) bound of Shannon et al. for discrete memoryless channels. A recent improvement on the SP67 bound, as suggested by Valembois and Fossorier, is also discussed. These concepts are used for the derivation of a new lower bound on the decoding error probability (referred to as the ISP bound) which is uniformly tighter than the SP67 bound and its recent improved version. The ISP bound is applicable to symmetric memoryless channels, and some of its applications are exemplified. Its tightness is studied by comparing it with bounds on the ML decoding error probability, and computer simulations of iteratively decoded turbo-like codes. The paper also presents a technique which performs the entire calculation of the SP59 bound in the logarithmic domain, thus facilitating the exact calculation of this bound for moderate to large block lengths without the need for the asymptotic approximations provided by Shannon.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-247502

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.