Abstract
This paper shows how to accurately describe a fully synchronised interleave division multiple access (IDMA) scheme without channel coding by a matrix model. This model allows the derivation of the optimal detector and provides additional insights into the IDMA principle, and we show that the matrices are structured and sparse. We use BER and EXIT charts to study the performance of parallel and serial interference cancellation schemes and demonstrate that the latter converges faster and is independent of the scrambling code. Any bit interleaved DS-CDMA system can be viewed as a special case of IDMA, and an IDMA receiver can therefore be used to detect DS-CDMA signals.
Original language | English |
---|---|
Pages (from-to) | 511-522 |
Number of pages | 12 |
Journal | European Transactions on Telecommunications |
Volume | 19 |
Issue number | 5 |
DOIs | |
Publication status | Published - Aug 2008 |