Apparatus and method for transmitting/receiving pilot signal in communication system using OFDM scheme

• US 20060028976A1
• Filed: 06/27/2005
• Published: 02/09/2006
• Est. Priority Date: 07/02/2004
• Status: Active Grant

• Current Assignee: Nokia Technologies Oy (Nokia Corporation)
• Original Assignee: Samsung Electronics Co. Ltd.
• Inventors: Park, Dong-Seek, Park, Sung-Eun, Choi, Seung-Hoon, Jang, Ji-Ho, Kim, Jae-Yoel, Joo, Pan-Yuh
• Granted Patent: US 7,583,586 B2
• Time in Patent Office: Days
• US Class Current: 370/203
• CPC Class Codes: H04B 2201/70701 featuring pilot assisted reception
• CPC Class Codes: H04B 2201/709709 Methods of preventing interference
• CPC Class Codes: H04J 13/0048 Walsh
• CPC Class Codes: H04J 13/16 Code allocation
• CPC Class Codes: H04L 27/2613 Structure of the reference signals
• CPC Class Codes: H04L 27/262 Reduction thereof by selection of pilot symbols
• CPC Class Codes: H04L 27/2655 Synchronisation arrangements
• CPC Class Codes: H04L 5/0023 Time-frequency-space
• CPC Class Codes: H04L 5/0048 Allocation of pilot signals, i.e. of signals known to the receiver

Abstract

Disclosed is a method for transmitting a reference signal for identification of each cell in a communication system including a plurality of cells each of which is identified by a cell identifier. The method includes receiving a cell identifier, and generating a block code corresponding to the cell identifier using a predetermined block code generator matrix, and generating a first part sequence using the block code; selecting a second part sequence in accordance with the cell identifier; generating a reference signal of a frequency domain using the first part sequence and the second part sequence; converting the reference signal of the frequency domain to a reference signal of a time domain through an Inverse Fast Fourier Transform operation and transmitting the reference signal of the time domain in a predetermined reference signal transmission interval.

Claims

1. A method for transmitting a reference signal for identification of each cell in a communication system including a plurality of cells, each of which is identified by a cell identifier, the method comprising the steps of:

receiving a cell identifier and generating a block code corresponding to the cell identifier using a predetermined block code generator matrix;

and

generating a first part sequence using the block code;

selecting a second part sequence in accordance with the cell identifier;

generating a reference signal of a frequency domain using the first part sequence and the second part sequence;

converting the reference signal of the frequency domain to a reference signal of a time domain through an Inverse Fast Fourier Transform operation; and

transmitting the reference signal of the time domain in a predetermined reference signal transmission interval.

2. The method as claimed in claim 1, wherein the step of generating the first part sequence comprises the steps of:

interleaving the block code according to a predetermined interleaving scheme; and

performing an exclusive OR operation on the interleaved block code.

3. An apparatus for transmitting a reference signal for identification of each cell in a communication system including a plurality of cells each of which is identified by a cell identifier, the apparatus comprising:

a reference signal generator which, in response to input of the cell identifier, generates a block code corresponding to the cell identifier using a predetermined block code generator matrix, generates a first part sequence using the block code, selects a second part sequence in accordance with the cell identifier, and generates a reference signal of a frequency domain by using the first part sequence and the second part sequence; and

a transmitter for converting the reference signal of the frequency domain to a reference signal of a time domain through an Inverse Fast Fourier Transform, and operation and then transmitting the reference signal of the time domain over a reference signal transmission interval.

4. The apparatus as claimed in claim 3, wherein the reference signal generator comprises:

a block code encoder for generating the block code corresponding to the cell identifier using the block code generator matrix;

an interleaver for interleaving the block code according to a predetermined interleaving scheme;

an adder for performing an exclusive OR operation on the interleaved block code, thereby generating the first part sequence; and

a combiner for generating the reference signal of the frequency domain using the first part sequence and the second part sequence.

5. A method for transmitting a reference signal for identification of each cell in a communication system including a plurality of cells each of which is identified by a cell identifier, an entire frequency band of the communication system including a sub-carrier bands, the method comprising the steps of:

in response to input of the cell identifier, generating a block code corresponding to the cell identifier using a predetermined block code generator matrix;

generating a first part sequence by interleaving the block code according to a predetermined interleaving scheme and performing an exclusive OR operation on the interleaved block code;

selecting a second part sequence corresponding to the cell identifier and from among predetermined sequences considering Peak-to-Average Power Ratio(PAPR) reduction;

generating a reference signal of a frequency domain by using the first part sequence and the second part sequence;

converting the reference signal of the frequency domain to a reference signal of a time domain through an Inverse Fast Fourier Transform operation; and

transmitting the reference signal of the time domain in a over a reference signal transmission interval.

6. The method as claimed in claim 5, wherein the step of converting the reference signal comprises the steps of:

inserting null data into sub-carriers corresponding to DC components and intersubcarrier interference eliminating components from among N sub-carriers;

inserting elements of the reference signal into M sub-carriers other than the sub-carriers into which the null data is inserted from among the N sub-carriers; and

performing an Inverse Fast Fourier Transform (IFFT) operation on a signal including the reference signal elements and the M sub-carriers.

7. The method as claimed in claim 5, wherein the step of converting the reference signal comprises the steps of:

inserting null data into sub-carriers corresponding to DC components and intersubcarrier interference eliminating components from among N sub-carriers;

inserting elements of the reference signal into M sub-carriers other than the sub-carriers into which the null data is inserted from among the N sub-carriers, in consideration of a predetermined offset; and

performing an IFFT operation on a signal including the reference signal elements and the M sub-carriers and then transmitting the signal.

8. The method as claimed in claim 7, wherein the offset is set to have a specific value for each of the cells and sectors.

9. The method as claimed in claim 6, wherein the reference signal of the frequency domain is defined by:

$P_{{\mathrm{ID}}_{\mathrm{cell},S}}<br><br>\left[k\right]=\{\begin{array}{cc}\sqrt{2}<br><br>\left(1-2<br><br>\text{\hspace{1em}<br><br>}<br><br>q_{{\mathrm{ID}}_{\mathrm{cell},S}}<br><br>\left[m\right]\right),& k=2<br><br>\text{\hspace{1em}<br><br>}<br><br>m-\frac{N_{\mathrm{used}}}{2},\\ \text{\hspace{1em}<br><br>}& m=0,1,\mathrm{\dots <br><br>}<br><br>\text{\hspace{1em}<br><br>},\frac{N_{\mathrm{used}}}{4}-1\\ \sqrt{2}<br><br>\left(1-2<br><br>\text{\hspace{1em}<br><br>}<br><br>q_{{\mathrm{ID}}_{\mathrm{cell},S}}<br><br>\left[m-1\right]\right),& k=2<br><br>m-\frac{N_{\mathrm{used}}}{2},\\ \text{\hspace{1em}<br><br>}& m=\frac{N_{\mathrm{used}}}{4}+1,\frac{N_{\mathrm{used}}}{4}+2,\mathrm{\dots <br><br>}<br><br>\text{\hspace{1em}<br><br>},\frac{N_{\mathrm{used}}}{2}\\ 0,& \mathrm{otherwise}\end{array}<br><br><br><br>{\mathrm{ID}}_{\mathrm{cell}}\in <br><br>\left\{0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},126\right\},s\in <br><br>\left\{0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},7\right\},<br><br>k\in <br><br>\left\{-N_{\mathrm{FFT}}/2,-N_{\mathrm{FFT}}/2+1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},N_{\mathrm{FFT}}<br><br>2-1\right\}.$

wherein P_IDcell,S[k] denotes the reference signal, ID_cell denotes the cell identifier, s denotes the sector identifier, k denotes a sub-carrier index, N_used has a value equal to M, and q_IDcell,S[m] denotes a setup sequence.

10. The method as claimed in claim 9, wherein the setup sequence is defined by:

$q_{{\mathrm{ID}}_{\mathrm{cell}},S}<br><br>\left[m\right]=\{\begin{array}{cc}R<br><br>\left(8*\lfloor <br><br>\frac{m}{9}\rfloor <br><br>+m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9\right),& \mathrm{where}<br><br>\text{\hspace{1em}<br><br>}<br><br>m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9=0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},7\\ \text{\hspace{1em}<br><br>}& m=0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},53\\ T<br><br>\left(\lfloor <br><br>\frac{m}{9}\rfloor <br><br>\right),& \mathrm{where}<br><br>\text{\hspace{1em}<br><br>}<br><br>m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9=8\end{array},$

wherein

$\lfloor <br><br>\frac{m}{9}\rfloor <br><br>$

represents a maximum integer not greater than

$\frac{m}{9},$

and R(r) is defined by;

$\begin{array}{c}R<br><br>\left(r\right)=w_{r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>8}^s\oplus <br><br>b_{\mathrm{IDcell}+1}<br><br>g_{\prod <br><br>\left(r\right)},\\ r=8*\lfloor <br><br>\frac{m}{9}\rfloor <br><br>+m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9=0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},47,\end{array}$

wherein w^s_{r mod8} represents repetition of Walsh codes having a length of 8, b_k (1≦

k≦

47) represents a row vector of the block code generator matrix, and g_u (0≦

u≦

47) represents the u-th column vector of the block code generator matrix.

