Optimal Power/Rate Allocation and Code Selection for Iterative Joint Detection of Coded Random CDMA

• Authors: C. Schlegel;Zhenning Shi;M. Burnashev
• Venue: IEEE Transactions on Information Theory
• Year: 2006

Iterative interference cancellation of coded code-division multiple access (CDMA) using random spreading with linear cancellation is analyzed. If users are grouped into power classes and Shannon bound approaching codes are used, a geometric power distribution achieves the additive white Gaussian noise (AWGN) channel Shannon bound as the numbers of classes becomes large. The optimal distribution of the size of these classes is shown to be uniform. If users are grouped into different rate classes with equal powers among equal rate users, the Shannon bound for AWGN channels can be achieved with an arbitrary distribution of the classes sizes, provided that the size of the largest rate class obeys the mild condition that its ratio of size to processing gain is much smaller than the inverse of the signal-to-noise ratio (SNR). The case of equal powers and equal rates among all users is addressed as a "worst case" scenario. It is argued that simple repetition codes provide for a larger achievable capacity than stronger codes. It is shown that this capacity monotonically increases as the rate of the code decreases. A density evolution analysis is used to show that the achievable rates exceed those of a minimum-mean square error filter applied to the uncoded signals. This lower bound is tight for small ratios of bit energy to noise power, and otherwise the iterative cancellation receiver provides an appreciably larger capacity. Relating to recent result from the application of statistical mechanics it is shown that the repetition-coded system with iterative cancellation achieves the performance of an equivalent optimal joint detector for uncoded transmission