0 Stimmen dafür0 Stimmen dagegen

4 Aufrufe5 SeitenOct 09, 2013

© Attribution Non-Commercial (BY-NC)

PDF, TXT oder online auf Scribd lesen

Attribution Non-Commercial (BY-NC)

Als PDF, TXT **herunterladen** oder online auf Scribd lesen

4 Aufrufe

Attribution Non-Commercial (BY-NC)

Als PDF, TXT **herunterladen** oder online auf Scribd lesen

- A MATLAB Tutorial
- optimizing an advertising campaign
- Physical cell ID planning for LTE system.pdf
- harq-2011
- HUAWEI_E392-specs.pdf
- Geometric Global Optimization
- agilent LTE
- On the Quality of Optimal Assignment for Data Association
- 04389045.pdf
- sudokuSolver
- Learning a Metric for Music Similarity
- Questions UFMF68!20!2 Ex Paper_Resit
- b.com.Generalcbcsdraftsyllabus
- Prob_1_1
- Nonlinear Model Predictive Control UAV
- 5. Foundation Embedded in a Layered Half-Space
- Optimization, Pedregal
- IEEE7
- FP_00057
- projectsecondsimister-160526105440

Sie sind auf Seite 1von 5

This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 2011 proceedings

Energy Efﬁcient Resource Allocation in SC-FDMA Uplink with Synchronous HARQ Constraints

Dan J. Dechene, Student Member, IEEE and Abdallah Shami, Member, IEEE

Abstract —In this paper we propose framework for energy efﬁcient (margin adaptive, MA) resource allocation in multiuser SC-FDMA with synchronous HARQ constraints. Resource al- location is formulated as a two-stage problem where resources are allocated in both time and frequency. To limit the impact of retransmissions on the time-frequency problem segmentation, we propose use of a block scheduling interval that ensures uplink users do not experience ARQ blocking. We formulate the optimal MA allocation problem under this framework and based on its structure, we propose a variable complexity sub-optimal approach to minimize the energy in resource allocation. Results are presented for the energy performance relative to complexity and datarate.

Index Terms —SC-FDMA, Energy Efﬁciency, Margin Adaptive, Resource Allocation

I. I NTRODUCTION

Energy efﬁciency is an on-going issue in modern wireless communication systems as radio resources account for a large portion of mobile device energy consumption. As the prolif- eration of smaller and faster devices increases, efﬁcient use of limited battery resources becomes ever more paramount. The radio resource allocation problem formulation of minimizing transmission energy is known as the margin adaptive (MA) problem [1]. MA problems are well-studied for a general OFDM transmission systems [1], [2] however systems such as uplink in 3GPP-LTE, employ localized SC-FDMA at the phys- ical layer. Implementation of localized SC-FDMA suffers from restrictions such as contiguous frequency block allocation and limited ﬂexibility in modulation and coding scheme (MCS) assignment ultimately limiting the applicability of traditional MA resource allocation framework to the SC-FDMA problem. In this work, we propose an uplink resource allocation scheme for localized SC-FDMA with a focus on energy efﬁciency. The resource allocation problem is complicated by restrictions imposed by synchronous hybrid automatic repeat request (HARQ) such as transmission at the same rate for retransmissions and by the fact that each UE can only transmit a single transport block (TB) during a given scheduling frame. Our proposed resource allocation method exploits periodicity of the HARQ process in selection of a scheduling epoch to efﬁciently schedule uplink trafﬁc. The remainder of this paper is divided as follows. In Section II we overview the details of the employed uplink system model. In Section III and IV we formulate the energy- optimal and suboptimal uplink resource allocation problem with HARQ constraints respectively. In Section V simulation results are provided. Finally in Section VI, conclusions are drawn on this work.

D. J. Dechene and A. Shami are with the Department of Electrical and Computer Engineering, The University of Western Ontario, London, ON, Canada (e-mail: ddechene@ieee.org, ashami2@uwo.ca).

II. S YSTEM M ODEL

In this paper we focus on multi-user SC-FDMA used for uplink in LTE, [3]. There are K users (UEs) within a single cell, communicating with a single base station (eNB). Since we focus on resource allocation within a single cell, for the purpose of this paper, it is assumed that intercell interference is negligible. The cell spectrum is divided into subcarriers which are grouped into M resource blocks (RBs) consisting of 12 subcarriers. Without loss of generality we assume there is an Integer number (M ) of RBs. The minimum duration of time that can be allocated to a single UE is a scheduling block (SB). The n ^{t}^{h} SB falls in the time duration [nT _{f} , ( n + 1)T _{f} ) where T _{f} is the subframe duration (equal to 1 ms) and is one RB in frequency. Resource allocation decisions are made at each scheduling epoch. We deﬁne the m ^{t}^{h} scheduling epoch as the time duration in [mT _{e} , ( m +1)T _{e} ] and each epoch consists of T _{e} /T _{f} subframes in time. In this paper, T _{e} is chosen to be equal to 4 T _{f} . The justiﬁcation of this selection T _{e} is discussed later. Figure 1 shows an example of the uplink frame layout with relevant time durations shown. Successful transmission are shown in gray, while failures are red. As shown retransmissions occur exactly 8 subframes following the initial transmission using the same number of resource blocks. Localized SC-FDMA transmissions are limited to contiguity in frequency and each UE can transmit one TB using a com- mon MCS mode per subframe ^{1} . Retransmissions employing HARQ must be transmitted over the same number of resource blocks using the same MCS after exactly 8 subframes have passed from original transmission (non-adaptive HARQ). In each subcarrier, there are N _{s}_{y}_{m} symbols in per subframe. We assume a constant amount of symbols N _{c}_{t}_{r}_{l} are reserved for control while the rest are for data transmission. We assume for simplicity that valid TB sizes are those deﬁned by CQI values given in Table 7.2.3-1 of [4]. Consequently, the overall number of data bits that can be transmitted per subframe over a set N of RBs in frequency is given as

