Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  investigate new scheduling algorithms for MIMO broadcast systems to maximize the achievable sum rate of block diagonalization transceivers. In contrast to conventional schemes which select users directly,  investigate a more efficient type of scheduling algorithms, named as multiuser eigenmode transmission (MET). It is based on the selection of eigenmodes of all users. Utilizing an iterative procedure to calculate the Moore-Penrose generalized inverse of a matrix consisting of the already selected eigenmodes,  propose a low complexity multiuser eigenmode selection method based on the greedy algorithm. Then  show that the multiuser dominant eigenmode transmission can achieve the same sum rate scaling law as that of DPC. Therefore, to further reduce the complexity,  restrict our search space to the set of dominant eigenmodes and derive an alternative eigenmode selection algorithm with lor complexity at the cost of little performance loss, which  name as the low-complexity multiuser dominant eigenmode selection algorithm.
['Zhihua Shi', 'Chunming Zhao', 'Zhi Ding']
I am writing a research paper on a idea Low Complexity Eigenmode Selection for MIMO Broadcast Systems with Block Diagonalization
[{"from": "human", "value": "I am writing a research paper on a idea Low Complexity Eigenmode Selection for MIMO Broadcast Systems with Block Diagonalization"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  investigate new scheduling algorithms for MIMO broadcast systems to maximize the achievable sum rate of block diagonalization transceivers. In contrast to conventional schemes which select users directly,  investigate a more efficient type of scheduling algorithms, named as multiuser eigenmode transmission (MET). It is based on the selection of eigenmodes of all users. Utilizing an iterative procedure to calculate the Moore-Penrose generalized inverse of a matrix consisting of the already selected eigenmodes,  propose a low complexity multiuser eigenmode selection method based on the greedy algorithm. Then  show that the multiuser dominant eigenmode transmission can achieve the same sum rate scaling law as that of DPC. Therefore, to further reduce the complexity,  restrict our search space to the set of dominant eigenmodes and derive an alternative eigenmode selection algorithm with lor complexity at the cost of little performance loss, which  name as the low-complexity multiuser dominant eigenmode selection algorithm."}]