CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Iterative multi-user detection of trellis code multiple access using a posteriori probabilities

Fredrik Brännström (Institutionen för datorteknik) ; Tor Aulin (Institutionen för datorteknik) ; Lars K. Rasmussen (Institutionen för datorteknik)
IEEE International Conference on Communications (ICC ’'01), Helsinki, Finland, June 2001 p. 11–-15. (2001)
[Konferensbidrag, refereegranskat]

Iterative detectors for trellis code multiple access (TCMA) are suggested as an alternative to the joint maximum likelihood sequence detector (MLSD). Interleavers are introduced in the TCMA system as a new feature to separate the users. This implies that MLSD is now too complex to implement. The conventional interference cancellation (IC) detector has lower complexity, but its performance is shown to be far from acceptable. Another iterative detector having close to single user performance is therefore suggested. Instead of using IC, this detector updates the branch metric for every iteration and avoids the standard Gaussian approximation. It is also shown that the users can be detected when the interleaver is the only user specific feature in the TCMA system.



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2006-08-25. Senast ändrad 2015-03-06.
CPL Pubid: 12840

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)


Institutioner (Chalmers)

Institutionen för datorteknik (1985-2001)

Ämnesområden

Informations- och kommunikationsteknik
Telekommunikationsteori

Chalmers infrastruktur