η ( k, N ) = 12(N _{s}_{y}_{m} − N _{c}_{t}_{r}_{l} ) k · |N | (1)

where k is the spectral efﬁciency from [4], N is a set of RBs

^{1} For single layer (non-MIMO) transmissions. [4]

8 subframes

Time

(subframes, n)

ARQ slot (m)=T e =4T F

ARQ subframe = ARQw = 8T F

LTE

subframe (n)=T F

Frequency

(RBs)

Fig. 1: Frame Layout

978-1-61284-231-8/11/$26.00 ©2011 IEEE

in frequency and |·| is the size of a set. For N _{s}_{y}_{m} = 14

(regular cyclic preﬁx, [4]) and assuming N _{c}_{t}_{r}_{l} = 3, the above

reduces to η ( k, N ) = 132k · |N | .

The SNR of the channel between each UE and the eNB and from RB to RB is independent. A block fading model is assumed, where the channel is static for the duration of the decision epoch and independent from epoch to epoch. Channel estimation is assumed to be error-free and available at the eNB. The block error rate (BLER) is the average failure rate of TBs. In general this will depend on γ _{i}_{,}_{e}_{f} _{f} (the effective SNR of a transmission), T _{i} (the TB size), and k _{i} (the MCS em- ployed). There exists no analytical solution to obtain the error rate of a coded transmission. Practically, estimates of BLER are based on receiver training/calibration. For the remainder of this paper, the measure of Information Outage probability (IOP) derived in [5] is used as a measure for BLER. The IOP was shown to closely model BLER for moderate block lengths. Extensions are trivial when system BLER can be more accurately estimated and stored for a particular implementation (via proper training). From [5], we obtain

BLER ( γ, N _{i} , T _{i} ) ≈ Q ⎛

_{⎝} log(1 + γ − ^{l}^{o}^{g}^{(}^{2}^{)} ^{T} ^{i}

132 |N _{i} |

2

γ

132 |N _{i} |

1+ γ

⎞

⎠

(2)

where N _{i} is set of RBs in use, Q( ·) is the well-known Q-

function and γ _{i}_{,}_{e}_{f} _{f} is the effective SNR. 132|N _{i} | and

corresponds to the number of modulated symbols and effective spectral efﬁciency per allocation respectively. The measured effective SNR of a transmission is related to the SNR of the subchannels allocated for that particular transmission. As in [6], the effective SNR of an SC-FDMA symbol cannot be approximated using EESM or MIESM (as in OFDM), but rather it can be computed as the average SNR over the set of subchannels or as

T

i

132 |N _{i} |

γ _{i}_{,}_{e}_{f} _{f} ( m, N _{i} ) = ^{1}

(0)

|N _{i} |

k∈N _{i}

γ _{i}_{,}_{k} ( m )

|N _{i} |

(3)

where γ _{i}_{,}_{k} ( m ) is the instantaneous SNR in resource block k seen from UE i relative to a reference power level γ _{0} and N _{i} is the set of RBs in the computation. The superscript

( x ) is used to denote the x ^{t}^{h} retransmission number where

0 is the initial transmission. The additional |N _{i} | in the above equation describes that power is equally allocated across the all assigned resource blocks. Further, we can model the effect of retransmissions as an increase in the measured SNR [7]. We employ this model with coefﬁcients for SNR gains given in Ta- ble 2 of [7]. We note however that for a given implementation, these gain factors can be obtained through receiver calibration measurements. The effective SNR of retransmission z is then given as (in dB)

γ

(

z )

i,ef f, ( dB ) ^{(} ^{m}^{,} ^{N} ^{i} ^{,} ^{k} ^{i} ^{)} ^{=}

(0)

^{γ} i,ef f, ( dB ) ^{(} ^{m}^{,} ^{N} ^{i} ^{)}

+ μ (z, k _{i} ) · R _{c}_{o}_{d}_{e} + (z, k _{i} ) (4)

where R _{c}_{o}_{d}_{e} is the code rate × 1024 which is given in [4]

), μ (z, k _{i} ) and (z, k _{i} ) are given from [7]

