Low-complexity near-ML decoding of large non-orthogonal STBCs using reactive tabu search.
B. Sundar RajanSaif K. MohammedAnanthanarayanan ChockalingamNagaraja SrinidhiPublished in: ISIT (2009)
Keyphrases
- low complexity
- tabu search
- decoding complexity
- simulated annealing
- metaheuristic
- scheduling problem
- path relinking
- maximum likelihood
- memetic algorithm
- motion estimation
- genetic algorithm
- heuristic methods
- search procedure
- hybrid algorithm
- search algorithm
- vehicle routing problem
- tabu search algorithm
- job shop scheduling problem
- distributed video coding
- decoding algorithm
- tabu list
- low density parity check
- computational complexity
- initial solution
- iterated local search
- quadratic assignment problem
- optimization problems
- video streaming
- joint source channel
- ldpc codes
- turbo codes
- video coding
- computer vision
- image transmission
- multiple description coding
- bit plane
- combinatorial optimization
- optical flow