TSG-RAN WG1#49 Kobe, JAPAN 7th 11th May 2007 Agen a !te"# So&'(e# T,t-e# .

.o(&"ent 2o'# 7$1%$1 N)* G'o&+ ./ 0n,(a1t Re1o&'(e A--o(at,on S,gna--,ng .,1(&11,on an .e(,1,on

R1-072119

Introduction

The resource allocation information must be signalled in the downlink L1/L2 control channel to each scheduled UE. For the uplink, an efficient Tree based method has been alread! proposed for the localised allocations "2#. $owe%er, for downlink, a discontinuous localised allocations and resource block le%el distribution must be supported with small number of signaling bits. &n this contribution, a combination of reduced 'it mapping and Tree based method is proposed for the downlink resource assignment with discontinuous localised allocations and resource block le%el distribution transmission.

DL Resource Allocation Signalling

The proposed reduced 'it mapping method is shown on Tab-e 1a-( for different bandwidths. &n order to reduce the signalling bits, the total s!stem bandwidth is di%ided into three e(ual parts )Upper, *iddle and Lower+ for 2,*$- and 1.*$- bandwidths while 1,*$-, .*$- and 2..*$- are di%ided into two e(ual parts each. $owe%er, for smaller bandwidth of 1.2.*$-, no di%ision is applied as the signalling bits are alread! small. &n &n addition, a Tree based method signalling can be used where there is small number of discontinuous localised allocations that are locating in different parts of the s!stem bandwidth. This will gi%e a greater fle/ibilit! to the scheduler. &n Table 1a for 2,*$- bandwidth, signalling of two localised allocations are concatenated and padding is used for the remaining bits, 10/21padding 2 03 bits. For the 4L resource block )5'+ le%el distributed transmission, we assume the concept described in "3 .# where some 5's are put aside for distributed transmission. The location of these 5's can be signalled within L1/L2 control signalling for each UE or broadcasting channel for all UEs. &n our proposal, in order to reduce the number of signalling bits, in some bandwidth, it is more efficient to signal the location of these 5's in the broadcasting channel while in some other bandwidths there is alwa!s some space for the signalling of these 5's in L1/L2 control channel. 6hen these distributed 5's are signalled within L1/L2 control signalling as part of the resource assignments )see for e/ample Table 1a with last 111 bits+ a Tree based method "7# can be used to pro%ide the smallest number of bits in %iew

of that the location of these 5's are e(uall! spaced within the whole s!stem bandwidth. 8 Tree based method that can be applied for both localised and distributed 5's signalling is shown on 8ppendi/ 8. For 5' le%el distributed transmission, multiple users are multiple/ed subcarrier wise within one 5' as shown on 3,g&'e 1. &t is possible one UE to be assigned more than one subcarrier depending on the re(uired data rate. 6e propose to appl! either 'it mapping )i.e. 12 bits+ or Tree based method )i.e. 9 bits+ to indicate the number of subcarriers allocated for each UE. The top part of 3,g&'e 1 shows 12 UEs multiple/ed in F4* manner in one 5' and each UE:s data is distributed across 12 5's to benefit from the fre(uenc! di%ersit!. Further more, the middle and lower part of 3,g&'e 1 shows a situation where a red UE has higher data rate )i.e. 25's and 75's+ than other UEs.
1st RB '(s
1 2 ! " # 7 $ % 1&1112 1 2

2nd RB
! " # 7 $ % 1&1112 1 2

12th RB
! " # 7 $ % 1&1112

