Location of Repository

Iterative detectors for trellis-code multiple-access

By Fredrik Brännström, Student Member, Tor M. Aulin, Lars K. Rasmussen and Senior Member

Abstract

Abstract—Trellis-code multiple-access (TCMA) is a narrowband multiple-access scheme based on trellis-coded modulation. There is no bandwidth expansion, so users occupy the same bandwidth as one single user. The load of the system, in number of bits per channel use, is therefore much higher than the load in, for example, conventional code-division multiple-access systems. Interleavers are introduced as a new feature to separate the users. This implies that the maximum-likelihood sequence detector (MLSD) is now too complex to implement. Iterative detectors are therefore suggested as an alternative to the joint MLSD. The conventional interference cancellation (IC) detector has lower complexity than the MLSD, but its performance is shown to be far from acceptable. Even after a novel improvement of the IC detector, the performance is unsatisfactory. Instead of using IC, another iterative detector is suggested. This detector updates the branch metric for every iteration, and avoids the standard Gaussian approximation. Simulations show that the performance of this detector can be close to single-user performance, even when the interleaver and the phase offset are the only user-specific features in the TCMA system. Index Terms—Interference cancellation, iterative methods, multiple-access technique, trellis-code multiple-access, trellis-coded modulation. I

Year: 2002
OAI identifier: oai:CiteSeerX.psu:10.1.1.321.1134
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.itr.unisa.edu.au/~l... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.