Weighted graph coloring based softer pilot reuse for TDD massive MIMO systems.
Wenson ChangHan-Wei ChanPublished in: WCNC (2018)
Keyphrases
- np hard
- graph coloring
- mimo systems
- scheduling problem
- constraint satisfaction problems
- combinatorial problems
- low complexity
- job shop scheduling
- np complete
- branch and bound algorithm
- phase transition
- lower bound
- max sat
- computational complexity
- video transmission
- constraint satisfaction
- constraint programming
- wireless channels
- fading channels
- job shop scheduling problem
- hyper heuristics
- multiple input multiple output
- branch and bound
- neural network
- motion estimation
- control system