Adaptive Antenna Subset Selection and Constellation Breakdown for Spatial Modulation

Author

Maleki, Mehdi ; Bahrami, Hamid Reza ; Alizadeh, Amirreza

Author_Institution

Dept. of Electr. & Comput. Eng., Univ. of Akron, Akron, OH, USA

Volume

18

Issue

9

fYear

2014

fDate

Sept. 2014

Firstpage

1649

Lastpage

1652

Abstract

The problem of antenna subset selection (ASS) and constellation breakdown (CBD) for spatial modulation (SM) is investigated. Assuming the availability of the channel state information, an ASS scheme is introduced such that the symbol error rate of SM is minimized. A graph-based heuristic search algorithm is then proposed to significantly reduce the search complexity of ASS compared to the exhaustive search, while maintaining the performance. As it is not always optimal to use all the transmit antennas, optimal CBD in conjunction with ASS is then considered to develop an adaptive low-complexity ASS-CBD scheme.

Keywords

adaptive antenna arrays; computational complexity; error statistics; modulation; search problems; set theory; ASS; CBD; adaptive antenna subset selection; adaptive low-complexity ASS-CBD scheme; antennas transmission; channel state information; constellation breakdown; graph-based heuristic search algorithm; search complexity; spatial modulation; symbol error rate; Adaptive arrays; Complexity theory; Heuristic algorithms; Joints; Modulation; Transmitting antennas; Spatial modulation; antenna subset selection; constellation breakdown; minimum weight clique;

fLanguage

English

Journal_Title

Communications Letters, IEEE

Publisher

ieee

ISSN

1089-7798

Type

jour

DOI

10.1109/LCOMM.2014.2336837

Filename

6857399