Low complexity user selection algorithms for multiuser MIMO systems with block diagonalization

395 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Networked MIMO with clustered linear precoding (2008, methodology): “For the greedy search scheduling algorithm applied in this paper, we need to roughly search over O(KBKmax) user combinations [49], and the problem (8) needs to be solved for each combination except the single-user sets.”
Millimeter-Wave Massive MIMO Communication for Future Wireless Systems: A Survey (2018, methodology): “For Block Diagonization (BD) precoder design [185], Dn is chosen to satisfy the condition HkDn = 0.”
Shifting the MIMO Paradigm (2007, methodology): “GREEDY AND ITERATIVE METHODS FOR USER GROUPING The complexity of the optimal scheduling is high, thus there has been several suboptimal algorithms that were proposed to reduce the computational complexity for user group selection [25], [27]–[29].”
Pilot Contamination and Precoding in Multi-Cell TDD Systems (2009, background): “This body of work [25]–[29] demonstratess that sum rates close to sum capacity can be achieved with much lower computational complexity.”