for each retransmission and modulation scheme and where

( i.e., 78, 120,

(0)

γ _{i}_{,}_{e}_{f} _{f} ( m, N _{i} ) is the effective SNR for UE i given in (3).

The required power to obtain BLER _{t}_{g}_{t} is then simply

P i = γ _{i}_{,}_{e}_{f} _{f} ( N _{i} , T _{i} )

γ

(

z )

i,ef f ^{(} ^{m}^{,} ^{N} i ^{)}

(5)

where γ _{i}_{,}_{e}_{f} _{f} ( N _{i} , T _{i} ) is the γ argument in (2) when (2) is set equal to BLER _{t}_{g}_{t} for given arguments N _{i} and T _{i} .

III. O PTIMAL A LLOCATION F RAMEWORK

It is well-known [2] that OFDM MA problems are NP-

hard due to Integer constraints on the subcarrier allocation variables. The problem is further complicated in localized SC- FDMA due to restrictions on contiguity of allocated resources. Nevertheless, for the interest of the reader we formulate the MA resource allocation optimization problem. Based on the characteristics of this problem formulation, we propose an online suboptimal scheme that tries to minimize the average transmission power of each new transmission in Section IV.

A. Time Domain, Time-Frequency Domain Packet Scheduler

Recent research, particularly for LTE systems, proposes

segmenting the packet scheduling problem into a time- domain packet scheduling (TDPS) and frequency-domain packet scheduling (FDPS) problem. Such methods [8] choose

a set of users at each scheduling interval to schedule (TDPS) and allocate them in frequency (FDPS) to maximize cell throughput (rate adaptive, RA).

In the energy limited regime, the goal is to minimize

transmission energy while meeting throughput requirements. In this regime, the optimal allocation for MA differs from that of an RA problem. As a result, RA methods are not directly applicable in solving the MA problem. Further, due to limitations imposed by synchronous HARQ, the above described approaches may experience ARQ blocking since the TDPS is limited in knowledge to a single subframe in time.

A simple method to eliminate ARQ blocking is to limit

the number of new transmissions a station can initiate in each ARQ window. In synchronous HARQ, retransmissions are limited to exactly ARQ _{w} subframes following the initial transmission (where ARQ _{w} = 8 in LTE uplink) and the maximum number of times a packet can be transmitted is 4 . Based on these observations, the maximum number of new transmissions that any station should initiate during any ARQ _{w} subframes is ARQ _{w} / 4=2 to eliminate any ARQ blocking. Based on this, we deﬁne an ARQ slot as the duration of time such that each UE can be allotted at most one new TB for transmission. Consequently, each ARQ slot m has a duration of 4 subframes or 1 / 2 of an ARQ _{w} ( i.e., T _{e} = 4T _{f} ). We formulate the resource allocation problem by segment- ing it into a TDPS and Time-Frequency Domain packet scheduler (TFDPS). At the beginning of scheduling epoch (ARQ slot) m , the TDPS chooses which UEs can access the channel (and with how much data, T _{i} ( m ) ) based on the buffers and priority of each UE over ARQ slot m . The TFDPS then allocates the UEs within the Time-Frequency grid of a ARQ slot based on channel conditions and on-going retransmission.

B. TDPS Formulation

During ARQ slot m , the TDPS analyzes the number of resources available for transmission. Based on this information combined with buffer and quality of service information, the TDPS chooses the set of UEs to transmit with TB size T _{i} ( m ) . For the remainder of this paper, we assume all UEs

¯

transmit T _{i} ( m ) = T _{i} bits per frame. The detailed design of

an energy efﬁcient TDPS will be presented elsewhere.

C. TFDPS Formulation

The TFDPS is formulated as follows. Given a set of

and a set of TB sizes for each UE

{T _{1} ( m ) , T _{2} ( m ) ,

ergy minimization problem can be formulated to solve for resource assignment (S _{i}_{,}_{j}_{,}_{n} ( m ) and S _{i}_{,}_{j}_{,}_{n} ( m ), ∀i, j, n, m), power assignment (P _{i}_{,}_{n} ( m ), ∀i, n, m), and rate assignment ( k _{i}_{,}_{n} ( m ) , ∀i, n, m). Here S _{i}_{,}_{j}_{,}_{n} ( m ) and S _{i}_{,}_{j}_{,}_{n} ( m ) are binary indicators that denote whether a given RB j is allocated to a given UE i for both new transmissions and retransmissions respectively, P _{i}_{,}_{n} ( m ) denotes the power allocated to UE i and k _{i}_{,}_{n} ( m ) denotes the spectral efﬁciency of the MCS chosen for UE i all during subframe n of ARQ slot m . The energy-optimal objective function can be given as

_{K} ( m )} for all m , the TFDPS en-

UEs { 1 , 2 ,

,K}

,T

min ⎛ lim

⎝

t→∞

1

t

t

K

M

3

m

=0 i =1 j =1 n =0

α

i

( S _{i}_{,}_{j}_{,}_{n} ( m ) + S _{i}_{,}_{j}_{,}_{n} ( m ))P _{i}_{,}_{n} ( m ) (6)

where α _{i} is the relative importance parameter of power mini- mization for UE i and subframe n ∈ {0 , 1 , 2 , 3 } within ARQ slot m . 1) Rate Constraints: The amount of new information that must be transmitted during a frame is constrained as