'(s '(1 '(2

1 1 2

" # 7 $ % 1&1112

1 1 2

" # 7 $ % 1&1112

1 1 2

" # 7 $ % 1&1112

1 1 1 1 1 1 2 2 2 2 2 2

1 1 1 1 1 1 2 2 2 2 2 2 12-bits for Bit-mapping or 7-bits for Tree-based method

1 1 1 1 1 1 2 2 2 2 2 2

3,g&'e 1$ R4 -e5e- ,1t',b&te t'an1",11,on1$

Tab-e 1a$ ./ Re1o&'(e a11,gn"ent 1,gna--,ng ,n 20M67 an 10M67 ban 8, th1$

2,*$1,, 5's 5esolution 1,2,0 ,,, ,,1 ,1, ,11 03 bit, Upper part with 15' resolution )03 5's+ 03 bit, *iddle part with 15' resolution )03 5's+ 03 bit, Lower part with 15' resolution )03 5's+ 03 bit, Upper + Middle parts with 25' resolution )7; 5's+ 1,, 03 bit, Lower + Middle parts with 25' resolution )7; 5's+ 1,1 11, 03 bit, 8ll with 05' resolution )ma/ 1,, 5's+ 03 bit, <oncatenated two discontinuous localised assignments using Tree based method )10/21padding 2 03 bits+ 1,1 11, 1,, ,,, ,,1 ,1, ,11 1.*$9. 5's 5esolution 1,2,0 2. bit, Upper part with 15' resolution )2. 5's+ 2. bit, *iddle part with 15' resolution )2. 5's+ 2. bit, Lower part with 15' resolution )2. 5's+ 2. bit, Upper + Middle part with 25' resolution )., 5's+ 2. bit, Lower + Middle parts with 25' resolution )., 5's+ 2. bit, 8ll with 05' resolution )9. 5's+ 2. bit, <oncatenated two discontinuous localised assignments using Tree based method )12/2 2 231padding 22. bits+

111

03 bit, 4istributed 5's signalling using Tree based )10 'its+ and distributed subcarrier assignment using 'it mapping method )12 bits+, in total 2 101121padding 2 03 bits.
Note: The location distributed RBs is not needed to be signalled in BCH or from higher la ers!

111

2. bit, 4istributed 5's signalling using Tree based )12 'its+ and distributed subcarrier assignment using 'it mapping method )12 bits+, in total 2 121121padding 2 2. bits.
Note: The location distributed RBs is not needed to be signalled in BCH or from higher la ers!

Tota- b,t1

%9%4 : %7 b,t1

%92; : 2< b,t1

Tab-e 1b$ ./ Re1o&'(e a11,gn"ent 1,gna--,ng ,n 10M67 an ;M67 ban 8, th1$

1,*$., 5's 5esolution 1,2 ,,, ,,1 ,1, ,11 2. bit, Upper part with 15' resolution )2. 5's+ 2. bit, Lower part with 15' resolution)2. 5's+ 2. bit, 8ll with 25' resolution )., 5's+ 2. bit, <oncatenated two discontinuous ,, ,1 1, 11 .*$2. 5's 5esolution 1,2 10 bit, Upper part with 15' resolution)10 5's+ 10 bit, Lower part with 15' resolution)10 5's+ 10 bit, 8ll with 25' resolution )ma/ 2. 5's+ 10 bit, 4istributed subcarrier assignments using 'it mapping method )12 bits+, in total 2 121padding 2 10 bits.
Note: The location distributed RBs is needed to be signalled in BCH or from higher la ers!

localised assignments using Tree based method )11/2 2 221padding 22. bits+.

1,,

2. bit, 4istributed 5's signalling using Tree based )11 'its+ and distributed subcarrier assignment using 'it mapping method )12 bits+, in total 2 111121padding 2 2. bits.
Note: The location distributed RBs is not needed to be signalled in BCH or from higher la ers.

291% : 1; b,t1

Tota- b,t1

%92; : 2< b,t1

Tab-e 1($ ./ Re1o&'(e a11,gn"ent 1,gna--,ng ,n 2$;M67 an 1$2;M67 ban 8, th1$

2..*$12 5's 5esolution 1,2 ,, 9 bit, Upper part with 15' resolution )9 5's+ 1.2.*$7 5's 5esolution 1 , 9 bit, 8ll with 15' resolution )7 5's+, all 5's are non distributed transmissions. ,1 9 bit, Lower part with 15' resolution )9 5's+ 1 9 bit, 4istributed subcarrier assignments using Tree method )9 bits+, in total 2 9 bits, all 5's are distributed transmissions. Note:The location of distributed RBs is not needed to be signalled in BCH or from higher la ers! 1, 9 bit, 8ll with 25' resolution )12 5's+ 11 9 bit, 4istributed subcarrier assignments using Tree method )9 bits+, in total 2 9 bits. Note:The location of distributed RBs is needed to be signalled in BCH or from higher la ers!

