Skip navigation
Please use this identifier to cite or link to this item: http://repository.iitr.ac.in/handle/123456789/16028
Title: Beyond fixed neighborhood search in the likelihood ascent algorithm for MIMO systems
Authors: Sah, Abhay Kumar
Chaturvedi, Ajit Kumar
Published in: Proceedings of 2016 IEEE International Conference on Communications, ICC 2016
Abstract: Neighborhood search algorithms have been proposed for detection in large/massive multiple-input multiple-output (MIMO) systems. They iteratively search for the best vector in a fixed neighborhood. However, the ML solution may not lie in the searched space or the search may take a large number of intermediate vectors to converge. Instead of searching in a fixed neighborhood, a better way will be to look for an update which is not restricted to be in a fixed neighborhood. Motivated by this, we formulate an optimization problem to maximize the reduction in ML cost and use it to derive an expression for updating the solution. We use a metric based on the channel matrix and the error vector to determine the likelihood of a symbol being in error. Using this likelihood and the update, we propose a likelihood ascent search (LAS) algorithm to find an update which is not restricted to be in a fixed neighborhood and seeks to provide maximum reduction in ML cost. This process continues till there is a reduction in the ML cost. Compared to existing LAS based algorithms, it is found to provide better error performance, that too at a lower complexity. © 2016 IEEE.
Citation: Proceedings of 2016 IEEE International Conference on Communications, ICC 2016 (2016), -.
URI: https://doi.org/10.1109/ICC.2016.7511055
http://repository.iitr.ac.in/handle/123456789/16028
Issue Date: 2016
Publisher: Institute of Electrical and Electronics Engineers Inc.
Keywords: Algorithms
Cost reduction
Costs
Errors
Iterative methods
MIMO systems
Vector spaces
Ascent algorithms
Channel matrices
Error performance
Lower complexity
Neighborhood search
Neighborhood search algorithms
Optimization problems
Searched space
Optimization
ISBN: 9.78E+12
Author Scopus IDs: 56473455100
9333507700
Author Affiliations: Sah, A.K., Department of Electrical Engineering, Indian Institute of Technology Kanpur, Kanpur, 208016, India
Chaturvedi, A.K., Department of Electrical Engineering, Indian Institute of Technology Kanpur, Kanpur, 208016, India
Appears in Collections:Conference Publications [ECE]

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


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