Factor graph based design of an OFDM-IDMA receiver performing joint data detection, channel estimation, and channel length selection

We present a factor graph based design of a receiver for pilot-assisted OFDM-IDMA systems transmitting over frequency-selective channels. The receiver performs joint iterative multiuser data detection and channel estimation with a complexity that is linear in the number of users, and it includes estimation of the channel length. Simulation results demonstrate large performance gains compared to OFDM-IDMA receivers using separate MMSE channel estimation.

[1]  Gerald Matz,et al.  MIMO-IDMA: Uplink Multiuser MIMO Communications using Interleave-Division Multiple Access and Low-Complexity Iterative Receivers , 2007, 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07.

[2]  Charlotte Langlais,et al.  OFDM-IDMA versus IDMA with ISI Cancellation for Quasistatic Rayleigh Fading Multipath Channels , 2006 .

[3]  J. Boutros,et al.  Iterative multiuser joint decoding: unified framework and asymptotic analysis , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[4]  Gerhard Bauch,et al.  Performance of Interleave Division Multiple Access Based on Minimum Mean Square Error Detection , 2007, 2007 IEEE International Conference on Communications.

[5]  Li Ping,et al.  The OFDM-IDMA approach to wireless communication systems , 2007, IEEE Wireless Communications.

[6]  Li Ping,et al.  Interleave division multiple-access , 2006, IEEE Trans. Wirel. Commun..

[7]  Li Ping,et al.  The Factor Graph Approach to Model-Based Signal Processing , 2007, Proceedings of the IEEE.

[8]  Wayne E. Stark,et al.  Unified design of iterative receivers using factor graphs , 2001, IEEE Trans. Inf. Theory.

[9]  Gerald Matz,et al.  A factor graph approach to joint iterative data detection and channel estimation in pilot-assisted IDMA transmissions , 2008, 2008 IEEE International Conference on Acoustics, Speech and Signal Processing.

[10]  G. Forney,et al.  Codes on graphs: normal realizations , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[11]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.