Low-complexity user selection for rate maximization in MIMO broadcast channels with downlink beamforming
Autor(a) principal: | |
---|---|
Data de Publicação: | 2014 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10773/12525 |
Resumo: | We present in this work a low-complexity algorithm to solve the sum rate maximization problem in multiuser MIMO broadcast channels with downlink beamforming. Our approach decouples the user selection problem from the resource allocation problem and its main goal is to create a set of quasiorthogonal users. The proposed algorithm exploits physical metrics of the wireless channels that can be easily computed in such a way that a null space projection power can be approximated efficiently. Based on the derived metrics we present a mathematical model that describes the dynamics of the user selection process which renders the user selection problem into an integer linear program. Numerical results show that our approach is highly efficient to form groups of quasiorthogonal users when compared to previously proposed algorithms in the literature. Our user selection algorithm achieves a large portion of the optimum user selection sum rate (90%) for a moderate number of active users. |
id |
RCAP_bf86cf65ea66b1056737eb09f653bd06 |
---|---|
oai_identifier_str |
oai:ria.ua.pt:10773/12525 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Low-complexity user selection for rate maximization in MIMO broadcast channels with downlink beamformingWe present in this work a low-complexity algorithm to solve the sum rate maximization problem in multiuser MIMO broadcast channels with downlink beamforming. Our approach decouples the user selection problem from the resource allocation problem and its main goal is to create a set of quasiorthogonal users. The proposed algorithm exploits physical metrics of the wireless channels that can be easily computed in such a way that a null space projection power can be approximated efficiently. Based on the derived metrics we present a mathematical model that describes the dynamics of the user selection process which renders the user selection problem into an integer linear program. Numerical results show that our approach is highly efficient to form groups of quasiorthogonal users when compared to previously proposed algorithms in the literature. Our user selection algorithm achieves a large portion of the optimum user selection sum rate (90%) for a moderate number of active users.Hindawi2014-07-28T09:08:11Z2014-01-01T00:00:00Z2014-01-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10773/12525eng1537-744X10.1155/2014/865905Castañeda, EduardoSilva, AdãoRobles, RamiroGameiro, Atílioinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-02-22T11:22:51Zoai:ria.ua.pt:10773/12525Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T02:48:41.466181Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Low-complexity user selection for rate maximization in MIMO broadcast channels with downlink beamforming |
title |
Low-complexity user selection for rate maximization in MIMO broadcast channels with downlink beamforming |
spellingShingle |
Low-complexity user selection for rate maximization in MIMO broadcast channels with downlink beamforming Castañeda, Eduardo |
title_short |
Low-complexity user selection for rate maximization in MIMO broadcast channels with downlink beamforming |
title_full |
Low-complexity user selection for rate maximization in MIMO broadcast channels with downlink beamforming |
title_fullStr |
Low-complexity user selection for rate maximization in MIMO broadcast channels with downlink beamforming |
title_full_unstemmed |
Low-complexity user selection for rate maximization in MIMO broadcast channels with downlink beamforming |
title_sort |
Low-complexity user selection for rate maximization in MIMO broadcast channels with downlink beamforming |
author |
Castañeda, Eduardo |
author_facet |
Castañeda, Eduardo Silva, Adão Robles, Ramiro Gameiro, Atílio |
author_role |
author |
author2 |
Silva, Adão Robles, Ramiro Gameiro, Atílio |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
Castañeda, Eduardo Silva, Adão Robles, Ramiro Gameiro, Atílio |
description |
We present in this work a low-complexity algorithm to solve the sum rate maximization problem in multiuser MIMO broadcast channels with downlink beamforming. Our approach decouples the user selection problem from the resource allocation problem and its main goal is to create a set of quasiorthogonal users. The proposed algorithm exploits physical metrics of the wireless channels that can be easily computed in such a way that a null space projection power can be approximated efficiently. Based on the derived metrics we present a mathematical model that describes the dynamics of the user selection process which renders the user selection problem into an integer linear program. Numerical results show that our approach is highly efficient to form groups of quasiorthogonal users when compared to previously proposed algorithms in the literature. Our user selection algorithm achieves a large portion of the optimum user selection sum rate (90%) for a moderate number of active users. |
publishDate |
2014 |
dc.date.none.fl_str_mv |
2014-07-28T09:08:11Z 2014-01-01T00:00:00Z 2014-01-01 |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10773/12525 |
url |
http://hdl.handle.net/10773/12525 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
1537-744X 10.1155/2014/865905 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Hindawi |
publisher.none.fl_str_mv |
Hindawi |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799137538040922112 |