Method and apparatus for allocating subcarriers in a broadband wireless communications system using multiple carriers

1. A method of allocating subchannels by a Base Station (BS) in a wireless communication system, comprising the steps of:

allocating, by the BS, A subchannels, each of which including a subcarrier selected from each of B subcarrier groups using cell identification information and C Reed-Solomon sequences,

wherein D subcarriers are grouped into the B subcarrier groups, each of the B subcarrier groups including Q successive subcarriers, and each of A, B, C, D and Q being an integer equal to or greater than 1, and further

wherein Q is equal to A.

2. The method of claim 1 , wherein the cell identification information includes a quotient and a remainder of a division of a cell IDentifier (ID) number (m) by Q.

3. The method of claim 2 , wherein indexes of the subcarriers selected from each of the B subcarrier groups which are included in each of the A subchannels are calculated by

Sub_carrier( i )= Q*i+S ( i )

where the Sub_carrier(i) denotes an index of each of the subcarriers selected from each of the B subcarrier groups, i denotes an index of each of the subcarriers selected from each of the B subcarrier groups when B is Q−1, ranging from 0 to Q−2, and S(i) is an (i+1)th element of the following sequence S m,β which is expressed by

S m,β =S m +{β, β, β, . . . , β,β}

β∈GF(Q)

where GF(Q) represents Galois Field (Q), β is the index of the subchannel ranging from 0 to A−1, and S m is a cell identification sequence and is calculated by

S m =c 0 *S 0 +c 1 *S 1

where each of c 0 and c 1 is one of the quotient and the remainder and each of S 0 and S 1 is one of C Reed-Solomon sequences.

4. The method of claim 3 , wherein the S 0 and S 1 are expressed by

S0={1, a, a 2 , a 3 , . . . , a Q-2 }

S1={1, a 2 , a 4 , a 6 , . . . , a 2(Q-2) }

(a m ≠1 for m<Q−1)

where a is a primitive element of GF(Q).

5. The method of claim 4 , wherein equivalent sequences of the S 0 and S 1 are generated by cyclically shifting S 0 and S 1 .

6. The method of claim 4 , wherein B is equal to (Q−1), and increases and decreases.

7. The method of claim 2 , wherein if the number of the entire subcarriers of the wireless communication system is Q(Q−1), N subcarrier groups are defined using Q*N subcarriers in each symbol, (Q−1)/N symbols are used and N is equal to B, then indexes of the subcarriers selected from each of the B subcarrier groups which are included in each of the A subchannels are calculated by

Sub_carrier index ( n;i )= Q *( i−N*└i/N ┘)+ S m,β ( i ), n=i/N

where └i/N┘ represents a maximum integer less than or equal to i/N, the Sub_carrier index(n;i) denotes an index of each of the entire subcarriers, n denotes a symbol index, i denotes an index of each of the subcarriers selected from each of the B subcarrier groups, ranging from 0 to N−1, and the following sequence S m,β is expressed by

S m,β =S m +{β, β, β, . . . , β,β}

β∈GF(Q)

where GF(Q) represents Galois Field (Q), β is the index of the subchannel ranging from 0 to A−1, and S m is a cell identification sequence and is calculated by

S m =c 0 *S 0 +c 1 *S 1

where each of c 0 and c 1 is one of the quotient and the remainder and each of S 0 and S 1 is one of a plurality of C Reed-Solomon sequences.

8. The method of claim 7 , wherein the S 0 and S 1 are expressed by

S0={1, a, a 2 , a 3 , . . . , a Q-2 }

S1={1, a 2 , a 4 , a 6 , . . . , a 2(Q-2) }

(a m ≠1 for m<Q−1)

where a is a primitive element of GF(Q).

9. The method of claim 8 , wherein equivalent sequences of S 0 and S 1 are generated by cyclically shifting S 0 and S 1 .

10. The method of claim 8 , wherein B is equal to (Q−1), and increases and decreases.

11. The method of claim 2 , wherein the allocating step comprises calculating indexes of the subcarriers selected from each of the B subcarrier groups which are with included in each of the A subchannels by

Sub_carrier( i )= Q*i+S ″( i )

where Sub_carrier(i) denotes an index of each of the subcarriers selected from each of the B subcarrier groups, i denotes an index of each of B subcarrier groups, ranging from 0 to B−1, and S″(i) is an (i+1)th element of the following sequence S″ which is expressed by

S′=c 0 *S 0 +{β, β, β, . . . , β,β}, β∈GF ( Q )

S″=S′+c 1 *S 1

