A novel branch-and-bound based maximum-likelihood MIMO detection algorithm

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

For a multiple-input multiple output (MIMO) communication system, the optimal detection is by the maximum-likelihood (ML) approach, which, however, has complexity that increases exponentially with the number of transmit antennas. In this paper, we propose a novel algorithm that implements the MIMO ML detection with reduced complexity. Our algorithm is developed based on a branch-and-bound (BB) principle. We apply a new type of cost function and give an efficient calculation algorithm. The initial reference data vector could be obtained by efficient MMSE-based algorithms. We also observe the impacts of initial reference data vectors.

Original languageEnglish
Title of host publication2008 IEEE Radio and Wireless Symposium, RWS
Pages627-630
Number of pages4
DOIs
Publication statusPublished - 2008 Sep 9
Event2008 IEEE Radio and Wireless Symposium, RWS - Orlando, FL, United States
Duration: 2008 Jan 222008 Jan 24

Publication series

Name2008 IEEE Radio and Wireless Symposium, RWS

Other

Other2008 IEEE Radio and Wireless Symposium, RWS
CountryUnited States
CityOrlando, FL
Period08-01-2208-01-24

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

Fingerprint Dive into the research topics of 'A novel branch-and-bound based maximum-likelihood MIMO detection algorithm'. Together they form a unique fingerprint.

Cite this