11. The method as claimed in claim 10, wherein the block code generator matrix is defined as

12. The method as claimed in claim 11, wherein, when N, has a value of 108, Π

(r) is determined according to an interleaving scheme as shown;

Π

(r) 9, 7, 14, 15, 10, 1, 2, 5, 3, 8, 0, 4, 13, 11, 6, 12, 27, 29, 21, 18, 16, 25, 23, 17, 24, 19, 28, 31, 26, 20, 30, 22, 38, 47, 41, 42, 37, 46, 39, 45, 32, 34, 40, 33, 35, 43, 36, 44

wherein each number in the table indicates an index of a sub-carrier to which an element of the block code is one-to-one mapped.

13. An apparatus for transmitting a reference signal for identification of each cell in a communication system including a plurality of cells each of which is identified by a cell identifier, and an entire frequency band of the communication system including a sub-carrier bands, the apparatus comprising:

a block code encoder which, in response to input of the cell identifier, generates a block code corresponding to the cell identifier by using a predetermined block code generator matrix;

an interleaver for interleaving the block code according to a predetermined interleaving scheme;

an adder for performing an exclusive OR operation on the interleaved block code, thereby generating a first part sequence;

a combiner for generating a reference signal of a frequency domain by using the first part sequence and a second part sequence which is selected corresponding to the cell identifier and from among predetermined sequences; and

a transmitter for converting the reference signal of the frequency domain to a reference signal of a time domain through an Inverse Fast Fourier Transform (IFFT) and, operation and then transmitting the reference signal of the time domain over a reference signal transmission interval.

14. The apparatus as claimed in claim 13, wherein the block code generator matrix includes b number of sub-blocks, each of which includes c number of Walsh bases and d number of mask sequences.

15. The apparatus as claimed in claim 14, wherein the b sub-blocks including a first sub-block to a b-th sub-block have a relation of cyclic shift between each other, so as to maximize the minimum distance of the block code generated by using the block code generator matrix.

16. The apparatus as claimed in claim 14, wherein the interleaver divides the block code into the b sub-blocks and interleaves the b sub-blocks according to b number of interleaving schemes differently set for the b sub-blocks.

17. The apparatus as claimed in claim 14, wherein the transmitter comprises:

an Inverse Fast Fourier Transform (IFFT) unit for inserting null data into sub-carriers corresponding to DC components and intersubcarrier interference eliminating components from among N sub-carriers, inserting elements of the reference signal into M sub-carriers other than the sub-carriers into which the null data is inserted from among the N sub-carriers, and then performing an IFFT operation on a signal including the reference signal of the frequency domain elements and the M sub-carriers; and

a Radio Frequency (RF) processor for processing and transmitting the IFFT-processed signal.

18. The apparatus as claimed in claim 13, wherein the transmitter comprises:

an IFFT unit for inserting null data into sub-carriers corresponding to DC components and intersubcarrier interference eliminating components from among N sub-carriers, inserting elements of the reference signal into M sub-carriers other than the sub-carriers into which the null data is inserted from among the N sub-carriers, in consideration of a predetermined offset, and then performing an IFFT operation on a signal including the reference signal of the frequency domain elements and the M sub-carriers and then transmitting the signal; and

a Radio Frequency (RF) processor for processing and transmitting the IFFT-processed signal.

19. The apparatus as claimed in claim 18, wherein the offset is set to have a specific value for each of the cells and sectors.

20. The apparatus as claimed in claim 17, wherein the reference signal of the frequency domain is defined by:

$P_{{\mathrm{ID}}_{\mathrm{cell},S}}<br><br>\left[k\right]=\{\begin{array}{cc}\sqrt{2}<br><br>\left(1-2<br><br>\text{\hspace{1em}<br><br>}<br><br>q_{{\mathrm{ID}}_{\mathrm{cell},S}}<br><br>\left[m\right]\right),& k=2<br><br>\text{\hspace{1em}<br><br>}<br><br>m-\frac{N_{\mathrm{used}}}{2},\\ \text{\hspace{1em}<br><br>}& m=0,1,\mathrm{\dots <br><br>}<br><br>\text{\hspace{1em}<br><br>},\frac{N_{\mathrm{used}}}{4}-1\\ \sqrt{2}<br><br>\left(1-2<br><br>\text{\hspace{1em}<br><br>}<br><br>q_{{\mathrm{ID}}_{\mathrm{cell},S}}<br><br>\left[m-1\right]\right),& k=2<br><br>m-\frac{N_{\mathrm{used}}}{2},\\ \text{\hspace{1em}<br><br>}& m=\frac{N_{\mathrm{used}}}{4}+1,\frac{N_{\mathrm{used}}}{4}+2,\mathrm{\dots <br><br>}<br><br>\text{\hspace{1em}<br><br>},\frac{N_{\mathrm{used}}}{2}\\ 0,& \mathrm{otherwise}\end{array},<br><br>{\mathrm{ID}}_{\mathrm{cell}}\in <br><br>\left\{0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},126\right\},s\in <br><br>\left\{0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},7\right\},<br><br>k\in <br><br>\left\{-N_{\mathrm{FFT}}/2,-N_{\mathrm{FFT}}/2+1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},N_{\mathrm{FFT}}<br><br>2-1\right\}.$

wherein P_IDcell,S[k] denotes the reference signal, ID_cell denotes the cell identifier, s denotes the sector identifier, k denotes a sub-carrier index, N_used has a value equal to M, and q_IDcell,S[m] denotes a setup sequence.

21. The apparatus as claimed in claim 20, wherein the setup sequence is defined by:

$q_{{\mathrm{ID}}_{\mathrm{cell}},S}<br><br>\left[m\right]=\{\begin{array}{cc}R<br><br>\left(8*\lfloor <br><br>\frac{m}{9}\rfloor <br><br>+m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9\right),& \mathrm{where}<br><br>\text{\hspace{1em}<br><br>}<br><br>m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9=0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},7\\ \text{\hspace{1em}<br><br>}& m=0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},53\\ T<br><br>\left(\lfloor <br><br>\frac{m}{9}\rfloor <br><br>\right),& \mathrm{where}<br><br>\text{\hspace{1em}<br><br>}<br><br>m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9=8\end{array},$

wherein

$\lfloor <br><br>\frac{m}{9}\rfloor <br><br>$

represents a maximum integer not greater than

$\frac{m}{9},$

and R(r) is defined by;

$\begin{array}{c}R<br><br>\left(r\right)=w_{r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>8}^s\oplus <br><br>b_{\mathrm{IDcell}+1}<br><br>g_{\prod <br><br>\left(r\right)},\\ r=8*\lfloor <br><br>\frac{m}{9}\rfloor <br><br>+m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9=0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},47,\end{array}$

wherein w^s_{r mod8} represents repetition of Walsh codes having a length of 8, b_k (1≦

k≦

47) represents a row vector of the block code generator matrix, and g_u (0≦

u≦

47) represents the u-th column vector of the block code generator matrix.

22. The apparatus as claimed in claim 21, wherein the block code generator matrix is expressed as

23. The apparatus as claimed in claim 22, wherein, when N_used has a value of 108, Π

(r) is determined according to an interleaving scheme as shown;

Π

(r) 9, 7, 14, 15, 10, 1, 2, 5, 3, 8, 0, 4, 13, 11, 6, 12, 27, 29, 21, 18, 16, 25, 23, 17, 24, 19, 28, 31, 26, 20, 30, 22, 38, 47, 41, 42, 37, 46, 39, 45, 32, 34, 40, 33, 35, 43, 36, 44

wherein each number in the table indicates an index of a sub-carrier to which an element of the block code is one-to-one mapped.

24. A method for receiving a reference signal for identification of each cell in a communication system including a plurality of cells each of which is identified by a cell identifier and an entire frequency band of the communication system including a sub-carrier bands, the method comprising the steps of:

extracting the reference signal from a received signal which has been converted through a Fast Fourier Transform (FFT) operation;

dividing the reference signal into a predetermined number of intervals and performing an exclusive OR (XOR) operation on the divided intervals;

deinterleaving the XOR-processed signal according to a predetermined deinterleaving scheme;

dividing the deinterleaved signal into sub-block signals in accordance with a predetermined block code generator matrix;

performing an Inverse Fast Hadamard Transform (IFHT) using mask sequences generated according to control of each of the sub-block signals;

generating a combined signal by combining the IFHT-processed signals for each of the sub-block signals; and

determining a cell identifier corresponding to a block code having a maximum correlation value from among the combined signals as a final cell identifier.

25. The method as claimed in claim 24, wherein, in the step of extracting, the reference signal is extracted by eliminating a predetermined sequence from a signal received through M sub-carriers other than sub-carriers corresponding to DC components and intersubcarrier interference eliminating components from among N sub-carriers.

26. The method as claimed in claim 24, wherein, in the step of extracting, the reference signal is extracted by eliminating, in consideration of a predetermined offset, a predetermined sequence from a signal received through M sub-carriers other than sub-carriers corresponding to DC components and intersubcarrier interference eliminating components from among N sub-carriers.

27. The method as claimed in claim 26, wherein the offset is set to have a specific value for each of the cells and sectors.

