Next Article in Journal
A Self-Adaptive Evolutionary Algorithm for the Berth Scheduling Problem: Towards Efficient Parameter Control
Previous Article in Journal
Width, Depth, and Space: Tradeoffs between Branching and Dynamic Programming
Article Menu

Export Article

Open AccessArticle
Algorithms 2018, 11(7), 99; https://doi.org/10.3390/a11070099

A Low Complexity Reactive Tabu Search Based Constellation Constraints in Signal Detection

1
School of Electric and Information Engineering, Nanjing University of Information Science and Technology, 219 Ninliu Road, Nanjing 210044, China
2
Jiangsu Collaborative Innovation Center on Atmospheric Environment and Equipment Technology (CICAEET), Nanjing 210044, China
*
Author to whom correspondence should be addressed.
Received: 12 May 2018 / Revised: 13 June 2018 / Accepted: 28 June 2018 / Published: 3 July 2018
View Full-Text   |   Download PDF [277 KB, uploaded 3 July 2018]   |  

Abstract

For Massive multiple-input multiple output (MIMO) systems, many algorithms have been proposed for detecting spatially multiplexed signals, such as reactive tabu search (RTS), minimum mean square error (MMSE), etc. As a heuristic neighborhood search algorithm, RTS is particularly suitable for signal detection in systems with large number of antennas. In this paper, we propose a strategy to reduce the neighborhood searching space of the traditional RTS algorithms. For this, we introduce a constellation constraints (CC) structure to determine whether including a candidate vector into the RTS searching neighborhood. By setting a pre-defined threshold on the symbol constellation, the Euclidean distance between the estimated signal and its nearest constellation points are calculated, and the threshold and distance are compared to separate the reliable estimated signal from unreliable ones. With this structure, the proposed CC-RTS algorithm may ignore a significant number of unnecessary candidates in the RTS neighborhood searching space and greatly reduce the computational complexity of the traditional RTS algorithm. Simulation results show that the BER performance of the proposed CC-RTS algorithm is very close to that of the traditional RTS algorithm, and with about 50% complexity reduction with the same signal-to-noise (SNR) ratio. View Full-Text
Keywords: MIMO; maximum likelihood; RTS; CC; detection complexity MIMO; maximum likelihood; RTS; CC; detection complexity
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Feng, J.; Zhang, X.; Li, P.; Hu, D. A Low Complexity Reactive Tabu Search Based Constellation Constraints in Signal Detection. Algorithms 2018, 11, 99.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top