MULTIUSER RECEIVER FOR PUCCH SIGNALING WITH TRANSMIT DIVERSITY

Icaro L. J. da Silva
(1)
and Andr e L. F. de Almeida
(2)
(1)
Ericsson Research, Ericsson AB, Stockholm, Sweden.
(2)
GTEL-Wireless Telecom Research Group, Federal University of Cear a, Fortaleza, Brazil.
E-mails: icaro.leonardo.da.silva.@ericsson.com, andre@gtel.ufc.br
ABSTRACT
This paper deals with a transmit diversity scheme to be applied
in multiple-antenna signaling over the physical uplink control
channel (PUCCH) of 3GPP LTE-Advanced (Release 10). Taking
into account the signaling structure of this system, we show that
received signal at the base station can be modeled using a tensor
decomposition with constraints imposed on the control symbol
matrix. By exploiting the proposed tensor model and its known
structure, a receiver for joint multiuser channel estimation and
detection is presented. The receiver is based on a semi-blind
algorithm, by using known reference control symbols at the rst
iteration, and then proceeding with a data-aided channel and symbol
estimation in subsequent iterations. Numerical results from Monte
Carlo simulations are provided for performance assessment.
1. INTRODUCTION
The Format 1 of the physical uplink control channel (PUCCH)
of 3GPP LTE is associated with the transmission of hybrid
automate repeat request (ARQ) acknowledgements (ACK/NACK)
and scheduling requests. More specically, when packets are
erroneously received in the uplink, the user equipment (UE)
requests successive retransmissions by transmitting ACK/NACK
messages. In PUCCH Format 1, multiple UEs share the same
time-frequency physical resources. Within each cell, the UEs are
code-division multiplexed in the frequency domain using a spreading
code composed by phase-rotated versions of a cell-specic base
sequence. Under ideal channel conditions, this code design ensures
orthogonality between UEs within the same cell. However, since
base sequences of different cells have low but still non-zero cross
correlations, inter-cell interference (ICI) is still present and may
signicantly degrade signal detection over PUCCH.
The Release 10 of the long term evolution (LTE) standard, also
known as LTE-Advanced, targets signicantly increased peak data
rates up to 500 Mbps in the uplink [1]. In order to achieve this
peak rates, multiple-input multiple-output (MIMO) congurations
has been assumed in the uplink [2]. Given the availability
of multiple transmit antennas at the UE, possible open-loop
transmit diversity schemes for both the data and control channels
are being considered by 3GPP. In PUCCH, recent discussions
about two-antenna transmit diversity schemes have been reported
in a number of contributions. Among the candidate schemes,
space-orthogonal transmit diversity (SORTD) is the 3GPPs choice
[3]. In the SORTD scheme, each transmit antenna is associated with
one orthogonal resource to transmit control information. When the

The author is partially supported by Pronex/Funcap (Proc. 21.01.00/08)