197 : < b,t1

Tota- b,t1 297 : 9 b,t1

)onclusions &n this contribution, we ha%e proposed a combination of reduced 'it mapping method and Tree based method to minimi-e the number of bits for 4L resource allocation signaling. $ence, we propose to adapt such method for LTE 4L resource assignment, Tab-e 1a-( be accepted.

References
"1# 0=>> T5 2..;13 %1.2.2, ?>h!sical La!er 8spects for E%ol%ed UT58@. "2# 51 ,9,;;1, ?Uplink 5esource 8llocation for EUT58@ AE< =roup, ATT 4o<o*o. "0# 51 ,9,,07, ?E UT58 4L L1/L2 <ontrol <hannel &nformation B 58 map reduction@ *otorola. "3# 51 ,9,;93, ?4ownlink 4istributed 5esource 'lock *apping@, AE<, ATT 4o<o*o.

".# 51 ,9111., ?<omparison between 5' le%el and Cub carrier le%el 4istributed Transmission for Chared 4ata <hannel in E UT58 4ownlink@, ATT 4o<o*o, AE<D "7# 51 ,72990, ?Uplink 5esource 8llocation for EUT58@ AE< =roup, ATT 4o<o*o.

"

Appendi* A+ Tree Based Resource Allocation ,#-

For resource allocation signalling, a triangular structure as shown below is constructed with the number of 5's a%ailable for a particular bandwidth e(ual to the number of leaf nodes. 8n e/ample for the 1.2. *$- bandwidth is shown in 3,g&'e 2 with a minimum resource block unit of 12 subcarriers.

3,g&'e 2 # /o(a-,1e = .,1t',b&te A--o(at,on1 8,th 1$2;M67 ban 8, th

For a bandwidth with N leaf nodes, the triangle depth e(uals N and the number of nodes in the tree e(ual N)N11+/2. 8 node number can hence be signalled using ceil)log2)NE)N11+/2++ number of bits. The e/act number of bits re(uired for each bandwidth is shown in the table below. *$N F'its 1.2. 7 . 2.. 12 9 . 2. G 1, ., 11 1. 9. 12 2, 1,, 10

The node numbering is designed to optimise the number of signalling bits re(uired to signal a particular resource allocation. &n the e/ample for 1.2. *$- bandwidth abo%e, a . bit number is .

signalled to uni(uel! determine the starting 5' and the number of consecuti%e 5's. &n a bandwidth with A leaf 5's, the starting resource block H and number of consecuti%e resource blocks > can be signalled as an unsigned integer " as follows I
N if ) P 1+ 2

x = N ( P 1) + O J

else
x = N ) N ) P 1++ + ) N 1 O + J

For localised allocation, each UE is signalled a node number which maps to a set of leaf 5's. 8s an e/ample, pre%ious Figure 2 shows a scenario where three localised users are multiple/ed within 1.2. *$- bandwidth with the green user allocated 5's , and 1, the red user 5's 2, 0 and 3 and the blue user 5' .. &n this case, the green user is signalled to 7, the red user is signalled to 13 and the blue user is signalled to .. 8n e/ample of distributed resource allocation for the same bandwidth is also shown in 3,g&'e 2 )on the right side+. The red user allocated 5's 1 and . is signalled to 17. The > and H %alues are decoded in the same manner as in the localised transmissionJ howe%er the interpretation is different with > denoting the 5' spacing and H denoting the first 5' in the distributed allocation. 8t the recei%er a simple decoding scheme not re(uiring the benefit of a lookup table can be used to reco%er the %alues of > and H. The %alues of > and H at the recei%er can be e/tracted as followsK
x a = +1 N b = x mod N

if ) a1b L N + M P2N12Ia O2NI1Ib N elseM P2a O2b