# Adaptive Phase Rolling for Opportunistic Beamforming in OFDMA Systems with a Small Number of Users

Authors: Minjoong Rim
Journal: The Scientific World Journal
 (2014)

---

## Abstract

The performance of opportunistic beamforming might be degraded if the number of users is small. This paper proposes an adaptive opportunistic beamforming technique for orthogonal frequency division multiple access systems, which can produce good results even with a small number of users. This paper also proposes a modified proportional fairness scheduling algorithm, which can further improve the performance of the proposed opportunistic beamforming technique.


---

## Body

## 1. Introduction

The throughput of a wireless communication system can be improved using scheduling if the number of users is large and the channels are sufficiently time-selective. A channel-aware scheduling technique tries to select and allocate a user with a good channel condition and the multiuser diversity effect is maximized with a large number of candidates for scheduling [1, 2]. If wireless channels are not time-varying, an opportunistic beamforming technique with random beamforming or phase rolling (phase rotations) can be applied to make the channels time-selective [3–10]. Opportunistic beamforming can be achieved by applying different random beamforming weights each time slot. However, for some cases, such discontinuous changes of channel states may degrade the performance of channel estimation or channel quality estimation. Continuous changes of the channel states can be implemented by multiplying continuously rotating phases to signals for some antennas. This paper discusses modifications to phase rolling techniques for improving the system throughputs.Although an opportunistic beamforming scheme needs only the channel quality information (CQI), it can produce a performance comparable to a transmit beamforming method, which requires the channel state information (CSI) [3–10]. However, the performance of an opportunistic beamforming technique can be degraded if the number of users is small since there will be too few users participating in scheduling and none of the candidate channels might be satisfactory. Several methods are proposed to improve the performance even with a small number of users [11–14]. In some methods, appropriate beamforming patterns are found from the previous time slots assuming that the channels vary very slowly [11, 12]. Such methods may require a large memory and produce good results only when the channels change slowly. In some other schemes, multiple minislots with different random beamforming are used for each time slot to generate multiple different channels and select the weighting factor with the largest channel quality for data transmissions [13, 14]. Although these schemes can produce good results, substantial modifications to the air interface may be required.While these methods are based on random beamforming, this paper proposes a simple opportunistic beamforming technique based on phase rolling for orthogonal frequency division multiple access (OFDMA) systems. The proposed technique is similar to conventional phase rolling schemes but adaptively changes the direction of phase rotations to produce satisfactory results even with a small number of users. This paper also proposes a modification to channel-aware scheduling algorithms to further improve the performance of the proposed opportunistic beamforming technique.The rest of this paper is organized as follows. Section2 describes the system model considered in this paper. Section 3 describes conventional methods including a transmit beamforming scheme, a phase rolling technique, and a proportional fairness scheduling algorithm. In Section 4, an adaptive phase rolling technique is proposed for improving the performance. Also, modification to the proportional fairness scheduling algorithm is presented. Simulation results are shown in Section 5 and conclusions are drawn in Section 6.


## 2. System Model