and CNPq/Brazil (Proc. 303238/2010-0).
same control information is transmitted from different antennas by
using different orthogonal-resources, a transmit diversity gain can be
achieved [3].
Recently, semi-blind multi-user receivers have been proposed
to improve the error performance in PUCCH signaling for LTE
systems [47]. In [4] and [5], only single-cell scenarios have been
considered, meaning that ICI is not taken into account. In [6],
a multi-user receiver designed to reduce ICI has been proposed
for cell-cooperative scenarios. This receiver has been extended
to a non-cooperative scenario in a recent work [7]. All these
contributions rely on constrained tensor models, which are special
cases of the constrained factor model originally proposed in [8].
All these works are restricted to single-antenna transmissions in the
uplink.
In this paper, we propose a semi-blind multiuser receiver for
transmit diversity based PUCCH signaling in a multi-cell MIMO
system. By taking into account the signaling structure of SORTD
in PUCCH signaling, we show that received signal model follows
a tensor decomposition with constraints. These constraints are
imposed on the control symbol matrix, and are modeled by means
of a time-spreading matrix containing the cover sequences and a
space-spreading matrix that models spreading of control symbols
across transmit antennas. By exploiting the proposed tensor model
and its known structure, we propose a receiver algorithm for joint
multiuser channel estimation that provides improved performance
over the conventional time-frequency decorrelator/maximal ratio
combiner receiver.
The rest of this paper is organized as follows. In Section 2, the
system model is presented. Section 3 formulates the received signal
in PUCCH signaling as a tensor decomposition of constraints. In
Section 4, the semi-blind receiver algorithm is described. Numerical
results are given in Section 5 and the paper is concluded in Section 6.
2. SYSTEM MODEL
2.1. System overview
The physical resources of uplink LTE are dened in terms of
resource blocks of P = 12 subcarriers and time-slots of duration
0.5ms. A subframe consists of L = 2 time-slots, each of which
transmits N = 7 single-carrier frequency-domain multiple access
(SC-FDMA) symbols. The PUCCH consists of 2 resource blocks
distributed at the edges of the total uplink bandwidth. In order to
provide frequency diversity, frequency hopping is applied across slot
boundaries. Assuming the use of a normal cyclic prex (CP), there
are 3 (out of 7) SC-FDMA symbols used as reference symbols in
each slot for channel estimation purposes [9].
The time-frequency transmission structure of PUCCH Format
1 is depicted in Fig. 1. The ACK/NACK bits are converted into
2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications
978-1-4244-9332-6/11/$26.00 2011 IEEE 481
DS: Data Symbols
RS: Reference Symbols
1 2 3 4 5 6 7
8 9 10 11 12 13 14
1
(frequency spreading)
slot 2
slot 1
PSK mod.
1 or 2 bits
IFFT IFFT IFFT IFFT IFFT IFFT IFFT
IFFT IFFT IFFT IFFT IFFT IFFT IFFT
a
1 1 1
1 1 1
base sequence
phase rotation
U
L
B
a
n
d
w
i
d
t
h
ACK/NACK
1 subframe = 14 SC-OFDMsymbols
Fig. 1. Time-frequency structure of PUCCH Format 1
one BPSK/QPSK symbol denoted here by a. For slots 1 and 2,
this symbol is converted into 4 SC-FDMA data symbols. The data
symbols correspond to the symbol indices n = 1, 2, 6, 7 for slot 1
and n = 8, 9, 13, 14 for slot 2. Each slot is completed by adding
3 reference symbols (composed by 1s) which are known at the
receiver side.
For a particular terminal, each SC-FDMA symbol is generated
by spreading the modulated symbol across the P = 12 subcarriers
allocated to the PUCCH, i.e., by multiplying the corresponding
symbol (a or 1) by a length-12 coding sequence designed from a
base sequence assigned for each cell ID. The signals transmitted by
different UEs are code division multiplexed in time and frequency
domains. The time-domain sequences can be either a length-3
discrete time Fourier (DFT) sequence or a length-4 Walsh-Hadamard
(WH) sequence, while the frequency-domain sequences are phase
rotated versions of the cell-specic base sequence [10]. For
simplicity, in this work we assume that the R terminals use the
same time-domain cover sequence, implying that their signals are
multiplexed in the frequency domain only.
In 3GPP LTE-Advanced specications, transmit diversity can be
used in PUCCH signaling in order to add resilience against fading
and to improve performance by providing spatial diversity gains. It
is implemented by means of the so-called space-orthogonal resource
transmit diversity (SORTD). The idea behind SORTD is to allocate
different PUCCH resources to different transmit antennas of the
same UE. More specically, the same control modulation symbol
associated with the r-th terminal is spread across Mr transmit
antennas and P subcarriers using orthogonal resources. Note also
that different multiple-antenna signals emitted by different UEs
within the same cell are also mutually orthogonal under normal
operating conditions.
2.2. Baseline signal model
Let us dene H
(r)
l
.
= [h
(r,1)
l
, . . . , h
(r,Mr)
l
] C
KMr
, as the r-th
MIMO channel associated the l-th time-slot, linking Mr transmit
antennas to K receive antennas at the base station. In this work,
we assume a frequency-domain independent MIMO channel, which
implies that the subcarriers allocated to PUCCH signaling are
associated with the same channel fading coefcient. Dene W
(r)
.
=
[w
(r,1)
, . . . , w
(r,Mr)
] C
12Mr
as the coding matrix that collects
Mr length-12 orthogonal coding sequences allocated to the r-th
user, and let
s
(r) .
=
_
_
_
_
_
_
_
_
_
_
_
s
(r)
1
s
(r)
2
s
(r)
3
s
(r)
4
s
(r)
5
s
(r)
6
s
(r)
7
_