M 3

j =1 n =0

S _{i}_{,}_{j}_{,}_{n} ( m )k _{i}_{,}_{n} ( m ) ≥ T _{i} ( m ),

∀i, m

(7)

2) HARQ Constraints: The ARQ constraints ensure that resource allocation cannot occur in a subframe where a re- transmission exists. This means S _{i}_{,}_{j}_{,}_{n} ( m )=0, n ∈ S _{i} ( m − 2), ∀i, m, where S _{i} ( m− 2) is the set of subframes during ARQ slot m − 2 whose transmissions were unsuccessful and have not reached the maximum number of retransmissions. Further, the number of RBs allocated to a user during a retransmission must equal the original amount of RBs assigned, i.e.,

M

j

=1

S i,j,n ( m ) =

M

j

=1

( S _{i}_{,}_{j}_{,}_{n} ( m − 2) + S _{i}_{,}_{j}_{,}_{n} ( m − 2)),

(8)

3) New Transmission Limitation: In order to ensure ARQ blocking does not occur, each station is limited to a new transmission in a ARQ slot. This constraint is given as

n ∈ S _{i} ( m − 2),

∀i, m

n∈S

C

i

(

m− 2)

I ⎛

M

⎝

j

=1

S

i,j,n ( m ) ⎞

⎠ ≤ 1 ,

∀i, m

(9)

C

where I (x )=0 when x = 0 and 1 otherwise and S ( m − 2) is the complementary set of S _{i} ( m − 2). 4) Allocation and Contiguity Constraints: Additionally, lo- calized SC-FDMA is limited to RB allocations in contiguity, this constraint can be given jointly as

i

K

i =1

( S _{i}_{,}_{j}_{,}_{n} ( m ) + S _{i}_{,}_{j}_{,}_{n} ( m )) ≤ 1 ,

S _{i}_{,}_{j}_{,}_{n} ( m ) ∈ {0 , 1 }, ∀j, n, m (10)

ensuring only a single user can occupy an RB during an instant of time and from [9] as

S i,j,n ( m ) ,

S i,j,n ( m ) − S i,j +1 ,n ( m ) + S i,x,n ( m ) ≤ 1 ,

x = j + 2,

,M,

C

i

∀i, j, n ∈ S

(

m − 2), m (11)

S i,j,n ( m ) −

S i,j +1 ,n ( m ) +

S _{i}_{,}_{x}_{,}_{n} ( m ) ≤ 1 ,

(12)

5) Power Level Constraints: The applied power level con- straints are expressed as

x = j + 2,

,M, ∀i, j, n ∈ S _{i} ( m − 2), m

P i,n ( m ) = γ _{i}_{,}_{e}_{f} _{f} ( N _{i}_{,}_{n} , T _{i} ( m ))

γ

(0)

i,ef f ^{(} ^{m}^{,} ^{N} i,n ^{)}

C

i

, ∀i, n ∈ S

(

m− 2), m (13)

¯

P i,n ( m ) = ^{γ} i,ef f ^{(}

( z i,n )

γ i,ef f

N _{i}_{,}_{n} , T _{i} ( m ))

( m,

¯

N i,n )

, ∀i, n ∈ S _{i} ( m − 2), m

(14)

where z _{i}_{,}_{n} ( m ) is the retransmission number in subframe n for UE i during ARQ slot m and N _{i}_{,}_{n} = {j|S _{i}_{,}_{j}_{,}_{n} ( m )=1} and

N _{i}_{,}_{n} = {j| S _{i}_{,}_{j}_{,}_{n} ( m )=1} Combining (6)-(14), forms the optimal TFDPS allocation for inputs T _{i} ( m ) , ∀m . In general, it is not computationally feasible to solve this problem for all time m . This is due to the time dependance on m ( i.e., scheduling for slot m depends on the outcome of all previous slots m ).

¯

_{I}_{V}_{.} _{S} UB -O PTIMAL R ESOURCE A LLOCATION S CHEME

As previously noted, it is not feasible to allocate resources described in Section III for all time m in advance. Traditional approaches in the literature [10] have done so by exhaus- tively breaking the system into channel states and solving the optimization problem as a function of these states. However unlike the above methods, the SC-FDMA channel has a large number of subchannels (RBs) resulting in a state space that grows exponentially with the number of RBs. This combined with the Integer allocation constraints above, makes solving the problem in this fashion infeasible. A greedy, less complex approach is to solve the problem online at each ARQ slot m . The resulting problem is still rather complex, particularly when considering the contiguity constraints. Recent work by Wong et al. [11] exploited these contiguity constraints as a method of reducing the overall

