Near-optimal MIMO detection algorithm with low and fixed complexity

In this paper, we propose a near-optimal multiple-input multiple-output (MIMO) detection algorithm with low and fixed complexity, which is based on the fixed-complexity sphere decoder (FSD). By employing the lattice reduction (LR) to the FSD, the computational complexity is reduced considerably whil...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Digest of technical papers - IEEE International Conference on Consumer Electronics s. 1 - 2
Hlavní autoři: Hyunsub Kim, Jaeseok Kim
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2015
Témata:
Computational complexity
Decoding
Detection algorithms
FSD
lattice reduction
Lattices
MIMO
optimal
Signal processing algorithms
ISSN:0747-668X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we propose a near-optimal multiple-input multiple-output (MIMO) detection algorithm with low and fixed complexity, which is based on the fixed-complexity sphere decoder (FSD). By employing the lattice reduction (LR) to the FSD, the computational complexity is reduced considerably while maintaining the near-optimal bit-error-rate (BER) performance. Although the application of LR to the FSD is not straightforward, an efficient solution is proposed in this paper. The numerical results demonstrate that the computational complexity of the proposed algorithm is reduced by about 43.02% and 76.49% for 64-QAM and 256-QAM compared to the optimal FSD while the performance degradation is negligible.
ISSN:0747-668X
DOI:10.1109/ISCE.2015.7177810