|Publisher DOI:||10.1109/VTCSpring.2018.8417572||Title:||Markov Chain Monte Carlo Methods for a Low Complexity LTE-Advanced Joint Detector||Language:||English||Authors:||Justavino Castillo, Rodrigo Alberto
|Issue Date:||20-Jul-2018||Source:||IEEE Vehicular Technology Conference (2018-June): 1-5 (2018-07-20)||Journal or Series Name:||IEEE Vehicular Technology Conference||Abstract (english):||To meet the goal of tenfold increase in spectral efficiency, interference cancellation and multiuser detection are expected to be important tasks of fifth-generation (5G) radio access systems. Both tasks can be realized by joint detection algorithms. However, joint detection algorithms such as maximum likelihood (ML) detection have a high computational complexity. Previous works have shown that joint detectors based on Markov chain Monte Carlo (MCMC) methods can achieve similar results compared to ML detection with a large reduction in the computational complexity for systems with a large number of streams or users. The purpose of this work is to present a MIMO joint detector based on MCMC methods and evaluate it within the constraints of LTE Advanced (LTE-A), namely, using at most 8 transmit antennas and 64-QAM modulation. The evaluation is done separately from the channel decoder. Moreover, the complexity of the presented algorithm is compared to the one of an ML detector. The results show that the proposed MIMO detector offers a similar detection error rate compared to an ML detector. Furthermore, it was observed that the complexity reduction is significant for systems with more than six transmit antennas.||URI:||http://hdl.handle.net/11420/2569||ISBN:||978-153866355-4||ISSN:||1550-2252||Institute:||Nachrichtentechnik E-8||Type:||InProceedings (Aufsatz / Paper einer Konferenz etc.)||Project:||Interference Management for D2D Communications in 5G Wireless|
|Appears in Collections:||Publications without fulltext|
Show full item record
checked on Oct 22, 2020
Add Files to Item
Note about this record
Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.