A low complexity user scheduling algorithm for uplink multiuser MIMO systems
A low complexity user scheduling algorithm based on a novel adaptive Markov chain Monte Carlo (AMCMC) method is proposed to achieve the maximal sum capacity in an uplink multiple-input multiple-output (MIMO) multiuser system. Compared with the existing scheduling algorithms, our algorithm is not onl...
Main Authors: | , , , , , |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2008
|
_version_ | 1826275016061222912 |
---|---|
author | Zhang, Y Ji, C Liu, Y Malik, W O'Brien, D Edwards, D |
author_facet | Zhang, Y Ji, C Liu, Y Malik, W O'Brien, D Edwards, D |
author_sort | Zhang, Y |
collection | OXFORD |
description | A low complexity user scheduling algorithm based on a novel adaptive Markov chain Monte Carlo (AMCMC) method is proposed to achieve the maximal sum capacity in an uplink multiple-input multiple-output (MIMO) multiuser system. Compared with the existing scheduling algorithms, our algorithm is not only more efficient but also converges to within 99% of the optimal capacity obtained by exhaustive search. We demonstrate the convergence of the proposed scheduling algorithm and study the tradeoff between its complexity and performance. © 2008 IEEE. |
first_indexed | 2024-03-06T22:52:16Z |
format | Journal article |
id | oxford-uuid:5f325e90-6da5-454c-8c59-fdd04632276f |
institution | University of Oxford |
language | English |
last_indexed | 2024-03-06T22:52:16Z |
publishDate | 2008 |
record_format | dspace |
spelling | oxford-uuid:5f325e90-6da5-454c-8c59-fdd04632276f2022-03-26T17:45:22ZA low complexity user scheduling algorithm for uplink multiuser MIMO systemsJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:5f325e90-6da5-454c-8c59-fdd04632276fEnglishSymplectic Elements at Oxford2008Zhang, YJi, CLiu, YMalik, WO'Brien, DEdwards, DA low complexity user scheduling algorithm based on a novel adaptive Markov chain Monte Carlo (AMCMC) method is proposed to achieve the maximal sum capacity in an uplink multiple-input multiple-output (MIMO) multiuser system. Compared with the existing scheduling algorithms, our algorithm is not only more efficient but also converges to within 99% of the optimal capacity obtained by exhaustive search. We demonstrate the convergence of the proposed scheduling algorithm and study the tradeoff between its complexity and performance. © 2008 IEEE. |
spellingShingle | Zhang, Y Ji, C Liu, Y Malik, W O'Brien, D Edwards, D A low complexity user scheduling algorithm for uplink multiuser MIMO systems |
title | A low complexity user scheduling algorithm for uplink multiuser MIMO systems |
title_full | A low complexity user scheduling algorithm for uplink multiuser MIMO systems |
title_fullStr | A low complexity user scheduling algorithm for uplink multiuser MIMO systems |
title_full_unstemmed | A low complexity user scheduling algorithm for uplink multiuser MIMO systems |
title_short | A low complexity user scheduling algorithm for uplink multiuser MIMO systems |
title_sort | low complexity user scheduling algorithm for uplink multiuser mimo systems |
work_keys_str_mv | AT zhangy alowcomplexityuserschedulingalgorithmforuplinkmultiusermimosystems AT jic alowcomplexityuserschedulingalgorithmforuplinkmultiusermimosystems AT liuy alowcomplexityuserschedulingalgorithmforuplinkmultiusermimosystems AT malikw alowcomplexityuserschedulingalgorithmforuplinkmultiusermimosystems AT obriend alowcomplexityuserschedulingalgorithmforuplinkmultiusermimosystems AT edwardsd alowcomplexityuserschedulingalgorithmforuplinkmultiusermimosystems AT zhangy lowcomplexityuserschedulingalgorithmforuplinkmultiusermimosystems AT jic lowcomplexityuserschedulingalgorithmforuplinkmultiusermimosystems AT liuy lowcomplexityuserschedulingalgorithmforuplinkmultiusermimosystems AT malikw lowcomplexityuserschedulingalgorithmforuplinkmultiusermimosystems AT obriend lowcomplexityuserschedulingalgorithmforuplinkmultiusermimosystems AT edwardsd lowcomplexityuserschedulingalgorithmforuplinkmultiusermimosystems |