# US 2017/0250846 A1 · PHICH Transmission in Time Division Duplex Systems

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2017/0250846 A1
- Document ID: US20170250846A1
- Status: Published application
- Kind: A1
- Application number: 15/594,290
- Filed: 2017-05-12
- Published: 2017-08-31
- Earliest claimed: 2012-05-11
- Assignees: BlackBerry Limited
- Applicants: BlackBerry Limited
- Inventors: Yiping Wang; Jun Li; Jianfeng Weng
- Web page: https://patentgrep.com/patent/US20170250846A1

## CPC

- H04L 27/2607: {Cyclic extensions}
- H04L 1/1812: Hybrid protocols; Hybrid automatic repeat request [HARQ]
- H04L 5/001: {the frequencies being arranged in component carriers}
- H04L 5/0055: {Physical resource allocation for ACK/NACK (for physical mapping arrangements in ARQ protocols H04L1/1861)}
- H04L 5/143: {for modulated signals (H04L5/1469 takes precedence)}
- H04W 72/21: in the uplink direction of a wireless link, i.e. towards the network
- H04W 72/23: in the downlink direction of a wireless link, i.e. towards a terminal
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

A method is provided for communication in a wireless telecommunication system. The method comprises multiplexing, by a network element, at least one symbol of a PHICH onto at least one resource element of a PCFICH.

## Claims

### Claim 1

A method for communication in a wireless telecommunication system, the method comprising:
multiplexing, by a network element, at least one symbol of a physical HARQ (hybrid automatic repeat request) indicator channel (PHICH) onto at least one resource element of a physical control format indicator channel (PCFICH),
wherein extra PHICH resources are created by multiplexing the at least one PHICH symbol onto the at least one PCFICH resource element such that up to six acknowledgement/negative acknowledgement (ACK/NACK) signals can be carried using the extra PHICH resources.

### Claim 2 (depends on 1)

The method of claim 1, wherein the at least one PHICH symbol is orthogonal to at least one PCFICH symbol.

### Claim 3 (depends on 1)

The method of claim 1, wherein the at least one PHICH symbol is mapped to a physical uplink shared channel (PUSCH) by the following equation:
nPHICHseq=(IPRB_RAlowest_index+nDMRS)mod N
where N is 6 for a normal cyclic prefix and N is 2 for an extended cyclic prefix.

### Claim 4 (depends on 3)

The method of claim 3, wherein explicit signaling is used to define the mapping between the PUSCH and the at least one PHICH symbol.

### Claim 5 (depends on 1)

The method of claim 1, wherein channel coding for the PHICH generates a total of 16 coded bits with four repeated sections, each section having a length of four for normal cyclic prefix mode and a length of two for extended cyclic prefix mode, and wherein each PHICH acknowledgement/negative acknowledgement (ACK/NACK) bit is repeated 16 times and then binary phase shift keying (BPSK) modulated, scrambled, and cover-coded with the PHICH orthogonal sequence.

### Claim 6 (depends on 5)

The method of claim 5, wherein, for a given PHICH sequence, the resulting symbols are given by:
d
(
PHICH
)