_
=
_
_
_
_
_
_
_
_
_
ar
ar
1
1
1
ar
ar
_

_
. .
control symbols

_
_
_
_
_
_
_
_
_
1
2
1
2
3
3
4
_

_
. .
cover sequence
C
7
(1)
be the symbol vector transmitted by the r-th terminal in time-slots 1
and 2, which is given by the Hadamard product of the control symbol
vector and the time-domain cover sequence vector. The control
symbol vector is composed of 4 data symbols (ars) and 3 reference
symbols (1s). The cover sequence vector is a combination of
two orthogonal sequences {1, 2, 3, 4} and {1, 2 3}, which
correspond, respectively, to length-4 DFT sequences and to length-3
WH sequences [10]. In this work, we assume that the UEs use the
same cover sequence.
The space-frequency encoding of the n-th transmitted symbol of
the r-th user is given by:
U
(r)
n
= s
(r)
n
W
(r)
C
PMr
. (2)
After cyclic prex (CP) removal, frequency-domain conversion by
fast Fourier transform (FFT) and subcarrier demapping, we can
write the space-frequency received signal matrix X
n,l
C
PK
associated with the n-th symbol of the l-th slot as:
X
n,l
=
R

r=1
U
(r)
n
H
(r)T
l
=
R

r=1
s
(r)
n
W
(r)
H
(r)T
l
, (3)
n = 1, . . . , 7, l = 1, 2. It can be seen in (3) that each control symbol
s
(r)
n is spread across P subcarriers and loaded into Mr transmit
spatial channels after multiplication by the coding matrix W
(r)
.
Note that this encoding operation is valid for both time-slots (i.e.
l = 1 and l = 2), since the same ACK/NACK modulation symbol is
repeated in both slots, as shown in Figure 1.
In the next section, we recast the received signal model using
a tensorial formalism. We show that the received signal can be
modeled as a third-order tensor, the dimensions of which correspond
to the number of symbols per slot the number of subcarriers
the number of receive antennas/time-slots. The modeling
approach introduced in the next section will be later exploited
for receiver processing, where a joint multiuser multiple-antenna
channel estimation and symbol recovery algorithm is presented.
3. TENSOR MODELING OF PUCCH SIGNALING WITH
TRANSMIT DIVERSITY
Dene the augmented (space-time) MIMO channel matrix

H
(r) .
=
_
H
(r)
1
H
(r)
2
_
C
2KMr
, (4)
which stacks column-wise the MIMO channel matrices associated
with both time-slots. The matrix

H
(r)
can be viewed as an
482
equivalent MIMO channel with 2K virtual receive antennas and
Mr transmit antennas. Let M =

R
r=1
Mr denote the total
number of co-channel signals (i.e. summed over all the R terminals)
contributing to the received signal at the base-station antenna array.
The overall multiuser/multi-antenna channel and coding matrices
and the multiuser symbol matrix can be respectively, dened as
H
.
= [

H
(1)
, . . . ,

H
(R)
] C
2KM
(5)
W
.
= [W
(1)
, . . . , W
(R)
] C
12M
(6)
S
.
= [s
(1)
, . . . , s
(R)
] C
7R
. (7)
Let us dene the effective symbol vector associated with the r-th
terminal as
a
(r) .
=
_
ar
1
_
, (8)
which contains an useful control data symbol and a reference symbol
transmitted over PUCCH. An effective symbol matrix collecting R
contributions can thus be dened as:
A
.
= [a
(1)
a
(R)
] =
_
a1 aR
1 1
_
C
2R
. (9)
With these denitions, the base station received signal can be
viewed as three-way array, or third-order tensor X C
7122K
,
collecting the discrete-time samples received by 2K virtual spatial
channels over a time-frequency grid of 7 symbols and 12 subcarriers.
The (n, p, k)-th element of this tensor, which is associated with n-th
symbol, p-th subcarrier and k-th diversity branch can be written as:
x
n,p,k
=
M

m=1
2

f=1
R

r=1

n,f
a
f,r
r,mwp,mh
k,m
, (10)
where a
f,r
, wp,m and h
k,m
are typical entries of the matrices A, W,
H, respectively, and C
72
and C
RM
have, respectively,
the following special structures:
=
_
_
_
_
_
_
_
_
_
1 0
2 0
0 1
0 2
0 3
3 0
4 0
_

