Near ML detection using Dijkstra's algorithm with bounded list size over MIMO channels
Atsushi OkawadoRyutaroh MatsumotoTomohiko UyematsuPublished in: CoRR (2008)
Keyphrases
- detection algorithm
- dynamic programming
- objective function
- times faster
- matching algorithm
- computational complexity
- search space
- scales linearly
- computationally efficient
- computational cost
- experimental evaluation
- cost function
- preprocessing
- optimal solution
- np hard
- simulated annealing
- significant improvement
- segmentation algorithm
- window size
- similarity measure
- markov random field
- maximum likelihood
- search algorithm
- memory requirements
- recognition algorithm
- multi channel