Low complexity scheduling algorithm for the downlink of distributed antenna systems
In this paper we present a low-complexity user selection algorithm for the downlink of a distributed antenna system (DAS) that achieves an optimum solution for a weighted matching problem. The user selection process is modeled as a linear sum assignment problem (LSAP). The proposed solution consists...
| Autor principal: | |
|---|---|
| Outros Autores: | , |
| Formato: | conferenceObject |
| Idioma: | eng |
| Publicado em: |
2015
|
| Texto completo: | http://hdl.handle.net/10773/13582 |
| País: | Portugal |
| Oai: | oai:ria.ua.pt:10773/13582 |