3GPP TSG RAN WG1#48
`
`St. Louis, USA
`
` February 12 – 16, 2007
`
`Agenda Item:
`
`8
`
`Tdoc R1-071137
`
`Source:
`
`
`
`CATT, TD-TECH
`
`Title: LCR TDD: Structure and Coding for E-HICH
`
`Document for:
`
`Discussion/Decision
`
` 1
`
`Introduction
`
`The HARQ acknowledgement indicators are transmitted on a new downlink physical channel termed E-DCH
`HARQ Acknowledgement Indicator Channel (E-HICH) for 3.84Mcps TDD [1]. For LCR TDD EUL, it is
`proposed that the downlink physical channel E-HICH is also included for transmitting the HARQ
`acknowledgement indicators. In this document, structure and coding for E-HICH are discussed and text
`proposal for TR 25.827[2] is also provided.
`2 Structure
`Similar to HCR TDD, it is proposed that E-HICH is a SF=16 downlink physical channel and QPSK modulation
`shall be applied. Multiple users’ ACK/NACK indicators are code-division-multiplexed on E-HICH. Different
`from HCR, it is proposed thatE-HICHs for non-scheduled users carry not only ACK/NACK indicators but also
`TPC/SS commands. The structures of E-HICH for scheduled users and non-scheduled users are discussed
`respectively blow.
`
`2.1 Selection of signature sequences
`
`2.1.1 Scheduled users
`Each scheduled user’s ACK/NACK indicator is spread by a short-term orthogonal code assigned by higher
`layer.
`
`2.1.2 Non-scheduled users
`TPC and SS of scheduled users are transmitted on E-AGCH. Since there are no E-AGCHs for non-scheduled
`users, it is proposed that E-HICH is used to convey TPC and SS for non-scheduled users. In [3], it is proposed
`that the 8 spare bits are used to carry TPC and SS. One E-HICH may thus carry at most two non-scheduled
`users’ information. This scheme restricts the number of non-scheduled users carried on one E-HICH. In this
`section, a new scheme is proposed so that the number of non-scheduled users carried on an E-HICH can be
`increased.
`
`It is proposed that the 80 signature sequences are divided into 20 groups while each group includes 4 sequences.
`Every non-scheduled user is assigned one group by higher layer. Among the 4 sequences, one is used to indicate
`ACK/NACK, and the other three are used to indicate the TPC/SS command. The three sequences and their three
`reverse sequences are the six possible sequences chosen to indicate the TPC/SS state. The reverse sequence is
`constructed by reverse every bit of the sequence from 0 to 1 or from 1 to 0. The mapping between the index and
`the TPC/SS command is shown in table 1. The index is calculated according to the equation: index=2*A+B,
`
`BlackBerry Exhibit 1007, pg. 1
`
`

`
`(A=0,1,2; B=0,1). A is the relative index of the selected sequence among the three assigned sequences and B
`equals to 1 when the reverse sequence is chosen, otherwise, B equals to 0. The power of the sequence used for
`TPC/SS indication can be set differently from the one used to indicate ACK/NACK.
`
`Table 1 Mapping between the index and TPC/SS command
`
`index
`0
`1
`2
`3
`4
`5
`
`TPC command
`‘DOWN’
`‘UP’
`‘DOWN’
`‘UP’
`‘DOWN’
`‘UP’
`
`SS command
`‘DOWN’
`‘DOWN’
`‘UP’
`‘UP’
`‘Do Nothing’
`‘Do Nothing’
`
`2.2 Coding and Multiplexing of acknowledgement indicators on E-HICH
`The system may configure several E-HICHs in a cell. Each E-HICH physical channel may carry not only
`ACK/NACK indicators for scheduled users, but also ACK/NACK indicators, TPC and SS commands for
`non-scheduled users，with different signature sequences being assigned to scheduled users
`and/or non-scheduled users. Up to four E-HICHs may be configured for a scheduled transmission. The 2-bit
`EI on E-AGCH is used to indicate which E-HICH is used by the specific scheduled user while which E-HICH is
`used by the non-scheduled user is informed by higher layer.
`
`2.2.1 Scheduled user
`Channel coding process for E-HICH is proposed below:
`
` Each ACK/NACK indicator is firstly spread by the corresponding signature sequence to 80 bits.
`
` Spare bits are appended and the sequence becomes 88-bit long.
`
` Bit scrambling is applied to each of the 88-bit sequence.
`
` Each Sequence after bit scrambling is QPSK modulated and amplitude-weighted.
`
` Multiple acknowledgement indicators are multiplexed. (Multiplexing is transparent when only one
`ACK/NACK indicator is carried on the E-HICH.)
`
`Physical channel spreading and scrambling operation are then performed in the usual manner.
`
`Figure 1 illustrates the multiplexing of acknowledgement indicators for scheduled users.
`
`BlackBerry Exhibit 1007, pg. 2
`
`

`
`Figure 1 – Multiplexing of acknowledgement indicators for scheduled users
`
`2.2.2 Non-scheduled user
`There are two signature sequences on E-HICH for each non-scheduled user.
`
` ACK/NACK is spread by the signature sequence assigned by higher layer to 80 bits. Another sequence is
`chosen according to TPC/SS command.
`
` Spare bits are appended to both of the two sequences and they both become 88-bit long.
`
`
`
` Bit scrambling is applied to each of the 88-bit sequence.
`
` Each Sequence after bit scrambling is QPSK modulated.
`
` The sequence used to indicate TPC/SS is multiplied by a factor set by Node-B. Two sequences belonging
`to one non-scheduled user are added.
`
` The amplitudes of different users are adjusted and then multiplexed together.
`
`Physical channel spreading and scrambling operation are then performed in the usual manner.
`
`Figure 2 illustrates the multiplexing of acknowledgement indicators for non-scheduled users.
`
`BlackBerry Exhibit 1007, pg. 3
`
`

`
`Figure 2 – Multiplexing of acknowledgement indicators for non-scheduled users
`
`3 Signature Sequences
`It is proposed to have a common signature sequence of length 80 irrespective of scheduled users or non-
`schedule users. The sequences are the rows of an orthogonal matrix of order 80 which is Kronecker tensor
`product of one Hadamard matrix of order 20 and another Hadamard matrix of order 4. Two Hadamard matrices
`used to construct the orthogonal matrix of order 80 are listed in Table 2 and Table 3 below.
`
`Table 2 – Hadamard matrix of order 4
`
`
`
`m
`
`0 1 2 3
`
`C4,0,m 1 1 1 1
`
`C4,1,m 1 0 1 0
`
`C4,2,m 1 1 0 0
`
`C4,3,m 0 1 1 0
`
`
`
`Table 3 – Hadamard matrix of order 20
`
`k
`
`0
`
`C20,0,k 1
`
`1
`
`0
`
`2
`
`0
`
`3
`
`0
`
`4
`
`0
`
`5
`
`1
`
`6
`
`0
`
`7
`
`0
`
`8
`
`0
`
`9
`
`0
`
`10 11 12 13 14 15 16 17 18 19
`
`1
`
`1
`
`0
`
`1
`
`0
`
`0
`
`1
`
`0
`
`1
`
`0
`
`0
`
`1
`
`1
`
`0
`
`1
`
`1
`
`0
`
`1
`
`C20,1,k 0
`
`C20,2,k 0
`
`C20,3,k 0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`1
`
`0
`
`1
`
`1
`
`1
`
`1
`
`0
`
`1
`
`1
`
`1
`
`0
`
`1
`
`1
`
`0
`
`0
`
`1
`
`1
`
`0
`
`BlackBerry Exhibit 1007, pg. 4
`
`

`
`C20,4,k 0
`
`C20,5,k 0
`
`C20,6,k 1
`
`C20,7,k 1
`
`0
`
`1
`
`0
`
`1
`
`0
`
`1
`
`1
`
`0
`
`0
`
`1
`
`1
`
`1
`
`1
`
`1
`
`1
`
`1
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`1
`
`0
`
`0
`
`1
`
`0
`
`1
`
`0
`
`0
`
`1
`
`0
`
`1
`
`0
`
`0
`
`1
`
`0
`
`1
`
`1
`
`0
`
`0
`
`1
`
`0
`
`1
`
`1
`
`0
`
`0
`
`1
`
`1
`
`1
`
`1
`
`0
`
`1
`
`0
`
`1
`
`1
`
`1
`
`0
`
`0
`
`0
`
`1
`
`1
`
`1
`
`1
`
`0
`
`0
`
`1
`
`C20,8,k 1
`
`C20,9,k 1
`
`C20,10,k 0
`
`C20,11,k 0
`
`1
`
`1
`
`0
`
`0
`
`1
`
`1
`
`1
`
`0
`
`0
`
`1
`
`1
`
`1
`
`1
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`0
`
`1
`
`1
`
`0
`
`1
`
`1
`
`0
`
`0
`
`1
`
`0
`
`1
`
`1
`
`0
`
`1
`
`1
`
`0
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`1
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`1
`
`1
`
`0
`
`1
`
`0
`
`1
`
`0
`
`1
`
`1
`
`0
`
`1
`
`1
`
`1
`
`1
`
`1
`
`1
`
`1
`
`1
`
`C20,12,k 1
`
`C20,13,k 1
`
`C20,14,k 0
`
`C20,15,k 0
`
`C20,16,k 1
`
`0
`
`1
`
`1
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`0
`
`1
`
`1
`
`0
`
`0
`
`0
`
`0
`
`1
`
`1
`
`0
`
`0
`
`0
`
`1
`
`1
`
`0
`
`1
`
`0
`
`1
`
`1
`
`0
`
`1
`
`0
`
`1
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`1
`
`1
`
`0
`
`1
`
`1
`
`0
`
`1
`
`1
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`C20,17,k 0
`
`C20,18,k 0
`
`C20,19,k 1
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`1
`
`0
`
`1
`
`0
`
`1
`
`0
`
`1
`
`1
`
`0
`
`0
`
`1
`
`1
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`Let C4 denote the 4x4 Hadamard matrix and C20 denote the 20x20 Hadamard matrix. The 80x80 Hadamard
`matrix C80 is the Kronecker tensor product of C20 and C4.
`
`⊗
`C
`20
`4
`⊗ ≠ ⊗ .
`Note: Kronecker product is not commutative, i.e. A B B A
`The Kronecker tensor product of two matrices ( A B⊗ ) maps two arbitrarily dimensioned matrices into a larger
`matrix. Given the nxm matrix A and the pxq matrix B,
`
`=
`
`C
`
`C
`80
`
`=
`
`A
`
`
`
`
`
`
`
`a
`11
`
`
`  
`a
`a
`
`
`1n
`
`a
`m
`1
`
`
`
`
`
`
`nm n m
`×
`
`,
`
`B
`
`
`
`= 
`
`
`
`their Kronecker tensor product A B⊗ is the (np)x(mq) matrix
`
`b
`11
`
`b
`
`1q
`
`
`  
`b
`b
`
`
`p
`
`1
`
`pq
`
`
`
`
`
`
`
`
`
`×
`p q
`
`BlackBerry Exhibit 1007, pg. 5
`
`

`
`⊗ =
`A B
`
`
`
`
`
`
`
`a B
`11
`
`a B
`
`1m
`
`
`
`
`
`  
`
`a B
`a B ×
`
`
`
`1n
`nm
`np mq
`
`.
`
`For example, given
`
`A
`
`
`= 
`
`
`1
`0
`
`2
`
`−
`1
`
`
`×
`2 2
`
`
`
`B
`
`1 2 3
`4 5 6
`
`
`= 
`
`
`
`
`
`
`
`
`×
`2 3
`
`Kronecker product A B⊗ is
`
`⊗ =
`A B
`
`1 2 3
`4 5 6
`0 0 0
`0 0 0
`
`
`
`
`
`
`
`
`2
`8
`−
`1
`−
`4
`
`6
`4
`10 12
`−
`−
`2
`3
`−
`−
`5
`6
`
`
`
`
`
`
`
`
`
`
`×
`4 6
`
`For binary elements, the corresponding elements are performed the XNor operation instead of multiplication
`operation. It is explained by an example.
`
`Given
`
`A
`
`
`= 
`
`
`1 0
`0 1
`
`
`
`
`
`×
`2 2
`
`
`
`B
`
`=
`
`0 0 1
`1 1 0
`0 1 0
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`×
`3 3
`
`Their Kronecker product
`
`
`
`
`
`⊗ = 
`A B
`
`
`
`
`
`
`0 0 1 1 1 0
`1 1 0 0 0 1
`0 1 0 1 0 1
`1 1 0 0 0 1
`0 0 1 1 1 0
`1 0 1 0 1 0
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`×
`6 6
`
`4 Physical channel structure for E-HICH
`The proposed timeslot format for E-HICH is Slot Format #0 described in section 5A.2.2.4.1.1 in TS25.221 [4]
`which is illustrated below:
`
`Figure 3 – E-HICH physical channel structure
`
`
`
`BlackBerry Exhibit 1007, pg. 6
`
`

`
`5 E-HICH simulation result
`There are 4 ACK/NACK indicators in each E-HICH per TTI including 4 TPC/SS for Non-scheduled E-HICH.
`Each ACK/NACK has the same transmitted power and each TPC/SS’s transmitted power is half of that of
`ACK/NACK ’s.
`
`Simulation parameters are listed in Table 4.
`
`Table 4 – Simulation parameters
`
`Parameter
`
`Codes per timeslot
`Ec/Ior
`Ec/Ioc
`ACK/NACK indicators per E-HICH
`
`Ratio of power setting between
`ACK/NACK and TPC/SS
`Carrier frequency
`Channel type
`Receiver
`Channel estimation
`Midamble scheme
`Power control
`Modulation
`
`
`Value
`
`1
`0dB
`Variable
`4
`
`2
`
`2GHz
`Pedestrian-B 3kmph
`MMSE
`Realistic
`Default midamble, Kcell=8
`None
`QPSK
`
`The simulation result is shown in figure 4.
`
`Comments
`
`
`
`
`for Non-scheduled E-
`HICH including 4
`TPC/SS;
`only for non-scheduled
`E-HICH
`
`
`
`
`
`
`
`
`BlackBerry Exhibit 1007, pg. 7
`
`

`
`E-HICH Performance (PB3)
`
`Scheduled-ACK
`Non-scheduled-ACK
`Non-scheduled-TPC-SS
`
`-10
`
`-5
`Ior/Ioc(dB)
`
`0
`
`5
`
`
`
`Figure4 – Simulation Result
`
`100
`
`10-1
`
`10-2
`
`BLER
`
`10-3
`
`10-4
`-15
`
`Scheduled is the BER of ACK in scheduled E-HICH. Non-scheduled is the BER of ACK in Non-scheduled E-
`HICH. Non-scheduled-TPC-SS is the BER of TPC/ SS in scheduled E-HICH.
`
`Seen from the figure above, in a Pedestrian-B channel, a 1% ACK/NACK error probability is achieved at an E-
`HICH Ec/Ioc of -5.6dB for scheduled E-HICH and -5.1dB for No-scheduled E-HICH. This means that TPS and
`SS are transmitted in E-HICH only with another 0.5 dB.
`
` 6
`
` Reference
`[1] 3GPP TR25.826 v1.0.1 “3.84Mcps TDD Enhanced Uplink; Physical Layer Aspects”
`
`[2] 3GPP R1-063619 TR 25.827 v0.3.1 “1.28Mcps TDD Enhanced Uplink; Physical Layer Aspects” ,
`CATT, RAN WG1 #47, Riga, Latvia, 6th -10th Oct, 2006
`
`[3] R1-062331, “LCR TDD: Structure and Coding for E-AGCH and E-HICH”, CATT, RAN WG1#46,
`Tallinn, Estonia, 28th Aug – 1st Sep, 2006
`
`[4] 3GPP TS25.221 v6.1.0, “Physical channels and mapping of transport channels onto physical channels
`(TDD) (Release 6)”
`[5] 3GPP R1-050870- “TDD E-HICH: structure and coding”, IPWireless, RAN WG1 #42, London, UK, 29th
`August-2nd September 2005
`
`
`
`<<<<<<<<<<<<<<<<<<<<<< start of text proposal >>>>>>>>>>>>>>>>>>>>>>
`
`BlackBerry Exhibit 1007, pg. 8
`
`

`
`8 Physical Channel Structure
`8.2 Physical Channel Structure for Downlink Control Signalling
`8.2.2 HARQ Acknowledgement Indicator Channel (E-HICH)
`
`Formatted: Indent: Left: 0", First line: 0"
`
`The E-DCH HARQ Acknowledgement indicator channel (E-HICH) is a SF=16 downlink physical channel and
`uses timeslot format #0 defined in section 5A.2.2.4.1.1 in TS25.221 which is illustrated in Figure 8.2.2.1.
`
`Formatted: Centered, Indent: Left: 0", First
`line: 0"
`
`Table 8.2.2.1 Time slot format for E-HICH
`
`Slot
`Format
`#
`0
`
`Spreading
`Factor
`
`16
`
`Midamble
`length
`(chips)
`144
`
`NTFCI
`code word
`(bits)
`0
`
`NSS & NTPC
`(bits)
`
`Bits/slot NData/Slot
`(bits)
`
`0 & 0
`
`88
`
`88
`
`Ndata/data
`field(1)
`(bits)
`44
`
`Ndata/data
`field(2)
`(bits)
`44
`
`Formatted: Indent: Left: 0", First line: 0"
`
`
`
`Formatted: Centered, Indent: Left: 0", First
`line: 0"
`
`Figure 8.2.2.1 - E-HICH Structure
`
`
`
`The number of E-HICHs in a cell is configured by the system. Scheduled users’ and non-scheduled users’
`acknowledgement indicators may beare transmitted on the differentsame E-HICHs. At most four E-HICHs can
`be configured for one scheduled user’s scheduled transmission. Which E-HICH is used to convey the
`acknowledgment indicator is indicated by the 2-bit E-HICH indicator on E-AGCH for the specific scheduled
`user while is informed by higher layer for the non-scheduled users. E-HICHs for non-scheduled users carry not
`only the acknowledgement indicators but also TPC and SS commands. The TPC /SS command for the non-
`scheduled users is indicated by selecting different orthogonal sequences. Each E-HICH physical channel may
`carry not only ACK/NACK indicators for scheduled users, but also ACK/NACK indicators, TPC and
`SS commands for non-scheduled users，with different signature sequences being assigned to
`scheduled users and/or non-scheduled users.A single E-HICH may carry one or multiple HARQ
`acknowledgement indicator(s) decided by Node-Band TPC and SS for non-scheduled users. In an implicit
`manner, UE shall use the first signature sequence for HARQ acknowledgement indicator usage and other three
`for defined TPC/SS pattern
`
`The E-HICH contains 8 spare bit locations. The spare bit values are undefined. The power of each user’s
`acknowledgement indicator may be set independently by the Node-B.
`
`Formatted: Indent: Left: 0", First line: 0"
`Formatted: Subscript
`Formatted: Subscript
`
`The acknowledgement inidicator for an E-DCH transmission in TTI “N” is carried by the E-HICH in TTI
`“N+[TA]”(TA is determined according to the value of nE-HICH). The E-HICH is thus synchronously related to
`those E-DCH transmissions for which it carries acknowledgement information.
`
`BlackBerry Exhibit 1007, pg. 9
`
`

`
`<<<<<<<<<<<<<<<<<<<< next changed section >>>>>>>>>>>>>>>>>>>>>>
`9 Multiplexing, Channel Coding and Interleaving
`9.2 Coding and Multiplexing for Downlink Signalling
`9.2.2 E-HICH
`The value of a binary HARQ acknowledgement indicator for user h is denoted “ah” and may assume the value 0
`or 1. The value of the indicator is mapped as shown in table 9.2.2.1.
`
`Table 9.2.2.1 – Mapping of HARQ acknowledgement indicator
`
`Command
`
`NACK
`
`ACK
`
`HARQ acknowledgement indicator value (ah)
`
`0
`
`1
`
`
`
`Construction of the bit sequence for the hth acknowledgement indicator is achieved via a spreading process
`using an orthogonal sequence which is the row of an orthogonal matrix of order 80. This orthogonal matrix(C80)
`is Kronecker tensor product of one Hadamard matrix of order 20 (C20) and another Hadamard matrix of order 4
`=
`⊗
`C
`C
`C
`(C4),
`80
`20
`4
`
`
`
`⊗ is Kronecker tensor product. (note: Kronecker product is not commutative, i.e. A B B A⊗ ≠ ⊗ )
`
`These two Hadamard matrices are given by table 9.2.2.2 and table 9.2.2.3.
`
`Table 9.2.2.2 – Hadamard matrix of order 4
`
`m
`
`0 1 2 3
`
`C4,0,m 1 1 1 1
`
`C4,1,m 1 0 1 0
`
`C4,2,m 1 1 0 0
`
`C4,3,m 0 1 1 0
`
`Formatted: Heading 3, Indent: Left: 0",
`Hanging: 4.13 ch, First line: -4.13 ch
`
`Formatted: Space After: 12 pt
`
`Formatted: Space After: 12 pt
`
`Formatted: Space After: 12 pt
`
`Formatted: Subscript
`
`Formatted: Left, Space After: 12 pt
`
`Formatted: Left, Space After: 12 pt
`
`Formatted: Left, Space After: 12 pt
`
`Formatted: Left, Space After: 12 pt
`
`Formatted: Left, Space After: 12 pt
`
`
`
`Table 9.2.2.3 – Hadamard matrix of order 20
`
`Formatted: Left
`
`Formatted: Left
`
`k
`
`C20,0,k
`
`0
`
`1
`
`1
`
`0
`
`2
`
`0
`
`3
`
`0
`
`4
`
`0
`
`5
`
`1
`
`6
`
`0
`
`7
`
`0
`
`8
`
`0
`
`9
`
`0
`
`10 11 12 13 14 15 16 17 18 19
`
`1
`
`1
`
`0
`
`0
`
`1
`
`1
`
`0
`
`1
`
`1
`
`0
`
`BlackBerry Exhibit 1007, pg. 10
`
`

`
`Formatted: Left
`
`Formatted: Left
`
`C20,1,k
`
`C20,2,k
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`1
`
`1
`
`1
`
`1
`
`1
`
`0
`
`1
`
`1
`
`0
`
`0
`
`1
`
`0
`
`1
`
`1
`
`1
`
`0
`
`1
`
`0
`
`1
`
`0
`
`1
`
`0
`
`1
`
`1
`
`1
`
`0
`
`Formatted: Left
`
`Formatted: Left
`
`C20,3,k
`
`C20,4,k
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`1
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`0
`
`1
`
`1
`
`0
`
`1
`
`1
`
`1
`
`1
`
`0
`
`0
`
`0
`
`1
`
`1
`
`Formatted: Left
`
`Formatted: Left
`
`Formatted: Left
`
`C20,5,k
`
`C20,6,k
`
`C20,7,k
`
`0
`
`1
`
`1
`
`1
`
`0
`
`1
`
`1
`
`1
`
`0
`
`1
`
`1
`
`1
`
`1
`
`1
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`1
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`0
`
`1
`
`1
`
`1
`
`1
`
`0
`
`1
`
`1
`
`0
`
`0
`
`1
`
`Formatted: Left
`
`Formatted: Left
`
`C20,8,k
`
`C20,9,k
`
`1
`
`1
`
`1
`
`1
`
`1
`
`1
`
`0
`
`1
`
`1
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`1
`
`0
`
`1
`
`1
`
`1
`
`1
`
`1
`
`Formatted: Left
`
`Formatted: Left
`
`C20,10,k 0
`
`C20,11,k 0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`1
`
`0
`
`0
`
`1
`
`1
`
`1
`
`0
`
`1
`
`0
`
`1
`
`0
`
`1
`
`0
`
`1
`
`1
`
`1
`
`0
`
`0
`
`1
`
`1
`
`1
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`1
`
`1
`
`0
`
`1
`
`1
`
`0
`
`1
`
`1
`
`1
`
`1
`
`Formatted: Left
`
`Formatted: Left
`
`Formatted: Left
`
`C20,12,k 1
`
`C20,13,k 1
`
`C20,14,k 0
`
`1
`
`1
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`1
`
`1
`
`0
`
`1
`
`1
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`1
`
`1
`
`1
`
`1
`
`1
`
`0
`
`1
`
`1
`
`0
`
`0
`
`1
`
`0
`
`1
`
`0
`
`0
`
`Formatted: Left
`
`Formatted: Left
`
`C20,15,k 0
`
`C20,16,k 1
`
`1
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`1
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`1
`
`0
`
`0
`
`1
`
`1
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`Formatted: Left
`
`Formatted: Left
`
`Formatted: Left
`
`Formatted: Indent: Left: 0", First line: 0"
`
`
`
`C20,17,k 0
`
`C20,18,k 0
`
`C20,19,k 1
`
`1
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`1
`
`0
`
`1
`
`0
`
`1
`
`1
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`0
`
`0
`
`0
`
`0
`
`0
`
`0
`
`1
`
`0
`
`0
`
`1
`
`E-HICHs for scheduled users carry HARQ acknowledgement indicators only. The binary orthogonal sequence
`(C80,r,n) used for spreading operation is selected from the rth row of the orthogonal matrix of order 80 (C80).
`
`The orthogonal sequence for HARQ acknowledgement indicators of scheduled users is assigned by higher
`layers.
`
`A HARQ acknowledgement indicator is synchronously linked with the E-DCH TTI transmission to which it
`relates. There is thus a one-to-one association between an E-DCH TTI transmission and its respective HARQ
`acknowledgement indicator. An allocation resource tag ID “r” (r=0,1,2,…,79) is calculated for the E-DCH
`resource allocation associated with the HARQ acknowledgement indicator.
`
`BlackBerry Exhibit 1007, pg. 11
`
`

`
`Formatted: No bullets or numbering
`
`
`
`
`
`
`
`
`
`=
`
`r
`
`
`
`(16 t
`
`0
`
`+−
`)1
`
`(
`q
`
`0
`
`−
`
`161
`)
`Q
`0
`
`
`
`where:
`
`t0 is the first (lowest-numbered) allocated timeslot (1,2,..,5)
`
`q0 is the lowest-numbered channelisation code index allocated in timeslot t0 (1,2,…, Q0)
`
`Q0 is the spreading factor of the lowest-numbered channelisation code index allocated in timeslot t0
`=
`
`b
`The output of the spreading stage is equal to ,h n
`
`
`a
`
`h
`
`
`
`C
`80,
`
`
`
`,r n
`
`, where n=0,1,…,79.
`
`The bits bh,0, bh,1, …, bh,79 are segmented into two halves corresponding to bh,0, …, bh,39 and to bh,40, …, bh,79. A
`sequence of 8 spare bits zu (u=0,…,7) are inserted between the first and second half of the sequence to form:
`
`Formatted: Centered, Indent: Left: 0", First
`line: 0"
`
`dh={bh,0, bh,1,…, bh,39, z0, z1, …, z6,z7,bh,40, bh,41,…,bh,79}
`
`Formatted: Indent: Left: 0", First line: 0"
`
`Formatted: Subscript
`
`dh is applied by bit scrambling (as per section 4.2.9 of TS 25.222) then subject to QPSK modulation and is
`amplitude-weighted prior to summation with other such sequences corresponding to other acknowledgement
`indicators active on the E-HICH.
`
`Physical channel spreading and scrambling operations are then performed in the usual manner.
`
`E-HICHs for non-scheduled users carry HARQ acknowledgement indicators and TPC/SS commands. The
`eighty orthogonal sequences are divided into 20 groups while each group includes 4 sequences. Each non-
`scheduled user is assigned one group by higher layer to indicate the HARQ acknowledgement indicators and
`TPC/SS command. One of the four sequences is used for the acknowledgement indicator’s spreading operation
`and the other three are used to indicate TPC/SS command implicitly.
`
`The HARQ acknowledgement indicator is spread by the assigned orthogonal sequence (C80,s,n). The output of
`=
`c
`a
`C
`the spreading stage is equal to
`, where n=0,1,…,79.
`
`
`,h n
`
`h
`,s n
`80,
`
`The three sequences and their three reverse sequences are the possible sequences been chosen multiplexed on E-
`HICH to indicate the TPC and SS commands. The reverse sequence is constructed by reverse every bit of the
`sequence from 0 to 1 or from 1 to 0. Only one sequence is chosen to indicate the TPC/SS command according
`to the relation between the sequence index and TPC/SS command. Mapping between index and TPC/SS
`command is shown in table 9.2.2.4. The index is calculated according to the equation: index=2*A+B ,
`(A=0,1,2;B=0,1), where A is the relative index of the three assigned sequences and B equals to 1 when the
`reverse sequence is chosen, otherwise, B equals to 0.
`
`Formatted: Centered
`
`Table 9.2.2.4 Mapping between index and TPC/SS command
`
`BlackBerry Exhibit 1007, pg. 12
`
`

`
`Formatted: Subscript
`Formatted: Subscript
`
`Formatted: Centered
`
`Formatted: Left
`
`SS command
`TPC command
`index
`‘DOWN’
`‘DOWN’
`0
`‘DOWN’
`‘UP’
`1
`‘UP’
`‘DOWN’
`2
`‘UP’
`‘UP’
`3
`‘Do Nothing’
`‘DOWN’
`4
`‘Do Nothing’
`‘UP’
`5
`The output sequence of the spreading stage ch,n and the sequence chosen to indicate TPC/SS command eh,n are
`segmented into two halves corresponding to ch,0, …, ch,39 and ch,40, …, ch,79 and eh,0, …, eh,39 and eh,40, …, eh,79
`respectively. A sequence of 8 spare bits zu (u=0,…,7) are inserted between the first and second half of the two
`sequences to form:
`
`ch={ch,0, ch,1,…, ch,39, z0, z1, …, z6,z7,ch,40, ch,41,…,ch,79}
`
`eh={eh,0, eh,1,…, eh,39, z0, z1, …, z6,z7,eh,40, eh,41,…,eh,79}
`
`ch and eh is applied by bit scrambling (as per section 4.2.9 of TS 25.222) then subject to QPSK modulation. The
`symbols of eh is multiplied by a factor set by Node-B before summation with symbols of ch. The sum of each
`user is amplitude-weighted before being multiplexed together with other users’ symbols.
`
`Physical channel spreading and scrambling operations are then performed in the usual manner.
`
`<<<<<<<<<<<<<<<<<<<< next changed section >>>>>>>>>>>>>>>>>>>>>>
`11.1 Power control
`11.1.1 E-PUCH
`The basic principle of our proposed power control method of E-PUCH follows that used for DPCH/PUSCH in
`R4/5/6[7][8], i.e., the combination of open-loop power control and traditional closed-loop power control:
`
`-
`
`-
`
`the initial transmit power of E-PUCH is set based on an open-loop power control scheme, then
`
`the transmission power control transits into closed-loop power control using TPC commands carried on
`E-AGCH for the scheduled transmission (for the non-scheduled transmission, the method to carry TPC
`command is FFS). while implicitly carried on E-HICH for non-scheduled users.
`
`<<<<<<<<<<<<<<<<<<<< next changed section >>>>>>>>>>>>>>>>>>>>>>
`
`6.1 11.2 Synchronization control
`
`11.2.1 E-PUCH
`6.1.1
`Uplink synchronization control procedure for E-PUCH remains the same as that used for DPCH[8], using SS
`commands carried on E-AGCH normally; for the non-scheduled transmission, how to transfer SS commands is
`FFS. SS commands are implicitly carried on E-HICH.
`
`<<<<<<<<<<<<<<<<<<< end of text proposal >>>>>>>>>>>>>>>>>>>
`
`
`
`BlackBerry Exhibit 1007, pg. 13