USRE48101EActiveUtility
Method of transmitting downlink channel rank information through physical uplink shared channel
Assignee: ELECTRONICS & TELECOMMUNICATIONS RES INSTPriority: May 11, 2010Filed: Dec 3, 2015Granted: Jul 14, 2020
Est. expiryMay 11, 2030(~3.8 yrs left)· nominal 20-yr term from priority
H04L 1/0026H04B 7/063H04L 1/0057H04L 5/0057H04L 1/08H04L 1/0041H04L 1/0072H04L 27/34H04L 27/206H04B 7/0413
47
PatentIndex Score
0
Cited by
22
References
8
Claims
Abstract
Provided is a method of transmitting channel rank information (RI) when the number of bits for transmitting the channel RI to be transmitted through a physical uplink shared channel (PUSCH) is three or more. The method includes mapping channel RI to be transmitted to a channel RI bit string of 3 bits or more, Reed-Muller coding and rate-matching the channel RI bit string using a basis sequence having a 32-bit code length, and generating modulation symbols by applying the bit sequence that has been Reed-Muller coded and rate-matched to a modulation mapper. Accordingly, the method of transmitting downlink channel RI can be employed when five or more antennas are used for downlink transmission or several carrier bands are used by carrier aggregation as specified in Third Generation Partnership Project (3GPP) long term evolution (LTE)-advanced following 3GPP LTE release 10.
Claims
exact text as granted — not AI-modifiedWhat is claimed is:
1. A communication method of transmitting channel rank information (RI) when a number of bits for transmitting the channel RI to be transmitted through a physical uplink shared channel (PUSCH) is three or more, the method comprising:
mapping the channel RI to be transmitted rank indication (RI) to a channel RI bit string of 3 bits or more set of bits, the set of bits comprising N RI bits {O 0 RI O 1 RI . . . O RI N RI -1 }, wherein N RI is an integer equal to or larger than 3;
Reed-Muller codingencoding the channel RI bit string using a basis sequence having a 32-bit code lengthset of bits to generate a set of encoded bits; and
generating modulation symbols by applying the Reed-Muller coded bit sequence to a modulation mapper based on the set of encoded bits; and
transmitting the symbols,
wherein, when the channel RI to be transmitted is mapped to a 3-bit channel RI bit string, mapping the channel RI includes mapping the channel RI (one value of {1, 2, 3, 4, 5, 6, 7, 8}) to a bit 3-bit channel RI bit string [O 0 RI O 1 RI O 2 RI ] according to the table of FIG. 2 , and
wherein the Reed-Muller coding encoding is performed by the following expression:
q
i
RI
=
∑
N
RI
-
1
n
=
0
(
O
n
RI
·
M
(
imod
32
)
,
n
)
mod
2
(
i
=
0
,
1
,
…
,
Q
RI
-
1
)
where q i RI denotes a bit sequence obtained after encoding, Q RI denotes a number of bits after encoding, and M i,n and denotes a basis sequence having a value of 0 or 1 defined by Table 1:
TABLE 1
i
M i,0
M i,1
M i,2
M i,3
M i,4
M i,5
M i,6
M i,7
M i,8
M i,9
M i,10
0
1
1
0
0
0
0
0
0
0
0
1
1
1
1
1
0
0
0
0
0
0
1
1
2
1
0
0
1
0
0
1
0
1
1
1
3
1
0
1
1
0
0
0
0
1
0
1
4
1
1
1
1
0
0
0
1
0
0
1
5
1
1
0
0
1
0
1
1
1
0
1
6
1
0
1
0
1
0
1
0
1
1
1
7
1
0
0
1
1
0
0
1
1
0
1
8
1
1
0
1
1
0
0
1
0
1
1
9
1
0
1
1
1
0
1
0
0
1
1
10
1
0
1
0
0
1
1
1
0
1
1
11
1
1
1
0
0
1
1
0
1
0
1
12
1
0
0
1
0
1
0
1
1
1
1
13
1
1
0
1
0
1
0
1
0
1
1
14
1
0
0
0
1
1
0
1
0
0
1
15
1
1
0
0
1
1
1
1
0
1
1
16
1
1
1
0
1
1
1
0
0
1
0
17
1
0
0
1
1
1
0
0
1
0
0
18
1
1
0
1
1
1
1
1
0
0
0
19
1
0
0
0
0
1
1
0
0
0
0
20
1
0
1
0
0
0
1
0
0
0
1
21
1
1
0
1
0
0
0
0
0
1
1
22
1
0
0
0
1
0
0
1
1
0
1
23
1
1
1
0
1
0
0
0
1
1
1
24
1
1
1
1
1
0
1
1
1
1
0
25
1
1
0
0
0
1
1
1
0
0
1
26
1
0
1
1
0
1
0
0
1
1
0
27
1
1
1
1
0
1
0
1
1
1
0
28
1
0
1
0
1
1
1
0
1
0
0
29
1
0
1
1
1
1
1
1
1
0
0
30
1
1
1
1
1
1
1
1
1
1
1
31
1
0
0
0
0
0
0
0
0
0
0.
2. The method of claim 1 , wherein the basis sequence M i,n is defined by the table of FIG. 4 the encoding is Reed-Muller coding.
3. The method of claim 1, wherein the symbols are transmitted through a physical uplink shared channel (PUSCH).
4. The method of claim 1, wherein the N RI is larger than 3.
5. A communication apparatus, comprising a processor:
wherein the processor is configured to:
map rank indication (RI) to a set of bits, the set of bits comprising N RI bits {O 0 RI O 1 RI . . . O RI N RI -1 }, wherein N RI is an integer equal to or larger than 3;
encode the set of bits to generate a set of encoded bits;
generate symbols based on the set of encoded bits; and
cause the communication apparatus to transmit the symbols,
wherein the encoding is performed by the following expression:
q
i
RI
=
∑
N
RI
-
1
n
=
0
(
O
n
RI
·
M
(
imod
32
)
,
n
)
mod
2
(
i
=
0
,
1
,
…
,
Q
RI
-
1
)
where q i RI denotes a bit sequence obtained after encoding, Q RI denotes a number of bits after encoding, and M i,n denotes a sequence defined by Table 1:
TABLE 1
i
M i,0
M i,1
M i,2
M i,3
M i,4
M i,5
M i,6
M i,7
M i,8
M i,9
M i,10
0
1
1
0
0
0
0
0
0
0
0
1
1
1
1
1
0
0
0
0
0
0
1
1
2
1
0
0
1
0
0
1
0
1
1
1
3
1
0
1
1
0
0
0
0
1
0
1
4
1
1
1
1
0
0
0
1
0
0
1
5
1
1
0
0
1
0
1
1
1
0
1
6
1
0
1
0
1
0
1
0
1
1
1
7
1
0
0
1
1
0
0
1
1
0
1
8
1
1
0
1
1
0
0
1
0
1
1
9
1
0
1
1
1
0
1
0
0
1
1
10
1
0
1
0
0
1
1
1
0
1
1
11
1
1
1
0
0
1
1
0
1
0
1
12
1
0
0
1
0
1
0
1
1
1
1
13
1
1
0
1
0
1
0
1
0
1
1
14
1
0
0
0
1
1
0
1
0
0
1
15
1
1
0
0
1
1
1
1
0
1
1
16
1
1
1
0
1
1
1
0
0
1
0
17
1
0
0
1
1
1
0
0
1
0
0
18
1
1
0
1
1
1
1
1
0
0
0
19
1
0
0
0
0
1
1
0
0
0
0
20
1
0
1
0
0
0
1
0
0
0
1
21
1
1
0
1
0
0
0
0
0
1
1
22
1
0
0
0
1
0
0
1
1
0
1
23
1
1
1
0
1
0
0
0
1
1
1
24
1
1
1
1
1
0
1
1
1
1
0
25
1
1
0
0
0
1
1
1
0
0
1
26
1
0
1
1
0
1
0
0
1
1
0
27
1
1
1
1
0
1
0
1
1
1
0
28
1
0
1
0
1
1
1
0
1
0
0
29
1
0
1
1
1
1
1
1
1
0
0
30
1
1
1
1
1
1
1
1
1
1
1
31
1
0
0
0
0
0
0
0
0
0
0.
6. The communication apparatus of claim 5, wherein the encoding is Reed-Muller coding.
7. The communication apparatus of claim 5, wherein the symbols are transmitted through a physical uplink shared channel (PUSCH).
8. The communication apparatus of claim 5, wherein the N RI is larger than 3.Cited by (0)
No later patents cite this yet.
References (0)
No backward citations on record.