_
, =
_
_
_
_
_
1
T
M
1
1
T
M
2
.
.
.
1
T
M
R
_

_
.
(11)
We refer to as the time-spreading matrix and to as the
space-spreading matrix of the proposed PUCCH signaling model.
The rst matrix reveals the mapping of the control symbols {a
f,r
, 1}
across the 7 SC-OFDMsymbols of each slot, and is a function of the
time-domain cover sequences. The second one s a block-diagonal
matrix that models the spreading of each UE transmitted symbol
across its associated transmit antennas.
4. RECEIVER PROCESSING
In this section, we present a tensor-based receiver algorithm
for PUCCH with transmit diversity (herein called TREP). The
algorithm exploits the structure of decomposition (10) and perform
least-squares estimations of the symbol, coding and channel matrices
that dene the decomposition. Let us dene X1 C
842K
,
X2 C
24K7
, and X3 C
14K12
, as three matrices that collect
the elements of the received data tensor X C
7122K
as follows:
[X1]
(n1)P+p,k
.
= x
n,p,k
(12)
[X2]
(p1)K+k,n
.
= x
n,p,k
(13)
[X3]
(k1)N+n,p
.
= x
n,p,k
, (14)
where [X]i,j denotes the (i, j)-th element of its matrix argument.
If can be shown [8] that X1, X2 and X3 admit the following
factorization:
X1 = ((A) W)H
T
(15)
X2 = (W H)(A)
T
(16)
X3 = (H (A))W
T
, (17)
where denotes the Khatri-Rao (columnwise Kronecker) product.
4.1. Identiability
The necessary conditions for least-squares identiability of A
C
2R
, W C
12M
, and H C
2KM
from (15)-(17) are given
by:
rank((A) W) = M (18)
rank(H (A)) = M (19)
rank((W H)
T
) = R. (20)
Assuming that A, W, and Hare full-rank matrices, (18) implies the
following simplied condition:
min(84, 14K) M, and 24K R. (21)
Both conditions yield a lower bound on the number K of receive
antennas at the base station that ensures the identiability of control
symbol, coding, and channel matrices.
For instance, consider an uplink of a multi-cell setting with 3
cells, 2 UEs per cell, each equipped with 2 transmit antennas. In this
setting, we have a total of R = 6 UEs in the system, and a total of
M = 12 transmit antennas. From condition (21), identiability is
assured even for K = 1. Based on the same setting, consider now 4
UEs per cell. In this case, we have R = 12 UEs in the system, and
a total of 24 transmit antennas. According to condition (21), K = 2
receive antennas are enough to jointly estimate the composite MIMO
channel and to recover the UEs transmitted symbols.
4.2. Receiver Algorithm
The receiver uses a constrained version of the alternating
least-squares (ALS) algorithm [11], exploiting the proposed PUCCH
signaling structure to yield a joint multiuser channel estimation and
symbol detection. The constrained ALS algorithm makes use of the
matrix representations (15)-(17) in order to conditionally estimate
the symbol, coding, and channel matrices A, W, and H in the
least squares (LS) sense. The TREP receiver performs a semi-blind
processing, by using known reference control symbols at the rst
iteration of the algorithm, and then proceeding with a data-aided
estimation in subsequent iterations.
Let Yi = Xi + Vi (with i = 1, 2, 3), where Vi represents
the additive white Gaussian noise term. Let

H
(i)
,

A
(i)
and

W
(i)
denote the estimates of the channel, symbol, and coding matrices,
respectively, at the i-th iteration, and denote the Moore-Penrose
pseudo-inverse. The TREP algorithm can be summarized as follows:
483
TREP Receiver for PUCCH with Tx Diversity
1. Set i = 0;
Initialize

A
(0)
C
2R
and

W
(0)
C
12M
;
2. i = i + 1;
3. Using Y1, nd an estimate of H:

H
T
(i)
= ((A
(i1)
) W
(i1)
)

Y1
4. Using Y2, nd an estimate of A:

A
T
(i)
= ((W
(i1)
H
(i)
)
T
)

Y2
_

T
_

5. Using Y3, nd an estimate of W:

W
T
(i)
= (H
(i)
(A
(i)
))