problem search space to solve the SC-FDMA RA allocation

problem. This was accomplished by exploiting the property that the number of exhaustive frequency contiguous allocations

is signiﬁcantly less than the exhaustive allocations for a gen- eral OFDMA RA allocation problem. From the reduced search space, allocations were solved for each UE to maximize the

cell uplink sum-rate. While the exhaustive set of allocations reduces the search space, it is still quite large, particularly for a moderate number of RBs in frequency and UEs. In the case of an MA problem (where we look to minimize energy used for transmission while meeting a target rate rather than maximizing cell throughput), it is not necessary to allocate all RBs as in RA problems (as with the approach in [11]), but to simply allocate those necessary to minimize transmission power while meeting rate constraints. Further, Wong’s method suffers from needing to exhaustively consider all possible allocations while in practice, only a small number of allocations need to be considered in the problem. In our proposed method, we adapt the approach in [11] for the MA problem and solve the problem for each ARQ slot m . The proposed sub-optimal algorithm provides for a varying degree of complexity. By including a limited number of the most energy efﬁcient allocations for a UE determined based on channel measurements, the optimization framework can consider a reduced search space. We denote this as the Best-

N method. The search space increases as N increases, and

in the limiting case when N is large, this method obtains the optimal allocation at each ARQ slot m . The algorithm operates as follows. At the beginning of each ARQ slot

m determine the subset of RBs available for transmission

as described in Section IV-A. For each UE, ﬁnd the N most energy efﬁcient allocations (power, rate and subcarriers) subject to the restrictions and details described in Section IV-B and formulate the reduced search-space optimization problem. Finally, allocate the chosen subcarriers to each UE at a given power level and using a given MCS.

A. Residual Resource Allocation

Due to the synchronous HARQ mechanism, any transmis- sion that was erroneous, and has not exceeded the maximum number of transmissions is rescheduled exactly 8 subframes following its original transmission. These transmissions are scheduled using the same set of RBs ^{2} and using the same MCS. To accommodate these restrictions, we denote the resource restriction for each UE the vector given as S _{i} ( m ) ^{T} =

[S ^{T} _{1} , S ^{T} _{2} , S ^{T} _{3} , S ^{T} _{4} ] where S _{i}_{,}_{n} has elements given as

i,

i,

i,

i,

S i,n : j =

⎧ ⎨ if block {n, j} is reserved for ReTx if UE i ReTx during n

1

,

1

,

⎩ otherwise j = 1,

0

,

,M

(15)

The resource restriction vector ensures that UEs are not able to initiate a new transmission during subframes where they have a retransmission, and cannot be allocated any resources that are reserved for retransmission by any UE.

B. Best- N Allocation Computation

The Best-N allocations represent the N allocations (set of RBs, MCS mode, and power allocated) that are the most energy efﬁcient for the UE use for transmission. We denote

^{2} Retransmissions are restricted to the same RBs in frequency.

the tuple B _{i}_{,}_{n} ≡ {k _{i} , P _{i} , N _{i} } as the n ^{t}^{h} most energy efﬁcient allocation for a UE i. These allocations minimize the required applied power to satisfy a target error rate BLER _{t}_{g}_{t} . To obtain these allocation, for each UE i, we perform the following 1) For known T _{i} ( m ) , obtain the number of RBs M ^{} ( k _{i} ) needed for each MCS mode k _{i} given from [4] and using (1) 2) For each unique quantity of resource blocks M ^{} ( k _{i} ) , choose the minimum effective coding rate that can transmit T _{i} ( m ) bits of data during that block 3) For each such MCS scheme, determine the power level needed to maintain BLER _{t}_{g}_{t} for all possible allocations of M ^{} ( k _{i} ) contiguous resource blocks using (2). As the Q-function is monotonic in its arguments, this can easy be found through efﬁcient search techniques. 4) Store the Best- N allocations, including MCS, power level required and resource block set in B _{i}_{,}_{n} ranked by required power allocation level. Once efﬁcient allocations have been computed, the optimiza- tion problem is a general set-packing problem and can be formulated using binary programming as

(16)

min

c ^{T} x

x

s.t.

Ax ≤ 1 _{M} , A _{e}_{q} x = 1 _{K} ,

x _{j} ∈ {0 , 1 }, ∀j ∈ x

where c is a real-valued vector, x is the vector of allocation selections, A _{e}_{q} is the equality constraint matrix of K rows and A is the inequality constraint matrix. Each non-zero entry of the solution vector x corresponds to selecting the corresponding column allocation in A. Consequently, the matrices A and A _{e}_{q} are given as

A = [A _{1} , ··· , A _{K} ] (17) A _{e}_{q} = ⎣ ⎡

⎢

1

0

^{T} _{C} _{1}

.

.

.

^{T} _{C} _{1}

···

^{.}

···

^{.}

.

0

1

^{T}

C

.

^{T}