where S′ is a sequence for a cell identification, S″ is a sequence representing β th subchannel of a cell having the cell ID number m, GF(Q) represents Galois Field, each of c 0 and c 1 are one of the quotient and the remainder and each of S 0 and S 1 is one of a plurality of C Reed-Solomon sequences expressed by

S0={1, a, a 2 , a 3 , . . . , a Q-2 }

S1={1, a 2 , a 4 , a 6 , . . . , a 2(Q-2) }

(a m ≠1 for m<Q−1)

where a is a primitive element of GF(Q).

12. The method of claim 11 , wherein equivalent sequences of S 0 and S 1 are generated by cyclically shifting S 0 and S 1 .

13. The method of claim 11 , wherein B is equal to (Q−1), and increases and decreases.

14. The method of claim 2 , wherein if (Q−M) subcarriers are allocated to each of A subchannels, then indexes of(Q−M) subcarriers which are included each of the A subchannels are calculated by

Sub_carrier( i )= Q*i+S ( i )

where (Q−M) subcarriers indicates that the number of subcarriers per channel is less than (Q−1), the Sub_carrier(i) denotes an index of each of the (Q−M) subcarriers, i denotes an index of each of the subcarrier groups when B is equal to (Q−M), ranging from 0 to (Q−M)−1, and S(i) is an (i+1)th element of the following sequence S m,β which is expressed by

S m,β =S m +{β, β, β, . . . , β, β}

β∈GF(Q)

where GF(Q) represents Galois Field, β is the index of the subchannel ranging from 0 to A−1, and S m is a cell identification sequence and is calculated by

S m =c 0 *S 0 +c 1 *S 1

where each of c 0 and c 1 is one of the quotient and the remainder and each of S 0 and S 1 is one of a plurality of C Reed-Solomon sequences.

15. The method of claim 14 , wherein the S 0 and S 1 are expressed by

S0={1, a, a 2 , a 3 , . . . , a Q-2 }

S1={1, a 2 , a 4 , a 6 , . . . , a 2(Q-2) }

(a m ≠1 for m<Q−1)

where a is a primitive element of GF(Q).

16. The method of claim 15 , wherein equivalent sequences of S 0 and S 1 are generated by cyclically shifting S 0 and S 1 .

17. The method of claim 15 , wherein B is equal to (Q−1), and increases and decreases.

18. An apparatus for allocating subchannels in a wireless communication system, comprising:

a subcarrier allocator for allocating A subchannels, each of the A subchannels including a subcarrier selected from each of B subcarrier groups using cell identification information and C Reed-Solomon sequences,

wherein D subcarriers are grouped into the B subcarrier groups, each of the B subcarrier groups including Q successive subcarriers, and each of A, B, C, D and Q being an integer equal to or greater than 1, and further

wherein Q is equal to A.

19. The apparatus of claim 18 , wherein the cell identification information includes a quotient and a remainder of a division of a cell IDentifier (ID) number (m) by Q.

20. The apparatus of claim 19 , wherein indexes of the subcarriers selected from each of the B subcarrier groups which are included each of the A subchannels are calculated by

Sub_carrier( i )= Q*i+S ( i )

where the Sub_carrier (i) denotes an index of each of the subcarriers selected from each of the B subcarrier groups, i denotes an index of each of the subcarriers selected from each of the B subcarrier groups when B is Q−1, ranging from 0 to Q−2, and S(i) is an (i+1)th element of the following sequence S m,β which is expressed by

S m,β =S m +{β, β, β, . . . , β, β}

β∈GF(Q)

where GF(Q) represents Galois Field, β is the index of the subchannel ranging from 0 to A−1, and S m is the cell identification sequence and is calculated by

S m =c 0 *S 0 +c 1 *S 1

where each of c 0 and c 1 is one of the quotient and the remainder and each of S 0 and S 1 is one of a plurality of C Reed-Solomon sequences.

21. The apparatus of claim 20 , wherein S 0 and S 1 are expressed by

S0={1, a, a 2 , a 3 , . . . , a Q-2 }

S1={1, a 2 , a 4 , a 6 , . . . , a 2(Q-2) }

(a m ≠1 for m<Q−1)

where a is a primitive element of GF(Q).

22. The apparatus of claim 21 , wherein equivalent sequences of S 0 and S 1 are generated by cyclically shifting S 0 and S 1 .

23. The apparatus of claim 21 , wherein B is equal to (Q−1), and increases and decreases.

