Abstract
Code division multiple access (CDMA) in which the spreading
code assignment to users contains a random element has recently become a cornerstone of CDMA research. The random element in the construction is particularly attractive as it provides robustness and flexibility in utilizing multiaccess channels, whilst not making significant sacrifices in terms of transmission power. Random codes are generated from some ensemble; here we consider the possibility of combining two standard paradigms, sparsely and densely spread codes, in a single composite code ensemble. The composite code analysis includes a replica symmetric calculation of performance in the large system limit, and investigation of finite systems through a composite belief propagation algorithm. A variety of codes are examined with a focus on the high multi-access interference regime. We demonstrate scenarios both in the large size limit and for finite systems in which the composite code has typical performance exceeding those of sparse and dense codes at equivalent signal to noise ratio.
Original language | English |
---|---|
Article number | P05015 |
Journal | Journal of Statistical Mechanics |
Volume | 2009 |
Issue number | 5 |
DOIs | |
Publication status | Published - 21 May 2009 |
Bibliographical note
© 2009 IOP Publishing Ltd and SISSAKeywords
- random graphs
- networks
- disordered systems
- source and channel coding