28. The method as claimed in claim 26, wherein the reference signal of the frequency domain, and is defined by:

$P_{{\mathrm{ID}}_{\mathrm{cell},S}}<br><br>\left[k\right]=\{\begin{array}{cc}\sqrt{2}<br><br>\left(1-2<br><br>\text{\hspace{1em}<br><br>}<br><br>q_{{\mathrm{ID}}_{\mathrm{cell},S}}<br><br>\left[m\right]\right),& k=2<br><br>\text{\hspace{1em}<br><br>}<br><br>m-\frac{N_{\mathrm{used}}}{2},\\ \text{\hspace{1em}<br><br>}& m=0,1,\mathrm{\dots <br><br>}<br><br>\text{\hspace{1em}<br><br>},\frac{N_{\mathrm{used}}}{4}-1\\ \sqrt{2}<br><br>\left(1-2<br><br>\text{\hspace{1em}<br><br>}<br><br>q_{{\mathrm{ID}}_{\mathrm{cell},S}}<br><br>\left[m-1\right]\right),& k=2<br><br>m-\frac{N_{\mathrm{used}}}{2},\\ \text{\hspace{1em}<br><br>}& m=\frac{N_{\mathrm{used}}}{4}+1,\frac{N_{\mathrm{used}}}{4}+2,\mathrm{\dots <br><br>}<br><br>\text{\hspace{1em}<br><br>},\frac{N_{\mathrm{used}}}{2}\\ 0,& \mathrm{otherwise}\end{array},<br><br>{\mathrm{ID}}_{\mathrm{cell}}\in <br><br>\left\{0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},126\right\},s\in <br><br>\left\{0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},7\right\},<br><br>k\in <br><br>\left\{-N_{\mathrm{FFT}}/2,-N_{\mathrm{FFT}}/2+1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},N_{\mathrm{FFT}}<br><br>2-1\right\}.$

wherein P_IDcell,S[k] denotes the reference signal, ID_cell denotes the cell identifier, s denotes the sector identifier, k denotes a sub-carrier index, N_used has a value equal to M, and q_IDcell,S[m] denotes a setup sequence.

29. The method as claimed in claim 26, wherein the setup sequence is defined by:

$q_{{\mathrm{ID}}_{\mathrm{cell}},S}<br><br>\left[m\right]=\{\begin{array}{cc}R<br><br>\left(8*\lfloor <br><br>\frac{m}{9}\rfloor <br><br>+m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9\right),& \mathrm{where}<br><br>\text{\hspace{1em}<br><br>}<br><br>m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9=0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},7\\ \text{\hspace{1em}<br><br>}& m=0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},53\\ T<br><br>\left(\lfloor <br><br>\frac{m}{9}\rfloor <br><br>\right),& \mathrm{where}<br><br>\text{\hspace{1em}<br><br>}<br><br>m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9=8\end{array},$

wherein

$\lfloor <br><br>\frac{m}{9}\rfloor <br><br>$

represents a maximum integer not greater than

$\frac{m}{9},$

and R(r) is defined by;

$\begin{array}{c}R<br><br>\left(r\right)=w_{r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>8}^s\oplus <br><br>b_{\mathrm{IDcell}+1}<br><br>g_{\prod <br><br>\left(r\right)},\\ r=8*\lfloor <br><br>\frac{m}{9}\rfloor <br><br>+m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9=0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},47,\end{array}$

wherein W⁵_{r mod8} represents repetition of Walsh codes having a length of 8, b_k (1≦

k≦

47) represents a row vector of the block code generator matrix, and g_u (0≦

u≦

47) represents the u-th column vector of the block code generator matrix.

30. The method as claimed in claim 29, wherein the block code generator matrix is defined as:

31. The method as claimed in claim 30, wherein, when N_used has a value of 108, Π

(r) is determined according to an interleaving scheme as shown in;

Π

(r) 9, 7, 14, 15, 10, 1, 2, 5, 3, 8, 0, 4, 13, 11, 6, 12, 27, 29, 21, 18, 16, 25, 23, 17, 24, 19, 28, 31, 26, 20, 30, 22, 38, 47, 41, 42, 37, 46, 39, 45, 32, 34, 40, 33, 35, 43, 36, 44

wherein each number in the table indicates an index of a sub-carrier to which an element of the block code is one-to-one mapped.

32. The method as claimed in claim 31, wherein the setup sequences are sequences set to have a minimum Peak to Average Power Ratio (PAPR) for the reference signal.

33. An apparatus for receiving a reference signal for identification of each cell in a communication system including a plurality of cells each of which is identified by a cell identifier, and an entire frequency band of the communication system including a sub-carrier bands, the apparatus comprising:

a Fast Fourier Transform (FFT) unit for performing an FFT operation on a received signal;

a reference signal extractor for extracting the reference signal from the FFT-processed signal;

an adder for dividing the reference signal into a predetermined number of intervals and performing an exclusive OR (XOR) operation on the divided intervals;

a deinterleaver for deinterleaving the XOR-processed signal according to a predetermined deinterleaving scheme;

a sub-block divider for dividing the deinterleaved signal into sub-block signals in accordance with a predetermined block code generator matrix;

a block code decoder for performing an Inverse Fast Hadamard Transform (IFHT) using mask sequences generated according to control of each of the sub-block signals;

a combiner for generating a combined signal by combining the IFHT-processed signals for each of the sub-block signals; and

a comparison selector for determining a cell identifier corresponding to a block code having a maximum correlation value from among the combined signals as a final cell identifier.

34. The apparatus as claimed in claim 33, wherein the reference signal extractor extracts the reference signal by eliminating a predetermined sequence from a signal received through M sub-carriers other than sub-carriers corresponding to DC components and intersubcarrier interference eliminating components from among N sub-carriers.

35. The apparatus as claimed in claim 33, wherein the reference signal extractor extracts the reference signal by eliminating, in consideration of a predetermined offset, a predetermined sequence from a signal received through M sub-carriers other than sub-carriers corresponding to DC components and intersubcarrier interference eliminating components from among N sub-carriers.

36. The apparatus as claimed in claim 35, wherein the offset is set to have a specific value for each of the cells and sectors.

37. The apparatus as claimed in claim 35, wherein the reference signal of the frequency domain and is defined by:

$P_{{\mathrm{ID}}_{\mathrm{cell},S}}<br><br>\left[k\right]=\{\begin{array}{cc}\sqrt{2}<br><br>\left(1-2<br><br>\text{\hspace{1em}<br><br>}<br><br>q_{{\mathrm{ID}}_{\mathrm{cell},S}}<br><br>\left[m\right]\right),& k=2<br><br>\text{\hspace{1em}<br><br>}<br><br>m-\frac{N_{\mathrm{used}}}{2},\\ \text{\hspace{1em}<br><br>}& m=0,1,\mathrm{\dots <br><br>}<br><br>\text{\hspace{1em}<br><br>},\frac{N_{\mathrm{used}}}{4}-1\\ \sqrt{2}<br><br>\left(1-2<br><br>\text{\hspace{1em}<br><br>}<br><br>q_{{\mathrm{ID}}_{\mathrm{cell},S}}<br><br>\left[m-1\right]\right),& k=2<br><br>m-\frac{N_{\mathrm{used}}}{2},\\ \text{\hspace{1em}<br><br>}& m=\frac{N_{\mathrm{used}}}{4}+1,\frac{N_{\mathrm{used}}}{4}+2,\mathrm{\dots <br><br>}<br><br>\text{\hspace{1em}<br><br>},\frac{N_{\mathrm{used}}}{2}\\ 0,& \mathrm{otherwise}\end{array},<br><br>{\mathrm{ID}}_{\mathrm{cell}}\in <br><br>\left\{0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},126\right\},s\in <br><br>\left\{0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},7\right\},<br><br>k\in <br><br>\left\{-N_{\mathrm{FFT}}/2,-N_{\mathrm{FFT}}/2+1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},N_{\mathrm{FFT}}<br><br>2-1\right\}.$

wherein P_IDcell,S[k] denotes the reference signal of the frequency domain, ID_cell denotes the cell identifier, s denotes the sector identifier, k denotes a sub-carrier index, N_used has a value equal to M, and q_IDcell,S[m] denotes the setup sequence.

38. The apparatus as claimed in claim 37, wherein the setup sequence is defined by:

$q_{{\mathrm{ID}}_{\mathrm{cell}},S}<br><br>\left[m\right]=\{\begin{array}{cc}R<br><br>\left(8*\lfloor <br><br>\frac{m}{9}\rfloor <br><br>+m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9\right),& \mathrm{where}<br><br>\text{\hspace{1em}<br><br>}<br><br>m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9=0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},7\\ \text{\hspace{1em}<br><br>}& m=0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},53\\ T<br><br>\left(\lfloor <br><br>\frac{m}{9}\rfloor <br><br>\right),& \mathrm{where}<br><br>\text{\hspace{1em}<br><br>}<br><br>m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9=8\end{array},$

wherein

$\lfloor <br><br>\frac{m}{9}\rfloor <br><br>$

represents a maximum integer not greater than

$\frac{m}{9},$

and R(r) is defined by;