24. The apparatus of claim 19 , wherein if the number of the entire subcarriers of the wireless communication system is Q(Q−1), N subcarrier groups are defined using Q*N subcarriers in each symbol, (Q−1)/N symbols are used, and N is equal to B, then indexes of the subcarriers selected from each of the B subcarrier groups which are included in each of the A subchannels are calculated by

Sub_carrier index( n;i )= Q *( i−N*└i/N ┘)+ S m,β (i), n=i/N

where └i/N┘ represents a maximum integer less than or equal to i/N, the Sub_carrier index(n;i) denotes an index of each of the subcarriers, n denotes a symbol index, i denotes an index of each of the B subcarrier groups, ranging from 0 to N−1, and the following sequence S m,β is expressed by

S m,β =S m +{β, β, β, . . . , β, β}

β∈GF(Q)

where GF(Q) represents Galois Field (Q), β is the index of the subchannel ranging from 0 to A−1, and S m is a cell identification sequence and is calculated by

S m =c 0 *S 0 +c 1 *S 1

where each of c 0 and c 1 is one of the quotient and the remainder and each of S 0 and S 1 is one of a plurality of C Reed-Solomon sequences.

25. The apparatus of claim 24 , wherein the S 0 and S 1 are expressed by

S0={1, a, a 2 , a 3 , . . . , a Q-2 }

S1={1, a 2 , a 4 , a 6 , . . . , a 2(Q-2) }

(a m ≠1 for m<Q−1)

where a is a primitive element of GF(Q).

26. The apparatus of claim 25 , wherein equivalent sequences of S 0 and S 1 are generated by cyclically shifting S 0 and S 1 .

27. The apparatus of claim 25 , wherein B is equal to (Q−1), and increases and decreases.

28. The apparatus of claim 19 , wherein indexes of the subcarriers selected from each of the B subcarrier groups which are included each of the A subchannels are calculated by

Sub_carrier( i )= Q*i+S ″( i )

where Sub_carrier(i) denotes an index of each of the subcarriers selected from each of the B subcarrier groups, i denotes an index of each of the B subcarrier groups, ranging from 0 to B−1, and S″ (i) is an (i+1)th element of the following sequence S″ which is calculated by

S′=c 0 *S 0+{β, β, β, . . . , β, β}, β∈GF(Q)

S″=S′c 1 *S 1

where GF(Q) represents Galois Field (Q), S′ is a sequence for a cell identification, S″ is a sequence representing a βth subchannel of a cell having the cell ID number m, each of c 0 and c 1 is one of the quotient and the remainder and each of S 0 and S 1 is one of a plurality of C Reed-Solomon sequences expressed by

S0={1, a, a 2 , a 3 , . . . , a Q-2 }

S1={1, a 2 , a 4 , a 6 , . . . , a 2(Q-2) }

(a m ≠1 for m<Q−1)

where a is a primitive element of GF(Q).

29. The apparatus of claim 28 , wherein equivalent sequences of the S 0 and S 1 are generated by cyclically shifting S 0 and S 1 .

30. The apparatus of claim 28 , wherein B is equal to (Q−1), and increases and decreases.

31. The apparatus of claim 19 , wherein if (Q−M) subcarriers are allocated to each of A subchannels, subcarriers which are included in each of A subchannels are calculated by

Sub_carrier( i )= Q*i+S ( i )

where (Q−M) subcarriers indicates that the number of subcarriers per channel is less than (Q−1), the Sub_carrier(i) denotes an index of each of the (Q−M) subcarriers, i denotes an index of each of (Q−M) subcarrier groups when B is equal to (Q−M), ranging from 0 to (Q−M)−1, and S(i) is an (i+1)th element of the following sequence S m,β which is expressed by

S m,β =S m +{β, β, β, . . . , β, β}

β∈GF(Q)

where GF(Q) represents Galois Field, β is the index of the subchannel ranging from 0 to A−1, and S m is a cell identification sequence and is calculated by

S m =c 0 *S 0 +c 1 *S 1

where each of c 0 and c 1 is one of the quotient and the remainder and each of S 0 and S 1 is one of a plurality of Reed-Solomon sequences expressed by

S0={1, a, a 2 , a 3 , . . . , a Q-2 }

S1={1, a 2 , a 4 , a 6 , . . . , a 2(Q-2) }

(a m ≠1 for m<Q−1)

where a is a primitive element of GF(Q).

32. The apparatus of claim 31 , wherein equivalent sequences of S 0 and S 1 are generated by cyclically shifting S 0 and S 1 .

33. The apparatus of claim 31 , wherein B is equal to (Q−1) and increases and decreases.