Iterative Joint Detection and Decoding for MIMO-OFDM Wireless Communications

• Published in: 2006 Fortieth Asilomar Conference on Signals, Systems and Computers pp. 1752 - 1756
• Main Authors: Keun Chul Hwang, Sungwoo Park, Moon June, Soon Young Yoon
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.10.2006
• Subjects: Computational complexity; Computational modeling; Degradation; Interference cancellation; Iterative decoding; Maximum likelihood decoding; Maximum likelihood detection; MIMO; Parity check codes; Wireless communication
• ISBN: 9781424407842; 1424407842
• ISSN: 1058-6393; 2576-2303
• DOI: 10.1109/ACSSC.2006.355062

In this paper, we propose a simplified iterative joint detection and decoding (IJDD) scheme for MIMO-OFDM communications, which reduces the extremely high computational complexity of conventional iterative joint detection and decoding receiver with negligible performance degradation. For the MIMO detection, we propose a simplified maximum likelihood detection (MLD), which reduce the complexity of conventional MLD. The performance and computational complexity of the proposed scheme are compared with those of minimum mean squared error-ordered successive interference cancellation (MMSE-OSIC) receiver and maximum likelihood detection with QR decomposition and M-algorithm (QRM-MLD), which is known as to show near ML performance. Simulation results show that the proposed scheme outperforms the QRM-MLD with the half of computational complexity at a 1 Gbps data rate with 4 times 4 MIMO configuration, 16 QAM, the low-density parity-check (LDPC) code of 5/6 code rate and 90 MHz bandwidth.