$\begin{array}{c}R<br><br>\left(r\right)=w_{r<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>8}^s\oplus <br><br>b_{\mathrm{IDcell}+1}<br><br>g_{\prod <br><br>\left(r\right)},\\ r=8*\lfloor <br><br>\frac{m}{9}\rfloor <br><br>+m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9=0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},47,\end{array}$

wherein w^s_{r mod8} represents repetition of Walsh codes having a length of 8, b_k (1≦

k≦

47) represents a row vector of the block code generator matrix, and g_u (0≦

u≦

47) represents the u-th column vector of the block code generator matrix.

39. The apparatus as claimed in claim 37, wherein the block code generator matrix is defined as:

40. The apparatus as claimed in claim 39, wherein, when N_used has a value of 108, Π

(r) is determined according to an interleaving scheme as shown in;

Π

(r) 9, 7, 14, 15, 10, 1, 2, 5, 3, 8, 0, 4, 13, 11, 6, 12, 27, 29, 21, 18, 16, 25, 23, 17, 24, 19, 28, 31, 26, 20, 30, 22, 38, 47, 41, 42, 37, 46, 39, 45, 32, 34, 40, 33, 35, 43, 36, 44

wherein each number in the table indicates an index of a sub-carrier to which an element of the block code is one-to-one mapped.

41. The apparatus as claimed in claim 40, wherein the setup sequences are sequences set to have a minimum Peak to Average Power Ratio (PAPR) for the reference signal.

42. A method for transmitting a reference signal for identification of each cell through at least one transmit antenna in a communication system including a plurality of cells each of which is identified by a cell identifier, an entire frequency band of the communication system including a sub-carrier bands, the method comprising the steps of:

receiving a cell identifier;

generating a block code corresponding to the cell identifier by using a predetermined block code generator matrix;

selecting a Walsh code corresponding to the cell identifier from among predetermined Walsh codes, and repeating the selected Walsh code a predetermined number of times;

interleaving the block code according to a predetermined interleaving scheme and performing an exclusive OR operation on the interleaved block code and the repeated Walsh code, thereby generating a first part sequence;

selecting a second part sequence corresponding to the cell identifier from among predetermined sequences;

generating a reference signal of a frequency domain by using the first part sequence and the second part sequence; and

converting the reference signal of the frequency domain to a reference signal of a time domain through an Inverse Fast Fourier Transform (IFFT) operation and then transmitting the reference signal of the time domain in a predetermined reference signal transmission interval.

43. The method as claimed in claim 42, wherein the block code generator matrix includes b number of sub-blocks, each of which includes c number of Walsh bases and d number of mask sequences.

44. The method as claimed in claim 43, wherein the b sub-blocks including a first sub-block to a b-th sub-block have a relation of cyclic shift between each other, so as to maximize the minimum distance of the block code generated by using the block code generator matrix.

45. The method as claimed in claim 43, wherein the step of interleaving comprises the steps of:

dividing the block code into the b sub-blocks; and

interleaving the b sub-blocks according to b number of interleaving schemes differently set for the b sub-blocks.

46. The method as claimed in claim 45, wherein the step of converting comprises the steps of:

inserting null data into sub-carriers corresponding to DC components and intersubcarrier interference eliminating components from among N sub-carriers;

inserting elements of the reference signal into M sub-carriers other than the sub-carriers into which the null data is inserted from among the N sub-carriers; and

performing an Inverse Fast Fourier Transform (IFFT) operation on a signal including the reference signal elements and the M sub-carriers.

47. The method as claimed in claim 45, wherein the step of converting comprises the steps of:

inserting null data into sub-carriers corresponding to DC components and intersubcarrier interference eliminating components from among N sub-carriers;

inserting elements of the reference signal into M sub-carriers other than the sub-carriers into which the null data is inserted from among the N sub-carriers, in consideration of a predetermined offset; and

performing an IFFT operation on a signal including the reference signal elements and the M sub-carriers and then transmitting the signal.

48. The method as claimed in claim 47, wherein the offset is set to have a specific value for each of the cells and sectors.

49. The method as claimed in claim 46, wherein the reference signal of the frequency domain is defined by:

$\begin{array}{c}{P}_{{\mathrm{ID}}_{\mathrm{cell},n}}<br><br>\left[k\right]=\{\begin{array}{cc}1-2<br><br>q_{{\mathrm{ID}}_{\mathrm{cell}}}<br><br>\left[m\right],& k=N_t<br><br>m-\frac{N_{\mathrm{used}}}{2}+n,\\ \text{\hspace{1em}<br><br>}& m=0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},\frac{N_{\mathrm{used}}}{N_t}-1\\ 0,& \mathrm{otherwise}\end{array}\\ {\mathrm{ID}}_{\mathrm{cell}}\in <br><br>\left\{0,1,\mathrm{\dots <br><br>}<br><br>\text{\hspace{1em}<br><br>},126\right\},n=0,1,\mathrm{\dots <br><br>}<br><br>\text{\hspace{1em}<br><br>}<br><br>N_t-1,\\ k\in <br><br>\left\{-\frac{N_{\mathrm{FFT}}}{2},-\frac{N_{\mathrm{FFT}}}{2}+1,\mathrm{\dots <br><br>}<br><br>\text{\hspace{1em}<br><br>},\frac{N_{\mathrm{FFT}}}{2}-1\right\}\end{array},$

wherein P_IDcell,S[k] denotes the reference signal, ID_cell denotes the cell identifier, n denotes the number of transmit antennas, k denotes a sub-carrier index, and q_IDcell,S[m] denotes a setup sequence.

50. The method as claimed in claim 46, wherein the setup sequence is defined by:

$q_{{\mathrm{ID}}_{\mathrm{cell}}}<br><br>\left[m\right]=\{\begin{array}{cc}R<br><br>\left(8*\lfloor <br><br>\frac{m}{9}\rfloor <br><br>+m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9\right),& \mathrm{where}<br><br>\text{\hspace{1em}<br><br>}<br><br>m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9=0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},7\\ \text{\hspace{1em}<br><br>}& m=0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},\frac{N_{\mathrm{used}}}{N_t}-1\\ T<br><br>\left(\lfloor <br><br>\frac{m}{9}\rfloor <br><br>\right),& \mathrm{where}<br><br>\text{\hspace{1em}<br><br>}<br><br>m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9=8\end{array},$

wherein

$\lfloor <br><br>\frac{m}{9}\rfloor <br><br>$

represents a maximum integer not greater than

$\frac{m}{9}.$

51. The method as claimed in claim 50, wherein R(r) is defined by an equation,

$R$

( r ) = B IDcell + 1 ⁢

g ∏

( r ) , r = 8 * ⌊

m 9 ⌋

+ m ⁢

 

⁢

mod ⁢

 

⁢

9 = 0 , 1 , ⋯

⁢

 

, 47 ,

wherein the number of transmit antennas is two, the number of operation points of the FFT operation is 128, and g_u (0≦

u≦

47) represents the u-th column vector of the block code generator matrix.

52. The method as claimed in claim 51, wherein the block code generator matrix is defined as:

53. The method as claimed in claim 51, wherein Π

(r) is determined according to an interleaving scheme as shown in;

Π

(l) 5, 6, 4, 10, 7, 2, 14, 0, 8, 11, 13, 12, 3, 15, 1, 9, 26, 29, 19, 27, 31, 17, 20, 16, 23, 28, 24, 21, 18, 30, 25, 22, 43, 46, 34, 47, 44, 41, 37, 36, 39, 38, 35, 33, 32, 45, 40, 42

wherein each number in the table indicates an index of a sub-carrier to which an element of the block code is one-to-one mapped.

54. The method as claimed in claim 50, wherein T(k) has values as expressed in:

