1. An interleaving method using a parallel structured Latin square matrix in a communication system, comprising:
dividing input information bits into a plurality of sub-blocks according to a parallel processing order;
generating a first Latin square matrix or a second Latin square matrix by comparing the parallel processing order with a predetermined threshold; and
interleaving the information bits divided into the sub-blocks according to the generated Latin square matrix.
2. The interleaving method of claim 1, wherein if the parallel processing order is less than the threshold, generating a first Latin square matrix having a size of the parallel processing order and having a good distribution.
3. The interleaving method of claim 1, wherein if the parallel processing order is greater than the threshold, generating a Latin square matrix having a size of a predetermined order less than the parallel processing order and generating a second Latin square matrix extended by the size of the parallel processing order from the Latin square matrix.
4. The interleaving method of claim 3, wherein the predetermined order size l is a constant less than the parallel processing order L, where L is a multiple of l.
5. The interleaving method of claim 3, wherein the second Latin square matrix is expressed by:
u
L
=
\ue89e
(
u
l
)
(
n
)
=
\ue89e
(
a
11
a
12
\u2026
a
1
\ue89e
l
a
21
a
22
a
2
\ue89e
l
\u22ee
\u22f0
\u22ee
a
l
\ue89e
\ue89e
1
a
l
\ue89e
\ue89e
2
\u2026
a
ll
)
(
n
)
=
\ue89e
a
11
\u2026
a
1
\ue89e
\ue89e
l
a
11
(
1
)
\u2026
a
1
\ue89e
\ue89e
l
(
1
)
\u2026
a
11
(
n
–
1
)
\u2026
a
1
\ue89e
l
(
n
–
1
)
a
21
(
n
–
1
)
\u2026
a
21
(
n
–
1
)
a
21
\u2026
a
2
\ue89e
l
\u2026
a
21
(
n
–
2
)
\u2026
a
2
\ue89e
l
(
n
–
2
)
\u22ee
\u22ee
\u22ee
\u22ee
\u22f0
\u22ee
\u22ee
a
11
(
1
)
\ue89e
\u2026
a
1
\ue89e
l
(
1
)
a
11
(
2
)
\u2026
a
1
\ue89e
l
(
2
)
\u2026
a
11
\u2026
a
1
\ue89e
l
a
21
\u2026
a
2
\ue89e
l
a
21
(
1
)
\u2026
a
2
\ue89e
l
(
1
)
\u2026
a
21
(
n
–
1
)
\u2026
a
2
\ue89e
l
(
n
–
1
)
\u22ee
\u22ee
\u22ee
\u22ee
\u22f0
\u22ee
\u22ee
\u22ee
\u22ee
\u22ee
\u22ee
\u22f0
\u22ee
\u22ee
a
11
(
n
–
1
)
\u2026
a
1
\ue89e
l
(
n
–
1
)
a
11
\u2026
a
1
\ue89e
l
\u2026
a
11
(
n
–
2
)
\u2026
a
1
\ue89e
l
(
n
–
2
)
a
21
(
n
–
2
)
\u2026
a
2
\ue89e
l
(
n
–
2
)
a
21
(
n
–
1
)
\u2026
a
2
\ue89e
l
(
n
–
1
)
\u2026
a
21
(
n
–
3
)
\u2026
a
2
\ue89e
l
(
n
–
3
)
\u22ee
\u22ee
\u22ee
\u22ee
\u22f0
\u22ee
\u22ee
where uL denotes the second Latin matrix having a size of L\xd7L, ul denotes a Latin square matrix having a size of l\xd7l, and n denotes a parameter for converting the Latin square matrix ul into the Latin square matrix uL having a size required by the system.
6. The interleaving method of claim 5, wherein an element ai,j(k) of the second Latin square matrix is calculated according to:
aij(k)=aij+l\xb7k, 0\u2266k\u2266n\u22121,
where ai,j(k) denotes an element of the second Latin square matrix, ai,j denotes an element of an ith row and an jth column of the reduced Latin square matrix ul, l denotes a predetermined order size, i denotes a sub-block index, and j denotes a time-domain index.
7. The interleaving method of claim 1, wherein interleaving the information bits divided into the sub-blocks according to the generated Latin square matrix further comprises:
determining an information bit permutation is so that a memory contention does not occur.
8. The interleaving method of claim 7, wherein the information bit permutation is determined according to:
\u03c0(k)=uij\xb7M+\u03c0T(t), k=j\xd7M+i,
wherein \u03c0(k) denotes an interleaving rule of an interleaver, \u03c0T(t) denotes a conventional sub-block interleaver, uijdenotes an element of an ith row and an jth column of the second Latin square matrix U, and M denotes a sub-block size.
9. The interleaving method of claim 1, wherein interleaving using the parallel structured Latin square matrix is based on parallel processing of a turbo code.
10. The interleaving method of claim 1, further comprising generating the first Latin square matrix by determining a number of sub-blocks to a number of columns and by determining a number of bits for each sub-block to a number of rows, or generating the first Latin square matrix by determining a number of sub-blocks to a number of rows and by determining a number of bits for each sub-block to a number of columns.
11. An interleaving apparatus using a parallel structured Latin square matrix in a communication system, wherein the apparatus divides input information bits into a plurality of sub-blocks according to a parallel processing order, generates a first Latin square matrix or a second Latin square matrix by comparing the parallel processing order with a predetermined threshold, and interleaves the information bits divided into the sub-blocks according to the generated Latin square matrix.
12. The interleaving apparatus of claim 11, wherein, if the parallel processing order is less than the threshold, the apparatus generates a first Latin square matrix having a size of the parallel processing order and having a good distribution.
13. The interleaving apparatus of claim 11, wherein if the parallel processing order is greater than the threshold, the apparatus generates a Latin square matrix having a size of a predetermined order less than the parallel processing order and generates a second Latin square matrix extended by the size of the parallel processing order from the Latin square matrix.
14. The interleaving apparatus of claim 13, wherein the preset order size l is a constant less than the parallel processing order L, where L is a multiple of l.
15. The interleaving apparatus of claim 13, wherein the second Latin square matrix is expressed by:
u
L
=
\ue89e
(
u
l
)
(
n
)
=
\ue89e
(
a
11
a
12
\u2026
a
1
\ue89e
l
a
21
a
22
a
2
\ue89e
l
\u22ee
\u22f0
\u22ee
a
l
\ue89e
\ue89e
1
a
l
\ue89e
\ue89e
2
\u2026
a
ll
)
(
n
)
=
\ue89e
a
11
\u2026
a
1
\ue89e
\ue89e
l
a
11
(
1
)
\u2026
a
1
\ue89e
\ue89e
l
(
1
)
\u2026
a
11
(
n
–
1
)
\u2026
a
1
\ue89e
l
(
n
–
1
)
a
21
(
n
–
1
)
\u2026
a
21
(
n
–
1
)
a
21
\u2026
a
2
\ue89e
l
\u2026
a
21
(
n
–
2
)
\u2026
a
2
\ue89e
l
(
n
–
2
)
\u22ee
\u22ee
\u22ee
\u22ee
\u22f0
\u22ee
\u22ee
a
11
(
1
)
\ue89e
\u2026
a
1
\ue89e
l
(
1
)
a
11
(
2
)
\u2026
a
1
\ue89e
l
(
2
)
\u2026
a
11
\u2026
a
1
\ue89e
l
a
21
\u2026
a
2
\ue89e
l
a
21
(
1
)
\u2026
a
2
\ue89e
l
(
1
)
\u2026
a
21
(
n
–
1
)
\u2026
a
2
\ue89e
l
(
n
–
1
)
\u22ee
\u22ee
\u22ee
\u22ee
\u22f0
\u22ee
\u22ee
\u22ee
\u22ee
\u22ee
\u22ee
\u22f0
\u22ee
\u22ee
a
11
(
n
–
1
)
\u2026
a
1
\ue89e
l
(
n
–
1
)
a
11
\u2026
a
1
\ue89e
l
\u2026
a
11
(
n
–
2
)
\u2026
a
1
\ue89e
l
(
n
–
2
)
a
21
(
n
–
2
)
\u2026
a
2
\ue89e
l
(
n
–
2
)
a
21
(
n
–
1
)
\u2026
a
2
\ue89e
l
(
n
–
1
)
\u2026
a
21
(
n
–
3
)
\u2026
a
2
\ue89e
l
(
n
–
3
)
\u22ee
\u22ee
\u22ee
\u22ee
\u22f0
\u22ee
\u22ee
where uL denotes the second Latin matrix having a size of L\xd7L, ul denotes a Latin square matrix having a size of l\xd7l, and n denotes a parameter for converting the Latin square matrix ul into the Latin square matrix uL having a size required by the system.
16. The interleaving apparatus of claim 15, wherein an element ai,j(k) of the second Latin square matrix is calculated according to:
aij(k)=aij+l\xb7k, 0\u2266k\u2266n\u22121,
where ai,j(k) denotes an element of the second Latin square matrix, ai,j denotes an element of an ith row and an jth column of the reduced Latin square matrix ul, l denotes a predetermined order size, i denotes a sub-block index, and j denotes a time-domain index.
17. The interleaving apparatus of claim 11, wherein when the apparatus interleaves the information bits divided into the sub-blocks according to the generated Latin square matrix, an information bit permutation is determined so that a memory contention does not occur.
18. The interleaving apparatus of claim 17, wherein the information bit permutation is determined according to:
\u03c0(k)=uij\xb7M+\u03c0T(t), k=j\xd7M+i,
wherein \u03c0(k) denotes an interleaving rule of an interleaver, \u03c0T(t) denotes a conventional sub-block interleaver, uij denotes an element of an ith row and an jth column of the second Latin square matrix U, and M denotes a sub-block size.
19. The interleaving apparatus of claim 11, wherein the interleaving using the parallel structured Latin square matrix is based on parallel processing of a turbo code.
20. The interleaving apparatus of claim 11, wherein the apparatus generates the first Latin square matrix by determining a number of sub-blocks to a number of columns and by determining a number of bits for each sub-block to a number of rows, or generates the first Latin square matrix by determining a number of sub-blocks to a number of rows and by determining a number of bits for each sub-block to a number of columns.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A method for transmitting a spread signal at a base station in a mobile communication system, the method comprising:
spreading a signal using a plurality of spreading codes, wherein the plurality of spreading codes have a spreading factor of 4;
coding the spread signal for multiple antenna transmission;
multiplexing the coded spread signal by code division multiplexing for each antenna;
transmitting the multiplexed signal via four neighboring frequency resources of one orthogonal frequency-division multiplexing (OFDM) symbol of a first antenna set comprising two antennas; and
transmitting the same multiplexed signal via four neighboring frequency resources of one OFDM symbol of a second antenna set comprising two antennas,
wherein the multiplexed signal transmitted via the first antenna set and the multiplexed signal transmitted via the second antenna set are transmitted via different OFDM symbols,
wherein the multiplexed signal transmitted via the first antenna set and the multiplexed signal transmitted via the second antenna set are separated from each other by a plurality of subcarriers in a frequency domain,
wherein the spread signal is coded between the two antennas in each of the first antenna set and the second antenna set as shown in Table 1:
TABLE 1
neighboring frequency resources in
one OFDM symbol
antenna A
f1(a1)
f2(a2)
f1(a3)
f2(a4)
antenna B
f3(a2)
f4(a1)
f3(a4)
f4(a3)
wherein antenna A and antenna B represent the two antennas in each of the first antenna set and second antenna set, f1(x)=x, f2(x)=x, f3(x)=\u2212x* and f4(x)=x*, and a1 to a4 represent each element of the spread signal, and
wherein the spread signal is an ACKNACK signal for indicating whether or not uplink signal is successfully received.
2. The method of claim 1, wherein frequency switching transmitting diversity (FSTD) is applied in a way of transmitting the multiplexed signal alternately by the first antenna set and second antenna set repeatedly.
3. The method of claim 2, wherein the multiplexed signal is transmitted a total of 3 times using the first antenna set and second antenna set alternately.
4. The method of claim 1, wherein the first antenna set comprises a first antenna and a second antenna of a four-antenna group.
5. The method of claim 4, wherein the second antenna set comprises a third antenna and a fourth antenna of the four-antenna group.
6. The method of claim 1, wherein the first antenna set comprises a first antenna and a third antenna of a four-antenna group.
7. The method of claim 6, wherein the second antenna set comprises a second antenna and a fourth antenna of the four-antenna group.
8. A method for receiving a spread signal at a user equipment in a mobile communication system, the method comprising:
receiving a multiplexed signal via four neighboring frequency resources of one orthogonal frequency-division multiplexing (OFDM) symbol, the multiplexed signal being received from a first antenna set comprising two antennas of a transmitting end; and
receiving the same multiplexed signal via four neighboring frequency resources of one OFDM symbol, the same multiplexed signal being received from a second antenna set comprising two antennas of the transmitting end,
wherein the multiplexed signal received from the first antenna set and the multiplexed signal received from the second antenna set are received via different OFDM symbols,
wherein the multiplexed signal originates from a coded spread signal using code division multiplexing for each antenna,
wherein the coded spread signal originates from a spread signal coded between the two antennas in each of the first antenna set and the second antenna set as shown in Table 1:
TABLE 1
neighboring frequency resources in
one OFDM symbol
antenna A
f1(a1)
f2(a2)
f1(a3)
f2(a4)
antenna B
f3(a2)
f4(a1)
f3(a4)
f4(a3)
wherein antenna A and antenna B represent the two antennas in each of the first antenna set and second antenna set, f1(x)=x, f2(x)=x, f3(x)=\u2212x* and f4(x)=x*, and a1 to a4 represent each element of the spread signal,
wherein the spread signal originates from spreading a signal using a plurality of spreading codes, wherein the plurality of spreading codes have a spreading factor of 4,
wherein the multiplexed signal received via the first antenna set and the multiplexed signal received via the second antenna set are separated from each other by a plurality of subcarriers in a frequency domain,
wherein the spread signal is an ACKNACK signal for indicating whether or not uplink signal is successfully received.
9. The method of claim 8, wherein frequency switching transmitting diversity (FSTD) is applied in receiving the multiplexed signal alternately from the first antenna set and second antenna set repeatedly.
10. The method of claim 9, wherein the multiplexed signal is received a total of 3 times using the first antenna set and second antenna set alternately.
11. The method of claim 8, wherein the first antenna set comprises a first antenna and a second antenna of a four-antenna group.
12. The method of claim 11, wherein the second antenna set comprises a third antenna and a fourth antenna of the four-antenna group.
13. The method of claim 8, wherein the first antenna set comprises a first antenna and a third antenna of a four-antenna group.
14. The method of claim 13, wherein the second antenna set comprises a second antenna and a fourth antenna of the four-antenna group.