Parallel Bit Interleaved Coded Modulation

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

19 pages, 15 figures. A shorter version will be presented at the 48th Allerton Conference on Communication, Control, and Compu

Scientific paper

A new variant of bit interleaved coded modulation (BICM) is proposed. In the new scheme, called Parallel BICM, L identical binary codes are used in parallel using a mapper, a newly proposed finite-length interleaver and a binary dither signal. As opposed to previous approaches, the scheme does not rely on any assumptions of an ideal, infinite-length interleaver. Over a memoryless channel, the new scheme is proven to be equivalent to a binary memoryless channel. Therefore the scheme enables one to easily design coded modulation schemes using a simple binary code that was designed for that binary channel. The overall performance of the coded modulation scheme is analytically evaluated based on the performance of the binary code over the binary channel. The new scheme is analyzed from an information theoretic viewpoint, where the capacity, error exponent and channel dispersion are considered. The capacity of the scheme is identical to the BICM capacity. The error exponent of the scheme is numerically compared to a recently proposed mismatched-decoding exponent analysis of BICM.

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

Parallel Bit Interleaved Coded Modulation 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 Parallel Bit Interleaved Coded Modulation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel Bit Interleaved Coded Modulation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-103266

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