Skip to main content Accessibility help
×
Home
  • Print publication year: 2014
  • Online publication date: December 2013

5 - Detection based on local search

Summary

Local search has grown from a simple heuristic idea into an important and mature field of research in combinatorial optimization [1]. When confronted with NP-hard problems, one can resort to (i) an enumerative method that is guaranteed to produce an optimal solution, or (ii) an approximation algorithm that runs in polynomial time, or (iii) some kind of heuristic technique without any guarantee on the quality of the solution and running time. The first approach of true optimization algorithms may become prohibitive due to the problem of size or the lack of insight into the problem structure. The second approach of polynomial-time approximation algorithms, though characterizable by performance bounds, may give inferior solutions. The third approach of heuristics is the preferred choice for NP-hard problems, as it provides a robust means to obtain good solutions to problems of large size in a reasonable time. Local search techniques come under the third approach. Optimum signal detection in MIMO systems involves the minimization of a certain cost over a discrete signal space, where the exhaustive enumerative approach becomes prohibitive when the number of signaling dimensions becomes large. Therefore, the local search approach can be a considered choice for signal detection in MIMO systems with a large number of antennas.

An important characteristic of a local search algorithm is its neighborhood function/definition which guides the search to a good solution.

Related content

Powered by UNSILO
[1] E., Aarts and J. K., Lenstra, Eds., Local Search in Combinatorial Optimization. Princeton, NJ: Princeton University Press, New Age International Ltd, 2007.
[2] P., Merz and B., Freisleben, “Greedy and local search heuristics for unconstrained binary quadratic programming,” J. Heuristics, vol. 8, pp. 197–213, 2002.
[3] B., Kernighan and S., Lin, “An efficient heuristic procedure for partitioning graphs,” Bell Syst. Tech. J., vol. 49, pp. 291–307, 1972.
[4] S., Lin and B., Kernighan, “An effective heuristic algorithm for the traveling salesman problem,” Oper. Res., vol. 21, pp. 498–516, 1973.
[5] F., Glover, “Tabu search – Part I,” ORSA J. Computing, vol. 1, no. 3, pp. 190–206, Summer 1989.
[6] F., Glover, “Tabu search – Part II,” ORSA J. Computing, vol. 2, no. 1, pp. 4–32, Winter 1990.
[7] S., Verdu, Multiuser Detection. Cambridge, UK: Cambridge University Press, 1998.
[8] Y., Sun, “Search algorithms based on elimination-highest-error and fastest-metric-descent criteria for bit-synchronous CDMA multiuser detection,” in IEEE ICC'1998, Atlanta, GA, Jun. 1998, pp. 390–394.
[9] J., Luo, G., Levchuk, K., Pattipati, and P., Willett, “A class of coordinate descent methods for multiuser detection,” in IEEE ICASSP2000, Istanbul, Jun. 2000, pp. 2853–2856.
[10] J., Hu and R. S., Blum, “A gradient guided search algorithm for multiuser detection,” IEEE Commun. Lett., vol. 4, no. 11, pp. 340–342, Nov. 2000.
[11] A., AlRustamani and B. R., Vojcic, “A new approach to greedy multiuser detection,” IEEE Trans. Commun., vol. 50, no. 8, pp. 1326–1336, Aug. 2002.
[12] H. S., Lim and B., Venkatesh, “An efficient local search heuristics for asynchronous multiuser detection and heuristic search methods,” IEEE Commun. Lett., vol. 7, no. 7, pp. 299–301, Jul. 2003.
[13] Z., Qin, K., Cai, and X., Zou, “Turbo multiuser detection based on local search algorithms,” in IEEE ICC'2007, Glasgow, Jun. 2007, pp. 5987–5992.
[14] Y., Sun, “A family of likelihood ascent search multiuser detectors: an upper bound of bit error rate and a lower bound of asymptotic multiuser efficiency,” IEEE Trans. Commun., vol. 57, no. 6, pp. 1743–1752, Jun. 2009.
[15] Y., Sun, “A family of likelihood ascent search multiuser detectors: approaching optimum performance via rand om multicodes with linear complexity,” IEEE Trans. Commun., vol. 57, no. 8, pp. 2215–2220, Aug. 2009.
[16] P. H., Tan and L. K., Rasmussen, “A reactive tabu search heuristic for multiuser detection in CDMA,” in IEEE ISIT'2002, Lausanne, Jun.-Jul. 2002, p. 472.
[17] P. H., Tan and L. K., Rasmussen, “Multiuser detection in CDMA – a comparison of relaxations, exact, and heuristic search methods,” IEEE Trans. Wireless Commun., vol. 3, no. 5, pp. 1802–1809, Sep. 2004.
[18] Z., Qin and K. C., Teh, “Reduced-complexity turbo equalization for coded inter-symbol interference channels based on local search algorithms,” IEEE Trans. Veh. Tech., vol. 57, no. 1, pp. 630–635, Jan. 2008.
[19] J. H.-Y., Fan, R. D., Murch, and W. H., Mow, “Near maximum likelihood detection schemes for wireless MIMO systems,” IEEE Trans. Wireless Commun., vol. 3, no. 5, pp. 1427–1430, Sep. 2004.
[20] H., Zhao, H., Long, and W., Wang, “Tabu search detection for MIMO systems,” in IEEE PIMRC'2007, Athens, Sep. 2007, pp. 1–5.
[21] K. V., Vardhan, S. K., Mohammed, A., Chockalingam, and B. S., Rajan, “A low-complexity detector for large MIMO systems and multicarrier CDMA systems,” IEEE J. Sel. Areas Commun., vol. 26, no. 3, pp. 473–485, Apr. 2008.
[22] S. K., Mohammed, A., Chockalingam, and B. S., Rajan, “A low-complexity near-ml performance achieving algorithm for large MIMO detection,” in IEEE ISIT'2008, Toronto, Jul. 2008, pp. 2012–2016.
[23] S. K., Mohammed, A., Zaki, A., Chockalingam, and B. S., Rajan, “High-rate spacetime coded large-MIMO systems: low-complexity detection and channel estimation,” IEEE J. Sel. Topics Sig. Proc., vol. 3, no. 6, pp. 958–974, Dec. 2009.
[24] P., Li and R. D., Murch, “Multiple output selection-las algorithm in large mimo systems,” IEEE Commun. Lett., vol. 14, no. 5, pp. 399–401, May 2010.
[25] N., Srinidhi, T., Datta, A., Chockalingam, and B. S., Rajan, “Layered tabu search algorithm for large-MIMO detection and a lower bound on ML performance,” IEEE Trans. Commun., vol. 59, no. 11, pp. 2955–2963, Nov. 2011.
[26] T., Datta, N., Srinidhi, A., Chockalingam, and B. S., Rajan, “Rand om-restart reactive tabu search algorithm for detection in large-MIMO systems,” IEEE Commun. Lett., vol. 14, no. 12, pp. 1107–1109, Dec. 2010.
[27] B. A., Sethuraman, B. S., Rajan, and V., Shashidhar, “Full-diversity high-rate space-time block codes from division algebras,” IEEE Trans. Inform. Theory, vol. 49, no. 10, pp. 2596–2616, Oct. 2003.
[28] H., Jafarkhani, Space-Time Coding: Theory and Practice. Cambridge, UK: Cambridge University Press, 2005.
[29] A., Kumar, S., Chandrasekaran, A., Chockalingam, and B. S., Rajan, “Near-optimal large-MIMO detection using rand omized MCMC and rand omized search algorithms,” in IEEE ICC'2011, Kyoto, Jun. 2011.