C

K

K

⎤

_{⎦} (18)

⎥

A _{K} each contain a set

of potential RB allocations for each UE based on the efﬁcient allocations found previously and C _{i} is the number of columns in A _{i} . The inequality ensures that at most 1 UE occupies any RB in frequency during any subframe while the equality is used to ensure exactly 1 allocation is chosen for each UE.

where the columns of matrices A _{1} ,

,

The submatrix A _{i} is obtained as follows. Let N ( i, n) be

the set of RB allocations for the n ^{t}^{h} allocation of i (stored in

B i,n ). A ^{}

_{i} is then comprised of small submatrices for each of

the n allocations and for each subframe of the ARQ slot or as

A

⎣

i = ⎡

⎢

A _{i}_{,} _{1}

.

.

.

0 _{M}

···

^{.}

··· A _{i}_{,} _{1}

0 _{M}

.

^{.}

.

······

······

······

A _{i}_{,}_{n}

.

.

.

0 _{M}

···

^{.}

···

^{.}

.

0 _{M}

.

A _{i}_{,}_{n}

⎤

⎥

_{⎦} (19)

where 0 _{M} is an M length column vector and A _{i}_{,}_{n} is a M length column vector given as

a i,n : j

=

,

0 ,

1

j ∈ N ( i, n) otherwise

,

j = 1, 2 ,

,M

(20)

Finally, A _{i} is obtained by removing any columns from A that share any non-zero row elements with the column vector S _{i} ( m ) (to account for pre-allocated retransmissions).

i

Average Power per UE (dB)

Complexity Increase (%)

Average Power (dB)

11

1000

10

500

9

Average Power, K=2

Average Power, K=6

Average Power, K=10

Complexity Time, K=2

Complexity Time, K=6

Complexity Time, K=10

2

2

2.5

2.5

3

3

3.5

3.5

4

4

4.5

4.5

5

5

5.5

5.5

6 0

6

Best−N Parameter (N)

Fig. 2: Complexity Comparison

c _{K} ^{T} ] is simply the cost

of choosing the corresponding allocation. The problem objec-

tive vector for each c _{i} is c

where P _{i} ( N ( j )) is the power level required for the n ^{t}^{h} transmission scheme, α _{i} is the priority of UE i and N (j ) denotes the n ^{t}^{h} allocation corresponding to column j in A _{i} . The above problem can be solved using binary programming techniques such as branch and bound at each ARQ slot m . The proposed optimization framework allows for solving the resource allocation problem efﬁciently at each scheduling epoch. While the proposed approach dramatically reduces the problem complexity, in rare cases the solution may be infeasible during a given scheduling epoch as we do not exhaustively allow selection of every possible allocation. To minimize the probability of this occurrence the designer may take a number of steps including limiting the maximum number of resource blocks that can be allocated to a single user as a function of available, enforcing overlap restrictions on the Best- N selection scheme or incrementing N and re- solving the problem when a solution is found infeasible.

