ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

A hybrid RTS-BP algorithm for improved detection of large-MIMO M-QAM signals

Datta, Tanumay and Srinidhi, N and Chockalingam, Ananthanarayanan and Rajan, Sundar B (2011) A hybrid RTS-BP algorithm for improved detection of large-MIMO M-QAM signals. In: 2011 National Conference on Communications (NCC), 28-30 Jan. 2011, Bangalore.

[img] PDF
Nat_Conf_Comm_1_2011.pdf - Published Version
Restricted to Registered users only

Download (174kB) | Request a copy
Official URL: http://dx.doi.org/10.1109/NCC.2011.5734727

Abstract

Low-complexity near-optimal detection of large-MIMO signals has attracted recent research. Recently, we proposed a local neighborhood search algorithm, namely reactive tabu search (RTS) algorithm, as well as a factor-graph based belief propagation (BP) algorithm for low-complexity large-MIMO detection. The motivation for the present work arises from the following two observations on the above two algorithms: i) Although RTS achieved close to optimal performance for 4-QAM in large dimensions, significant performance improvement was still possible for higher-order QAM (e.g., 16-, 64-QAM). ii) BP also achieved near-optimal performance for large dimensions, but only for {±1} alphabet. In this paper, we improve the large-MIMO detection performance of higher-order QAM signals by using a hybrid algorithm that employs RTS and BP. In particular, motivated by the observation that when a detection error occurs at the RTS output, the least significant bits (LSB) of the symbols are mostly in error, we propose to first reconstruct and cancel the interference due to bits other than LSBs at the RTS output and feed the interference cancelled received signal to the BP algorithm to improve the reliability of the LSBs. The output of the BP is then fed back to RTS for the next iteration. Simulation results show that the proposed algorithm performs better than the RTS algorithm, and semi-definite relaxation (SDR) and Gaussian tree approximation (GTA) algorithms.

Item Type: Conference Proceedings
Additional Information: Copyright of this article belongs to IEEE.
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Depositing User: Id for Latest eprints
Date Deposited: 15 Apr 2013 11:46
Last Modified: 15 Apr 2013 11:46
URI: http://eprints.iisc.ac.in/id/eprint/46210

Actions (login required)

View Item View Item