DocumentCode :
1614683
Title :
Low-Complexity Factor Graph Receivers for Spectrally Efficient MIMO-IDMA
Author :
Novak, Clemens ; Hlawatsch, Franz ; Matz, Gerald
Author_Institution :
Inst. of Commun. & Radio-Freq. Eng., Vienna Univ. of Technol., Vienna
fYear :
2008
Firstpage :
770
Lastpage :
774
Abstract :
Interleave-division multiple access (IDMA) has recently been introduced as an attractive alternative to CDMA. IDMA employs user-specific interleavers combined with low-rate channel coding for user separation. In this paper, we consider a MIMO-IDMA system with increased spectral efficiency due to the use of higher-order symbol constellations. Based on a factor graph framework and the sum-product algorithm, we develop an iterative turbo multiuser receiver. Gaussian approximations for certain messages propagated through the factor graph lead to a complexity that scales only linearly with the number of users. To further reduce complexity, we introduce a selective message update scheme. Numerical simulations demonstrate the performance of the proposed receiver algorithms.
Keywords :
Gaussian processes; MIMO communication; approximation theory; channel coding; communication complexity; graph theory; interleaved codes; multi-access systems; turbo codes; wireless channels; Gaussian approximation; MIMO-IDMA; higher-order symbol constellation; interleave-division multiple access; iterative turbo multiuser receiver; low-complexity factor graph receiver; low-rate channel coding; spectral efficiency; sum-product algorithm; Base stations; Channel coding; Detectors; Fading; Gaussian approximation; Iterative algorithms; MIMO; Multiaccess communication; Receiving antennas; Sum product algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications, 2008. ICC '08. IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-2075-9
Electronic_ISBN :
978-1-4244-2075-9
Type :
conf
DOI :
10.1109/ICC.2008.151
Filename :
4533187
Link To Document :
بازگشت