Y3.
6. Repeat steps 2-5 until convergence.
The knowledge of the reference symbols at the receiver side is
exploited for initializing the effective symbol matrix as follows:

A
(0)
=
_
0 0 0
1 1 1
_
C
2R
, (22)
with 1s in the second row associated with the reference symbols
[5]. As for the single-antenna case, using this initialization, the
rst iteration of the receiver algorithm is equivalent to a classical
(single-step) LS channel estimator. In subsequent iterations, the
channel estimation is ameliorated as the previously estimated
symbols are used as reference symbols. Therefore, the proposed
receiver works as a data-aided channel estimator [5]. This receiver
is an extension of the algorithm of [12] to the multiple-antenna case,
where terminals are possibly equipped with multiple antennas.
Remark: The proposed receiver exploits the knowledge and
structure of the time- and space-spreading matrices and
during the iterative estimation process. Since and are known
to the base station and are therefore xed during the iterative
estimation process. Moreover, the knowledge of W depends on
level of cooperation between the neighboring cells. For instance,
in a cooperative multi-cell case, W is fully known and Step 5 of
the algorithm is skipped. Moreover, in the particular single-cell
scenario, Wis fully known to the receiver.
5. PERFORMANCE RESULTS
We evaluate the performance of LTE PUCCH Format 1 with
transmit diversity using the proposed TREP multiuser receiver. All
simulations assume K = 2 receive antennas at the base station and
Mr = 2 transmit antennas at the UEs. In our results, we consider a
multi-cell scenario with three cells, with one cell is associated with
the UE of interest, and two neighboring cells with two interferer UEs
per cell. Figure 2 illustrates the considered simulation scenario. Our
results focus on a worst-case situation, where the received signal
contribution of each interfering UE has the same average power as
that of the in-cell UE. We consider the evolved typical urban (ETU)
channel model described in the LTE specications [13]. A system
bandwidth of 10 MHz and a maximum Doppler frequency of 5 Hz
is assumed. The noise variance is assume to be perfectly known at
the receiver. The performance is measured in terms of the average
bit-error-rate (BER) calculated over the ACK/NACK symbols of the
in-cell UE. The BER is plotted as a function of the signal-to-noise
ratio (SNR) at the receiver. The SNR varies from -16 to 0 dB. Such
a noise-limited scenario is usual in LTE PUCCH signaling. We
denote by TREPNIt a TREP receiver with a xed number NIt
of iterations and by CONV. the conventional receiver.
Cell-1
Cell-2
Cell-3
W=
_
w
(1)
w
(M)
_
eNodeB
Fig. 2. LTE multi-cell scenario
In Figure 3, we compare the performance of the proposed TREP
receiver with that of the conventional receiver which is based on a
time-frequency decorrelator followed by a maximal ratio combiner
[1]. A cooperative multi-cell setting is considered, where the coding
sequences of the neighboring UEs are known at the base station
receiver. This means that W is fully known so that Step 5 of the
receiver algorithm is skipped. Note that the conventional receiver
presents a poor performance with a high BER oor of about 10
2
due to the high interference in the cell edge. The TREP receiver
offers a signicant performance gain over the conventional one. For
a target BER of 10
4
, an SNR gain of almost 2dB is obtained from
the rst to the second iteration of the algorithm.
In Figure 4, we consider non-cooperative multi-cell setting.
Note that, in this case, the coding sequences of interfering UEs are
not known a the base station of interest, so that the estimation of W
(in addition to the estimation of S and H) is necessary in Step 5 of
the proposed algorithm. This is a more challenging scenario. We can
verify that the proposed multiuser receiver dramatically improves the
BER performance as the number of iterations increases. Figure 5
depicts the NMSE of channel estimation under both cooperative and
non-cooperative congurations. Note that for both congurations,
the NMSE decreases at each iteration, corroborating that the
proposed algorithm works effectively as a data-aided channel
estimator by rening channel estimates across the iterations.
6. CONCLUSION
We have exploited the structure of a LTE-Advanced PUCCH
signaling with transmit diversity to devise a semi-blind receiver for
joint channel estimation and symbol detection. The receiver is based
on a tensor decomposition of the received signal that imposes time-
and space-domain constraints on the symbol matrix. Moreover, it
allows to separate out-of-cell interference from the desired in-cell
UE signal. Our approach offers remarkable performance gains
over the conventional LTE PUCCH receiver. An extension of this
approach to PUCCH Format 2 will is under investigation.
484
16 14 12 10 8 6 4
10
5
10
4
10
3
10
2
10
1


