Mobility

Application of Heuristic (1-Opt Local Search) and Metaheuristic (Ant Colony Optimization) Algorithms for Symbol Detection in MIMO Systems

Free registration required

Executive Summary

Heuristic and metaheuristic techniques are used for solving computationally hard optimization problems. Local search is a heuristic technique while Ant Colony Optimization (ACO), inspired by the ants' foraging behavior, is one of the most recent metaheuristic technique. These techniques are used for solving optimization problems. Multiple-Input Multiple-Output (MIMO) detection problem is an NP-hard combinatorial optimization problem. The authors present heuristic and metaheuristic approaches for symbol detection in Multi-Input Multi-Output (MIMO) system. Since, symbol detection is an NP-hard problem so ACO is particularly attractive as ACO algorithms are one of the most successful strands of swarm intelligence and are suitable for applications where low complexity and fast convergence is of absolute importance.

  • Format: PDF
  • Size: 239.81 KB