Method of allocating resources for transmitting uplink signal in MIMO wireless communication system and apparatus thereof
A method of allocating resources for transmitting a signal in a Multiple-Input Multiple-Output (MIMO) wireless communication system is disclosed. The method includes allocating one or more spatial resources of a plurality of spatial resources corresponding to first Single Carrier-Frequency Division Multiple Access (SC-FDMA) symbols to a first transport block, allocating one or more other spatial resources of the plurality of spatial resources corresponding to the first SC-FDMA symbols to a second transport block, and allocating spatial resources corresponding to second SC-FDMA symbols to the first transport block and the second transport block.
1. A method for transmitting an uplink signal using L layers at a terminal in a Multiple-Input Multiple-Output (MIMO) wireless communication system, the method comprising:
writing input vector sequences into an interleaver matrix row by row in a unit of L·log 2 Q rows, wherein Q is a modulation order;
reading out the interleaver matrix column by column;
modulating output bit sequences read out from the interleaver matrix, by a unit of log 2 Q bits, to generate modulation symbols;
mapping the modulation symbols to the L layers; and
transmitting the modulation symbols by using the L layers.
2. The method according to claim 1 , wherein if a number of modulation symbols per layer is given by H and a number of columns of the interleaver matrix is given by C, a number of rows R of the interleaver matrix is defined Equation 2 shown below:
H
·
L
·
log
2
Q
C
.
〈
Equation
2
〉
3. The method according to claim 2 , wherein the number of columns of the interleaver matrix C is a number of symbols for transmitting data per subframe (N symb ).
4. The method according to claim 2 , wherein the interleaver matrix is represented by Equation 3 shown below:
[
g
0
g
1
…
g
C
-
1
g
C
g
C
+
1
…
g
2
C
-
1
⋮
⋮
⋱
⋮
g
(
R
′
-
1
)
·
C
g
(
R
′
-
1
)
·
C
+
1
…
g
R
′
·
C
-
1
]
〈
Equation
3
〉
(where
R
′
=
R
L
·
log
2
Q
and g k is a vector defined by L·log 2 Q rows).
5. The method according to claim 4 , wherein the input vector sequence y k is defined by Equation 4 shown below:
y k =[q k·log 2 Q 1 , . . . ,q (k+1)·log 2 Q−1 1 ,q k·log 2 Q 2 , . . . ,q (k+1)·log 2 Q−1 2 , . . . ,q k·log 2 Q L , . . . ,q (k+1)·log 2 Q−1 L ] T <Equation 4>
(where q j denotes an encoded bit).
6. A terminal apparatus of a Multiple-Input Multiple-Output (MIMO) wireless communication system, the terminal apparatus comprising:
a processor configured to
write input vector sequences into an interleaver matrix row by row in a unit of L·log 2 Q rows, wherein L is a number of layers and Q is a modulation order,
read out the interleaver matrix column by column,
modulate output bit sequences read out from the interleaver matrix, by a unit of log 2 Q bits, to generate modulation symbols, and
map the modulation symbols to the L layers; and
a transmission module configured to transmit the modulation symbols by using the L layers.
7. The terminal apparatus according to claim 6 , wherein if a number of modulation symbols per layer is given by H and a number of columns of the interleaver matrix is given by C, a number of rows R of the interleaver matrix is defined Equation 2 shown below:
H
·
L
·
log
2
Q
C
.
〈
Equation
2
〉
8. The terminal apparatus according to claim 7 , wherein the number of columns of the interleaver matrix C is a number of symbols for transmitting data per subframe (N symb ).
9. The terminal apparatus according to claim 7 , wherein the interleaver matrix is represented by Equation 3 shown below:
[
g
0
g
1
…
g
C
-
1
g
C
g
C
+
1
…
g
2
C
-
1
⋮
⋮
⋱
⋮
g
(
R
′
-
1
)
·
C
g
(
R
′
-
1
)
·
C
+
1
…
g
R
′
·
C
-
1
]
〈
Equation
3
〉
(where
R
′
=
R
L
·
log
2
Q
and g k is a vector defined by L·log 2 Q rows).
10. The terminal apparatus according to claim 9 , wherein the input vector sequence y k is defined by Equation 4 shown below:
y k =[q k·log 2 Q 1 , . . . ,q (k+1)·log 2 Q−1 1 ,q k·log 2 Q 2 , . . . ,q (k+1)·log 2 Q−1 2 , . . . ,q k·log 2 Q L , . . . ,q (k+1)·log 2 Q−1 L ] T <Equation 4>
(where q j denotes an encoded bit).