ID cell sequence papr 0 1 1 1 0 1 1 6.67057 1 0 0 1 1 0 0 5.883 2 1 1 1 1 1 1 4.95588 3 0 1 1 0 0 1 4.92942 4 1 0 0 1 0 0 4.84232 5 0 1 0 1 0 0 5.97707 6 0 0 0 0 1 1 5.2818 7 0 1 1 1 0 1 4.62935 8 1 1 1 1 0 1 4.80191 9 0 1 1 1 1 0 4.62839 10 1 0 0 0 0 0 4.93818 11 0 0 0 0 1 0 4.62239 12 1 1 0 0 1 1 5.23206 13 0 0 0 0 0 1 4.76556 14 1 1 0 1 1 1 5.21957 15 0 1 1 0 0 0 6.73261 16 0 0 1 1 1 0 4.9981 17 0 1 1 0 0 0 5.23977 18 1 1 1 1 1 0 5.59862 19 0 1 1 1 0 1 6.75846 20 0 0 1 1 1 1 4.86729 21 1 1 0 0 0 0 5.57405 22 1 0 1 0 0 1 4.82309 23 0 1 0 1 0 1 4.54948 24 0 1 1 1 0 1 5.45765 25 1 1 0 0 0 1 4.91648 26 1 0 0 1 0 1 3.95813 27 1 0 0 0 0 1 6.03433 28 1 1 0 0 0 1 4.50629 29 0 1 0 0 0 1 4.80454 30 1 0 1 1 1 1 4.94614 31 1 0 1 1 0 0 4.54236 32 0 1 1 0 0 0 5.66311 33 0 1 1 0 0 0 5.18297 34 1 1 0 1 0 1 5.59197 35 1 0 0 1 0 0 5.51692 36 1 1 0 0 1 0 4.64969 37 1 1 1 0 0 0 5.59862 38 0 0 0 0 1 1 5.56593 39 1 0 1 0 0 0 6.65257 40 0 0 1 0 1 1 6.30837 41 0 0 0 1 0 1 5.76988 42 0 0 0 1 1 1 5.17799 43 1 0 0 1 1 0 5.50595 44 0 0 0 0 0 1 5.58222 45 1 1 1 0 1 1 5.19814 46 1 0 0 1 1 0 5.50865 47 1 0 0 0 0 0 5.40509 48 1 0 0 1 0 0 4.48416 49 0 1 0 0 1 1 5.59862 50 0 1 0 1 0 0 4.76609 51 0 1 1 1 0 1 4.87035 52 1 1 1 0 0 1 5.60052 53 1 0 1 0 0 1 4.18939 54 1 1 1 1 0 1 5.00411 55 1 1 1 1 0 0 4.91284 56 0 0 0 0 1 0 6.92296 57 0 0 0 0 1 0 5.39012 58 0 1 1 0 0 1 6.0232 59 1 1 0 1 0 0 5.27241 60 0 0 1 0 1 0 5.26582 61 1 0 0 0 0 1 5.47146 62 0 0 0 0 1 0 6.43249 63 1 0 0 1 1 1 4.69906 64 1 1 1 0 0 0 5.28969 65 1 0 1 0 1 1 6.66965 66 1 0 1 0 1 1 5.90593 67 0 1 1 1 0 0 6.13642 68 0 0 1 0 0 0 4.9337 69 0 1 1 0 1 0 5.19715 70 1 1 1 1 0 0 5.05877 71 1 0 0 1 0 0 5.42538 72 1 1 1 0 1 0 5.21428 73 1 0 1 1 0 1 4.27288 74 0 1 0 0 0 1 4.63478 75 1 0 1 0 0 1 5.47216 76 1 0 1 0 0 0 6.48514 77 1 1 0 0 0 0 5.95897 78 0 0 0 0 0 1 5.59862 79 0 1 0 0 0 0 5.36634 80 0 0 0 0 1 0 4.79522 81 0 0 1 1 1 0 5.03585 82 1 1 0 0 1 1 6.41538 83 0 1 1 0 0 1 5.92329 84 1 0 1 1 1 0 5.24541 85 0 0 0 0 0 1 6.41868 86 1 0 1 0 1 1 5.47231 87 0 1 0 1 1 1 4.27052 88 0 0 0 1 0 1 4.98455 89 0 0 0 1 0 1 4.85573 90 1 0 1 1 0 0 4.66224 91 0 1 1 0 0 1 5.59862 92 0 1 0 1 0 1 5.13782 93 1 1 0 9 0 0 5.73599 94 0 1 1 1 1 1 6.91115 95 0 1 1 1 0 1 4.76096 96 0 1 0 1 1 1 4.43229 97 1 0 0 1 1 1 4.52951 98 1 0 0 1 0 0 4.16266 99 1 1 1 0 1 0 5.72573 100 0 1 0 1 0 0 4.34746 101 1 0 0 1 0 0 6.81937 102 0 1 0 1 1 1 5.86829 103 0 1 0 1 1 0 5.22098 104 1 0 0 0 0 0 4.8724 105 0 1 1 0 1 1 6.7658 106 1 0 0 0 1 0 5.75267 107 1 1 0 0 1 1 5.1796 108 1 1 1 0 0 0 6.00083 109 1 0 1 0 0 1 4.6724 110 1 0 0 1 0 0 4.8945 111 0 0 1 1 1 0 4.05646 112 0 0 1 1 1 1 5.6271 113 0 1 1 1 1 1 5.59862 114 1 1 0 0 1 0 4.80494 115 0 0 1 1 0 0 5.95286 116 0 1 1 0 0 1 5.99303 117 0 1 0 0 1 1 3.97648 118 0 1 0 1 0 0 5.71222 119 0 0 0 0 1 1 4.61998 120 1 1 1 1 1 0 4.67909 121 1 0 0 1 1 0 5.53328 122 0 0 0 1 1 0 5.20303 123 0 1 1 0 0 0 5.00679 124 1 0 1 1 1 0 4.57847 125 0 1 1 1 0 0 4.79082 126 1 1 0 1 0 0 4.91901

55. The method as claimed in claim 50, wherein q_IDcell[m] has values as expressed in:

ID cell sequence papr 0 88B7E232CDC83C 6.67057 1 5E260E301C4620 5.883 2 D691EC22D18E1C 4.95588 3 EA1A5F3245640C 4.92942 4 62ADBD0098A430 4.84232 5 B43C5102592228 5.97707 6 3C0BB31084EA14 5.2818 7 127AEE31B90504 4.62935 8 9ACD4C2374C53C 4.80191 9 4C5CE021B54B20 4.62839 10 C4EB0213688318 4.93818 11 F860B103EC6908 4.62239 12 70D7531121A934 6.23206 13 A646BF13E0272C 4.76556 14 2EF15D013DEF14 5.21957 15 4A30D2BAA965A0 6.73261 16 C20730A874AD98 4.9981 17 1416DCAAA52380 5.23977 18 9CA17EB878EBB8 5.59862 19 A02ACDA8FC01AC 6.75846 20 281D2FBA31C994 4.86729 21 FE8CC398E04788 5.57405 22 76BB21AA2D87B4 4.82303 23 584A7C8B1060A4 4.54948 24 D07DDEB9DDA09C 5.45765 25 06EC729B0C2684 4.91648 26 8EDB9089D1E6BC 3.95813 27 B2D023994504AC 6.03433 28 3AE7C18B88C494 4.50629 29 EC766D8949428C 4.80454 30 64C18FBB948AB4 4.94614 31 9A82B62CDF0708 4.54236 32 1235543E02C730 3.86311 33 C424F83CC34128 5.18297 34 4C935A0E1E8114 5.59137 35 7098A91E9A6300 5.51632 36 F8AF4B0C47AB38 4.64969 37 2EBEE72E862520 5.59862 38 A609051C4BED1C 6.56393 39 88F8183D660208 6.63257 40 004FBA2FABCA34 6.30837 41 D65E160D7A442C 5.76388 42 5E69B41FB78C14 5.17733 43 62E2070F336E00 6.50695 44 EA55A51DEEA63C 5.58222 45 3CC4493F2F2824 5.19814 46 B4F3AB0DF2E818 5.50865 47 D0B224966662A8 5.40503 48 58858684BBA290 4.48416 49 8E146A866A2C8C 5.59862 50 0623C894B7E4B0 4.76609 51 3A287BA43306A4 4.87033 52 B29FD9B6EEC69C 5.60052 53 648E35B42F4084 4.18939 54 ECB9D7A6F280BC 5.00411 55 C2C8CAA7DF67A8 4.91284 56 4A7F289502AF90 6.92296 57 9C6E8497C32988 5.39012 58 145966A50EE1B4 6.0232 59 28D2D5959A03A0 6.27241 60 A06537A747CB98 5.26582 61 76F49B85864584 5.47146 62 FE4339974B8DB8 6.43249 63 08A61410F5BE24 4.69906 64 8091F622287618 5.28969 65 56801A20E9F804 6.66865 66 DEB7B83224383C 5.90593 67 E23C4B22B0D228 6.13642 68 6A0BA9306D1210 4.9337 69 BC1A4532AC9C08 5.13715 70 34ADE720715430 5.05877 71 1ADCBA015CB320 5.42538 72 92EB5833817B18 5.21428 73 44FAB43150F504 4.27288 74 CC4D56038D353C 4.63478 75 F0C6A53309D72C 5.47216 76 78F10721C41710 6.49514 77 AEE0EB03059108 5.35897 78 26570911C85134 5.59862 79 4216C68A4CD380 5.36634 80 CA212498811BB8 4.79522 81 1C3088BA509DA0 5.03585 82 94876A888D5D9C 6.41538 83 A80CD9B809B78C 5.92329 84 20BB3BAAD47FB0 5.24541 85 F62A978805F1AC 6.41868 86 7E9D35BAC83994 5.47231 87 506C689BF5DE84 4.27052 88 D85B8A893816BC 4.98455 89 0E4A268BF990A4 4.85573 90 86FD84B9345098 4.66224 91 BA7677A9A0B28C 5.59862 92 3241D59B7D72B4 5.13782 93 E4D07999ACF4A8 5.73533 94 6C67DBAB713C94 6.31115 95 9224E23C3AB12C 4.76096 96 1A13400EF77914 4.43229 97 CC82AC0C36FF0C 4.52351 98 44B50E1EFB3730 4.16266 99 78BEFD2E6FDD20 5.72573 100 F0095F1CB21518 4.34746 101 2698B31E739300 6.81937 102 AE2F510CBE5B3C 5.86829 103 805E4C0D93BC28 5.22038 104 08E9AE1F4E7410 4.8724 105 DE78423D8FFA0C 6.7858 106 56CFA00F423A30 5.75267 107 6AC4531FC6D824 5.1796 108 E2F3F12D0B1018 6.00083 109 34E21D2FCA9604 4.6724 110 BCD5BF1D175638 4.8345 111 D81430A693DC88 4.05646 112 502392B45E1CB4 5.6271 113 86327EB69F9AAC 5.59862 114 0E85DC84425A90 4.90494 115 320E2FB4D6B080 5.95286 116 BA39CDA60B70BC 5.99303 117 6C286184CAFEA4 3.97648 118 E41FC396173698 5.71222 119 CA6E9E972AD98C 4.61398 120 42D97CA5F719B0 4.67909 121 94C89087369FA8 5.53328 122 1C7F3295FB5F90 5.20303 123 2074C1A56FB580 5.00679 124 A8C323B7B27DB8 4.57847 125 7E52CFB573F3A0 4.79082 126 F6E56D87BE3398 4.91901

