2011 IEEE International Conference on Communications (ICC) 2011
DOI: 10.1109/icc.2011.5962572
|View full text |Cite
|
Sign up to set email alerts
|

Combined User Pairing and Spectrum Allocation for Multiuser SC-FDMA Transmission

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 18 publications
(15 citation statements)
references
References 12 publications
0
11
0
Order By: Relevance
“…(2), (6), and (7), we can obtain the effective capacity of User 2 and User 1 when using the non-collaborative V-MIMO transmission, denoted by C 2S (P 1 (ν 1 ), P 2 (ν), θ) and C 1S (P 1 (ν 1 ), P 2 (ν), θ), respectively, as (12) and…”
Section: A Optimization Problem Formulation For Qos-guaranteed Non-cmentioning
confidence: 99%
See 1 more Smart Citation
“…(2), (6), and (7), we can obtain the effective capacity of User 2 and User 1 when using the non-collaborative V-MIMO transmission, denoted by C 2S (P 1 (ν 1 ), P 2 (ν), θ) and C 1S (P 1 (ν 1 ), P 2 (ν), θ), respectively, as (12) and…”
Section: A Optimization Problem Formulation For Qos-guaranteed Non-cmentioning
confidence: 99%
“…If the number of receive antennas on the BS is equal to or larger than the number of transmitting single-antenna users, the multiple data flows from different single-antenna users can be decoded at the BS. This kind of transmission is called as the virtual-MIMO (V-MIMO) transmission in the uplink [10]- [12]. For current popular V-MIMO wireless cellular networks, such as the V-MIMO in Long Term Evolution (LTE), there is no collaboration among mobile users.…”
Section: Introductionmentioning
confidence: 99%
“…The problem of joint user pairing and radio frequency assignment without QoS constraints has been studied in several papers before [3]- [6]. In [3] a reduced-complexity iterative algorithm for minimization of the total block error rate was proposed.…”
Section: Introductionmentioning
confidence: 99%
“…Let us denote by R * n,k , the maximum achievable rate by each user k over chunk n, obtained from (10). Then, (7) becomes…”
Section: Joint Power and Chunk Allocationmentioning
confidence: 99%
“…In [9], another modification of the greedy algorithm of [3], called maximum greedy algorithm was proposed. In [10], a virtual multiple input multiple output (V-MIMO) model was used and assuming that two users transmit their data in the same time slot and frequency band, a combination of the Hungarian algorithm and the binary switching algorithm for chunk allocation was proposed.…”
Section: Introductionmentioning
confidence: 99%