Suppose that a resource block (RB) of a downlink OFDMA system is composed of two-dimensional resource elements ofN
Subcarrier subcarriers and N
Symbol OFDM symbols (a time duration of N
Symbol OFDM symbols is called a time slot in this paper), and each RB includes dedicated pilots to obtain the CQI or CSI for the RB. The transmitter (base station) receives the CQI from M receivers (mobile stations) every time slot and performs scheduling with K RBs. This paper considers an OFDMA system with two transmit antennas with equal transmit power and one receive antenna per receiver. Although the proposed schemes as well as the conventional schemes can be extended to more than two antennas, only two transmit antennas are considered in this paper for simplicity of discussion. As shown in Figure 1, an opportunistic beamforming technique can be implemented by multiplying a time-varying weighting factor to each RB at the second antenna.Figure 1
OFDMA system with phase rolling.LetRB
k
(
i
) be the kth RB at the ith time slot. Assuming a time-flat and frequency-flat fading channel over a single RB, the received signal r
m
,
k
,
p
,
q
(
i
) at the qth subcarrier of the pth OFDM symbol in RB
k
(
i
) for the mth user can be written as
(1)
r
m
,
k
,
p
,
q
(
i
)
=
h
~
m
,
k
(
i
)
x
m
,
k
,
p
,
q
(
i
)
+
n
m
,
k
,
p
,
q
(
i
)
,
where x
m
,
k
,
p
,
q
(
i
) is the transmitted signal, w
k
(
i
)
(
|
w
k
(
i
)
|
=
1
) is the weighting factor for the second antenna, n
m
,
k
,
p
,
q
(
i
) is the corresponding noise, and the resulting channel h
~
m
,
k
(
i
) is
(2)
h
~
m
,
k
(
i
)
=
h
1
,
m
,
k
(
i
)
+
w
k
(
i
)
h
2
,
m
,
k
(
i
)
,
where h
1
,
m
,
k
(
i
) and h
2
,
m
,
k
(
i
) are the channels for the two antennas. The data rate of the mth user can be determined by the resulting channel energy, written as
(3)
|
h
~
m
,
k
(
i
)
|
2
=
|
h
1
,
m
,
k
(
i
)
+
w
k
(
i
)
h
2
,
m
,
k
(
i
)
|
2
=
|
h
1
,
m
,
k
(
i
)
|
2
+
|
h
2
,
m
,
k
(
i
)
|
2
+
2
|
h
1
,
m
,
k
(
i
)
|
|
h
2
,
m
,
k
(
i
)
|
cos
⁡
(
Θ
m
,
k
(
i
)
)
,
where Θ
m
,
k
(
i
) is the phase difference between the two channels w
k
(
i
)
h
2
,
m
,
k
(
i
) and h
1
,
m
,
k
(
i
), expressed as
(4)
Θ
m
,
k
(
i
)
≡
mod
⁡
(
∠
h
2
,
m
,
k
(
i
)
+
∠
w
k
(
i
)
-
∠
h
1
,
m
,
k
(
i
)
,
2
π
)
.In (4), mod
⁡
(
ϕ
,
2
π
) is the modulo operation, representing a phase ϕ as a value between 0 and 2
π, written as
(5)
mod
⁡
(
ϕ
,
2
π
)
≡
ϕ
-
⌊
ϕ
2
π
⌋
2
π
,
where ⌊
•
⌋ is the floor operation. The energy of the resulting channel, defined as |
h
~
m
,
k
(
i
)
|
2 in this paper, is maximized as
(6)
|
h
~
m
,
k
(
i
)
|
2
=
(
|
h
1
,
m
,
k
(
i
)
|
+
|
h
2
,
m
,
k
(
i
)
|
)
2
when Θ
m
,
k
(
i
) is near 0 or 2
π and minimized as
(7)
|
h
~
m
,
k
(
i
)
|
2
=
(
|
h
1
,
m
,
k
(
i
)
|
-
|
h
2
,
m
,
k
(
i
)
|
)
2
when Θ
m
,
k
(
i
) is around π.


## 3. Conventional Methods

### 3.1. Beamforming

If themth user is assigned to RB
k
(
i
) and the CSI is available at the transmitter, a beamforming technique can be applied and the weighting factor can be written as follows:
(8)
w
k
Beamforming
(
i
)
=
exp
⁡
(
j
(
∠
h
1
,
m
,
k
(
i
-
1
)
-
∠
h
2
,
m
,
k
(
i
-
1
)
)
)
.
Suppose that the channels are changing very slowly; in other words, h
1
,
m
,
k
(
i
-
1
)
≈
h
1
,
m
,
k
(
i
) and h
2
,
m
,
k
(
i
-
1
)
≈
h
2
,
m
,
k
(
i
). Then, the phase difference is written as
(9)
Θ
m
,
k
(
i
)
=
mod
⁡
(
∠
h
2
,
m
,
k
(
i
)
-
∠
h
1
,
m
,
k
(
i
)
k
k
k
k
+
∠
h
1
,
m
,
k
(
i
-
1
)
-
∠
h
2
,
m
,
k
(
i
-
1
)
,
2
π
)
≈
0
or
2
π
,
and the channel energy can be maximized. However, using the CSI at the transmitter requires substantial amount of feedback information from the receivers and may not be practical for some cases.


### 3.2. Phase Rolling

If the CSI is unknown but the CQI is available at the transmitter, multiuser diversity can be exploited by making the channel sufficiently time-selective using time-varying weighting factors [3, 4]. When a phase rolling technique is applied, the weighting factor w
k
(
i
) for RB
k
(
i
) can be written as
(10)
w
k
PhaseRolling
(
i
)
=
w
k
PhaseRolling
(
i
-
1
)
exp
⁡
(
j
θ
)
,
where j
2
=
-
1, θ determines the speed of the phase rotation, and the initial weighting factor w
k
(
0
) can be randomly chosen. Suppose that θ is very small compared to 2
π and the channels for the mth user are changing very slowly and thus h
1
,
m
,
k
(
i
+
n
)
≈
h
1
,
m
,
k
(
i
) and h
2
,
m
,
k
(
i
+
n
)
≈
h
2
,
m
,
k
(
i
) for n
=
1
,
…
,
[
2
π
/
θ
], where [
•
] is the rounding operation finding the nearest integer. The resulting phase difference for the mth user at the (
i
+
n
)th time slot can be written as
(11)
Θ
m
,
k
(
i
+
n
)
≈
mod
⁡
(
Θ
m
,
k
(
i
)
+
n
θ
,
2
π
)
for n
=
1
,
…
,
[
2
π
/
θ
]. The phase difference in (11) is continuously changing and the resulting channel in (3) is fluctuating in time as shown in Figure 2. The phase difference becomes near 0 or 2
π and the resulting channel energy is maximized when n
=
n
max
⁡, where
(12)
n
max
⁡
=
[
mod
⁡
(
2
π
-
Θ
m
,
k
(
i
)
,
2
π
)
θ
]
.
Similarly, the phase difference becomes near π and the resulting channel energy is minimized when n
=
n
min
⁡, where
(13)
n
min
⁡
=
[
mod
⁡
(
π
-
Θ
m
,
k
(
i
)
,
2
π
)
θ
]
.
If scheduling can be performed on time slots with good resulting channels most of the time, the performance of the phase rolling technique can be comparable to that of the beamforming.Figure 2
Channel energy by phase rolling.