CONV.
TREPx1
TREPx2
TREPx3
B
E
R
Fig. 3. BER vs. SNR (cooperative case)
16 14 12 10 8 6 4 2 0
10
3
10
2
10
1
Case Study 2 Non Cooperative Interfering UE


B
E
R
SNR[dB]
TREPx1
TREPx2
TREPx3
TREPx4
TREPx5
Fig. 4. BER vs. SNR (non-cooperative case)
0 5 10 15 20
0.08
0.1
0.12
0.14
0.16
0.18
0.2
0.22
0.24
0.26
Number of Iterations
M
S
E

o
f

C
h
a
n
n
e
l

E
s
t
i
m
a
t
i
o
n


Cooperative
NonCooperative
Convergence at N=7
Converngence at N=4
Fig. 5. NMSE of channel estimation
7. REFERENCES
[1] E. Dahlman, S. Parkvall, J. Skold, and P. Beming, 3G
Evolution: HSPA and LTE for Mobile Broadband, 2nd Ed.,
Elsevier, Oxford, UK, 2008.
[2] 3GPP, TR 36.913 v8.0.0, Requirements for Further
Advancements for E-UTRA (LTE-Advanced) (Release 8),
RAN, June 2008.
[3] LG Electronics 3GPP, R1-091211, pucch txd schemes for
lte-a, RAN1, 56bis, March 2009.
[4] H. Yang, D. Astely, R. Baldemair, and S. Falahati, Semi-blind
multi-user detection for lte pucch, in Proc. IEEE Wireless
Communications and Networking Conference, Budapest,
Hungary, April 2009.
[5] I. L. J. Da Silva, A. L. F De Almeida, F. R. P. Cavalcanti,
R. Baldemair, and S. Falahati, Improved Data-Aided
Channel Estimation in LTE PUCCH Using a Tensor Modeling
Approach, in the IEEE International Conference on
Communications (ICC10), Cape Town, South Africa, May
2010, pp. 15.
[6] I. L. J. Da Silva, A. L. F De Almeida, F. R. P.
Cavalcanti, R. Baldemair, and S. Falahati, A Multi-User
Receiver for PUCCH LTE Format 1, in the 11th IEEE
International Workshop on Signal Processing Advances in
Wireless Communications (SPAWC10), Marrakech, Morocco,
June 2010.
[7] I. L. J. Da Silva, A. L. F De Almeida, F. R. P. Cavalcanti,
R. Baldemair, and S. Falahati, A Multi-user Receiver for
PUCCH LTE in Non-Cooperative Multi-cell Architectures,
in the IEEE Vehicular Technology Conference (VTC Fall10),
Ottawa, Canada, September 2010.
[8] A. L. F. de Almeida, G. Favier, and J. C. M. Mota, A
constrained factor decomposition with application to MIMO
antenna systems, IEEE Trans. Signal Process., vol. 56, no. 6,
pp. 24292442, June 2008.
[9] S. Sesia, I. Touk, and M. Baker, LTE: The UMTS Long Term
Evolution - From theory to practice, Wiley and Sons, U.S.,
2009.
[10] 3rd Generation Partnership Project (3GPP); Evolved UTRAN
(E-UTRAN); Physical Channels and Modulation (Release 8),
, Technical Specication Group Radio Access Network (TSG
RAN), vol. 3GPP TS 36.211, V8.4.0, page 66, Sep. 2009.
[11] R. Bro, Multi-way analysis in the food industry: Models,
algorithms and applications, Ph.D. thesis, University of
Amsterdam, Amsterdam, 1998.
[12] I. L. J Da Silva, de Almeida, R. Baldemair, S. Falahafel,
A.L.F., and F. R. P. Cavalcanti, Tensor-based receiver for
separating component signals in a composite signal, US
Patent Application Serial No. 12/917,126, 2010.
[13] 3rd Generation Partnership Project (3GPP); Evolved Universal
Terrestrial Radio Access (E-UTRAN); User Equipment
(UE) radio transmission and reception (Release 8), (release
8), Technical Specication Group Radio Access Network
(TSG RAN), vol. 3GPP TR 36.101, December 2008.
485