## HARQ Indicator (HI) Channel

LTE uses a hybrid automatic repeat request (HARQ) scheme for error correction. The eNodeB sends a HARQ indicator to the UE to indicate a positive acknowledgement (ACK) or negative acknowledgement (NACK) for data sent using the uplink shared channel. The channel coded HARQ indicator codeword is transmitted through the Physical Hybrid Automatic Repeat Request Indicator Channel (PHICH).

### HARQ Indicator

A HARQ indicator of ‘0’ represents a NACK and a ‘1’ represents an ACK.

### PHICH Groups

Multiple PHICHs are mapped to the same set of resource elements (REs). This set of REs constitutes a PHICH group. The PHICHs within a PHICH group are separated through different orthogonal sequences.

A PHICH resource is identified by the index pair $$\left({n}_{PHICH}^{group},{n}_{PHICH}^{seq}\right)$$. The variable $${n}_{PHICH}^{group}$$ is the number of the PHICH group and the variable $${n}_{PHICH}^{seq}$$ is the orthogonal sequence index within the group. For more information about the orthogonal sequences, see Scrambling.

The number of PHICH groups varies based on whether the frame structure is type one, frequency division duplex (FDD), or type two, time division duplex (TDD).

#### Frame Structure Type 1: FDD

The number of PHICH groups is constant in all subframes and is given by the following equation.