56. The method as claimed in claim 50, wherein R(r) is defined:

$R<br><br>\left(r\right)=B_{{\mathrm{IDcell}}^{+1}}<br><br>g_{\prod <br><br>\left(r\right)},r=8*\lfloor <br><br>\frac{m}{9}\rfloor <br><br>+m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9=0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},31,$

wherein the number of transmit antennas is three, the number of operation points of the FFT operation is 128, and g_u (0≦

u≦

47) represents the u-th column vector of the block code generator matrix.

57. The method as claimed in claim 51, wherein the block code generator matrix is defined as:

$\begin{array}{c}G=\left[g_0<br><br>\text{\hspace{1em}<br><br>}<br><br>g_1<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>}<br><br>g_{31}\right]\\ =\left[\begin{array}{c}01010101010101010000010101100011\\ 00110011001100110001000100010001\\ 00001111000011110101010101010101\\ 00000000111111110011001100110011\\ 00000011010101100000111100001111\\ 00000101011000110000000011111111\\ 00010001000100010000001101010110\end{array}\right].\end{array}$

58. The method as claimed in claim 51, wherein Π

(r) is determined according to an interleaving scheme as shown in;

Π

(l) 11, 4, 12, 15, 0, 13, 5, 6, 14, 8, 10, 9, 1, 3, 2, 7, 16, 20, 31, 26, 22, 30, 27, 23, 19, 18, 17, 25, 21, 29, 24, 28

wherein each number in the table indicates an index of a sub-carrier to which an element of the block code is one-to-one mapped.

59. The method as claimed in claim 50, wherein T(k) has values as expressed in:

ID cell sequence papr 0 0 0 1 1 4.49505 1 0 1 1 0 4.11454 2 0 1 1 0 5.0206 3 1 1 0 0 5.06895 4 0 0 0 0 4.51602 5 1 0 1 0 4.96176 6 0 0 0 1 4.50134 7 0 1 0 0 5.29586 8 1 1 1 1 5.37387 9 1 0 0 0 4.6668 10 0 1 1 0 6.09482 11 0 0 0 1 6.11344 12 0 0 0 0 5.71868 13 0 0 0 0 4.12233 14 0 1 1 1 4.44864 15 1 0 1 0 4.42172 16 1 0 0 0 4.43697 17 0 1 1 0 5.96559 18 0 0 1 0 5.31882 19 1 1 1 0 5.1578 20 0 0 1 1 4.18834 21 1 1 0 0 5.74259 22 1 0 1 0 6.10238 23 1 1 1 0 4.50063 24 1 0 0 1 4.38448 25 1 1 0 1 4.33171 26 1 0 0 1 6.31759 27 1 1 1 0 6.33599 28 1 1 0 1 4.55537 29 0 1 0 0 4.83803 30 1 0 1 1 4.45342 31 1 0 1 0 5.12448 32 1 0 0 0 4.43697 33 0 0 0 1 4.90907 34 1 0 0 1 3.9985 35 1 0 1 0 6.0206 36 0 0 0 1 5.38301 37 1 0 0 0 3.66487 38 1 0 1 1 4.92205 39 0 1 1 1 5.53843 40 0 1 1 1 5.26838 41 1 1 0 1 5.16959 42 0 1 1 0 5.34282 43 0 0 0 0 5.15133 44 1 0 0 1 4.87551 45 1 1 1 1 4.79443 46 1 0 1 0 5.07783 47 0 0 1 0 4.99682 48 1 0 1 1 5.94242 49 1 0 0 1 4.77698 50 1 0 0 0 5.03657 51 0 0 1 1 4.46604 52 1 0 0 0 5.68568 53 1 1 0 1 5.01898 54 0 1 1 1 4.95591 55 1 0 0 1 5.27862 56 1 1 1 0 6.0317 57 1 0 1 1 4.64379 58 1 1 0 0 5.02863 59 0 0 0 0 6.04332 60 0 0 0 1 4.44083 61 0 1 1 1 5.23739 62 1 0 1 0 6.43278 63 0 1 1 1 4.43697 64 1 0 1 1 4.43697 65 1 1 1 0 4.50516 66 1 0 0 1 4.58929 67 0 1 1 0 4.85849 68 0 0 0 0 5.13149 69 0 0 1 0 4.59563 70 0 1 0 1 4.73083 71 1 0 0 0 4.43697 72 1 0 0 0 4.44072 73 1 0 1 0 5.47799 74 1 1 1 0 4.92135 75 1 0 0 0 5.5708 76 1 0 0 0 4.48634 77 0 0 0 1 5.3005 78 1 0 1 1 5.8947 79 1 1 0 0 5.38806 80 0 0 1 0 4.74777 81 0 1 0 0 4.82428 82 1 0 0 0 4.45469 83 1 0 1 1 5.66832 84 1 1 0 0 4.50856 85 1 0 0 1 4.97946 86 1 0 1 1 4.68484 87 0 1 0 1 4.50907 88 1 0 1 0 5.38228 89 0 0 1 0 5.22999 90 1 1 1 0 5.0672 91 0 1 0 0 5.59042 92 0 1 0 1 4.95926 93 0 0 1 1 3.80828 94 1 0 1 1 5.40268 95 0 0 1 0 5.97897 96 1 0 0 1 3.99109 97 1 0 0 1 5.06574 98 0 0 0 1 6.08269 99 1 0 0 0 4.39827 100 0 0 1 1 4.70382 101 0 1 0 1 4.60731 102 0 1 0 0 5.05357 103 1 0 1 0 3.30653 104 1 0 1 1 4.52546 105 1 1 0 0 5.53041 106 0 1 1 0 6.04148 107 1 0 1 0 4.88727 108 0 0 1 0 5.40024 109 1 1 0 0 4.566 110 0 1 1 1 4.92796 111 1 0 1 1 5.17459 112 0 1 0 1 4.65719 113 1 1 1 0 4.94826 114 1 1 1 0 5.62084 115 0 0 1 0 4.77778 116 0 1 0 0 4.43697 117 0 1 1 0 4.24182 118 0 0 0 0 6.37234 119 1 1 1 0 4.46408 120 0 1 1 0 5.23129 121 1 1 0 0 5.9557 122 0 0 1 0 5.1374 123 1 0 0 0 5.35576 124 0 1 0 0 4.82596 125 1 1 1 0 4.43697 126 1 1 1 0 4.74343

60. The method as claimed in claim 50, wherein q_IDcell[m] has values as expressed in:

