US9634749B2ActiveUtilityA1
Method and apparatus for efficient feedback in a wireless communication system supporting multiple antenna
Est. expirySep 26, 2030(~4.2 yrs left)· nominal 20-yr term from priority
H04W 72/21H04W 48/08H04B 7/0639H04L 2025/03426H04W 72/00H04L 1/0026H04L 2025/03808H04B 7/10H04L 5/001H04B 7/0456H04W 72/0446H04L 5/0053H04L 5/0057H04B 7/0417H04L 1/0027H04B 7/0469H04L 5/0023H04B 7/0626H04L 5/006H04L 1/0028H04B 7/0632H04B 7/063H04L 25/03343H04B 7/0617H04W 24/10H04L 5/005H04W 24/08H04B 7/0481H04B 7/0486H04W 72/0413H04B 7/0478
63
PatentIndex Score
0
Cited by
30
References
20
Claims
Abstract
A method for transmitting channel status information (CSI) via uplink in a wireless communication system includes transmitting a first precoding matrix indicator (PMI) and a second PMI at a subframe. A subsampled codebook for each of a precoding codebook for Rank-1 and a precoding codebook for Rank-2 is determined based on at least the first PMI or the second PMI. In case of the Rank-1 or the Rank-2, a number of elements for the first PMI is 8.
Claims
exact text as granted — not AI-modifiedWhat is claimed is:
1. A method for transmitting channel status information (CSI) via a physical uplink control channel (PUCCH) by a user equipment (UE) in a wireless communication system, the method comprising:
transmitting a first PUCCH report including a rank indicator (RI); and
transmitting a second PUCCH report including a channel quality indicator (CQI), a first precoding matrix indicator (PMI) and a second PMI,
wherein when the RI corresponds to one of Rank-1 to Rank-4, a sub set of a codebook corresponding to the RI is available for selecting the first PMI and the second PMI, and a sum of the first PMI and the second PMI is comprised of 4 bits, and
wherein when the RI corresponds to one of Rank-5 to Rank-7, a full set of a codebook corresponding to the RI is available for selecting the first PMI and the second PMI, and a sum of the first PMI and the second PMI is comprised of 2 bits.
2. The method according to claim 1 , wherein a combination of the first PMI and the second PMI indicates a single precoding matrix.
3. The method according to claim 1 , wherein when the RI is one of the Rank-1 and the Rank-2, the first PMI is comprised of 3 bits, and the second PMI is comprised of 1 bit.
4. The method according to claim 1 , wherein a codebook corresponding to the Rank-1 is represented by the following table:
TABLE
i 2
i 1
0
1
2
3
4
5
6
7
0-15
W 2i 1 ,0 (1)
W 2i 1 ,1 (1)
W 2i 1 ,2 (1)
W 2i 1 ,3 (1)
W 2i 1 +1,0 (1)
W 2i 1 +1,1 (1)
W 2i 1 +1,2 (1)
W 2i 1 +1,3 (1)
i 2
i 1
8
9
10
11
12
13
14
15
0-15
W 2i 1 +2,0 (1)
W 2i 1 +2,1 (1)
W 2i 1 +2,2 (1)
W 2i 1 +2,3 (1)
W 2i 1 +3,0 (1)
W 2i 1 +3,1 (1)
W 2i 1 +3,2 (1)
W 2i 1 +3,3 (1)
where
W m , n ( 1 ) = 1 8 [ v m φ n v m ]
where φ n is denoted by φ n =e jπn/2 and ν m is denoted by ν m =[1 e j2πn/32 e j4πn/32 e j6πn/32 ] T , and
in case of the Rank-1, the first PMI is set to any one of 0, 2, 4, 6, 8, 10, 12 and 14, and the second PMI is set to any one of 0 and 2.
5. The method according to claim 1 , wherein a codebook corresponding to the Rank-2 is represented by the following table:
TABLE
i 2
i 1
0
1
2
3
0-15
W 2i 1 ,2i 1 ,0 (2)
W 2i 1 ,2i 1 ,1 (2)
W 2i 1 +1,2i 1 +1,0 (2)
W 2i 1 +1,2i 1 +1,1 (2)
i 2
i 1
4
5
6
7
0-15
W 2i 1 +2,2i 1 +2,0 (2)
W 2i 1 +2,2i 1 +2,1 (2)
W 2i 1 +3,2i 1 +3,0 (2)
W 2i 1 +3,2i 1 +3,1 (2)
i 2
i 1
8
9
10
11
0-15
W 2i 1 ,2i 1 +1,0 (2)
W 2i 1 ,2i 1 +1,1 (2)
W 2i 1 +1,2i 1 +2,0 (2)
W 2i 1 +1,2i 1 +2,1 (2)
i 2
i 1
12
13
14
15
0-15
W 2i 1 ,2i 1 +3,0 (2)
W 2i 1 ,2i 1 +3,1 (2)
W 2i 1 +1,2i 1 +3,0 (2)
W 2i 1 +1,2i 1 +3,1 (2)
where
W m , m ′ , n ( 2 ) = 1 4 [ v m v m ′ φ n v m - φ n v m ′ ]
where φ n is denoted by φ n =e jπn/2 and ν m is denoted by ν m =[1 e j2πn/32 e j4πn/32 e j6πn/32 ] T , and
in case of the Rank-2, the first PMI is set to any one of 0, 2, 4, 6, 8, 10, 12 and 14, and the second PMI is set to any one of 0 and 1.
6. The method according to claim 1 , wherein when the RI is one of the Rank-3 and the Rank-4, the first PMI is comprised of 1 bit, and the second PMI is comprised of 3 bits.
7. The method according to claim 1 , wherein a codebook corresponding to the Rank-3 is represented by the following table:
TABLE
i 2
i 1
0
1
0-3
W 8i 1 ,8i 1 ,8i 1 +8 (3)
W 8i 1 +8,8i 1 ,8i 1 +8 (3)
i 2
i 1
2
3
0-3
{tilde over (W)} 8i 1 ,8i 1 +8,8i 1 +8 (3)
{tilde over (W)} 8i 1 +8,8i 1 ,8i 1 (3)
i 2
i 1
4
5
0-3
W 8i 1 +2,8i 1 +2,4i 1 +10 (3)
W 8i 1 +10,8i 1 +2,8i 1 +10 (3)
i 2
i 1
6
7
0-3
{tilde over (W)} 8i 1 +2,8i 1 +10,8i 1 +10 (3)
{tilde over (W)} 8i 1 +10,8i 1 +2,8i 1 +2 (3)
i 2
i 1
8
9
0-3
W 8i 1 +4,8i 1 +4,8i 1 +12 (3)
W 8i 1 +12,8i 1 +4,8i 1 +12 (3)
i 2
i 1
10
11
0-3
{tilde over (W)} 8i 1 +4,8i 1 +12,8i 1 +12 (3)
{tilde over (W)} 8i 1 +12,8i 1 +4,8i 1 +4 (3)
i 2
i 1
12
13
0-3
W 8i 1 +6,8i 1 +6,8i 1 +14 (3)
W 8i 1 +14,8i 1 +6,8i 1 +14 (3)
i 2
i 1
14
15
0-3
{tilde over (W)} 8i 1 +6,8i 1 +14,8i 1 +14 (3)
{tilde over (W)} 8i 1 +14,8i 1 +6,8i 1 +6 (3)
where
W m , m ′ , m ″ ( 3 ) = 1 24 [ v m v m ′ v m ″ v m - v m ′ - v m ″ ] ,
W ~ m , m ′ , m ″ ( 3 ) = 1 24 [ v m v m ′ v m ″ v m v m ′ - v m ″ ]
where φ n is denoted by φ n =e jπn/2 and ν m is denoted by ν m =[1 e j2πn/32 e j4πn/32 e j6πn/32 ] T , and
in case of the Rank-3, the first PMI is set to any one of 0 and 2, and the second PMI is set to any one of 0, 1, 2, 3, 8, 9, 10 and 11.
8. The method according to claim 1 , wherein a codebook corresponding to the Rank-4 is represented by the following table:
TABLE
i 2
i 1
0
1
2
3
0-3
W 8i 1 ,8i 1 +8,0 (4)
W 8i 1 ,8i 1 +8,1 (4)
W 8i 1 +2,8i 1 +10,0 (4)
W 8i 1 +2,8i 1 +10,1 (4)
i 2
i 1
4
5
6
7
0-3
W 8i 1 +4,8i 1 +12,0 (4)
W 8i 1 +4,8i 1 +12,1 (4)
W 8i 1 +6,8i 1 +14,0 (4)
W 8i 1 +6,8i 1 +14,1 (4)
where
W m , m ′ , n ( 4 ) = 1 32 [ v m v m ′ v m v m ′ φ n v m φ n v m ′ - φ n v m - φ n v m ′ ]
where φ n is denoted by φ n =e jπn/2 and ν m is denoted by ν m =[1 e j2πn/32 e j4πn/32 e j6πn/32 ] T , and
in case of the Rank-4, the first PMI is set to any one of 0 and 2, and the second PMI is set to any one of 0, 1, 2, 3, 4, 5, 6 and 7.
9. The method according to claim 1 , wherein the RI, the first PMI, the second PMI, and the CQI are contained in channel status information (CSI) of downlink 8 transmission (Tx) antennas.
10. A method for receiving channel status information (CSI) via a physical uplink control channel (PUCCH) by a base station (BS) in a wireless communication system, the method comprising:
receiving a first PUCCH report including a rank indicator (RI); and
receiving a second PUCCH report including a channel quality indicator (CQI), a first precoding matrix indicator (PMI) and a second PMI,
wherein when the RI corresponds to one of Rank-1 to Rank-4, a sub set of a codebook corresponding to the RI is applied to the first PMI and the second PMI, and a sum of the first PMI and the second PMI is comprised of 4 bits, and
wherein when the RI corresponds to one of Rank-5 to Rank-7, a full set of a codebook corresponding to the RI is applied to the first PMI and the second PMI, and a sum of the first PMI and the second PMI is comprised of 2 bits.
11. The method according to claim 10 , wherein a combination of the first PMI and the second PMI indicates a single precoding matrix.
12. The method according to claim 10 , wherein when the RI is one of the Rank-1 and the Rank-2, the first PMI is comprised of 3 bits, and the second PMI is comprised of 1 bit.
13. The method according to claim 10 , wherein a codebook corresponding to the Rank-1 is represented by the following table:
TABLE
i 2
i 1
0
1
2
3
4
5
6
7
0-15
W 2i 1 ,0 (1)
W 2i 1 ,1 (1)
W 2i 1 ,2 (1)
W 2i 1 ,3 (1)
W 2i 1 +1,0 (1)
W 2i 1 +1,1 (1)
W 2i 1 +1,2 (1)
W 2i 1 +1,3 (1)
i 2
i 1
8
9
10
11
12
13
14
15
0-15
W 2i 1 +2,0 (1)
W 2i 1 +2,1 (1)
W 2i 1 +2,2 (1)
W 2i 1 +2,3 (1)
W 2i 1 +3,0 (1)
W 2i 1 +3,1 (1)
W 2i 1 +3,2 (1)
W 2i 1 +3,3 (1)
where
W m , n ( 1 ) = 1 8 [ v m φ n v m ]
where φ n is denoted by φ n =e jπn/2 and ν m is denoted by ν m =[1 e j2πn/32 e j4πn/32 e j6πn/32 ] T , and
in case of the Rank-1, the first PMI is set to any one of 0, 2, 4, 6, 8, 10, 12 and 14, and the second PMI is set to any one of 0 and 2.
14. The method according to claim 10 , wherein a codebook corresponding to the Rank-2 is represented by the following table:
TABLE
i 2
i 1
0
1
2
3
0-15
W 2i 1 ,2i 1 ,0 (2)
W 2i 1 ,2i 1 ,1 (2)
W 2i 1 +1,2i 1 +1,0 (2)
W 2i 1 +1,2i 1 +1,1 (2)
i 2
i 1
4
5
6
7
0-15
W 2i 1 +2,2i 1 +2,0 (2)
W 2i 1 +2,2i 1 +2,1 (2)
W 2i 1 +3,2i 1 +3,0 (2)
W 2i 1 +3,2i 1 +3,1 (2)
i 2
i 1
8
9
10
11
0-15
W 2i 1 ,2i 1 +1,0 (2)
W 2i 1 ,2i 1 +1,1 (2)
W 2i 1 +1,2i 1 +2,0 (2)
W 2i 1 +1,2i 1 +2,1 (2)
i 2
i 1
12
13
14
15
0-15
W 2i 1 ,2i 1 +3,0 (2)
W 2i 1 ,2i 1 +3,1 (2)
W 2i 1 +1,2i 1 +3,0 (2)
W 2i 1 +1,2i 1 +3,1 (2)
where
W m , m ′ , n ( 2 ) = 1 4 [ v m v m ′ φ n v m - φ n v m ′ ]
where φ n is denoted by φ n =e jπn/2 and ν m is denoted by ν m =[1 e j2πn/32 e j4πn/32 e j6πn/32 ] T , and
in case of the Rank-2, the first PMI is set to any one of 0, 2, 4, 6, 8, 10, 12 and 14, and the second PMI is set to any one of 0 and 1.
15. The method according to claim 10 , wherein when the RI is one of the Rank-3 and the Rank-4, the first PMI is comprised of 1 bit, and the second PMI is comprised of 3 bits.
16. The method according to claim 10 , wherein a codebook corresponding to the Rank-3 is represented by the following table:
TABLE
i 2
i 1
0
1
0-3
W 8i 1 ,8i 1 ,8i 1 +8 (3)
W 8i 1 +8,8i 1 ,8i 1 +8 (3)
i 2
i 1
2
3
0-3
{tilde over (W)} 8i 1 ,8i 1 +8,8i 1 +8 (3)
{tilde over (W)} 8i 1 +8,8i 1 ,8i 1 (3)
i 2
i 1
4
5
0-3
W 8i 1 +2,8i 1 +2,4i 1 +10 (3)
W 8i 1 +10,8i 1 +2,8i 1 +10 (3)
i 2
i 1
6
7
0-3
{tilde over (W)} 8i 1 +2,8i 1 +10,8i 1 +10 (3)
{tilde over (W)} 8i 1 +10,8i 1 +2,8i 1 +2 (3)
i 2
i 1
8
9
0-3
W 8i 1 +4,8i 1 +4,8i 1 +12 (3)
W 8i 1 +12,8i 1 +4,8i 1 +12 (3)
i 2
i 1
10
11
0-3
{tilde over (W)} 8i 1 +4,8i 1 +12,8i 1 +12 (3)
{tilde over (W)} 8i 1 +12,8i 1 +4,8i 1 +4 (3)
i 2
i 1
12
13
0-3
W 8i 1 +6,8i 1 +6,8i 1 +14 (3)
W 8i 1 +14,8i 1 +6,8i 1 +14 (3)
i 2
i 1
14
15
0-3
{tilde over (W)} 8i 1 +6,8i 1 +14,8i 1 +14 (3)
{tilde over (W)} 8i 1 +14,8i 1 +6,8i 1 +6 (3)
where
W m , m ′ , m ″ ( 3 ) = 1 24 [ v m v m ′ v m ″ v m - v m ′ - v m ″ ] ,
W ~ m , m ′ , m ″ ( 3 ) = 1 24 [ v m v m ′ v m ″ v m v m ′ - v m ″ ]
where φ n is denoted by φ n =e jπn/2 and ν m is denoted by ν m =[1 e j2πn/32 e j4πn/32 e j6πn/32 ] T , and
in case of the Rank-3, the first PMI is set to any one of 0 and 2, and the second PMI is set to any one of 0, 1, 2, 3, 8, 9, 10 and 11.
17. The method according to claim 10 , wherein a codebook corresponding to the Rank-4 is represented by the following table:
TABLE
i 2
i 1
0
1
2
3
0-3
W 8i 1 ,8i 1 +8,0 (4)
W 8i 1 ,8i 1 +8,1 (4)
W 8i 1 +2,8i 1 +10,0 (4)
W 8i 1 +2,8i 1 +10,1 (4)
i 2
i 1
4
5
6
7
0-3
W 8i 1 +4,8i 1 +12,0 (4)
W 8i 1 +4,8i 1 +12,1 (4)
W 8i 1 +6,8i 1 +14,0 (4)
W 8i 1 +6,8i 1 +14,1 (4)
where
W m , m ′ , n ( 4 ) = 1 32 [ v m v m ′ v m v m ′ φ n v m φ n v m ′ - φ n v m - φ n v m ′ ]
where φ n is denoted by φ n =e jπn/2 and ν m is denoted by ν m =[1 e j2πn/32 e j4πn/32 e j6πn/32 ] T , and
in case of the Rank-4, the first PMI is set to any one of 0 and 2, and the second PMI is set to any one of 0, 1, 2, 3, 4, 5, 6 and 7.
18. The method according to claim 10 , wherein the RI, the first PMI, the second PMI, and the CQI are contained in channel status information (CSI) of downlink 8 transmission (Tx) antennas.
19. A user equipment (UE) for transmitting channel status information (CSI) via a physical uplink control channel (PUCCH) in a wireless communication system, the UE comprising:
a transmitter; and
a processor controls the transmitter to transmit a first PUCCH report including a rank indicator (RI); and to transmit a second PUCCH report including a channel quality indicator (CQI), a first precoding matrix indicator (PMI) and a second PMI, wherein when the RI corresponds to one of Rank-1 to Rank-4, a sub set of a codebook corresponding to the RI is available for selecting the first PMI and the second PMI, and a sum of the first PMI and the second PMI is comprised of 4 bits, and wherein when the RI corresponds to one of Rank-5 to Rank-7, a full set of a codebook corresponding to the RI is available for selecting the first PMI and the second PMI, and a sum of the first PMI and the second PMI is comprised of 2 bits.
20. A base station (BS) for receiving channel status information (CSI) via a physical uplink control channel (PUCCH) in a wireless communication system, the BS comprising:
a receiver; and
a processor controls the receiver to receive a first PUCCH report including a rank indicator (RI) and to receive a second PUCCH report including a channel quality indicator (CQI), a first precoding matrix indicator (PMI) and a second PMI, wherein when the RI corresponds to one of Rank-1 to Rank-4, a sub set of a codebook corresponding to the RI is applied to the first PMI and the second PMI, and a sum of the first PMI and the second PMI is comprised of 4 bits, and
wherein when the RI corresponds to one of Rank-5 to Rank-7, a full set of a codebook corresponding to the RI is applied to the first PMI and the second PMI, and a sum of the first PMI and the second PMI is comprised of 2 bits.Join the waitlist — get patent alerts
Track US9634749B2 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.