2010/12/02 by Umer Salim, Salim, Umer, Dirk Slock +1
Computer Science · Engineering · #Advanced MIMO Systems Optimization #Cooperative Communication and Network Coding #Energy Harvesting in Wireless Networks #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Networks Research
paper · pdf · doi:10.48550/arxiv.1012.0452
openalex publication_date 2010/12/02 · openalex created_date 2022/10/04 · openalex updated_date 2026/07/28
In multi-user communication from one base station (BS) to multiple users, the\nproblem of minimizing the transmit power to achieve some target guaranteed\nperformance (rates) at users has been well investigated in the literature.\nSimilarly various user selection algorithms have been proposed and analyzed\nwhen the BS has to transmit to a subset of the users in the system, mostly for\nthe objective of the sum rate maximization.\n We study the joint problem of minimizing the transmit power at the BS to\nachieve specific signal-to-interference-and-noise ratio (SINR) targets at users\nin conjunction with user scheduling. The general analytical results for the\naverage transmit power required to meet guaranteed performance at the users'\nside are difficult to obtain even without user selection due to joint\noptimization required over beamforming vectors and power allocation scalars. We\nstudy the transmit power minimization problem with various user selection\nalgorithms, namely semi-orthogonal user selection (SUS), norm-based user\nselection (NUS) and angle-based user selection (AUS). When the SINR targets to\nachieve are relatively large, the average minimum transmit power expressions\nare derived for NUS and SUS for any number of users. For the special case when\nonly two users are selected, similar expressions are further derived for AUS\nand a performance upper bound which serves to benchmark the performance of\nother selection schemes. Simulation results performed under various settings\nindicate that SUS is by far the better user selection criterion.\n