LR-aided sphere decoding of generalized spatial modulation signals
| Autor: | Mohammad Neinavaie, Saeed Gazor, Mostafa Derakhtian, Negar Daryanavardan |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Minimum mean square error
Computational complexity theory Iterative method Brute-force search 020206 networking & telecommunications 02 engineering and technology 03 medical and health sciences 0302 clinical medicine GSM Lattice (order) 0202 electrical engineering electronic engineering information engineering Electrical and Electronic Engineering Lattice reduction Algorithm 030217 neurology & neurosurgery Decoding methods Computer Science::Information Theory Mathematics |
| Zdroj: | AEU - International Journal of Electronics and Communications. 109:8-16 |
| ISSN: | 1434-8411 |
| DOI: | 10.1016/j.aeue.2019.06.035 |
| Popis: | This paper presents a new low complexity sphere decoding (SD) for the generalized spatial modulation (GSM). We introduce a pre-processing stage using the lattice reduction (LR) aided minimum mean squared error (MMSE) equalization in the GSM systems. This stage speeds up the search in the decoding tree and provides a lattice dependent (LD) initial choice of the radius. Moreover, we derive a lattice independent (LI) initial radius that guarantees the optimal performance at a high signal-to-noise ratio (SNR). We also propose an iterative method to increase the radius in order to achieve the maximum likelihood (ML) performance at all SNRs. We show that the proposed algorithm achieves the ML performance while requiring prominently less computational complexity (CC) than an exhaustive search. In addition, we analyze the CC of the resulting algorithm at high SNRs and we derive an analytical expression for the complexity. The simulation results demonstrate a noticeable decrease in the CC of the proposed sphere decoding algorithm in comparison with its counterparts, particularly at low SNRs. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect