Low complexity receiver structures for space-time coded multiple-access systems

Eurasip Journal on Applied Signal Processing

Volumn , Issue 3, 2002, Pages 275-288

  Jayaweera, Sudharman K ^a   Poor, H Vincent ^a  

^a Princeton University   (United States)

Author keywords

Iterative detection; Multiuser detection; Space time coding

Indexed keywords

ALGORITHMS; CODE DIVISION MULTIPLE ACCESS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; MAXIMUM LIKELIHOOD ESTIMATION; RAYLEIGH FADING; COMPUTATIONAL COMPLEXITY; DECODING; DIVERSITY RECEPTION; ITERATIVE METHODS; SIGNAL DETECTION; SPACE TIME ADAPTIVE PROCESSING;

SPACE-TIME CODES (STC);

SIGNAL RECEIVERS; RADIO RECEIVERS;

MULTIUSER CHANNEL; MULTIUSER DETECTION; SPACE TIME CODES; VITERBI ALGORITHM;

EID: 0038818066     PISSN: 11108657     EISSN: None     Source Type: Journal    
DOI: 10.1155/s111086570200063x     Document Type: Article

References (15)

1. A simple transmit diversity technique for wireless communications
2. Space-time block codes from orthogonal designs
3. Space-time codes for high data rate wireless communication: Performance criterion and code construction
4. Iterative receivers for multiuser space-time coding systems
5. Multistage multiuser detection for CDMA with space-time coding
6. Iterative (turbo) soft interference cancellation and decoding for coded CDMA
7. Optimal decoding of linear codes for minimizing symbol error rate
8. Multiuser ML sequence estimator for convolutionally coded DS-CDMA systems
9. On the theory of space-time codes for PSK modulation
10. Suboptimum multiuser receivers for convolutionally coded asynchronous DS-CDMA systems
11. Probability of error in MMSE multiuser detection
12. An intuitive justification and a simplified implementation of the MAP decoder for convolutional codes