$${N}_{PHICH}^{group}=\{\begin{array}{c}\lceil {N}_{g}\left({N}_{RB}^{DL}\right)/8\rceil \text{,fornormalcyclicprefix}\\ 2\times \lceil {N}_{g}\left({N}_{RB}^{DL}\right)/8\rceil \text{,forextendedcyclicprefix}\end{array}$$

The set $${N}_{g}\in \left\{{\scriptscriptstyle \frac{1}{6}},{\scriptscriptstyle \frac{1}{2}},1,2\right\}$$ is provided by higher layers and is a scaling factor to control the number of PHICH groups.

The index of the PHICH group $${n}_{PHICH}^{group}$$ ranges from 0 to $${n}_{PHICH}^{group}$$–1.

#### Frame Structure Type 2: TDD

The number of PHICH groups varies depending on the number of
the downlink subframe and the uplink/downlink time division duplex
configuration. The number of groups is given by the expression $${m}_{i}\times {N}_{PHICH}^{group}$$.
The variable $${n}_{PHICH}^{group}$$ is
the number of PHICH groups for a frame structure type 1. The variable *m _{i}* is
dependent on the subframe. The value for

*m*for each uplink-downlink configuration and subframe number is given in the following table.

_{i}Uplink-downlink configuration | Subframe
number i | |||||||||
---|---|---|---|---|---|---|---|---|---|---|

0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | |

0 | 2 | 1 | — | — | — | 2 | 1 | — | — | — |

1 | 0 | 1 | — | — | 1 | 0 | 1 | — | — | 1 |

2 | 1 | 0 | — | — | — | 0 | 0 | 0 | 1 | 1 |

3 | 1 | 0 | — | — | — | 0 | 0 | 0 | 1 | 1 |

4 | 0 | 0 | — | — | 0 | 0 | 0 | 0 | 1 | 1 |

5 | 0 | 0 | — | 0 | 0 | 0 | 0 | 0 | 1 | 0 |

6 | 1 | 1 | — | — | — | 1 | 1 | — | — | 1 |

### HARQ Indicator Channel Coding

The HARQ Indicator undergoes repetition coding to create a HARQ indicator codeword made up of three bits, $$\langle {b}_{0},{b}_{1},{b}_{2}\rangle $$

HARQ Indicator | HARQ Indicator Codeword $$\langle {b}_{0},{b}_{1},{b}_{2}\rangle $$ |
---|---|

0 — Negative acknowledgement | $$\langle 0,0,0\rangle $$ |

1 — Positive acknowledgement | $$\langle 1,1,1\rangle $$ |

### PHICH Processing

The HARQ Indicator codeword undergoes BPSK modulation, scrambling, layer mapping, precoding, and resource mapping as shown in block diagram in the following figure.

#### Modulation

The HARQ indicator codeword undergoes BPSK modulation resulting
in a block of complex-valued modulated symbols, *z*(0), *z*(1), *z*(2).

#### Scrambling

The block of modulated symbols is bitwise multiplied with an
orthogonal sequence and a cell-specific scrambling sequence to create
a sequence of symbols, $$d(0),\dots ,d({M}_{symb}-1)$$.
The number of symbols, *M _{symb}*,
is given by the equation $${M}_{symb}=3\times {N}_{SF}^{PHICH}$$.
The PHICH spreading factor, $${N}_{SF}^{PHICH}$$,
is 4 for a normal cyclic prefix and 2 for an extended cyclic prefix.

The orthogonal sequence allows multiple PHICHs to be mapped to the same set of resource elements.

Scrambling with a cell-specific sequence serves the purpose of intercell interference rejection. When a UE descrambles a received bitstream with a known cell specific scrambling sequence, interference from other cells will be descrambled incorrectly and therefore only appear as uncorrelated noise.

The complex scrambled symbols, $$d(0),\dots ,d({M}_{symb}-1)$$, are created according to the following equation.

$$d(i)=w\left(i\mathrm{mod}{N}_{SF}^{PHICH}\right)\times \left(1-2c(i)\right)\times z\left(\lfloor i/{N}_{SF}^{PHICH}\rfloor \right)$$

The first term, $$w\left(i\mathrm{mod}{N}_{SF}^{PHICH}\right)$$, is the orthogonal sequence symbol with index $${N}_{SF}^{PHICH}$$. The second term, $$\left(1-2c(i)\right)$$, is the cell-specific scrambling sequence symbol. The third term, $$z\left(\lfloor i/{N}_{SF}^{PHICH}\rfloor \right)$$, is the modulated HARQ indicator symbol.

The three modulated symbols, *z*(0), *z*(1), *z*(2),
are repeated $${N}_{SF}^{PHICH}$$ times
and scrambled to create a sequence of six or twelve symbols depending
on whether a normal or extended cyclic prefix is used. When using
a normal cyclic prefix, the first four scrambled symbols are created
as shown in the following figure.

The variable *w* is an orthogonal scrambling
sequence with index $${n}_{PHICH}^{seq}$$.
The sequences are given in the following table.

Sequence Index | Orthogonal Sequence, $$w(0),\dots ,w\left({N}_{SF}^{PHICH}-1\right)$$ | |
---|---|---|

$${n}_{PHICH}^{seq}$$ | Normal Cyclic Prefix, $${N}_{SF}^{PHICH}=4$$ | Extended Cyclic Prefix, $${N}_{SF}^{PHICH}=2$$ |

0 | [+1 +1 +1 +1] | [+1 +1] |

1 | [+1 –1 +1 –1] | [+1 –1] |

2 | [+1 +1 –1 –1] | [+j +j] |

3 | [+1 –1 –1 +1] | [+j –j] |

4 | [+j +j +j +j] | — |

5 | [+j –j +j –j] | — |

6 | [+j +j –j –j] | — |

7 | [+j –j –j +j] | — |

The variable *c* is a cell-specific pseudo-random
scrambling sequence created using a length-31 Gold sequence. The scrambling
sequence is initialized using the slot number within the radio frame,*n _{s}*,
and the cell ID, $${N}_{ID}^{cell}$$.

$${c}_{init}=\left(\lfloor {n}_{s}/2\rfloor +1\right)\times \left(2{N}_{ID}^{cell}+1\right)\times {2}^{9}+{N}_{ID}^{cell}$$

#### Resource Group Alignment

As resource element groups (REGs) contain four resource elements (each able to contain one symbol) the blocks of scrambled symbols are aligned to create blocks of four symbols.

In the case of a normal cyclic prefix, each of the original
complex modulated symbols, *z*(0), *z*(1), *z*(2),
is represented by four scrambled symbols. Therefore, no alignment
is required, as shown in the following equation.

$${d}^{(0)}(i)=d(i)$$

In the case of an extended cyclic prefix each of the original
complex modulated symbols, *z*(0), *z*(1), *z*(2),
is represented by two scrambled symbols. To create blocks of four
symbols, zeros are added before or after blocks of two scrambled symbols
depending on whether the PHICH index is odd or even. This allows two
groups to be combined during the resource mapping stage and mapped
to one REG. Groups of four symbols, *d*^{(0)},
are formed as shown in the following figure.

#### Layer Mapping

The complex symbols are mapped to one, two, or four layers depending
on the number of transmit antennas used. The complex modulated input
symbols, $${d}^{(0)}(i)$$,
are mapped onto *v* layers, $${x}^{(0)}(i),{x}^{(1)}(i),\dots ,{x}^{(v-1)}(i)$$.

If a single antenna port is used, only one layer is used. Therefore, $${x}^{(0)}(i)={d}^{(0)}(i)$$.

If transmitter diversity is used, the input symbols are mapped to layers based on the number of layers.

**Two Layers**— Even symbols are mapped to layer 0 and odd symbols are mapped to layer 1, as shown in this figure.**Four Layers**— The input symbols are mapped to layers sequentially, as shown in the following figure.

#### Precoding

The precoder takes a block from the layer mapper, $${x}^{(0)}(i),{x}^{(1)}(i),\dots ,{x}^{(v-1)}(i)$$,
and generates a sequence for each antenna port, $${y}^{(p)}(i)$$.
The variable *p* is the transmit antenna port number,
and can assume values of {0}, {0,1}, or {0,1,2,3}.

For transmission over a single antenna port, no processing is carried out, as shown in this equation.

$${y}^{(p)}(i)={x}^{(0)}(i)$$

Precoding for transmit diversity is available on two or four antenna ports.

**Two Antenna Port Precoding. **An Alamouti scheme is used for precoding, which defines
the relationship between input and output as shown in the following equation.

$$\left(\begin{array}{c}{y}^{(0)}(2i)\\ {y}^{(1)}(2i)\\ {y}^{(0)}(2i+1)\\ {y}^{(1)}(2i+1)\end{array}\right)=\frac{1}{\sqrt{2}}\left(\begin{array}{cccc}1& 0& j& 0\\ 0& -1& 0& j\\ 0& 1& 0& j\\ 1& 0& -j& 0\end{array}\right)\left(\begin{array}{c}\mathrm{Re}\left\{{x}^{(0)}(i)\right\}\\ \mathrm{Re}\left\{{x}^{(1)}(i)\right\}\\ \mathrm{Im}\left\{{x}^{(0)}(i)\right\}\\ \mathrm{Im}\left\{{x}^{(1)}(i)\right\}\end{array}\right)$$

In the Alamouti scheme, two consecutive symbols, $${x}^{(0)}(i)$$ and $${x}^{(1)}(i)$$, are transmitted in parallel using two antennas with the following mapping, where the asterisk symbol (*) denotes the complex conjugate operation.

Since any two columns in the precoding matrix are orthogonal, the two symbols, $${x}^{(0)}(i)$$ and $${x}^{(1)}(i)$$, can be separated at the UE.

**Four Antenna Port Precoding. **Precoding for the four antenna port case depends on the index
of the PHICH group, $${n}_{PHICH}^{group}$$.
If $${n}_{PHICH}^{group}+i$$ is
even for a normal cyclic prefix or if $$\lfloor {n}_{PHICH}^{group}/2\rfloor +i$$ is
even for an extended cyclic prefix, the relationship between the input
and output is defined by the following equation.

$$\left(\begin{array}{c}{y}^{(0)}(4i)\\ {y}^{(1)}(4i)\\ {y}^{(2)}(4i)\\ {y}^{(3)}(4i)\\ {y}^{(0)}(4i+1)\\ {y}^{(1)}(4i+1)\\ {y}^{(2)}(4i+1)\\ {y}^{(3)}(4i+1)\\ {y}^{(0)}(4i+2)\\ {y}^{(1)}(4i+2)\\ {y}^{(2)}(4i+2)\\ {y}^{(3)}(4i+2)\\ {y}^{(0)}(4i+3)\\ {y}^{(1)}(4i+3)\\ {y}^{(2)}(4i+3)\\ {y}^{(3)}(4i+3)\end{array}\right)=\frac{1}{\sqrt{2}}\left(\begin{array}{cccccccc}1& 0& 0& 0& j& 0& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0\\ 0& -1& 0& 0& 0& j& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 1& 0& 0& 0& j& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0\\ 1& 0& 0& 0& -j& 0& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 1& 0& 0& 0& j& 0\\ 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 0& -1& 0& 0& 0& j\\ 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 0& 1& 0& 0& 0& j\\ 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 1& 0& 0& 0& -j& 0\end{array}\right)\left(\begin{array}{c}\mathrm{Re}\left\{{x}^{(0)}(i)\right\}\\ \mathrm{Re}\left\{{x}^{(1)}(i)\right\}\\ \mathrm{Re}\left\{{x}^{(2)}(i)\right\}\\ \mathrm{Re}\left\{{x}^{(3)}(i)\right\}\\ \mathrm{Im}\left\{{x}^{(0)}(i)\right\}\\ \mathrm{Im}\left\{{x}^{(1)}(i)\right\}\\ \mathrm{Im}\left\{{x}^{(2)}(i)\right\}\\ \mathrm{Im}\left\{{x}^{(3)}(i)\right\}\end{array}\right)$$

In this scheme, two consecutive symbols are transmitted in parallel in two symbol periods using four antennas with the following mapping, where the asterisk symbol (*) denotes the complex conjugate operation.

If $${n}_{PHICH}^{group}+i$$ is odd for a normal cyclic prefix or if $$\lfloor {n}_{PHICH}^{group}/2\rfloor +i$$ is odd for an extended cyclic prefix, the relationship between the input and output is defined by the following equation.

$$\left(\begin{array}{c}{y}^{(0)}(4i)\\ {y}^{(1)}(4i)\\ {y}^{(2)}(4i)\\ {y}^{(3)}(4i)\\ {y}^{(0)}(4i+1)\\ {y}^{(1)}(4i+1)\\ {y}^{(2)}(4i+1)\\ {y}^{(3)}(4i+1)\\ {y}^{(0)}(4i+2)\\ {y}^{(1)}(4i+2)\\ {y}^{(2)}(4i+2)\\ {y}^{(3)}(4i+2)\\ {y}^{(0)}(4i+3)\\ {y}^{(1)}(4i+3)\\ {y}^{(2)}(4i+3)\\ {y}^{(3)}(4i+3)\end{array}\right)=\frac{1}{\sqrt{2}}\left(\begin{array}{cccccccc}0& 0& 0& 0& 0& 0& 0& 0\\ 1& 0& 0& 0& j& 0& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0\\ 0& -1& 0& 0& 0& j& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 1& 0& 0& 0& j& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0\\ 1& 0& 0& 0& -j& 0& 0& 0\\ 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 1& 0& 0& 0& j& 0\\ 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 0& -1& 0& 0& 0& j\\ 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 0& 1& 0& 0& 0& j\\ 0& 0& 0& 0& 0& 0& 0& 0\\ 0& 0& 1& 0& 0& 0& -j& 0\end{array}\right)\left(\begin{array}{c}\mathrm{Re}\left\{{x}^{(0)}(i)\right\}\\ \mathrm{Re}\left\{{x}^{(1)}(i)\right\}\\ \mathrm{Re}\left\{{x}^{(2)}(i)\right\}\\ \mathrm{Re}\left\{{x}^{(3)}(i)\right\}\\ \mathrm{Im}\left\{{x}^{(0)}(i)\right\}\\ \mathrm{Im}\left\{{x}^{(1)}(i)\right\}\\ \mathrm{Im}\left\{{x}^{(2)}(i)\right\}\\ \mathrm{Im}\left\{{x}^{(3)}(i)\right\}\end{array}\right)$$

In this scheme, two consecutive symbols are transmitted in parallel in two symbol periods using four antennas with the following mapping, where the asterisk symbol (*) denotes the complex conjugate operation.

#### Mapping to Resource Elements

**PHICH Duration. **The number of OFDM symbols used to carry the PHICH is configurable
by the PHICH duration.

The PHICH duration is either normal or extended. A normal PHICH duration causes the PHICH to be present in only the first OFDM symbol. In general an extended PHICH duration causes the PHCH to be present in the first three OFDM symbols but there are some exceptions. The PHICH is present in the first two OFDM symbols under the following exceptions.

Within subframe 1 and 6 when frame structure type 2 (TDD) is used

Within MBSFN subframes

**Relationship between CFI and PHICH Duration. **Since the control format indicator (CFI) configures how many
OFDM symbols are used for mapping the physical downlink control channel
(PDCCH) and hence which OFDM symbols are available for the physical
downlink shared channel (PDSCH), care must be taken when using an
extended PHICH duration so the PHICH is not mapped into the same region
as the PDSCH.

For example, when using an extended PHICH in subframe zero of a frame structure type 1 (FDD) 10MHz subframe the first three OFDM symbols will contain PHICH. Therefore, the CFI must be set to 3 so the PDSCH is not mapped to OFDM symbols 0, 1, or 2, and so does not overlap with the PHICH.

**Combining PHICH Sequences. **Corresponding elements of each PHICH sequence are summed to
create the sequence for each PHICH group, $$\left({\overline{y}}^{(p)}\right)$$.
This process is illustrated in the following figure.

The variable $${y}_{i}^{(p)}(n)$$ is
the *n*-th element within PHICH *i* on
antenna port *p*.

**PHICH Mapping Units. **PHICHs are mapped to REGs using PHICH mapping units, $${\tilde{y}}_{{m}^{\prime}}^{(p)}$$,
where $${m}^{\prime}$$ is
the index of the mapping unit. For a normal cyclic prefix, each PHICH
group is mapped to a PHICH mapping unit. In the case of an extended
cyclic prefix, two PHICH groups are mapped to one PHICH mapping unit.
Due to the location of the padding zeros added during resource group
alignment, when two consecutive groups are added, the zeros of one
group overlap the data of the other.

**Mapping to REGs. **Each mapping unit contains twelve symbols. To map these twelve
symbols to REGs, the mapping units are split into three groups of
four symbols (quadruplets).

Each of the three symbol quadruplets, $${z}^{(p)}(i),i=\left\{0,1,2\right\}$$, is mapped to a REG, $$({k}^{\prime},{l}^{\prime})$$, so the PHICH is spread over all available OFDM symbols and resource blocks.

The OFDM symbol index, $${l}^{\prime}$$, is set so adjacent quadruplets are spread amongst the available OFDM symbols, as illustrated in the following figure.

The subcarrier index, $${{k}^{\prime}}_{i}$$, of the REG is based upon the cell ID, $${N}_{ID}^{cell}$$, and is chosen to spread the three symbol quadruplets over the entire bandwidth.

## See Also

`ltePHICH`

| `ltePHICHInfo`

| `ltePHICHIndices`

| `ltePHICHPRBS`

| `lteDLResourceGrid`

| `lteLayerMap`

| `lteLayerDemap`

| `lteDLPrecode`

| `lteDLDeprecode`

| `lteCRCEncode`

| `lteCRCDecode`

| `lteSymbolModulate`

| `lteSymbolDemodulate`