Skip navigation
Please use this identifier to cite or link to this item: http://repository.iitr.ac.in/handle/123456789/16032
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSah, Abhay Kumar-
dc.contributor.authorChaturvedi, Ajit Kumar-
dc.date.accessioned2020-12-02T14:15:34Z-
dc.date.available2020-12-02T14:15:34Z-
dc.date.issued2015-
dc.identifier.citationProceedings of 2015 IEEE Global Communications Conference, GLOBECOM 2015 (2015), -.-
dc.identifier.isbn9.78E+12-
dc.identifier.urihttps://doi.org/10.1109/GLOCOM.2014.7417691-
dc.identifier.urihttp://repository.iitr.ac.in/handle/123456789/16032-
dc.description.abstractNeighborhood search algorithms such as likelihood ascent search (LAS) and reactive tabu search (RTS) have been proposed for low complexity detection in multiple-input multiple-output (MIMO) systems having a large number of antennas. Both these algorithms are iterative and search for the vector which minimizes the maximum likelihood (ML) cost in the neighborhood. In this paper we propose a way to reduce the size of the neighborhood. For this, we propose a metric and a selection rule to decide whether or not to include a vector in the neighborhood. We use the indices of, say K, largest components of the metric for generating a reduced neighborhood set. This reduced set is used to evaluate the performance of the resulting LAS and RTS algorithms. Simulation results show that this reduces the complexity significantly while maintaining the error performance. We also show that the proposed reduced neighborhood algorithms can make MIMO systems with several hundred antenna pairs feasible. © 2015 IEEE.-
dc.language.isoen_US-
dc.publisherInstitute of Electrical and Electronics Engineers Inc.-
dc.relation.ispartofProceedings of 2015 IEEE Global Communications Conference, GLOBECOM 2015-
dc.subjectAntennas-
dc.subjectComputational complexity-
dc.subjectIterative methods-
dc.subjectLearning algorithms-
dc.subjectMaximum likelihood-
dc.subjectMIMO systems-
dc.subjectOptimization-
dc.subjectTabu search-
dc.subjectError performance-
dc.subjectLow-complexity detections-
dc.subjectNeighborhood algorithm-
dc.subjectNeighborhood search algorithms-
dc.subjectNeighborhood set-
dc.subjectReactive Tabu search-
dc.subjectSelection Rules-
dc.subjectAlgorithms-
dc.titleReduced neighborhood search algorithms for low complexity detection in MIMO systems-
dc.typeConference Paper-
dc.scopusid56473455100-
dc.scopusid9333507700-
dc.affiliationSah, A.K., Department of Electrical Engineering, Indian Institute of Technology Kanpur, Kanpur, 208016, India-
dc.affiliationChaturvedi, A.K., Department of Electrical Engineering, Indian Institute of Technology Kanpur, Kanpur, 208016, India-
dc.identifier.conferencedetails58th IEEE Global Communications Conference, GLOBECOM 2015, 6-10 December 2015-
Appears in Collections:Conference Publications [ECE]

Files in This Item:
There are no files associated with this item.
Show simple item record


Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.