ID cell sequence papr 0 960E8D691 4.48505 1 9159C8F00 4.11454 2 075D46B90 6.0206 3 77C0C8D78 5.06896 4 E14E05948 4.51602 5 E69300278 4.96176 6 701D8D449 4.50134 7 B4784FD80 5.29586 8 22F6C2BB1 5.37387 9 25AB87080 4.6668 10 B3254A6B0 6.09432 11 C338870F9 6.11344 12 55360A4C8 5.71868 13 526B0FDF8 4.12233 14 C465C2BC9 4.44864 15 85C89B61A 4.42172 16 13C61602A 4.43697 17 141B53B1A 5.96559 18 82159EF2A 5.31882 19 F28853B62 5.1578 20 64069EF53 4.18834 21 63DBDB462 5.74259 22 F5D516252 6.10238 23 31B0D4B9A 4.50063 24 A7BE19DAB 4.38448 25 A0E35C49B 1.33171 26 36ED910AB 6.31759 27 46F05C6E2 6.33599 28 D0FED10D3 4.55537 29 D723D48E2 4.83803 30 41AD19FD3 4.46342 31 12D88DA2E 5.12448 32 84D600C1E 4.45697 33 830B0552F 4.90907 34 15858811F 5.9985 35 659805756 6.0206 36 F31688167 5.39301 37 F4CB8D856 3.66497 38 62C500E67 4.92205 39 A620C27AF 5.53849 40 302E4F39F 5.26838 41 37F34A8AF 5.16959 42 A17DC7E9E 5.34282 43 D1600A8D6 5.15133 44 47EE87CE7 4.87551 45 40V3C27D7 4.79443 46 D6VD0F3E6 5.07783 47 971016E34 4.99682 48 019E9BA05 5.94242 49 06C39E135 4.77698 50 90CD13504 5.03657 51 E0509E34D 4.46604 52 76DE1357C 5.68568 53 718356C4D 5.01898 54 E70DDBA7D 4.95591 55 23E8191B5 5.27862 56 B5E6D4784 6.0317 57 B2BB91EB5 4.64379 58 24B55C884 5.02863 59 542891CCC 6.04332 60 C2261C8FD 4.44083 61 C57B593CD 5.23739 62 53F5947FC 6.43278 63 9002C3E29 4.43697 64 068COEA19 4.43697 65 01D14B328 4.50516 66 97DF86519 4.58929 67 E7424B350 4.35848 68 714C86560 5.13148 69 761183E50 4.59563 70 E01F4E861 4.73083 71 24FA8C1A8 4.43697 72 B2F4O1598 4.44072 73 B5A9O4EA8 5.47799 74 29A7C9A98 1.92135 75 53BA04CD0 5.5708 76 CDB4898E0 4.4934 77 C2698C1D1 5.3005 78 54E7D17E1 5.8947 79 15CA58832 5.38806 80 834495E02 4.74777 81 8419D0532 4.82428 82 12971D102 4.45469 83 628A9074B 5.66892 84 F4845D17A 4.50856 85 F3D91884B 4.97946 86 65D795E7B 4.68484 87 A132575B3 4.50907 88 37BC9A382 2.38228 89 30619FAB2 5.22999 90 A6EP52E82 5.0672 91 D672DF8CA 5.59042 92 407C52CFB 4.95926 93 4721177CB 3.80828 94 D1AF9A3FB 5.40268 95 825A0E606 5.97897 96 14D483037 3.99109 97 138986907 5.06574 98 85070BD37 6.08269 99 F59A8697E 4.39827 100 63140BF4F 4.70382 101 64494E47F 4.60731 102 F247C304E 5.05357 103 36A201B86 3.30653 104 A0AC9CFB7 4.52546 105 A7F1C9486 5.53041 106 317F442B6 6.04148 107 41E2896FE 4.68727 108 D76C042CE 5.40024 109 D0B1419FE 4.566 110 463FCCFCF 4.92796 111 07929521D 5.17459 112 911C5842D 4.65719 113 96C15DF1C 4.94826 114 00CFD0B2C 5.62084 115 70521DF64 4.77778 116 E65CD0954 4.43697 117 E101D5264 4.24182 118 770F18454 6.37234 119 B3EADAF9C 4.46408 120 256457BAC 5.23129 121 22B95209C 5.9557 122 B4379F6AC 5.1374 123 C4AA120E4 5.35576 124 5224DF4D4 4.82596 125 55F9DAFE4 4.43697 126 C3F757BD4 4.74343

61. The method as claimed in claim 50, wherein R(r) is defined by:

$R<br><br>\left(r\right)=B_{{\mathrm{IDcell}}^{+1}}<br><br>g_{\prod <br><br>\left(r\right)},r=8*\lfloor <br><br>\frac{m}{9}\rfloor <br><br>+m<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{mod}<br><br>\text{\hspace{1em}<br><br>}<br><br>9=0,1,\mathrm{\cdots <br><br>}<br><br>\text{\hspace{1em}<br><br>},95,$

wherein the number of transmit antennas is four, the number of operation points of the FFT operation is 512, and g_u (0≦

u≦

47) represents the u-th column vector of the block code generator matrix.

62. The method as claimed in claim 51, wherein the block code generator matrix is defined as:

$\begin{array}{c}G=<br><br>\left[g_0<br><br>g_1<br><br>\text{\hspace{1em}<br><br>}<br><br>\mathrm{\dots <br><br>}<br><br>\text{\hspace{1em}<br><br>}<br><br>g_{47}\right]\\ =<br><br>\left[\begin{array}{c}010101010101010100010001000100010000010101100011\\ 000000110101011000000000111111110000111100001111\\ 00110011001100110101010101010101000100010001000\\ 1000010101100011000000110101011000000000111111111\\ 000011110000111100110011001100110101010101010101\\ 00010001000100010000101011000110000001101010110\\ 000000001111111100001111000011110011001100110011\\ 010101010101010100010001000100010000010101100011\\ 000000110101011000000000111111110000111100001111\\ 001100110011001101010101010101010001000100010001\\ 000001010110001100000011010101100000000011111111\\ 000011110000111100110011001100110101010101010101\\ 00010001000100010000010101100011000000110101011\\ 0000000001111111100001111000011110011001100110011\end{array}\right].\end{array}$

63. The method as claimed in claim 51, wherein Π

(r) is determined according to an interleaving scheme as shown in;

Π

(l) 2, 6, 0, 10, 14, 11, 7, 3, 8, 15, 1, 12, 9, 4, 13, 5, 18, 26, 24, 17, 29, 19, 21, 16, 23, 22, 25, 28, 27, 31, 20, 30, 41, 34, 38, 44, 36, 43, 35, 32, 45, 47, 46, 39, 40, 33, 37, 42, 60, 56, 59, 61, 51, 62, 52, 49, 58, 48, 53, 50, 54, 57, 55, 63, 71, 77, 76, 74, 67, 66, 68, 75, 78, 64, 69, 79, 72, 70, 65, 73, 81, 92, 83, 87, 82, 94, 86, 88, 95, 91, 93, 90, 84, 85, 80, 89

wherein each number in the table indicates an index of a sub-carrier to which an element of the block code is one-to-one mapped.

64. The method as claimed in claim 50, wherein T(k) has values as expressed in:

ID cell sequence papr 0 CB3 6.26336 1 D47 5.27748 2 59D 4.9581 3 F21 5.05997 4 87E 6.51422 5 BFA 5.33856 6 4D4 7.0618 7 3E0 6.41769 8 3E4 4.87727 9 6F7 4.15136 10 8D0 5.86359 11 33E 5.68455 12 CA3 5.79482 13 119 5.29216 14 AA3 5.3423 15 EC5 5.40257 16 A08 5.63148 17 96C 5.44285 18 9D3 5.19112 19 5BC 5.41859 20 4BC 5.96539 21 D15 6.07706 22 A31 4.76142 23 4B3 4.67373 24 B0A 5.24324 25 BB7 4.81109 26 245 4.99566 27 B34 4.81878 28 A59 5.78273 29 807 5.59368 30 694 5.53837 31 6C6 6.42782 32 1F3 5.26429 33 573 4.94488 34 O7F 6.36319 35 9A3 5.91188 36 C86 5.36258 37 349 4.98064 38 C83 6.14253 39 EE0 5.95156 40 4C4 5.40169 41 634 4.82317 42 360 5.05168 43 7B6 5.20885 44 4A7 5.52378 45 0D4 6.47369 46 523 5.20757 47 F29 5.0776 48 A67 5.52381 49 251 5.10732 50 B8E 4.77121 51 580 5.38618 52 B6B 5.20069 53 DCC 6.18175 54 356 5.46713 55 7FB 6.23427 56 C6B 4.64117 57 956 5.81606 58 100 5.04293 59 DF0 6.56931 60 663 5.4996 61 602 5.72958 62 894 4.96955 63 247 5.37554 64 73E 5.29366 65 0FE 6.62956 66 5CB 4.88939 67 C59 4.30678 68 5B5 5.54517 69 E2D 5.27261 70 5F6 5.03828 71 9A9 5.25379 72 BDB 5.14859 73 AE7 5.39255 74 2C2 4.97124 75 6A3 6.20876 76 D3A 4.83271 77 741 5.5686 78 737 5.64126 79 7AC 5.17063 80 79F 5.0828 81 3F4 5.22885 82 99C 6.01707 83 755 6.51422 84 A44 4.93486 85 F67 4.86142 86 4D4 6.21941 87 810 4.25677 88 201 4.47647 89 054 6.8165 90 654 5.87238 91 F34 5.31419 92 4FF 6.88515 93 4AA 6.75475 94 E8D 6.10937 95 944 4.79898 96 478 4.77121 97 17E 5.66118 98 696 4.93494 99 31A 5.36534 100 9D7 4.78933 101 2A4 5.45932 102 35C 6.40963 103 CBD 5.39788 104 44C 4.38835 105 416 4.38145 106 6B6 5.5007 107 E79 5.6706 108 34F 5.62588 109 DC4 5.29578 110 586 5.00808 111 DF3 4.48385 112 F2B 5.53794 113 ED1 5.58523 114 686 5.71655 115 500 5.01001 116 BFB 5.89436 117 CB5 5.25553 118 99A 5.47731 119 43D 5.4871 120 161 6.18899 121 32D 5.35874 122 49D 5.46312 123 8BD 5.13605 124 2E9 5.70272 125 0F0 6.26171 126 144 5.50515

65. The method as claimed in claim 50, wherein q_IDcell[m] has values as expressed in:

