1 Modification on random sequence generation scheme in DL/UL PHY (AWD – ) IEEE Presentation Submission Template (Rev. 9) Document Number: IEEE C802.16m-09/1593r2 Date Submitted: Source: Yu-Tao Hsieh, Chia-Lung Tsai, Pang-An Ting ITRI Venue: IEEE Session #62, San Francisco Base Contributions: None Re: Call for Contribution on 80216m-09_0028r1 Purpose: Discussion and Approval Notice: This document does not represent the agreed views of the IEEE Working Group or any of its subgroups. It represents only the views of the participants listed in the “Source(s)” field above. It is offered as a basis for discussion. It is not binding on the contributor(s), who reserve(s) the right to add, amend or withdraw material contained herein. Release: The contributor grants a free, irrevocable license to the IEEE to incorporate material contained in this contribution, and any modifications thereof, in the creation of an IEEE Standards publication; to copyright in the IEEE’s name any IEEE Standards publication even though it may include portions of this contribution; and at the IEEE’s sole discretion to permit others to reproduce in whole or in part the resulting IEEE Standards publication. The contributor also acknowledges and accepts that this contribution may be made public by IEEE Patent Policy: The contributor is familiar with the IEEE-SA Patent Policy and Procedures: and. Further information is located at and.

2 Introduction Problem formulation Proposed modification Simulation results Proposed text

3 Problem formulation This contribution serves to reply the comment #424 and #675 with emphasis on random sequence generation function of In current AWD, the subcarrier/tile permutation is composed of two steps  (1) Random sequence generation function PermSeg( )  (2) Randomizer function g( ) It is found that in some cases the permutation output does not actually randomize the input sequence

4 Problem formulation (cont.) An example  UL tile permutation with L DRU =6, IDcell=1 The output of PermSeq() contains a segment with sequential input elements,. i.e., Applying the permuted output to the randomizer which in UL is defined as Inputoutput

5 Problem formulation (cont.) The frequency diversity gain is reduced when a user burst uses long TTI with multiple subframes The artifact of the AWD randomization output can be solved by  Modifying PermSeq ()  Modifying g ()  Modifying both We propose to modify PermSeq () to improve the system performance

6 Proposed modification Increase randomness of the AWD random sequence generation function by three modifications  Step 1.a. Modify d 2 as d 2 = SEED mod  Step 2.b. Increment x by i once and for all without iteration index j  Step 2.c. Modify calculation of y = d 1 *x+d 2 as y=d 1 +d 2 *x Advantages of the proposed algorithm  For a certain user burst: improve the frequency diversity for consecutive UL subframes or DL symbols  For interfering bursts: Reduce the DL/UL hit rate among different IDcell’s  Maintain average SNR distribution  Complexity is reduced No need to iterate 2.c with max. number N.

7 Random sequence output comparison (M=8) AWD Proposed algorithm

8 Random sequence output comparison (M=12) AWD Proposed algorithm

9 Random sequence output comparison (M=16) AWDProposed algorithm

10 Statistics of non-permuted segments Cell id = 0~511 Non-permuted segment length 34~78~M AWDM = M = M = M = M = M = ProposedM = M = M = M = M = M =

11 Simulation for UL Tile permutation Channel model: PB-3 2x2 MIMO uncorrelated channel Cellid = 0~511 Channel estimator: 2D-MMSE Permutation parameter: N1 = 4, N2 = 1

12 Freq. Partition # of subbands (K SB,FP,i ) # of minibands (K MB,FPi ) # of PRUs in FP i FP12412 FP22412 FP32412 FP42412 Scenario1 (Mixed Reuse 1&3 – equal size) Scenario 2 (Mixed Reuse 1&3 – unequal size) Freq. Partition # of subbands (K SB,FP,i ) # of minibands (K MB,FPi ) # of PRUs in FP i FP14824 FP2088 FP3088 FP4088 Scenario 3 (Reuse 1) Freq. Partition # of subbands (K SB,FP,i ) # of minibands (K MB,FPi ) # of PRUs in FP i FP FP2000 FP3000 FP4000 Scenario 4 (Reuse 3) Freq. Partition # of subbands (K SB,FP,i ) # of minibands (K MB,FPi ) # of PRUs in FP i FP1000 FP22816 FP32816 FP42816 BW = 10 MHz, N PRU = 48 (N 1 = 4, N 2 = 1) UL Evaluation Scenarios