(
k
)
=
{
1
2

w
k
(
seqldx
)

(
1
-
2
·
b
(
HI
,
seqldx
)

(
k
)
)
·
(
1
-
2
·
b
(
CFI
)

(
2

k
)
)
·
(
1
-
2
·
c

(
2

k
)
)
,
if


w
k
(
seqldx
)


is


real
1
2

w
k
(
seqldx
)

(
1
-
2
·
b
(
HI
,
seqldx
)

(
k
)
)
·
(
1
-
2
·
b
(
CFI
)

(
2

k
+
1
)
)
·
(
1
-
2
·
c

(
2

k
+
1
)
)
,
otherwise
where wk(seqIdx) is the k-th element in the four-times-repeated orthogonal sequence with sequence index seqIdx; b(HI,seqIdx)(k) is a HI bit (for ACK/NACK) associated with sequence index seqIdx; b(CFI)(i) ∈ {0,1} for i=2k and 2k+1 denotes the i-th bit in a Control Format Indicator (CFI) sequence for a given CFI value; and c(k) is a cell-specific scrambling sequence that is the same as that used for PCFICH generation.

### Claim 7 (depends on 5)

The method of claim 5, wherein the four-times-repeated orthogonal sequence is formed by repeating the complex orthogonal Walsh sequence [w(0) . . . w(NSFPHICH−1)] four times and concatenating the sequences together.

### Claim 8 (depends on 1)

The method of claim 1, wherein power on the PCFICH is increased to overcome performance degradation caused by the multiplexing of the PHICH and the PCFICH.

### Claim 9 (depends on 1)

The method of claim 1, wherein the network element includes, in an uplink grant to a transmitting entity, a new data indicator capable of assuming one of two different values, wherein the network element changes the value of the new data indicator when the network element requests a new data transmission from the transmitting entity, and wherein the network element does not change the value of the new data indicator when the network element requests a retransmission from the transmitting entity.

### Claim 10 (depends on 1)

The method of claim 1, further comprising the network element including a new data indicator in an uplink grant to a transmitting entity when the number of PHICH bits to be transmitted is greater than the number of PHICH bits that can be multiplexed onto the PCFICH.

### Claim 11 (depends on 1)

The method of claim 1, wherein the network element is a primary cell in a wireless telecommunication system that employs carrier aggregation.

### Claim 12

A network element in a wireless telecommunication system, the network element comprising:
a processor configured such that the network element multiplexes at least one symbol of a physical HARQ (hybrid automatic repeat request) indicator channel (PHICH) onto at least one resource element of a physical control format indicator channel (PCFICH),
wherein extra PHICH resources are created by multiplexing the at least one PHICH symbol onto the at least one PCFICH resource element such that up to six acknowledgement/negative acknowledgement (ACK/NACK) signals can be carried using the extra PHICH resources.

### Claim 13 (depends on 12)

The network element of claim 12, wherein the at least one PHICH symbol is orthogonal to at least one PCFICH symbol.

### Claim 14 (depends on 12)

The network element of claim 12, wherein the at least one PHICH symbol is mapped to a physical uplink shared channel (PUSCH) by the following equation:
nPHICHseq=(IPRB_RAlowest_index+nDMRS)mod N
where N is 6 for a normal cyclic prefix and 2 for an extended cyclic prefix.

### Claim 15 (depends on 14)

The network element of claim 14, wherein explicit signaling is used to define the mapping between the PUSCH and the at least one PHICH symbol.

### Claim 16 (depends on 12)

The network element of claim 12, wherein channel coding for the PHICH generates a total of 16 coded bits with four repeated sections, each section having a length of four for normal cyclic prefix mode and a length of two for extended cyclic prefix mode, and wherein each PHICH acknowledgement/negative acknowledgement (ACK/NACK) bit is repeated 16 times and then binary phase shift keying (BPSK) modulated, scrambled, and cover-coded with the PHICH orthogonal sequence.

### Claim 17 (depends on 16)

The network element of claim 16, wherein, for a given PHICH sequence, the resulting symbols are given by:
d
(
PHICH
)

(
k
)
=
{
1
2

w
k
(
seqldx
)

(
1
-
2
·
b
(
HI
,
seqldx
)

(
k
)
)
·
(
1
-
2
·
b
(
CFI
)

(
2

k
)
)
·
(
1
-
2
·
c

(
2

k
)
)
,
if


w
k
(
seqldx
)


is


real
1
2

w
k
(
seqldx
)

(
1
-
2
·
b
(
HI
,
seqldx
)

(
k
)
)
·
(
1
-
2
·
b
(
CFI
)

(
2

k
+
1
)
)
·
(
1
-
2
·
c

(
2

k
+
1
)
)
,
otherwise
where wk(seqIdx) is the k-th element in the four-times-repeated orthogonal sequence with sequence index seqIdx, b(HI,seqIdx)(k) is a HI bit (for ACK/NACK) associated with sequence index seqIdx, b(CFI)(i) ∈ {0,1} for i=2k and 2k+1 denotes the i-th bit in a Control Format Indicator (CFI) sequence for a given CFI value; and c(k) is a cell-specific scrambling sequence that is the same as that used for PCFICH generation.

### Claim 18 (depends on 16)

The network element of claim 16, wherein the four-times-repeated orthogonal sequence is formed by repeating the complex orthogonal Walsh sequence [w(0) . . . w(NSFPHICH−1)] four times and concatenating the sequences together.

### Claim 19 (depends on 12)

The network element of claim 12, wherein power on the PCFICH is increased to overcome performance degradation caused by the multiplexing of the PHICH and the PCFICH.

### Claim 20 (depends on 12)

The network element of claim 12, wherein the network element includes, in an uplink grant to a transmitting entity, a new data indicator capable of assuming one of two different values, wherein the network element changes the value of the new data indicator when the network element requests a new data transmission from the transmitting entity, and wherein the network element does not change the value of the new data indicator when the network element requests a retransmission from the transmitting entity.

### Claim 21 (depends on 12)

The network element of claim 12, wherein the network element includes a new data indicator in an uplink grant to a transmitting entity when the number of PHICH bits to be transmitted is greater than the number of PHICH bits that can be multiplexed onto the PCFICH.

### Claim 22 (depends on 12)

The network element of claim 12, wherein the network element is a primary cell in a wireless telecommunication system that employs carrier aggregation.
