Achieving near-Capacity on Large Discrete Memoryless Channels

Details Achieving near-Capacity on Large Discrete Memoryless Channels Achieving near-Capacity on Large Discrete Memoryless Channels

2010-10-26

arxiv.org/abs/1010.5526v1

Computer Science

Information Theory

6 pages, 4 figures, 2008 International Symposium on Information Theory and its Applications (ISITA2008), Auckland, New Zealand

Scientific paper

We propose a method to increase the capacity achieved by uniform prior in discrete memoryless channels (DMC) with high input cardinality. It consists in appropriately reducing the input set. Different design criteria of the input subset are discussed. We develop an efficient algorithm to solve this problem based on the maximization of the cut-off rate. The method is applied to a mono-bit transceiver MIMO system, and it is shown that the capacity can be approached within tenths of a dB by employing standard binary codes while avoiding the use of distribution shapers.

Affiliated with

Also associated with

No associations

Rating

Achieving near-Capacity on Large Discrete 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 Achieving near-Capacity on Large Discrete Memoryless Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Achieving near-Capacity on Large Discrete Memoryless Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-484174