ID cell sequence papr 0 07B5C111880B98D21D714C95B59 6.26336 1 DFA04795906284114EC142D17E3 5.27748 2 D815C684186918C153B08E44CBB 4.9581 3 4AABF139B866B0A2069058858C3 5.05997 4 4D9E300820652C721BE1945039A 6.51422 5 958BB6AC380C34B349519A14F20 5.33856 6 923E779DA00FAC61552056C1478 7.0618 7 1C6D02BAF66B8CE64E89080512A 6.41769 8 1B5883AB7E68143652F844D0872 4.87727 9 C34D452F66090CF701484AD46C9 4.15136 10 C4F8841EEE0A94251D390601D90 5.86359 11 5646B3A35E0538464919D0C0BE8 5.68455 12 51F37292C60EA09654681C152B1 5.79482 13 8966B416DE67B85507D89211C0B 5.29216 14 8ED33527466C20871AA95E84753 5.3423 15 4E855A27A38F94B136C919CC181 5.40257 16 49B09B362B8408612AB8D5198D8 5.63148 17 91A51D9233E514A27808DB5D462 5.44285 18 96909C83BBEE8C7065791788F3B 5.19112 19 042EEB1E1BE920133159C149942 5.41859 20 031B6A0F83EAB8C32D288DDC01A 5.96539 21 DB8EEC8B9B83A0007F9803D8CA1 6.07706 22 DCBB2DBA038038D263E94F0D5F9 4.76142 23 5268589D45EC1857794011892AB 4.67373 24 55DD99ACDDE780856431DD1CBF2 5.24324 25 8DC81F28D58E984637815358749 4.81109 26 8A7D9E394D8504942AF01FCDC11 4.99566 27 18C3A984ED82A8F77FD0494C868 4.81878 28 1FF628B56581342563A18599131 5.78273 29 C7E3AE116DE028E430110BDDF8B 5.59368 30 C0566F20E5EBB0342D6047484D2 5.53837 31 1A24C23D294F4E58569D4A6C3CA 6.42782 32 1D11030CB14CD68A4BEC06B9A93 5.26429 33 C504C588B925CE4B195C08BD629 4.94488 34 C23104992126569B052DC468F71 6.36319 35 508F33049129FAFA500D12A9B09 5.91188 36 57BAF215092A62284C7C5E7C250 5.36258 37 8F2F34B111437EE91ECCD038CEB 4.98064 38 889AF5808948E23902BD1CAD7B3 6.14253 39 06C9C0A7CF2CC6BE181442290E0 5.95156 40 017C4196472F5E6C04658EBCBB8 5.40169 41 D969C7324F4642AF57D500F8502 4.82317 42 DE5C0623D745DE7F4AA44C2DC5A 5.05168 43 4C6271BE774A721E1F841AECA22 5.20885 44 4B57F08FEF49EACE02F5567937B 5.52378 45 9342360BE728F60D5145587DDC0 6.47369 46 9477F71A7F236ADF4C3414A8599 5.20757 47 54A1D83A9AC0DAEB6054D3A004B 5.0776 48 5394192B02C3463B7C251F75B13 5.52381 49 8B019FAF0AA25EF82F9511315A9 5.10732 50 8CB41EBE92A9C22832E4DDE4EF0 4.77121 51 1E0A690332AE6A4B67C40B25888 5.38618 52 19BFA832BAA5F69B7AB5C7B03D1 5.20069 53 C1AA6E96B2CCEE582805C9F4D6A 6.18175 54 C61FAFA73AC7768835740561632 5.46713 55 484CDAA07CAB560F2FDDDBA5361 6.23427 56 4FF95B91E4A0CEDF32AC9730A39 4.64117 57 97EC9D15FCC1D61C611C1974682 5.81606 58 90591C0474C24ACC7C6D55A1DDA 5.04293 59 02E76B99D4CDE6AF294D03209A2 6.56931 60 0552EAA84CC67E7F343C4FB52FB 5.4996 61 DD476C2C44A762BC668C41B1E40 5.72958 62 DAF2AD1DCCACFA6C7BFD0D64518 4.96955 63 072010B4AA4587D10AE25A4FBA1 5.37554 64 0015D1A532461B03179396DA2F8 5.29366 65 D80017012A2F07C2452398DEE42 6.62956 66 DF35D610B22C9F105852D40B71B 4.88939 67 4D8BE18D022337710D72828A163 4.30678 68 4A3E609C9A28ABA311034E5F83B 5.54517 69 92ABE6388241B36242B3C05B481 5.27261 70 951E67091A4A2FB25FC20CCEFD8 5.03828 71 1BCD120E5C2E0B37446BD20A88B 5.25379 72 1CF8933FD42D97E5591A9E9F3D3 5.14859 73 C4ED15BBCC4C8F260AAA10DBF69 5.39255 74 C35894AA444F17F416DB5C0E630 4.97124 75 5166E337E448BB9742FB0A8F249 6.20876 76 56D362067C4323475F8AC61AB10 4.83271 77 8E46E4A274223F840C3A481E5AB 5.5686 78 897365B3FC21A356114B04CBEF3 5.64126 79 49254AB319CA13623C2BC3C3820 5.17063 80 4E10CBA291C98BB0215A8F56379 5.0828 81 96050D2699A8977373EA8112FC2 5.22885 82 91B08C1711AB0BA16F9BCDC749A 6.01707 83 030EFBAAB1A4A7C03BBB1B460E3 6.51422 84 04BB3ABB29A73F1026CA57D39BA 4.93486 85 DCAEFC3F31C627D3747A59D7701 4.86142 86 DB1B7D0EA9CDBF01690B1542C58 6.21941 87 55C80809EFA19B8473A24B8690A 4.25677 88 527D893867A203546ED30713053 4.47647 89 8A680F9C6FC31F953D630957CE8 6.8165 90 8D5DCEADE7C08745211245C25B0 5.87238 91 1FE3F93057C72B26753213431C8 5.31419 92 18567801CFCCB7F66943DFD6A91 6.88515 93 C043FE85C7ADAB373AF3D19262A 6.75475 94 C7F67FB44FAE33E526829D47D73 6.10937 95 1D8492899302CD895C7F106386A 4.79898 96 1A3153980B01555B410EDCB6132 4.77121 97 C224951C13604D9A13BED2F2F88 5.66118 98 C511542D8B6BD1480FCF1E676D0 4.93494 99 572F23B03B6479295BEFC8A62A8 5.36534 100 509AA281B36FE5F9479E0473BF1 4.78933 101 880F2425AB0EF93A142E0A7754A 5.45932 102 8F3AA534330565E8095FC6E2C12 6.40963 103 01E9D0136569416F13F69866941 5.39788 104 065C5102ED62DDBD0E87D4F3018 4.38835 105 DE49D786E503C17C5D375AF7EA2 4.38145 106 D97C56B76D0859AE414616627FA 5.5007 107 4BC2612ACD07F5CF1566C0A3183 5.6706 108 4C77A03B55046D1D08178C76ADB 5.62588 109 94E2669F5D6D75DC5AA70272460 5.29578 110 9357E78ED56EE90C46D64EE7F38 5.00808 111 5381C88E308D5D3A6BB609AFBEB 4.48385 112 54B449BFB886C1EA76C7C53A2B3 5.53794 113 8CA1CF3BA0EFDD2925774B3EC09 5.58523 114 8B144E2A28EC41F9380607EB750 5.71655 115 192A799798E3E9986C26512A128 5.01001 116 1E9FB88600E8754A71579DBFA71 5.89436 117 C68A7E020889698B23E713FB4CB 5.25553 118 C1BFBF13908AF1593F96DF2EF92 5.47731 119 4F6CCA14C6E6D1DE253F81EA8C1 5.4871 120 48590B055EE54D0E384E4D3F199 6.18899 121 904C8DA1568451CF6AFEC37BD23 5.35874 122 97794C90CE8FC91D778F8FEE47B 5.46312 123 05C73B0D6E88617E23AFD96F003 5.13605 124 0272BA3CE68BFDAE3EDE95BA95B 5.70272 125 DA673C98EEEAE56F6D6E1BBE5E0 6.26171 126 DD52BD8976E17DBD701F576BCB8 5.50515

66. A method for providing a pilot symbol for base station identification in a Multiple-Input Multiple-Output (MIMO) communication system having one or more transmission antennas,

wherein the pilot symbol is comprised of a first sequence having a good cell identification characteristic and a second sequence for reducing a peak-to-average power ratio (PAPR) for all of pilot symbols.

67. The method of claim 66, wherein the first sequence is created by block-coding information to be transmitted from a base station to a mobile station.

68. The method of claim 66, wherein the second sequence is created from a predetermined reference table taking the first sequence into account.

69. The method of claim 67, wherein the information to be transmitted from the base station to the mobile station is a cell identifier (ID).

70. The method of claim 67, when the number of the transmit antenna is two or an the FFT operation point has a value of 128, first sequence is determined by,

$R$

( r ) = B IDcell + 1 ⁢

g ∏

( r ) , r = 8 * ⌊

m 9 ⌋

+ m ⁢

 

⁢

mod ⁢

 

⁢

9 = 0 , 1 , …

⁢

 

, 47

71. The method of claim 66, wherein the pilot symbol for base station identification is determined by the following equation in which the first sequence and the second sequence are reflected,

$q_{{\mathrm{ID}}_{\mathrm{cell}}}$

[ m ] = { R ⁡

( 8 * ⌊

m 9 ⌋

+ m ⁢

 

⁢

mod ⁢

 

⁢

9 ) , where ⁢

 

⁢

m ⁢

 

⁢

mod ⁢

 

⁢

9 = 0 , 1 , …

⁢

 

, 7 T ⁡

( ⌊

m 9 ⌋

) , where ⁢

 

⁢

m ⁢

 

⁢

mod ⁢

 

⁢

9 = 8 ⁢

m = 0 , 1 , …

⁢

 

, N used N t - 1

where R(r) denotes the first sequence, and T(−

) denotes the second sequence.