Two-stage detection of partitioned random CDMA

• Published in: European transactions on telecommunications Vol. 19; no. 5; pp. 499 - 509
• Main Authors: Krzymien, Lukasz, Truhachev, Dmitri, Schlegel, Christian, Burnashev, Marat
• Format: Journal Article
• Language: English
• Published: Chichester, UK John Wiley & Sons, Ltd 01.08.2008
• ISSN: 1124-318X; 1541-8251
• DOI: 10.1002/ett.1269

Random Code Division Multiple Access (CDMA) with low complexity two‐stage joint detection/decoding is considered. A sequence partitioning approach is used for modulation, where every spreading sequence is divided into M sections (partitions) which are interleaved prior to transmission. This setup, called partitioned CDMA, can be understood as a generalisation of (chip) interleave division multiple access (IDMA). An analysis of a low‐complexity iterative cancellation receiver is presented for arbitrary received power distributions. It is shown that for equal rate and equal power users the asymptotic performance of partitioned CDMA is equal to the performance of CDMA with optimal a posteriori probability (APP) detection for system loads K/N < 1.49. Effects of asynchronous signal transmission are quantified for standard pulse shaping filters and it is shown that the signal‐to‐noise ratios achievable in an asynchronous system are improved with respect to fully synchronous transmission. The effect of unequal received powers is examined and considerable gains in performance are obtained by judicious choices of power distributions. For certain power distribution, partitioned CDMA with iterative detection can achieve arbitrary system loads, that is detection is no longer fundamentally interference limited. The practical near‐far resistance of the proposed system is illustrated using an example of a receiver with a circular receive footprint and uniformly distributed transmitters (single cell system). Copyright © 2008 John Wiley & Sons, Ltd.