### 3.3. Proportional Fairness Scheduling

One of the most popular scheduling methods for wireless communications is the proportional fairness (PF) algorithm [1, 2]. Using the PF algorithm, the scheduled user S
k
(
i
) for RB
k
(
i
) can be determined as
(14)
S
k
(
i
)
=
argmax
m
D
m
,
k
(
i
)
R
m
(
i
-
1
)
R
m
(
i
)
=
(
1
-
1
T
)
R
m
(
i
-
1
)
+
1
T
∑
k
=
1
M
δ
m
,
k
(
i
)
D
m
,
k
(
i
)
,
where D
m
,
k
(
i
) is the amount of data possibly transmitted to the mth user through RB
k
(
i
) obtained by the CQI feedback, R
m
(
i
) is the amount of recently received data by the mth user until the ith time slot, T is the window size to calculate R
m
(
i
), and δ
m
,
k
(
i
) is defined as
(15)
δ
m
,
k
(
i
)
≡
{
1
if
S
k
(
i
)
=
m
,
0
otherwise
.
Using the PF scheduling algorithm, the data amount actually transmitted through RB
k
(
i
), denoted as D
-
k
(
i
), is written as
(16)
D
-
k
(
i
)
=
D
S
k
(
i
)
,
k
(
i
)
.
Assuming that a data amount transmitted through an RB is proportional to the corresponding channel energy, in other words,
(17)
D
m
,
k
(
i
)
∝
|
h
~
m
,
k
(
i
)
|
2
,
there is a greater chance of scheduling when the channel energy becomes good. Since the PF scheduling with the phase rolling scheme selects near-best users among M users with random beamforming, its performance can be comparable to that of the transmit beamforming technique when the number of users M is very large. However, the scheduling performance might be degraded if the number of users is small since the choice needs to be made among a small number of candidates.


## 3.1. Beamforming

If themth user is assigned to RB
k
(
i
) and the CSI is available at the transmitter, a beamforming technique can be applied and the weighting factor can be written as follows:
(8)
w
k
Beamforming
(
i
)
=
exp
⁡
(
j
(
∠
h
1
,
m
,
k
(
i
-
1
)
-
∠
h
2
,
m
,
k
(
i
-
1
)
)
)
.
Suppose that the channels are changing very slowly; in other words, h
1
,
m
,
k
(
i
-
1
)
≈
h
1
,
m
,
k
(
i
) and h
2
,
m
,
k
(
i
-
1
)
≈
h
2
,
m
,
k
(
i
). Then, the phase difference is written as
(9)
Θ
m
,
k
(
i
)
=
mod
⁡
(
∠
h
2
,
m
,
k
(
i
)
-
∠
h
1
,
m
,
k
(
i
)
k
k
k
k
+
∠
h
1
,
m
,
k
(
i
-
1
)
-
∠
h
2
,
m
,
k
(
i
-
1
)
,
2
π
)
≈
0
or
2
π
,
and the channel energy can be maximized. However, using the CSI at the transmitter requires substantial amount of feedback information from the receivers and may not be practical for some cases.


## 3.2. Phase Rolling

If the CSI is unknown but the CQI is available at the transmitter, multiuser diversity can be exploited by making the channel sufficiently time-selective using time-varying weighting factors [3, 4]. When a phase rolling technique is applied, the weighting factor w
k
(
i
) for RB
k
(
i
) can be written as
(10)
w
k
PhaseRolling
(
i
)
=
w
k
PhaseRolling
(
i
-
1
)
exp
⁡
(
j
θ
)
,
where j
2
=
-
1, θ determines the speed of the phase rotation, and the initial weighting factor w
k
(
0
) can be randomly chosen. Suppose that θ is very small compared to 2
π and the channels for the mth user are changing very slowly and thus h
1
,
m
,
k
(
i
+
n
)
≈
h
1
,
m
,
k
(
i
) and h
2
,
m
,
k
(
i
+
n
)
≈
h
2
,
m
,
k
(
i
) for n
=
1
,
…
,
[
2
π
/
θ
], where [
•
] is the rounding operation finding the nearest integer. The resulting phase difference for the mth user at the (
i
+
n
)th time slot can be written as
(11)
Θ
m
,
k
(
i
+
n
)
≈
mod
⁡
(
Θ
m
,
k
(
i
)
+
n
θ
,
2
π
)
for n
=
1
,
…
,
[
2
π
/
θ
]. The phase difference in (11) is continuously changing and the resulting channel in (3) is fluctuating in time as shown in Figure 2. The phase difference becomes near 0 or 2
π and the resulting channel energy is maximized when n
=
n
max
⁡, where
(12)
n
max
⁡
=
[
mod
⁡
(
2
π
-
Θ
m
,
k
(
i
)
,
2
π
)
θ
]
.
Similarly, the phase difference becomes near π and the resulting channel energy is minimized when n
=
n
min
⁡, where
(13)
n
min
⁡
=
[
mod
⁡
(
π
-
Θ
m
,
k
(
i
)
,
2
π
)
θ
]
.
If scheduling can be performed on time slots with good resulting channels most of the time, the performance of the phase rolling technique can be comparable to that of the beamforming.Figure 2
Channel energy by phase rolling.


## 3.3. Proportional Fairness Scheduling

One of the most popular scheduling methods for wireless communications is the proportional fairness (PF) algorithm [1, 2]. Using the PF algorithm, the scheduled user S
k
(
i
) for RB
k
(
i
) can be determined as
(14)
S
k
(
i
)
=
argmax
m
D
m
,
k
(
i
)
R
m
(
i
-
1
)
R
m
(
i
)
=
(
1
-
1
T
)
R
m
(
i
-
1
)
+
1
T
∑
k
=
1
M
δ
m
,
k
(
i
)
D
m
,
k
(
i
)
,
where D
m
,
k
(
i
) is the amount of data possibly transmitted to the mth user through RB
k
(
i
) obtained by the CQI feedback, R
m
(
i
) is the amount of recently received data by the mth user until the ith time slot, T is the window size to calculate R
m
(
i
), and δ
m
,
k
(
i
) is defined as
(15)
δ
m
,
k
(
i
)
≡
{
1
if
S
k
(
i
)
=
m
,
0
otherwise
.
Using the PF scheduling algorithm, the data amount actually transmitted through RB
k
(
i
), denoted as D
-
k
(
i
), is written as
(16)
D
-
k
(
i
)
=
D
S
k
(
i
)
,
k
(
i
)
.
Assuming that a data amount transmitted through an RB is proportional to the corresponding channel energy, in other words,
(17)
D
m
,
k
(
i
)
∝
|
h
~
m
,
k
(
i
)
|
2
,
there is a greater chance of scheduling when the channel energy becomes good. Since the PF scheduling with the phase rolling scheme selects near-best users among M users with random beamforming, its performance can be comparable to that of the transmit beamforming technique when the number of users M is very large. However, the scheduling performance might be degraded if the number of users is small since the choice needs to be made among a small number of candidates.


## 4. Proposed Methods

### 4.1. Adaptive Phase Rolling

When the number of users is small, a user scheduled on an RB may have a greater chance to be scheduled on the same RB at the next time slot. If the same user is assigned to an RB for consecutive time slots, the phase rotation direction for the RB can be chosen to improve the performance of the user expecting that it might be scheduled on the same RB again at the next time slot. In the proposed adaptive phase rolling technique, the phase rotation direction for an RB is altered if the same user is scheduled on the RB for consecutive time slots and the data amount transmitted through the RB is decreased. Otherwise, it remains unchanged. Letd
k
(
i
) (= 1 or −1) be the phase rotation direction for RB
k
(
i
). In the proposed phase rolling technique, the weighting factor w
k
(
i
) for RB
k
(
i
) can be written as
(18)
w
k
Proposed
(
i
)
=
w
k
Proposed
(
i
-
1
)
exp
⁡
(
j
d
k
(
i
-
1
)
θ
)
,
d
k
(
i
)
=
{
-
d
k
(
i
-
1
)
if
S
k
(
i
)
=
S
k
(
i
-
1
)
,
D
-
k
(
i
)
<
D
-
k
(
i
-
1
)
d
k
(
i
-
1
)
otherwise
,
where the initial value of the phase rotation direction d
k
(
0
) is 1. Suppose that the same user is assigned to an RB over multiple consecutive time slots, the phase rotation direction is chosen to improve the performance, and the weighting factor in (18) will be updated toward the beamforming weighting factor in (8). If different users are scheduled on an RB every time, (18) becomes (10), resulting in the conventional phase rolling. The proposed method provides the multiuser diversity effect when the number of users is large and attempts to obtain the beamforming effect with a small number of users.Suppose thatθ is very small compared to 2
π; the mth user is repeatedly assigned to the kth RB, and the channels are varying very slowly and thus h
1
,
m
,
k
(
i
+
n
)
≈
h
1
,
m
,
k
(
i
) and h
2
,
m
,
k
(
i
+
n
)
≈
h
2
,
m
,
k
(
i
) for n
=
1
,
…
,
[
2
π
/
θ
]. The phase difference for the mth user at the (
i
+
1
)th time slot can be represented as
(19)
Θ
m
,
k
(
i
+
1
)
≈
mod
⁡
(
Θ
m
,
k
(
i
)
+
d
k
(
i
)
θ
,
2
π
)
and the difference between the channel energy values |
h
~
m
,
k
(
i
+
1
)
|
2 and |
h
~
m
,
k
(
i
)
|
2 can be written as follows:
(20)
|
h
~
m
,
k
(
i
+
1
)
|
2
-
|
h
~
m
,
k
(
i
)
|
2
≈
2
|
h
1
,
m
,
k
(
i
)
|
|
h
2
,
m
,
k
(
i
)
|
×
{
cos
⁡
(
Θ
m
,
k
(
i
)
+
d
k
(
i
)
θ
)
-
cos
⁡
(
Θ
m
,
k
(
i
)
)
}
.
Assuming that a data amount transmitted through an RB is proportional to the corresponding channel energy, the rotation direction d
k
(
i
+
1
) is determined as
(21)
when
0
<
Φ
m
,
k
(
i
)
<
π
d
k
(
i
+
1
)
=
{
-
d
k
(
i
)
if
d
k
(
i
)
=
1
d
k
(
i
)
otherwise
,
when
π
<
Φ
m
,
k
(
i
)
<
2
π
d
k
(
i
+
1
)
=
{
d
k
(
i
)
if
d
k
(
i
)
=
1
-
d
k
(
i
)
otherwise
,
when
Φ
m
,
k
(
i
)
=
0
or
π
d
k
(
i
+
1
)
=
d
k
(
i
)
,
where
(22)
Φ
m
,
k
(
i
)
=
mod
⁡
(
Θ
m
,
k
(
i
)
+
d
k
(
i
)
θ
2
,
2
π
)
.
Equation (21) can be simplified as
(23)
d
k
(
i
+
1
)
=
{
-
1
if
0
<
Φ
m
,
k
(
i
)
<
π
1
if
π
<
Φ
m
,
k
(
i
)
<
2
π
d
k
(
i
)
if
Φ
m
,
k
(
i
)
=
0
or
π
.
As shown in Figure 3, the rotation direction in the adaptive phase rolling scheme is chosen to increase the channel energy.Figure 3
Rotation directions by adaptive phase rolling.If|
h
~
m
,
k
(
i
+
1
)
|
2
<
|
h
~
m
,
k
(
i
)
|
2 and the rotation direction d
k
(
i
+
1
) at the (
i
+
1
)th time slot is changed to -
d
k
(
i
), then
(24)
Θ
m
,
k
(
i
+
2
)
≈
mod
⁡
(
Θ
m
,
k
(
i
+
1
)
+
d
k
(
i
+
1
)
θ
,
2
π
)
≈
mod
⁡
(
Θ
m
,
k
(
i
)
+
d
k
(
i
)
θ
+
d
k
(
i
+
1
)
θ
,
2
π
)
=
Θ
m
,
k
(
i
)
and thus
(25)
|
h
~
m
,
k
(
i
+
2
)
|
2
-
|
h
~
m
,
k
(
i
+
1
)
|
2
≈
|
h
~
m
,
k
(
i
)
|
2
-
|
h
~
m
,
k
(
i
+
1
)
|
2
<
0
.
Hence, the rotation direction at the (
i
+
2
)th time slot remains unchanged; in other words, d
k
(
i
+
2
)
=
d
k
(
i
+
1
). If |
h
~
m
,
k
(
i
+
1
)
|
2
≥
|
h
~
m
,
k
(
i
)
|
2 and the rotation direction d
k
(
i
+
1
) remains as d
k
(
i
), the direction d
k
(
i
+
n
) will be unchanged while 1
≤
n
≤
n
max
⁡, where
(26)
n
max
⁡
=
[
mod
⁡
(
2
π
-
d
k
(
i
)
Θ
m
,
k
(
i
)
,
2
π
)
θ
]
and the phase difference can be written as
(27)
Θ
m
,
k
(
i
+
n
)
≈
mod
⁡
(
Θ
m
,
k
(
i
)
+
n
d
k
(
i
)
θ
,
2
π
)
for 1
≤
n
≤
n
max
⁡
+
1. Since
(28)
n
max
⁡
d
k
(
i
)
θ
=
[
mod
⁡
(
2
π
-
d
k
(
i
)
Θ
m
,
k
(
i
)
,
2
π
)
θ
]
d
k
(
i
)
θ
≈
{
2
π
-
Θ
m
,
k
(
i
)
if
d
k
(
i
)
=
1
,
Θ
m
,
k
(
i
)
≠
0
-
Θ
m
,
k
(
i
)
otherwise
for a small θ, the phase difference at the (
n
max
⁡
)th time slot is written as
(29)
Θ
m
,
k
(
i
+
n
max
⁡
)
≈
mod
⁡
(
Θ
m
,
k
(
i
)
+
n
max
⁡
d
k
(
i
)
θ
,
2
π
)
≈
0
or
2
π
and the channel energy is maximized. Similarly, the phase difference at the (
n
max
⁡
+
1
)th time slot can be approximated as
(30)
Θ
m
,
k
(
i
+
n
max
⁡
+
1
)
≈
mod
⁡
(
Θ
m
,
k
(
i
)
+
n
max
⁡
d
k
(
i
)
θ
+
d
k
(
i
)
θ
,
2
π
)
≈
θ
or
2
π
-
θ
and the rotation direction is altered; in other words, d
k
(
i
+
n
max
⁡
+
1
)
=
-
d
k
(
i
+
n
max
⁡
). After the channel energy reaches the maximum, the rotation direction is repeatedly altered so that the phase difference between the two channels remains very small. Hence, the resulting channel energy will stay around the maximum point, producing system performance close to that obtained by the beamforming in (8).


### 4.2. Modified Proportional Fairness Scheduling

The proposed method in (18) is useful when the same user is assigned to an RB over multiple consecutive time slots. In order to further improve the performance of the proposed technique, the PF algorithm in (14) can be modified. There can be many methods to achieve this and one simple modification to the PF algorithm is, for each RB, to give a slightly higher priority to the user scheduled on the RB in the previous time slot. In the modified PF algorithm, the scheduled user S
k
Modified
PF
(
i
) for RB
k
(
i
) can be determined as
(31)
S
k
Modifed
PF
(
i
)
=
argmax
m
(
1
+
α
δ
m
,
k
(
i
-
1
)
)
D
m
,
k
(
i
)
R
m
(
i
-
1
)
,
where α is the weighting factor to give a higher priority to user S
k
Modified
PF
(
i
-
1
).


## 4.1. Adaptive Phase Rolling

When the number of users is small, a user scheduled on an RB may have a greater chance to be scheduled on the same RB at the next time slot. If the same user is assigned to an RB for consecutive time slots, the phase rotation direction for the RB can be chosen to improve the performance of the user expecting that it might be scheduled on the same RB again at the next time slot. In the proposed adaptive phase rolling technique, the phase rotation direction for an RB is altered if the same user is scheduled on the RB for consecutive time slots and the data amount transmitted through the RB is decreased. Otherwise, it remains unchanged. Letd
k
(
i
) (= 1 or −1) be the phase rotation direction for RB
k
(
i
). In the proposed phase rolling technique, the weighting factor w
k
(
i
) for RB
k
(
i
) can be written as
(18)
w
k
Proposed
(
i
)
=
w
k
Proposed
(
i
-
1
)
exp
⁡
(
j
d
k
(
i
-
1
)
θ
)
,
d
k
(
i
)
=
{
-
d
k
(
i
-
1
)
if
S
k
(
i
)
=
S
k
(
i
-
1
)
,
D
-
k
(
i
)
<
D
-
k
(
i
-
1
)
d
k
(
i
-
1
)
otherwise
,
where the initial value of the phase rotation direction d
k
(
0
) is 1. Suppose that the same user is assigned to an RB over multiple consecutive time slots, the phase rotation direction is chosen to improve the performance, and the weighting factor in (18) will be updated toward the beamforming weighting factor in (8). If different users are scheduled on an RB every time, (18) becomes (10), resulting in the conventional phase rolling. The proposed method provides the multiuser diversity effect when the number of users is large and attempts to obtain the beamforming effect with a small number of users.Suppose thatθ is very small compared to 2
π; the mth user is repeatedly assigned to the kth RB, and the channels are varying very slowly and thus h
1
,
m
,
k
(
i
+
n
)
≈
h
1
,
m
,
k
(
i
) and h
2
,
m
,
k
(
i
+
n
)
≈
h
2
,
m
,
k
(
i
) for n
=
1
,
…
,
[
2
π
/
θ
]. The phase difference for the mth user at the (
i
+
1
)th time slot can be represented as
(19)
Θ
m
,
k
(
i
+
1
)
≈
mod
⁡
(
Θ
m
,
k
(
i
)
+
d
k
(
i
)
θ
,
2
π
)
and the difference between the channel energy values |
h
~
m
,
k
(
i
+
1
)
|
2 and |
h
~
m
,
k
(
i
)
|
2 can be written as follows:
(20)
|
h
~
m
,
k
(
i
+
1
)
|
2
-
|
h
~
m
,
k
(
i
)
|
2
≈
2
|
h
1
,
m
,
k
(
i
)
|
|
h
2
,
m
,
k
(
i
)
|
×
{
cos
⁡
(
Θ
m
,
k
(
i
)
+
d
k
(
i
)
θ
)
-
cos
⁡
(
Θ
m
,
k
(
i
)
)
}
.
Assuming that a data amount transmitted through an RB is proportional to the corresponding channel energy, the rotation direction d
k
(
i
+
1
) is determined as
(21)
when
0
<
Φ
m
,
k
(
i
)
<
π
d
k
(
i
+
1
)
=
{
-
d
k
(
i
)
if
d
k
(
i
)
=
1
d
k
(
i
)
otherwise
,
when
π
<
Φ
m
,
k
(
i
)
<
2
π
d
k
(
i
+
1
)
=
{
d
k
(
i
)
if
d
k
(
i
)
=
1
-
d
k
(
i
)
otherwise
,
when
Φ
m
,
k
(
i
)
=
0
or
π
d
k
(
i
+
1
)
=
d
k
(
i
)
,
where
(22)
Φ
m
,
k
(
i
)
=
mod
⁡
(
Θ
m
,
k
(
i
)
+
d
k
(
i
)
θ
2
,
2
π
)
.
Equation (21) can be simplified as
(23)
d
k
(
i
+
1
)
=
{
-
1
if
0
<
Φ
m
,
k
(
i
)
<
π
1
if
π
<
Φ
m
,
k
(
i
)
<
2
π
d
k
(
i
)
if
Φ
m
,
k
(
i
)
=
0
or
π
.
As shown in Figure 3, the rotation direction in the adaptive phase rolling scheme is chosen to increase the channel energy.Figure 3
Rotation directions by adaptive phase rolling.If|
h
~
m
,
k
(
i
+
1
)
|
2
<
|
h
~
m
,
k
(
i
)
|
2 and the rotation direction d
k
(
i
+
1
) at the (
i
+
1
)th time slot is changed to -
d
k
(
i
), then
(24)
Θ
m
,
k
(
i
+
2
)
≈
mod
⁡
(
Θ
m
,
k
(
i
+
1
)
+
d
k
(
i
+
1
)
θ
,
2
π
)
≈
mod
⁡
(
Θ
m
,
k
(
i
)
+
d
k
(
i
)
θ
+
d
k
(
i
+
1
)
θ
,
2
π
)
=
Θ
m
,
k
(
i
)
and thus
(25)
|
h
~
m
,
k
(
i
+
2
)
|
2
-
|
h
~
m
,
k
(
i
+
1
)
|
2
≈
|
h
~
m
,
k
(
i
)
|
2
-
|
h
~
m
,
k
(
i
+
1
)
|
2
<
0
.
Hence, the rotation direction at the (
i
+
2
)th time slot remains unchanged; in other words, d
k
(
i
+
2
)
=
d
k
(
i
+
1
). If |
h
~
m
,
k
(
i
+
1
)
|
2
≥
|
h
~
m
,
k
(
i
)
|
2 and the rotation direction d
k
(
i
+
1
) remains as d
k
(
i
), the direction d
k
(
i
+
n
) will be unchanged while 1
≤
n
≤
n
max
⁡, where
(26)
n
max
⁡
=
[
mod
⁡
(
2
π
-
d
k
(
i
)
Θ
m
,
k
(
i
)
,
2
π
)
θ
]
and the phase difference can be written as
(27)
Θ
m
,
k
(
i
+
n
)
≈
mod
⁡
(
Θ
m
,
k
(
i
)
+
n
d
k
(
i
)
θ
,
2
π
)
for 1
≤
n
≤
n
max
⁡
+
1. Since
(28)
n
max
⁡
d
k
(
i
)
θ
=
[
mod
⁡
(
2
π
-
d
k
(
i
)
Θ
m
,
k
(
i
)
,
2
π
)
θ
]
d
k
(
i
)
θ
≈
{
2
π
-
Θ
m
,
k
(
i
)
if
d
k
(
i
)
=
1
,
Θ
m
,
k
(
i
)
≠
0
-
Θ
m
,
k
(
i
)
otherwise
for a small θ, the phase difference at the (
n
max
⁡
)th time slot is written as
(29)
Θ
m
,
k
(
i
+
n
max
⁡
)
≈
mod
⁡
(
Θ
m
,
k
(
i
)
+
n
max
⁡
d
k
(
i
)
θ
,
2
π
)
≈
0
or
2
π
and the channel energy is maximized. Similarly, the phase difference at the (
n
max
⁡
+
1
)th time slot can be approximated as
(30)
Θ
m
,
k
(
i
+
n
max
⁡
+
1
)
≈
mod
⁡
(
Θ
m
,
k
(
i
)
+
n
max
⁡
d
k
(
i
)
θ
+
d
k
(
i
)
θ
,
2
π
)
≈
θ
or
2
π
-
θ
and the rotation direction is altered; in other words, d
k
(
i
+
n
max
⁡
+
1
)
=
-
d
k
(
i
+
n
max
⁡
). After the channel energy reaches the maximum, the rotation direction is repeatedly altered so that the phase difference between the two channels remains very small. Hence, the resulting channel energy will stay around the maximum point, producing system performance close to that obtained by the beamforming in (8).


## 4.2. Modified Proportional Fairness Scheduling

The proposed method in (18) is useful when the same user is assigned to an RB over multiple consecutive time slots. In order to further improve the performance of the proposed technique, the PF algorithm in (14) can be modified. There can be many methods to achieve this and one simple modification to the PF algorithm is, for each RB, to give a slightly higher priority to the user scheduled on the RB in the previous time slot. In the modified PF algorithm, the scheduled user S
k
Modified
PF
(
i
) for RB
k
(
i
) can be determined as
(31)
S
k
Modifed
PF
(
i
)
=
argmax
m
(
1
+
α
δ
m
,
k
(
i
-
1
)
)
D
m
,
k
(
i
)
R
m
(
i
-
1
)
,
where α is the weighting factor to give a higher priority to user S
k
Modified
PF
(
i
-
1
).


## 5. Simulation Results

In this section, the transmit beamforming in (8), conventional phase rolling in (10), and proposed adaptive phase rolling in (18) techniques are compared with the PF in (14) and modified PF scheduling algorithms in (31). Simulations are performed with 16 RBs and varying the number of users from 1 to 24. Equal power allocation to the antennas is assumed and the delay from CQI estimation to actual scheduling is ignored. The detailed simulation parameters are shown in Table 1.Table 1
Simulation parameters.
Parameters
Values
Sampling frequency
1 MHz
FFT size
128
Cyclic prefix length
16 samples
Number of users (M)
1~24
Number of resource blocks (K)
16
Number of OFDM symbols in RB (N
Symbol)
1
Number of subcarriers in RB (N
Subcarrier)
8
Carrier frequency
2 GHz
Mobility of users
3 Km/h
Channel power-delay-profile distribution
Exponential
Root-mean-square delay spread
0.67μs
Channel signal-to-noise ratio
10 dB
Phase rotation speed (θ)
2
π
×
0.02
Scheduling algorithm
Proportional fairness
Window size (T)
4
Weighting factor (α)
0.1Figure4 illustrates the phase trajectories of the second antenna with a single user. Only the first RB is monitored. While the phase of the second antenna is moved to one direction by the conventional phase rolling technique, the proposed scheme adaptively changes the phase rotation direction and can produce near-optimal phases after initialization of a few time slots. Figure 5 represents the resulting channel energy produced by the beamforming, conventional phase rolling, and proposed techniques. While the conventional phase rolling technique makes the resulting channel fluctuate, the proposed scheme produces results similar to those by the transmit beamforming technique.Figure 4
Phase of the second antenna.Figure 5
Resulting channel energy.Figure6 illustrates the aggregated data rates with the PF scheduling algorithm. The proposed technique performs similarly to the conventional phase rolling technique when the number of users is large and close to the transmit beamforming with a small number of users. The conventional phase rolling technique produces good results only when the number of users is large but the proposed technique is useful regardless of the number of users. Figure 7 shows the aggregated data rates with the modified PF scheduling algorithm. The improvement of the proposed technique using the modified PF algorithm is noticeable since the proposed technique is effective when the same user is allocated to an RB over multiple consecutive time slots.Figure 6
Data rates with the PF scheduling algorithm.Figure 7
Data rates with the modified PF scheduling algorithm.


## 6. Conclusion

When scheduling is performed with RBs in OFDMA systems, an opportunistic beamforming technique with a phase rolling technique can make the channels time-selective and produce good results with a large number of users. However, its performance may be degraded with a small number of users since there are insufficient candidates for scheduling. This paper proposes a modified phase rolling technique, whose phase rolling direction is changed adaptively to achieve the beamforming effect especially when the number of users is small. The performance improvement of the proposed technique is noticeable especially with the modified PF algorithm, where there is a greater chance that the same user is assigned to an RB over multiple consecutive time slots.



---

*Source: 625421-2014-04-14.xml*