The objective function c ^{T} = [c ^{T} ,

1

_{i}

,

_{:} _{j} = α _{i} P _{i} ( N (j )), j = 1, 2 ,

,C

i

_{V}_{.} _{R} ESULTS

To evaluate the performance of our proposed method, we implement the above framework and enforce the overlap restriction described above. The number of UEs and RBs is conﬁgured to 10 and 24 respectively with T _{f} = 1ms, T _{e} = 4ms, the Best- N depth set to 3 and all UEs have a priority ( α _{i} ) equal to 1 . The reference SNR is set to γ _{0} = 10dB and BLER _{t}_{g}_{t} = 10%. Each subchannel is assumed to follow the Rayleigh SNR distribution p ( γ ) = ^{1} _{0} exp − ^{γ} _{0} where γ _{0} is the mean SNR for a reference power level. Results are averaged over 40000 subframes. Due to length restrictions, limited results are shown for complexity and datarate. To observe the complexity tradeoff, Figure 2 shows the average power applied per UE versus the number of Best-

N allocations. We see that beyond 3 , there is little reduction

in average power, while a large complexity increase (measured via relative computation time) to the base case (2 UEs,

N = 2). Further, by increasing the number of UEs, there is an

increase in average power as result of each UE is less likely to be scheduled using its locally optimal allocation. While we note the effect of complexity and number of UEs on average power, the dependance on per UE TB size has a much larger

γ

γ

10

8

6

4

2

0

−2

−4

Average Power, K=2

−6

Average Power, K=6

Average Power, K=10

−8

200

400

600

800

1000

1200

1400

1600

1800

2000

TB Size (bits)

Fig. 3: Datarate Performance

effect on the average power performance (shown in Figure 3). This conﬁrms that proper design of the TDPS (i.e., minimizing

T _{i} ( m ) ) is vital in minimizing average transmission power.

_{V}_{I}_{.} _{C} ONCLUSION

In this work we have proposed framework for energy efﬁcient resource allocation in the SC-FDMA multi-user up- link. Firstly, we proposed an alternative method of selecting an appropriate scheduling epoch based on the impact of synchronous HARQ. By utilizing the proposed method, we can reduce the number of allocation procedures in time and ensure users can always initiate a new transmission during any frame ( i.e do not experience ARQ blocking). Secondly,

, we proposed a sub-optimal energy efﬁcient resource allocation method with a tunable complexity parameter to trade-off efﬁciency and complexity. In our future work, we will present the design of the energy efﬁcient TDPS as well as look at more efﬁcient allocation methods.

_{R} EFERENCES

[1] C. Y. Wong, R. Cheng, K. Lataief, and R. Murch, “Multiuser OFDM with adaptive subcarrier, bit, and power allocation ,” IEEE JSAC , vol. 17, no. 10, pp. 1747–1758, Oct. 1999. [2] M. Bohge, J. Gross, A. Wolisz, and M. Meyer, “Dynamic resource allocation in ofdm systems: an overview of cross-layer optimization principles and techniques,” IEEE Network, vol. 21, no. 1, pp. 53 –59, Jan. 2007. [3] 3GPP, “Evolved Universal Terrestrial Radio Access (E-UTRA); Long Term Evolution (LTE) physical layer; General description,” TS 36.201. [4] ——, “Evolved Universal Terrestrial Radio Access (E-UTRA); Physical

layer procedures,” TS 36.213. [5] D. Buckingham, “Information-outage analysis of ﬁnite-length codes,” Ph.D. dissertation, West Virginia University ’08. http://

wvuscholar.wvu.edu:8881/exlibris/dtl/d3 1/apache media/13988.pdf. [6] F. Calabrese, “Scheduling and Link Adaptation for Uplink SC-FDMA Systems,” Ph.D. dissertation, Aalborg University ’09. http://vbn.aau.dk/ ﬁles/19156393/PhD Thesis FrancescoDavideCalabrese ﬁnal print.pdf. [7] J. Ikuno, M. Wrulich, and M. Rupp, “Performance and modeling of LTE H-ARQ,” in Proc. of WSA 2009 . [8] F. Calabrese, P. Michaelsen, C. Rosa, M. Anas, C. Castellanos, D. Villa, K. Pedersen, and P. Mogensen, “Search-tree based uplink channel aware packet scheduling for UTRAN LTE,” in Proc. of IEEE VTC Spring ’08. [9] M. Al-Rawi, R. Jantti, J. Torsner, and M. Sagfors, “On the performance of Heuristic opportunistic scheduling in the uplink of 3G LTE networks,” in Proc. of IEEE PIMRC 2008 . [10] X. Bai and A. Shami, “Two dimensional cross-layer optimization for packet transmission over fading channel,” IEEE Transactions on Wireless Communications, vol. 7, no. 10, pp. 3813–3822, October 2008.

[11]

I. Wong, O. Oteri, and W. Mccoy, “Optimal resource allocation in uplink sc-fdma systems,” IEEE Transactions on Wireless Communications , vol. 8, no. 5, pp. 2161 –2165, may 2009.

- A MATLAB TutorialHochgeladen voncyanpak
- optimizing an advertising campaignHochgeladen vonapi-241793203
- Physical cell ID planning for LTE system.pdfHochgeladen vonVikas Kumar
- harq-2011Hochgeladen vonsmbokhari
- HUAWEI_E392-specs.pdfHochgeladen vonYoga Bengawan
- Geometric Global OptimizationHochgeladen vonRex Sanchez
- agilent LTEHochgeladen vonmithunapurva
- On the Quality of Optimal Assignment for Data AssociationHochgeladen vonDon Hass
- 04389045.pdfHochgeladen vonImam Fauzi
- sudokuSolverHochgeladen vonAlan Richards
- Learning a Metric for Music SimilarityHochgeladen vonmachinelearner
- Questions UFMF68!20!2 Ex Paper_ResitHochgeladen vonLibrary
- b.com.GeneralcbcsdraftsyllabusHochgeladen vonSumit Halder
- Prob_1_1Hochgeladen vonmiguelgtturbo
- Nonlinear Model Predictive Control UAVHochgeladen vonSohibul Hajah
- 5. Foundation Embedded in a Layered Half-SpaceHochgeladen vonararrati
- Optimization, PedregalHochgeladen vonmjcarri
- IEEE7Hochgeladen vonlcheekala
- FP_00057Hochgeladen vonAi Heart Pink
- projectsecondsimister-160526105440Hochgeladen vonPMM Ikhbal
- II CM _SY_110112115544Hochgeladen vonmayank13333
- Optimal Equipment Pricing , Love.pdfHochgeladen vonYASHVARDHAN DIDWANIA
- Simulated Binary Crossover for.pdfHochgeladen vonHako Khechai
- 585-932-1-SMHochgeladen vonTushar K Gohel
- syllabusICA1314newHochgeladen vonAakash Jain
- Operations ResearchHochgeladen vonAishwarya Kulkarni
- 2005_StructuralOptimizationStaticsDinamicsBeyondHochgeladen vonbrucemls
- 1112 QMDS100 Fall1 OutlineHochgeladen vonJacky Tang
- Eeee.pdfHochgeladen vonSiva Prasad
- Benders Decomposition for DummiesHochgeladen vonJeff Gurguri

- lteHochgeladen vonEr Biswajit Biswas
- 01 FrontHochgeladen vonKathleen Franklin
- 01-060-04Hochgeladen vonKathleen Franklin
- wangtao105753-self-201209-3Hochgeladen vonKathleen Franklin
- Full Text 01Hochgeladen vonNiapionUmineInaZain
- Adaptive Multicore Scheduling for the LTE Uplink_MAX_UE.pdfHochgeladen vonurfriendlyjoe
- 2012-hennepeHochgeladen vonKhoi.utc
- Rohling PrHochgeladen vonKathleen Franklin
- Ahmad Ayaz These VFHochgeladen vonKathleen Franklin
- LTE SC-FDMA for upllinkHochgeladen vonmike_miguel123
- Full Text 02Hochgeladen vonKathleen Franklin
- Wimax for DummiesHochgeladen vonMichael John Mjatta
- DissertationHochgeladen vonKathleen Franklin
- 11-232Hochgeladen vonKathleen Franklin
- Wang Dr ThesisHochgeladen vonKathleen Franklin
- Wi Max Lt e EqualizersHochgeladen vonKathleen Franklin
- 01-039-05Hochgeladen vonKathleen Franklin
- Pilot bitHochgeladen vonRamesh Shah
- 01-040-04Hochgeladen vonKathleen Franklin
- 11 Uplink Channel Aware SchedulingHochgeladen vonKathleen Franklin
- 35.232-2011.17 Abdulhadi AboualmalHochgeladen vonKathleen Franklin
- Channel Estimation Techniques of SC-FDMAHochgeladen vonKathleen Franklin
- 0004077Hochgeladen vonKathleen Franklin
- BookHochgeladen vonKathleen Franklin
- Bit Flipping Decoding Algorithms for LDPC CodesHochgeladen vonKathleen Franklin
- Fading ChannelHochgeladen vonosbihat

- Smart Wireless Sensor Networks (2010)Hochgeladen vonPaunescu Mihai
- 29915_9789533073248UWBTechnologiesHochgeladen vonConstantin Piştea
- (ebook) DSL Advances - Prentice Hall.pdfHochgeladen vonCaterine Feria Ramirez
- vit-matHochgeladen vonJagadeesh Ramayanam
- Paper Slm and Hadamard CodeHochgeladen vonArjav Desai
- Power Line Carrier CommunicationHochgeladen vonVaibhav Rai
- OFDM Matlab codeHochgeladen vonKool Rakesh
- Mobile WiMAX- Part 1-Overview and PerformanceHochgeladen vonshahadfais
- Docfoc.com-Chapter 6 OFDM-DMT for Wireline Communications.pptHochgeladen vonbolerm
- Implementation of High Speed Railway Mobile Communication SystemHochgeladen vonEditor IJRITCC
- 09 RA47049EN60GLA0 Capacity ManagementHochgeladen vonsurma12
- 5GA V2X Report FINAL for Upload (1)Hochgeladen vonmitsuosakamoto
- 29391532-PhD-Thesis-Scheduling-and-Link-Adaptation-for-Uplink-SC-FDMA-Systems.pdfHochgeladen vonVarun Tomar
- A Fixed-Point Type for OctaveHochgeladen vongasrodriguez
- Structure of the DemoHochgeladen vonSrinivas Hero
- Overview of WimaxHochgeladen vonAnuradha Thilakarathna
- 80211 Tutorial VeriwaveHochgeladen vonVivekjha2
- Compare Models SONICWALLHochgeladen vonAnonymous TtiPjCFEQ
- wimaxHochgeladen vonsrshelke
- Wireless LAN Tech Brief FinalHochgeladen vonRaghavendran Balakumar
- 40-RCIHochgeladen vonyasir9909
- A Comparison of 5G Candidate Waveforms Subject to Phase Noise Impairment at Mm-wave FrequenciesHochgeladen vonasr
- 684967Hochgeladen vonRamiz Rzaoglu
- ramya mtechHochgeladen vonRamesh Ankathi
- HomePlug Green PHY Whitepaper 100614Hochgeladen vonSetyo Wahyu Tomo
- commmuniction (1)Hochgeladen vonAnonymous 7H5MZY
- 5832849Hochgeladen vonVilasak Itpt
- ME CN.pdfHochgeladen vonFaizan Khan
- MATLAB Projects List From SoftroniicsHochgeladen vonsoftroniics
- Channel Estimation for Lte DownlinkHochgeladen vonAttila Kovács

## Viel mehr als nur Dokumente.

Entdecken, was Scribd alles zu bieten hat, inklusive Bücher und Hörbücher von großen Verlagen.

Jederzeit kündbar.