An Efficient Algorithm to Calculate BICM Capacity


G. Böcherer, F. Altenbach, A. Alvarado, S. Corroy, R. Mathar,


        Bit-interleaved coded modulation (BICM) is a practical approach for reliable communication over the AWGN channel in the bandwidth limited regime. For a signal point constellation with 2^m points, BICM labels the signal points with bit strings of length m and then treats these m bits separately both at the transmitter and the receiver. BICM capacity is defined as the maximum of a certain achievable rate. Maximation has to be done over the probability mass functions (pmf) of the bits. This is a non-convex optimization problem. So far, the optimal bit pmfs were determined via exhaustive search, which is of exponential complexity in m. In this work, an algorithm called bit-alternating convex concave method (BACM) is developed. This algorithm calculates BICM capacity with a complexity that scales approximately as m³. The algorithm iteratively applies convex optimization techniques. BACM is used to calculate BICM capacity of 4, 8, 16, 32, and 64-PAM in AWGN.
For PAM constellations with more than 8 points, the presented values are the first results known in the literature.

BibTEX Reference Entry 

	author = {Georg B{\"o}cherer and Fabian Altenbach and Alex Alvarado and Steven Corroy and Rudolf Mathar},
	title = "An Efficient Algorithm to Calculate {BICM} Capacity",
	pages = "314-318",
	booktitle = "International Symposium on Information Theory (ISIT 2012)",
	address = {Cambridge, USA},
	month = Jul,
	year = 2012,
	hsb = hsb999910270304 ,


 Download paper  Download bibtex-file

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights there in are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.