USRE48442EActiveUtility
Method of data transmission in multiple antenna system
Est. expiryMar 5, 2028(~1.6 yrs left)· nominal 20-yr term from priority
H04B 7/0473H04L 1/0625H04L 2025/03426H04L 5/0026H04L 25/03929H04L 1/0631H04L 1/1893H04L 1/06H04L 1/0041H04L 25/03343H04B 7/0413H04W 28/0268H04W 72/046H04B 7/04
61
PatentIndex Score
0
Cited by
35
References
12
Claims
Abstract
A method of data transmission includes determining the number of layers, generating mapping symbols by mapping modulation symbols for a first codeword and modulation symbols for a second codeword to each layer, and transmitting the mapping symbols through a plurality of antennas. At least one of the first codeword and the second codeword is mapped to at least 3 layers and the number of layers is larger than 3.
Claims
exact text as granted — not AI-modifiedThe invention claimed is:
1. A method for receiving data in a multiple antenna system, the method performed by a receiver including a processor and a plurality of antennas and comprising:
receiving, by the processor using at least one antenna among the plurality of antennas, mapping symbols which are mapped to a plurality of layers at least one layer; and
demapping, by the processor, the mapping symbols to generate modulation symbols for a first at least one codewordand modulation symbols for a second codeword,
wherein when a number of the plurality of layers is 5, 6, 7 or 8, based on a number of the at least one codeword being 2, the mapping symbols are demapped to the modulation symbols for the a first codeword and the modulation symbols for the a second codeword based on a the following table rules:
Number
Codeword-to-layer mapping
of the
i = 0, 1, . . . , M layer symb − 1,
plurality
Number of
M layer symb : a number of modulation symbols
of layers
codewords
for each layer of the plurality of layers
5
2
x (0) (i) = d (0) (2i)
M layer symb = M (o) symb /2 =
x (1) (i) = d (0) (2i + 1)
M (1) symb /3
x (2) (i) = d (1) (3i)
x (3) (i) = d (1) (3i + 1)
x (4) (i) = d (1) (3i + 2)
6
2
x (0) (i) = d (0) (3i)
M layer symb = M (o) symb /3 =
x (1) (i) = d (0) (3i + 1)
M (1) symb /3
x (2) (i) = d (0) (3i + 2)
x (3) (i) = d (1) (3i)
x (4) (i) = d (1) (3i + 1)
x (5) (i) = d (1) (3i + 2)
7
2
x (0) (i) = d (0) (3i)
M layer symb = M (o) symb /3 =
x (1) (i) = d (0) (3i + 1)
M (1) symb /4
x (2) (i) = d (0) (3i + 2)
x (3) (i) = d (1) (4i)
x (4) (i) = d (1) (4i + 1)
x (5) (i) = d (1) (4i + 2)
x (6) (i) = d (1) (4i + 3)
8
2
x (0) (i) = d (0) (4i)
M layer symb = M (o) symb /4 =
x (1) (i) = d (0) (4i + 1)
M (1) symb /4
x (2) (i) = d (0) (4i + 2)
x (3) (i) = d (0) (4i + 3)
x (4) (i) = d (1) (4i)
x (5) (i) = d (1) (4i + 1)
x (6) (i) = d (1) (4i + 2)
x (7) (i) = d (1) (4i + 3)
(rule 1) based on a number of the at least one layer being 5, x (0) (i)=d (0) (2i), x (1) (i)=d (0) (2i+1), x (2) (i)=d (1) (3i), x (3) (i)=d (1) (3i+1), x (4) (i)=d (1) (3i+2), and M layer symb =M (0) symb /2=M (1) symb /3;
(rule 2) based on a number of the at least one layer being 6, x (0) (i)=d (0) (3i), x (1) (i)=d (0) (3i+1), x (2) (i)=d (0) (3i+2), x (3) (i)=d (1) (3i), x (4) (i)=d (1) (3i+1), x (5) (i)=d (1) (3i+2), and M layer symb =M (0) symb /3=M (1) symb /3;
(rule 3) based on a number of the at least one layer being 7, x (0) (i)=d (0) (3i), x (1) (i)=d (0) (3i+1), x (2) (i)=d (0) (3i+2), x (3) (i)=d (1) (4i), x (4) (i)=d (1) (4i+1), x (5) (i)=d (1) (4i+2), x (6) (i)=d (1) (4i+3), and M layer symb =M (0) symb /3=M (1) symb /4; and
(rule 4) based on a number of the at least one layer being 8, x (0) (i)=d (0) (4i), x (1) (i)=d (0) (4i+1), x (2) (i)=d (0) (4i+2), x (3) (i)=d (0) (4i+3), x (4) (i)=d (1) (4i), x (5) (i)=d (1) (4i+1), x (6) (i)=d (1) (4i+2), x (7) (i)=d (1) (4i+3), and M layer symb =M (0) symb /4=M (1) symb /4,
wherein in the above table rules, d (0) (i) is d (0) (0), . . . ,d (0) (M (0) symb −1) are the modulation symbols for the first codeword, d (1) (i) is d (1) (0), . . . ,d (1) (M (1) symb −1) are the modulation symbols for the second codeword, x (n) (i) is mapping symbols mapped to layer n, M (0) symb is a number of modulation symbols for the first codewordand, M (1) symb is a number of modulation symbols for the second codeword, M layer symb is a number of modulation symbols per layer, and i is an index that is one of 0, 1, . . . , M layer symb −1.
2. The method of claim 1 , wherein the number of the plurality of layers at least one layer is smaller than or equal to a number of the plurality of antennas.
3. The method of claim 1 , further comprising:
determining the number of the plurality of layers at least one layer.
4. A receiver comprising:
a plurality of antennas for transmitting and receiving a radio signal; and
a processor coupled to the plurality of antennas,
wherein the processor, using at least one antenna among the plurality of antennas, receives mapping symbols which are mapped to a plurality of layers at least one layer, demaps the mapping symbols to generate modulation symbols for a first at least one codewordand modulation symbols for a second codeword,
wherein when a number of the plurality of layers is 5, 6, 7 or 8, based on a number of the at least one codeword being 2, the mapping symbols are demapped to the modulation symbols for the a first codeword and the modulation symbols for the a second codeword based on a following table rules:
Number
Codeword-to-layer mapping
of the
i = 0, 1, . . . , M layer symb − 1,
plurality
Number of
M layer symb : a number of modulation symbols
of layers
codewords
for each layer of the plurality of layers
5
2
x (0) (i) = d (0) (2i)
M layer symb = M (o) symb /2 =
x (1) (i) = d (0) (2i + 1)
M (1) symb /3
x (2) (i) = d (1) (3i)
x (3) (i) = d (1) (3i + 1)
x (4) (i) = d (1) (3i + 2)
6
2
x (0) (i) = d (0) (3i)
M layer symb = M (o) symb /3 =
x (1) (i) = d (0) (3i + 1)
M (1) symb /3
x (2) (i) = d (0) (3i + 2)
x (3) (i) = d (1) (3i)
x (4) (i) = d (1) (3i + 1)
x (5) (i) = d (1) (3i + 2)
7
2
x (0) (i) = d (0) (3i)
M layer symb = M (o) symb /3 =
x (1) (i) = d (0) (3i + 1)
M (1) symb /4
x (2) (i) = d (0) (3i + 2)
x (3) (i) = d (1) (4i)
x (4) (i) = d (1) (4i + 1)
x (5) (i) = d (1) (4i + 2)
x (6) (i) = d (1) (4i + 3)
8
2
x (0) (i) = d (0) (4i)
M layer symb = M (o) symb /4 =
x (1) (i) = d (0) (4i + 1)
M (1) symb /4
x (2) (i) = d (0) (4i + 2)
x (3) (i) = d (0) (4i + 3)
x (4) (i) = d (1) (4i)
x (5) (i) = d (1) (4i + 1)
x (6) (i) = d (1) (4i + 2)
x (7) (i) = d (1) (4i + 3)
(rule 1) based on a number of the at least one layer being 5, x (0) (i)=d (0) (2i), x (1) (i)=d (0) (2i+1), x (2) (i)=d (1) (3i), x (3) (i)=d (1) (3i+1), x (4) (i)=d (1) (3i+2), and M layer symb =M (0) symb /2=M (1) symb /3;
(rule 2) based on a number of the at least one layer being 6, x (0) (i)=d (0) (3i), x (1) (i)=d (0) (3i+1), x (2) (i)=d (0) (3i+2), x (3) (i)=d (1) (3i), x (4) (i)=d (1) (3i+1), x (5) (i)=d (1) (3i+2), and M layer symb =M (0) symb /3=M (1) symb /3;
(rule 3) based on a number of the at least one layer being 7, x (0) (i)=d (0) (3i), x (1) (i)=d (0) (3i+1), x (2) (i)=d (0) (3i+2), x (3) (i)=d (1) (4i), x (4) (i)=d (1) (4i+1), x (5) (i)=d (1) (4i+2), x (6) (i)=d (1) (4i+3), and M layer symb =M (0) symb /3=M (1) symb /4; and
(rule 4) based on a number of the at least one layer being 8, x (0) (i)=d (0) (4i), x (1) (i)=d (0) (4i+1), x (2) (i)=d (0) (4i+2), x (3) (i)=d (0) (4i+3), x (4) (i)=d (1) (4i), x (5) (i)=d (1) (4i+1), x (6) (i)=d (1) (4i+2), x (7) (i)=d (1) (4i+3), and M layer symb =M (0) symb /4=M (1) symb /4,
wherein in the above table rules, d (0) (i) is d (0) (0), . . . ,d (0) (M (0) symb −1) are the modulation symbols for the first codeword, d (1) (i) is d (1) (0), . . . ,d (1) (M (1) symb −1) are the modulation symbols for the second codeword, x (n) (i) is mapping symbols mapped to layer n, M (0) symb is a number of modulation symbols for the first codewordand, M (1) symb is a number of modulation symbols for the second codeword, M layer symb is a number of modulation symbols per layer, and i is an index that is one of 0, 1, . . . , M layer symb −1.
5. The receiver of claim 4 , wherein the number of the plurality of layers at least one layer is smaller than or equal to a number of the plurality of antennas.
6. The receiver of claim 4 , the processor determines the number of the plurality of layers at least one layer.
7. A method for data transmission in a multiple antenna system, the method performed by a transmitter including a processor and a plurality of antennas and comprising:
generating, by the processor, mapping symbols by mapping modulation symbols for at least one codeword onto at least one layer; and transmitting, by the processor, the mapping symbols through at least one antenna among the plurality of antennas, wherein based on a number of the at least one codeword being 2, modulation symbols for a first codeword and modulation symbols for a second codeword are mapped onto the at least one layer based on following rules:
(rule 1) based on a number of the at least one layer being 5, x (0) (i)=d (0) (2i), x (1) (i)=d (0) (2i+1), x (2) (i)=d (1) (3i), x (3) (i)=d (1) (3i+1), x (4) (i)=d (1) (3i+2), and M layer symb =M (0) symb /2=M (1) symb /3;
(rule 2) based on a number of the at least one layer being 6, x (0) (i)=d (0) (3i), x (1) (i)=d (0) (3i+1), x (2) (i)=d (0) (3i+2), x (3) (i)=d (1) (3i), x (4) (i)=d (1) (3i+1), x (5) (i)=d (1) (3i+2), and M layer symb =M (0) symb /3=M (1) symb /3;
(rule 3) based on a number of the at least one layer being 7, x (0) (i)=d (0) (3i), x (1) (i)=d (0) (3i+1), x (2) (i)=d (0) (3i+2), x (3) (i)=d (1) (4i), x (4) (i)=d (1) (4i+1), x (5) (i)=d (1) (4i+2), x (6) (i)=d (1) (4i+3), and M layer symb =M (0) symb /3=M (1) symb /4; and
(rule 4) based on a number of the at least one layer being 8, x (0) (i)=d (0) (4i), x (1) (i)=d (0) (4i+1), x (2) (i)=d (0) (4i+2), x (3) (i)=d (0) (4i+3), x (4) (i)=d (1) (4i), x (5) (i)=d (1) (4i+1), x (6) (i)=d (1) (4i+2), x (7) (i)=d (1) (4i+3), and M layer symb =M (0) symb /4=M (1) symb /4,
wherein in the above rules, d (0) (0), . . . ,d (0) (M (0) symb −1) are the modulation symbols for the first codeword, d (1) (0), . . . ,d (1) (M (1) symb −1) are the modulation symbols for the second codeword, x (n) (i) is mapping symbols mapped to layer n, M (0) symb is a number of modulation symbols for the first codeword, M (1) symb is a number of modulation symbols for the second codeword, M layer symb is a number of modulation symbols per layer, and i is an index that is one of 0, 1, . . . , M layer symb −1.
8. The method of claim 7, wherein the number of the at least one layer is smaller than or equal to a number of the plurality of antennas.
9. The method of claim 7, further comprising:
determining the number of the at least one layer.
10. A transmitter comprising:
a plurality of antennas for transmitting and receiving a radio signal; and a processor coupled to the plurality of antennas, wherein the processor generates mapping symbols by mapping modulation symbols for at least one codeword onto at least one layer, and transmits the mapping symbols through at least one antenna among the plurality of antennas, wherein based on a number of the at least one codeword being 2, modulation symbols for a first codeword and modulation symbols for a second codeword are mapped onto the at least one layer based on following rules:
(rule 1) based on a number of the at least one layer being 5, x (0) (i)=d (0) (2i), x (1) (i)=d (0) (2i+1), x (2) (i)=d (1) (3i), x (3) (i)=d (1) (3i+1), x (4) (i)=d (1) (3i+2), and M layer symb =M (0) symb /2=M (1) symb /3;
(rule 2) based on a number of the at least one layer being 6, x (0) (i)=d (0) (3i), x (1) (i)=d (0) (3i+1), x (2) (i)=d (0) (3i+2), x (3) (i)=d (1) (3i), x (4) (i)=d (1) (3i+1), x (5) (i)=d (1) (3i+2), and M layer symb =M (0) symb /3=M (1) symb /3;
(rule 3) based on a number of the at least one layer being 7, x (0) (i)=d (0) (3i), x (1) (i)=d (0) (3i+1), x (2) (i)=d (0) (3i+2), x (3) (i)=d (1) (4i), x (4) (i)=d (1) (4i+1), x (5) (i)=d (1) (4i+2), x (6) (i)=d (1) (4i+3), and M layer symb =M (0) symb /3=M (1) symb /4; and
(rule 4) based on a number of the at least one layer being 8, x (0) (i)=d (0) (4i), x (1) (i)=d (0) (4i+1), x (2) (i)=d (0) (4i+2), x (3) (i)=d (0) (4i+3), x (4) (i)=d (1) (4i), x (5) (i)=d (1) (4i+1), x (6) (i)=d (1) (4i+2), x (7) (i)=d (1) (4i+3), and M layer symb =M (0) symb /4=M (1) symb /4,
wherein in the above rules, d (0) (0), . . . ,d (0) (M (0) symb −1) are the modulation symbols for the first codeword, d (1) (0), . . . ,d (1) (M (1) symb −1) are the modulation symbols for the second codeword, x (n) (i) is mapping symbols mapped to layer n, M (0) symb is a number of modulation symbols for the first codeword, M (1) symb is a number of modulation symbols for the second codeword, M layer symb is a number of modulation symbols per layer, and i is an index that is one of 0, 1, . . . , M layer symb −1.
11. The transmitter of claim 10, wherein the number of the at least one layer is smaller than or equal to a number of the plurality of antennas.
12. The transmitter of claim 10, the processor determines the number of the at least one layer.Join the waitlist — get patent alerts
Track USRE48442E — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.