13 UL SNR distribution comparison: Scenarios 1, 2

14 UL SNR distribution comparison: Scenarios 3, 4

15 UL Hit rate comparison Select (512,2) = Cell_ID pairs  The hit rate of 3 collisions is reduced # COLLISION0 COLLISION1 COLLISION2 COLLISIONs3 COLLISIONs AWD6 DRU DRU DRU DRU DRU DRU Proposed algorithm 6 DRU DRU DRU DRU DRU DRU

16 DL Simulation for DL subcarrier permutation Channel model: PB-3 2x2 MIMO uncorrelated channel Cellid = 0~511 Channel estimator: 2D-MMSE Permutation parameter: N1 = 4, N2 = 1

17 Freq. Partition # of subbands (K SB,FP,i ) # of minibands (K MB,FPi ) # of PRUs in FP i FP12412 FP22412 FP32412 FP42412 Scenario1 (Mixed Reuse 1&3 – equal size) Scenario 2 (Mixed Reuse 1&3 – unequal size) Freq. Partition # of subbands (K SB,FP,i ) # of minibands (K MB,FPi ) # of PRUs in FP i FP14824 FP2088 FP3088 FP4088 Scenario 3 (Reuse 1) Freq. Partition # of subbands (K SB,FP,i ) # of minibands (K MB,FPi ) # of PRUs in FP i FP FP2000 FP3000 FP4000 Scenario 4 (Reuse 3) Freq. Partition # of subbands (K SB,FP,i ) # of minibands (K MB,FPi ) # of PRUs in FP i FP1000 FP22816 FP32816 FP42816 BW = 10 MHz, N PRU = 48 (N 1 = 4, N 2 = 1) DL Evaluation Scenarios

18 DL SNR distribution comparison: scenario 1, 2

19 DL SNR distribution comparison: scenario 3, 4

20 ProposalL DRU = 6L DRU = 8L DRU = 10L DRU = 12L DRU = 16L DRU = 24 AWD Proposed algorithm DL Hit Number Comparison ProposalL DRU = 6L DRU = 8L DRU = 10L DRU = 12L DRU = 16L DRU = 24 AWD Proposed algorithm Hits counted for 12 to 48 hits Hits counted for 24 to 48 hits The hit rate reduction is more prominent for heavy collision cases

21 Summary The proposed modified random sequence generation scheme has the following advantage  Largely reduce the non-permuted segments of random sequence generation output  Simply the computation procedure (N is not needed)  Better Hit rate and similar SNR distribution

22 Proposed text 1)Initialization a) Initialize the variables of the first order polynomial equation with the 10- bit seed, SEED. Set d 1 = floor(SEED/2 5 ) + 1 and d 2 = SEED mod b) Initialize the maximum iteration number, N=4. Initialize an array A with size M with the numbers 0, 1, …, M-1 (i.e. A[0]=0, A[1]=1, …, A[M-1]=M-1). c) Initialize the counter i to M-1. d) Initialize x to -1. 2)Repeat the following steps if i > 0 a) Initialize the counter j to 0. a) Increment x and j by 1. by i. b) Calculate the output variable of y = {(d 1 *x + d 2 ) (d 1 + d 2 *x) mod 1031} mod M. c) Repeat the above steps 2.b and 2.c if y ≥ i and j<N. c) If y ≥ i, set y = y mod i. d) Swap A[i] and A[y]. e) Decrement i by 1. 3)PermSeq[i] = A[i], where 0 ≤ i < M. Replace the AWD text in by