Branch and Bound with M algorithm for near optimal MIMO detection with higher order QAM constellation.
Ali A. ElgharianiMichael D. ZoltowskiPublished in: MILCOM (2012)
Keyphrases
- branch and bound
- search space
- higher order
- optimal solution
- dynamic programming
- detection algorithm
- lower bound
- search algorithm
- cost function
- computational complexity
- depth first search
- worst case
- particle swarm optimization
- space complexity
- branch and bound algorithm
- combinatorial optimization
- simulated annealing
- estimation algorithm
- column generation
- tree search
- branch and bound procedure
- metaheuristic
- monte carlo
- bayesian networks
- linear programming
- upper bound
- lower and upper bounds
- np hard