Apparatus and method for channel estimation in an orthogonal frequency division multiplexing cellular communication system using multiple transmit antennas

PRIORITY

0001This application claims priority under 35 U.S.C. § 119 to an application entitled "Apparatus And Method For Channel Estimation In An Orthogonal Frequency Division Multiplexing Cellular Communication System Using Multiple Transmit Antennas" filed in the Korean Intellectual Property Office on April 21, 2004 and assigned Serial No. 2004-27630, the contents of which are herein incorporated by reference.

BACKGROUND OF THE INVENTION

1. Field of the Invention

0002The present invention relates generally to a channel estimation apparatus and method in an OFDM (Orthogonal Frequency Division Multiplexing) communication system, and in particular, to an apparatus and method for performing accurate channel estimation by canceling inter-cellular interference in a MIMO (Multiple Input Multiple Output)-OFDM communication system.

2. Description of the Related Art

0003Typically, a wireless communication system refers to a system supporting wireless communication service, which includes Node Bs and UEs(User Equipment). The Node B and the UE support the wireless communication service in transmission frames. For frame transmission and reception, therefore, synchronization must be acquired between a Node B and a UE. Accordingly, the Node B transmits a synchronization signal to the UE, such that the UE can identify the start of a frame. The UE then detects the frame timing of the Node B from the synchronization signal and demodulates a received frame based on the frame timing. In general, the synchronization signal is a preamble sequence preset between the Node B and the UE.

0004Preferably, a multi-carrier OFDM communication system uses a preamble sequence having a low PAPR (Peak-to-Average Power Ratio). The Node B transmits to the UE the first part of a long preamble for coarse synchronization, followed by a short preamble for fine synchronization. The UE transmits only a short preamble to the Node B, for fine synchronization.

0005The OFDM communication system transmits user data to a plurality of users, i.e., UEs, by multiplexing a frame in time. Simultaneously, a frame preamble is transmitted for a predetermined time period starting from the start of a frame, to indicate the start of the frame. Because of burst data transmission to users in one frame, a burst preamble exists in front of each user data in order to indicate the start of the data. Therefore, the UE receives the data preamble to determine the start of its user data. More specifically, to synchronize it's timing to the start of data for data reception, the UE receives a common preamble sequence in the system and acquires synchronization, prior to signal reception.

0006The OFDM communication system uses the same source coding, channel coding, and modulation as non-OFDM communication systems. Compared to a CDMA (Code Division Multiple Access) communication system in which data is spread prior to transmission, the OFDM communication system inserts a guard interval into an IFFT (Inverse Fast Fourier Transform) signal. Therefore, the OFDM communication system can transmit a broadband signal with simple hardware relative to the CDMA communication system. The OFDM communication system IFFT-processes a modulated bit-symbol sequence, thereby producing a time-domain signal. The time-domain signal (i.e. OFDM symbol) is a broadband signal in which a plurality of narrow-band subcarrier signals are multiplexed. A plurality of modulated symbols are delivered for one OFDM symbol period.

0007However, simple transmission of an IFFT OFDM symbol without any further processing leads to inevitable interference between the previous OFDM symbol and the present OFDM symbol. To cancel the ISI (Inter-Symbol Interference), a guard interval is inserted. It was proposed that null data is to be inserted for a predetermined interval as the guard interval. The distinctive shortcoming of this guard interval is that for an incorrect estimation of the start of the OFDM symbol at the receiver, interference occurs between subcarriers, increasing the wrong decision probability of the received OFDM symbol. Therefore, the guard interval is used in form of a "cyclic prefix" or "cyclic postfix". The cyclic prefix is a copy of the last 1/n bits of a time-domain OFDM symbol, inserted into an effective OFDM symbol, and the cyclic postfix is a copy of the first 1/n bits of the time-domain OFDM symbol, inserted into the effective OFDM symbol. Utilizing the guard interval as the redundant information of the copied first or last part of one OFDM symbol, the receiver can acquire the time/frequency synchronization of a received OFDM symbol.

0008A signal transmitted from the transmitter is distorted as it experiences a radio channel and thus the distorted signal arrives at the receiver. The receiver performs channel estimation by acquiring time/frequency synchronization using a known preamble sequence, and channel-compensates frequency-domain FFT (Fast Fourier Transform) symbols using the channel estimate. The receiver then recovers information data by channel decoding and source decoding the channel-compensated symbols in correspondence with the channel coding and source coding used in the transmitter.

0009The OFDM communication system uses a preamble sequence to achieve frame timing synchronization, frequency synchronization, and channel estimation. Although a guard interval and pilot subcarriers can be used instead of the preamble in frame timing synchronization, frequency synchronization, and channel estimation, the transmitter usually transmits known symbols at the start of every frame or data burst as a preamble sequence and the receiver updates time/frequency/channel information with the preamble sequence.

0010The importance of channel estimation lies in coherent modulation and demodulation in the OFDM system. A channel estimator is a required for systems using coherent modulation and demodulation. Especially under a MIMO environment, channel information is needed for every antenna, further increasing the importance of the channel estimation.

0011When the MIMO-OFDM system supports a cellular environment, severe interference occurs at cell boundaries, thereby degrading channel estimation performance. Accordingly, a need exists for channel estimation techniques that minimize inter-cellular interference in the MIMO-OFDM cellular system.

SUMMARY OF THE INVENTION

0012Accordingly, the present invention has been designed to substantially solve at least the above problems and/or disadvantages and to provide at least the advantages below. An object of the present invention is to provide an apparatus and method for performing accurate channel estimation by canceling inter-cellular interference in an OFDM communication system.

0013Another object of the present invention is to provide an apparatus and method for performing accurate channel estimation by canceling inter-cellular interference in a wireless cellular communication system.

0014A further object of the present invention is to provide an apparatus and method for determining a number of channel-estimatable Node Bs (or cells) in a wireless cellular communication system.

0015The above and other objects are achieved by providing an apparatus and method for channel estimation in an OFDM cellular communication system using multiple antennas.

0016According to one aspect of the present invention, in an apparatus for channel estimation using preamble signals received from a serving Node B and neighboring Node Bs in a UE in a broadband wireless communication system in which each of the Node B s transmits a signal through N (≥1) antennas and the UE receives a signal through M (≥1) antennas, a Node B number decider calculates the maximum number N_s of channel-estimatable Node Bs using a preamble length, the number of antennas in each of the Node Bs, and the number of multiple paths. A multi-cell preamble matrix generator generates a multi-cell preamble matrix x_s by generating a Node B preamble matrix for each of the serving Node B and the neighboring Node Bs and selecting N_s Node B preamble matrices according to reception power among the generated Node B preamble matrices. A channel estimator performs a channel estimation using the multi-cell preamble matrix x_s and M signals received through the M antennas during a preamble receiving period.

0017According to another aspect of the present invention, in an apparatus for channel estimation using preamble signals received from a serving Node B and neighboring Node Bs in a UE in a broadband wireless communication system where each of the Node Bs transmits a signal through N (≥1) antennas and the UE receives a signal through M (≥1) antennas, a Node B number decider calculates the maximum number N_s of channel-estimatable Node Bs using a preamble length A, the number of antennas N in each of the Node Bs, and the number L of multiple paths by<maths id="math0001"><img file="EP1589712A2_D0001.tif" /></maths> A channel estimator selects N_s Node Bs according to the reception power of the serving Node B and the neighboring Node Bs and performs a channel estimation using known preamble information associated with the N_s Node Bs and signals received through the M antennas.

0018According to a further aspect of the present invention, in a method of channel estimation using preamble signals received from a serving Node B and neighboring Node Bs in a UE in a broadband wireless communication system where each of the Node Bs transmits a signal through N (≥1) antennas and the UE receives a signal through M (≥1) antennas, the maximum number N_s of channel-estimatable Node Bs is calculated using a preamble length, the number of antennas in each of the Node Bs, and the number of multiple paths. N_s Node Bs are selected according to the reception power of the serving Node B and the neighboring Node Bs, Node B preamble matrices are generated for the respective selected N_s Node Bs, and a multi-cell preamble matrix x_s is generated by combining the N_s Node B preamble matrices. A channel estimation is then performed using the multi-cell preamble matrix x_s and M signals received through the M antennas during a preamble receiving period.

0019According to still another aspect of the present invention, in a method of channel estimation using preamble signals received from a serving Node B and neighboring Node Bs in a UE in a broadband wireless communication system where each of the Node Bs transmits a signal through N (≥1) antennas and the UE receives a signal through M (≥1) antennas, the maximum number N_s of channel-estimatable Node Bs is calculated using a preamble length A, the number of antennas N in each of the Node Bs, and the number L of multiple paths by<maths id="math0002"><img file="EP1589712A2_D0002.tif" /></maths> N_s Node Bs are selected according to the reception power of the serving Node B and the neighboring Node Bs and a channel estimation is performed using known preamble information associated with the N_s Node Bs and signals received through the M antennas.

BRIEF DESCRIPTION OF THE DRAWINGS

0020The above and other objects, features, and advantages of the present invention will become more apparent from the following detailed description when taken in conjunction with the accompanying drawings in which: <ul id="ul0001" list-style="none" compact="compact"><li>FIG 1 is a block diagram illustrating a transmitter using N transmit antennas in an OFDM communication system according to an embodiment of the present invention;</li><li>FIG 2 is a block diagram illustrating a receiver using M receive antennas in an OFDM communication system according to an embodiment of the present invention;</li><li>FIG 3 illustrates a preamble transmission rule according to the present invention;</li><li>FIG 4 illustrates the operational principle of an L-phase shifter needed for generation of a preamble sequence;</li><li>FIG 5 is a detailed block diagram illustrating a multi-cell channel estimator in a receiver in a MIMO-OFDM communication system according to an embodiment of the present invention;</li><li>FIG 6 is a detailed block diagram illustrating a Node B number decider as illustrated in FIG 5;</li><li>FIG. 7 is a detailed block diagram illustrating a multi-cell preamble matrix generator as illustrated in FIG 5;</li><li>FIG. 8 is a detailed block diagram illustrating a preamble matrix generator for Node B #0 as illustrated in FIG. 7;</li><li>FIG 9 illustrates a preamble sequence transmission rule for each Node B when the total number of a serving Node B and its neighboring Node Bs is 2 and the number of transmit antennas is 4;</li><li>FIG 10 illustrates an operational principle of 16-phase shifters as illustrated in FIG. 9;</li><li>FIG 11 illustrates an operation of a Node B number decider when a preamble length is 128, the number of transmit antennas is 4, the number of multiple paths is 16, and the total number of a serving Node B and its neighboring Node Bs is 2;</li><li>FIG 12 illustrates an operation of a multi-cell preamble matrix generator when the number of transmit antennas is 4, the total number of a serving Node B and its neighboring Node Bs is 2, and the maximum number of accommodatable Node Bs is 2;</li><li>FIG 13 illustrates an operation of a preamble matrix generator for Node B #0 when a preamble length is 128, the number of transmit antennas is 4, and the number of multiple paths is 16;</li><li>FIG 14 is a flowchart illustrating an operation of a transmitter using N transmit antennas in an OFDM communication system according to an embodiment of the present invention;</li><li>FIG. 15 is a flowchart illustrating an operation of a receiver using M receive antennas in an OFDM communication system according to an embodiment of the present invention;</li><li>FIG 16 is a detailed flowchart illustrating a multi-cell estimation step as illustrated in FIG 15;</li><li>FIG. 17 is a detailed flowchart illustrating a multi-cell preamble matrix generation step as illustrated in FIG. 16;</li><li>FIG. 18 is a detailed flowchart illustrating a Node B preamble matrix generation step 1703 as illustrated in FIG 17;</li><li>FIG. 19 is a graph illustrating a comparison in performance between an SCMLE (Single Cell Maximum Likelihood Estimator) and an MCMLE (Multi-Cell Maximum Likelihood Estimator) according to the total number of a serving Node B and its neighboring Node Bs; and</li><li>FIG 20 is a graph illustrating another comparison in performance between the SCMLE and the MCMLE according to the total number of a serving Node B and its neighboring Node Bs.</li></ul>

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

0021Preferred embodiments of the present invention will be described herein below with reference to the accompanying drawings. In the following description, well-known functions or constructions are not described in detail because they would obscure the invention in unnecessary detail.

0022The present invention is directed to an apparatus and method for performing accurate channel estimation by canceling inter-cellular interference at a receiver in a MIMO-OFDM cellular communication system. While the following description is made in the context of a MIMO-OFDM system by way of example, it is to be appreciated that the present invention is applicable to any system suffering inter-cellular interference.

0023FIG 1 is a block diagram illustrating a transmitter using N transmit antennas in an OFDM communication system according to an embodiment of the present invention. Referring to FIG 1, the transmitter includes a symbol mapper 111, a serial-to-parallel converter (SPC) 113, a multi-antenna transmission coder 115, N preamble sequence generators 117 to 129, N selectors 119 to 131, N IFFT processors 121 to 133, N parallel-to-serial converters (PSCs) 123 to 135, N digital-to-analog converters (DACs) 125 to 137, and N RF (Radio Frequency) processors 127 to 139.

0024In operation, the symbol mapper 111 encodes input information bits at a predetermined code rate and modulates the coded bits according to a predetermined modulation order. The symbol mapper 111 is configured to have a channel coder and a modulator. For example, the channel coder is a Turbo coder or a convolutional coder, and the modulator uses QPSK (Quadrature Phase Shift Keying), 8PSK (8-ary PSK), 16QAM (16-ary Quadrature Amplitude Modulation), or 64QAM (64-ary QAM).

0025The SPC 113 performs BxN-point serial-to-parallel conversion on the modulated symbols. B is the number of subcarriers for delivering data from each transmit antenna and N is the number of transmit antennas. Upon generation of B×N symbols for all the transmit antennas in the symbol mapper 111, the SPC 113 parallel converts the symbols.

0026The multi-antenna transmission coder 115 can be a space-time coder, a data multiplexer, or any other device according to its purposes. In general, the space-time coder is used for transmit antenna diversity, and the data multiplexer for increasing data capacity The multi-antenna transmission coder 115 generates N antenna signals by encoding the modulated symbols in a predetermined coding method. and the N antenna signals are then provided them to the selectors 119 to 131, which are matched to the respective N antennas.

0027The preamble sequence generator 117 for antenna #0 generates a predetermined preamble sequence under the control of a controller (not shown), which will be described in great detail with reference to FIG 3.

0028The selector 119 selects one of the preamble sequence received from the preamble sequence generator 117 and the antenna signal received from the multi-antenna transmission coder 115 according to scheduling at the moment. That is, the selector 119 determines whether to transmit the preamble sequence or the code symbols. According to the decision result, the selector 119 provides the preamble sequence or the symbols to the IFFT processor 121 for antenna #0.

0029The IFFT processor 121 A-point IFFT-processes the preamble sequence or the symbols. A is the total number of subcarriers for IFFT and B is the number of available subcarriers, not including DC(down converted) subcarriers and the subcarriers of an unused high frequency band.

0030The PSC 123 receives a cyclic prefix (CP) and the IFFT signals, and then serial converts the received signals. The DAC 125 converts the digital signal received from the PSC 123 to an analog signal. The RF processor 127, including a filter and a front-end unit, processes the analog signal to an RF signal and then transmits the RF signal through antenna #0.

0031The preamble sequence generator 129 for antenna #(N-1) generates a predetermined preamble sequence under the control of the controller (not shown). The selector 131 selects the preamble sequence received from the preamble sequence generator 129 or the antenna signal received from the multi-antenna transmission coder 115 according to the scheduling at the moment. That is, the selector 131 determines whether to transmit the preamble sequence or the code symbols. According to the decision result, the selector 131 provides the preamble sequence or the symbols to the IFFT processor 133 for antenna #(N-1).

0032The IFFT processor 133 A-point IFFT-processes the preamble sequence or the symbols. As described above, A is the total number of subcarriers for IFFT and B is the number of available subcarriers, not including DC(down converted) subcarriers and the subcarriers of an unused high frequency band.

0033The PSC 135 receives a CP and the IFFT signals, and the serial converts the received signals. The DAC 137 converts the digital signal received from the PSC 123 to an analog signal. The RF processor 139, including a filter and a front-end unit, processes the analog signal to an RF signal, and then transmits the RF signal through antenna #(N-1).

0034FIG. 2 is a block diagram illustrating a receiver using M receive antennas in an OFDM communication system according to an embodiment of the present invention. Referring to FIG. 2, the receiver includes M receive antennas, M RF (Radio Frequency) processors 201 to 207, M analog-to-digital converters (ADCs) 203 to 209, M SPCs (Serial to Parallel Converters) 205 to 211, M FFT (Fast Fourier Transform) processors 215 to 217, a multi-cell channel estimator 213, M equalizers 219 to 221, a multi-antenna reception decoder 223, a PSC (Parallel to Serial Converter) 225, and a demodulator 227.

0035In operation, the RF processor 201 processes a signal received through antenna #0 through an RF filter and a front-end unit. The ADC 203 converts the analog signal received from the RF processor 210 to a digital signal. The SPC 205 removes CP samples from the digital signal, and parallel converts the remaining signal to signals y₀(Ax1) as an input to a digital end. Similarly, the SPC 211 outputs digital input signals y_M-1(Ax1) from antenna #(M-1).

0036At a preamble reception time, the received signals y₀(Ax1) to y_M-1(Ax1) are provided to the multi-cell estimator 213. The multi-cell estimator 213 estimates all possible M×N×L channels and provides the channel estimates to the equalizers 219 to 221. M is the number of the receive antennas, N is the number of the transmit antennas, and L is the number of multiple paths. The multi-cell channel estimator 213 will be described later in more detail with reference to FIG. 5.

0037At a non-preamble reception time, the received signals y₀(Ax1) to y_M-1(A×1) are provided to the FFT processors 215 to 217. The FFT processors 215 to 217 A-point FFT-process the received signals. The equalizers 219 to 221 compensate the FFT signals for channel distortion associated with the respective receive antennas using the channel estimates.

0038The multi-antenna reception decoder 223 decodes the channel-compensated signals to one signal stream according to a predetermined rule. The PSC 225 serializes the parallel data received from the multi-antenna reception decoder 223. Thereafter, the demodulator 225 recovers the original information bit stream by demodulating and decoding the serial data in a predetermined method.

0039FIG 3 illustrates a preamble transmission rule according to the present invention. The preamble sequence transmission rule is applied to N_B Node Bs, including a serving Node B and its neighboring Node Bs, each Node B using N transmit antennas. Here, the serving Node B refers to a reference Node B for generating preamble sequences.

0040Referring to FIG 3, a reference Node N 301 (Node B #0) is provided with N preamble sequence generators 303 to 305. The N preamble sequence generators 303 to 305 generate different preamble sequences in a predetermined method. The predetermined method can be to allocate different subcarriers to different transmit antennas. For example, if N is 2, for one antenna, a particular sequence is allocated to odd-numbered subcarriers with null data on even-numbered subcarriers among total subcarriers, while for the other antenna, the sequence is allocated to the even-numbered subcarriers with null data on the odd-numbered subcarriers.

0041A Node B 307 (Node B #1) has N preamble sequences 308 to 310 and N L-phase shifters 309 to 311. The N preamble sequence generators 308 to 310 generate the same N preamble sequences as in Node B #0 301. The L-phase shifters 309 to 311 then shift the phases of the preamble sequences received from their matched preamble sequence generators 308 to 310 by L, thereby producing final preamble sequences. L can be set to the length of the CP. The use of the L-phase shifters is a known technology for rendering the preambles of Node B #1 307 to be orthogonal to those of Node B #0 301.

0042Although the description of the present invention is based on the presumption of using the L-phase shifters, the preamble sequences can be generated in another suitable manner.

0043Similarly, a Node B 313 (Node B #(N_B-1)) has N preamble sequences 314 to 316 and N Lx(N_B-1)-phase shifters 325 to 317. The N preamble sequence generators 314 to 316 generate the same N preamble sequences as in Node B #0 301. The Lx(N_B-1)-phase shifters 309 to 311 then shift the phases of the preamble sequences received from their matched preamble sequence generators 314 to 316 by Lx(N_B-1), thereby producing final preamble sequences.

0044FIG. 4 illustrates an operational principle of L-phase shifters as illustrated in FIG 3. Referring to FIG. 4, after L-phase shifting, the phase of a frequency-domain signal [X₀, X₁, ..., X_A-1] is shifted in the frequency domain. If the phase-shifted signal is IFFT-processed to a time-domain signal, it is then a cyclically-shifted signal. Because orthogonality is ensured between IFFT cyclically-shifted signals, usually, a phase-shifter is used in the frequency domain in generating preamble sequences.

0045FIG. 5 is a detailed block diagram illustrating a multi-cell channel estimator in a receiver in a MIMO-OFDM communication system according to an embodiment of the present invention. Referring to FIG 5, in a multi-cell channel estimator 213 as illustrated in FIG 2, a Node B number decider 503 calculates a maximum number of accommodatable (or channel-estimatable) Node Bs, N_s. The preamble length is the size of IFFT/FFT (or OFDM symbol length), A in the present invention. Accordingly, N_s is closely related to A, which will be described later in more detail with reference to FIG 6.

0046A multi-cell preamble matrix generator 505 generates a multi-cell preamble matrix X_s according to N_s for direct use in multi-cell channel estimation, which will be described later in more detail with reference to FIG 7.

0047A matrix y generator 509 generates a signal matrix y, as shown in Equation (1) below, by combining the time-domain signals received through the receive antennas, y₀, y₁, ... y_M-1. The received signals y₀, y₁, ... y_M-1 are the outputs of the SPCs 205 to 211 as illustrated in FIG. 2, received during a preamble time period.<maths id="math0003" num="(1)"><math display="block"><mrow><mtext mathvariant="italic">y</mtext><mtext> = [</mtext><msub><mrow><mtext mathvariant="italic">y</mtext></mrow><mrow><mtext>0</mtext></mrow></msub><mtext></mtext><msub><mrow><mtext mathvariant="italic">y</mtext></mrow><mrow><mtext>1</mtext></mrow></msub><mtext> ... </mtext><msub><mrow><mtext mathvariant="italic">y</mtext></mrow><mrow><mtext mathvariant="italic">M</mtext><mtext>-1</mtext></mrow></msub><mtext>]</mtext></mrow></math><img file="EP1589712A2_D0003.tif" /></maths>

0048A pseudo-inverse matrix generator 507 calculates the pseudo-inverse of x_s, (x<maths id="math0004"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">H</mtext></mrow><mrow><mtext mathvariant="italic">s</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0004.tif" /></maths>x_s)^-1 x<maths id="math0005"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">H</mtext></mrow><mrow><mtext mathvariant="italic">s</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0005.tif" /></maths>.

0049A matrix multiplier 511 multiplies y by <i>(x</i><maths id="math0006"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">H</mtext></mrow><mrow><mtext mathvariant="italic">s</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0006.tif" /></maths><i>x</i>_<i>s</i><i>)</i>^<i>-1</i> x<maths id="math0007"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">H</mtext></mrow><mrow><mtext mathvariant="italic">s</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0007.tif" /></maths>, thereby producing a channel estimate <i>ĥ</i>, as shown in Equation (2) below, including NxMxL channel estimate values. In Equation (2), N is the number of transmit antennas, M is the number of receive antennas, and L is the number of multiple paths.<maths id="math0008" num="(2)"><math display="block"><mrow><mover accent="true"><mrow><mtext mathvariant="italic">h</mtext></mrow><mo>ˆ</mo></mover><mtext> = </mtext><msup><mrow><mfenced open="(" close=")"><mrow><mtext mathvariant="italic">x</mtext><msubsup><mrow><mtext>​</mtext></mrow><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext mathvariant="italic">H</mtext></mrow></msubsup><mtext mathvariant="italic">x</mtext><msub><mrow><mtext>​</mtext></mrow><mrow><mtext mathvariant="italic">s</mtext></mrow></msub></mrow></mfenced></mrow><mrow><mtext>-1</mtext></mrow></msup><mtext></mtext><msubsup><mrow><mtext mathvariant="italic">x</mtext></mrow><mrow><mtext mathvariant="italic">s</mtext></mrow><mrow><mtext mathvariant="italic">H</mtext></mrow></msubsup><mtext mathvariant="italic">y</mtext></mrow></math><img file="EP1589712A2_D0008.tif" /></maths>

0050An FFT processor 513 obtains a frequency-domain channel estimate <i>Ĥ</i> through A-point FFT-processing of <i>ĥ</i>. More specifically, the A-point FFT 513 FFT-processes L channel estimate values and outputs A channel estimate values (or subcarrier channel values), and repeats this operation NxM times. Accordingly, the FFT 513 eventually outputs NxMxA multi-path channel estimate values. Thereafter, <i>Ĥ</i> is provided to the equalizers 219 to 221, for channel compensation.

0051Depending on which channel estimation method is used, the channel estimate can be calculated by multiplying a pseudo-inverse matrix, or can be calculated in the frequency domain. In the present invention, the ML (Maximum Likelihood) method using pseudo-inverse matrix multiplication is used. The present invention calculates the multi-cell preamble matrix x_s using N_s.

0052FIG 6 is a detailed block diagram illustrating a Node B number decider 503 as illustrated in FIG 5. As described above, because the preamble length is limited to the length of an OFDM symbol, i.e., A, the number of channel-estimatable Node Bs is also limited. Also, the present invention assumes a channel environment with multiple paths such as a MIMO channel (or multi-cell) environment. Therefore, considering all these conditions, N_s is computed by Equation (3),<maths id="math0009"><img file="EP1589712A2_D0009.tif" /></maths> where A is the IFFT size, i.e. the preamble length, L is the number of multiple paths, i.e. the Cyclic Prefix length, N is the number of transmit antennas, and N_B is the number of a serving Node B plus its neighboring Node Bs.<maths id="math0010"><img file="EP1589712A2_D0010.tif" /></maths> represents the number of channel-estimatable Node Bs. L, representing a maximum delay spread or a maximum channel length, is computed as the difference between the time of arrival from the earliest path and the time of arrival from the last path, expressed in the number of samples.

0053In the OFDM system, the CP length expressed as the number of samples is typically determined using the maximum delay spread. The present invention also assumes that L is the CP length expressed in the number of samples.

0054As noted from Equation (3), when N_B is less than<maths id="math0011"><img file="EP1589712A2_D0011.tif" /></maths> N_B is N_s. However, when N_B is larger than<maths id="math0012"><img file="EP1589712A2_D0012.tif" /></maths> is N_s. This computation can be implemented in hardware as illustrated in FIG 6.

0055Referring to FIG. 6, a multiplier 601 multiplies L by N. A divider 603 divides A by the product of LxN. A floor operator 605 outputs only the integer part of <maths id="math0013"><math display="inline"><mrow><mfrac><mrow><mtext mathvariant="italic">A</mtext></mrow><mrow><mtext mathvariant="italic">LN</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0013.tif" /></maths>, deleting the fraction part. A smaller-value selector 607 selects the smaller of the output of the floor operator 605 and N_B as N_S.

0056FIG. 7 is a detailed block diagram illustrating a multi-cell preamble matrix generator 505 as illustrated in FIG 5. Referring to FIG. 7, a preamble matrix generator 701 for Node B #0 (the serving Node B) generates a preamble matrix for Node B #0, <i>x</i>^<i>(0)</i> = <i>[x</i><maths id="math0014"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0014.tif" /></maths> x<maths id="math0015"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0015.tif" /></maths> ...x<maths id="math0016"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">N-1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0016.tif" /></maths><i>]</i> using known frequency-domain preamble information associated with all transmit antennas of Node B #0, <i>X</i><maths id="math0017"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0017.tif" /></maths>, ..., <i>X</i><maths id="math0018"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext>(0)</mtext></mrow><mrow><mtext mathvariant="italic">N-1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0018.tif" /></maths>, which will be described later in more detail with reference to FIG. 8.

0057A preamble matrix generator 703 for Node B #1 generates a preamble matrix for Node B #1, <i>x</i>^<i>(1)</i> = <i>[x</i><maths id="math0019"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(1)</mtext></mrow><mrow><mtext mathvariant="italic">0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0019.tif" /></maths><i>x</i><maths id="math0020"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(1)</mtext></mrow><mrow><mtext mathvariant="italic">1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0020.tif" /></maths> ...x<maths id="math0021"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(1)</mtext></mrow><mrow><mtext mathvariant="italic">N-1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0021.tif" /></maths><i>]</i> using known frequency-domain preamble information associated with all transmit antennas of Node B #1, <i>X</i><maths id="math0022"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(1)</mtext></mrow><mrow><mtext mathvariant="italic">0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0022.tif" /></maths>,...,<i>X</i><maths id="math0023"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(1)</mtext></mrow><mrow><mtext mathvariant="italic">N-1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0023.tif" /></maths><i>.</i>

0058Similarly, a preamble matrix generator 705 for Node B #(N_s-1) generates a preamble matrix for Node B #(N_s-1), <i>x</i>^(Ns^-1) = <i>[x</i><maths id="math0024"><math display="inline"><mrow><mfrac linethickness="0"><mrow><msub><mrow><mtext mathvariant="italic">(N</mtext></mrow><mrow><mtext mathvariant="italic">s</mtext></mrow></msub><mtext mathvariant="italic">-1)</mtext></mrow><mrow><mtext mathvariant="italic">0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0024.tif" /></maths> x<maths id="math0025"><math display="inline"><mrow><mfrac linethickness="0"><mrow><msub><mrow><mtext mathvariant="italic">(N</mtext></mrow><mrow><mtext mathvariant="italic">s</mtext></mrow></msub><mtext mathvariant="italic">-1)</mtext></mrow><mrow><mtext mathvariant="italic">1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0025.tif" /></maths> ... <i>x</i><maths id="math0026"><math display="inline"><mrow><mfrac linethickness="0"><mrow><msub><mrow><mtext mathvariant="italic">(N</mtext></mrow><mrow><mtext mathvariant="italic">s</mtext></mrow></msub><mtext mathvariant="italic">-1)</mtext></mrow><mrow><mtext mathvariant="italic">N-1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0026.tif" /></maths><i>]</i>, and a preamble matrix generator 709 for Node B #(N_B-1) generates a preamble matrix for Node B #(N_B-1), <i>x</i>^<i>(N</i><i>s</i>^<i>-1)</i> = <i>[x</i><maths id="math0027"><math display="inline"><mrow><mfrac linethickness="0"><mrow><msub><mrow><mtext mathvariant="italic">(N</mtext></mrow><mrow><mtext mathvariant="italic">s</mtext></mrow></msub><mtext mathvariant="italic">-1)</mtext></mrow><mrow><mtext mathvariant="italic">0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0027.tif" /></maths><i>x</i><maths id="math0028"><math display="inline"><mrow><mfrac linethickness="0"><mrow><msub><mrow><mtext mathvariant="italic">(N</mtext></mrow><mrow><mtext mathvariant="italic">s</mtext></mrow></msub><mtext mathvariant="italic">-1)</mtext></mrow><mrow><mtext mathvariant="italic">1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0028.tif" /></maths> ... x<maths id="math0029"><math display="inline"><mrow><mfrac linethickness="0"><mrow><msub><mrow><mtext mathvariant="italic">(N</mtext></mrow><mrow><mtext mathvariant="italic">s</mtext></mrow></msub><mtext mathvariant="italic">-1)</mtext></mrow><mrow><mtext mathvariant="italic">N-1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0029.tif" /></maths><i>]</i> .

0059To increases channel estimation performance, a Node B for which channel estimation is performed must have greater power than other Node Bs. Therefore, the Node Bs are indexed in the order expressed as shown in Equation (4). In the above example, Node B #0 is highest and Node B #(N_B-1) is lowest in reception power.<maths id="math0030" num="(4)"><math display="block"><mrow><msup><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">(0)</mtext></mrow></msup><mtext> ≥ </mtext><msup><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">(1)</mtext></mrow></msup><mtext> ≥ ... ≥ </mtext><mtext mathvariant="italic">p</mtext><msup><mrow><mtext>​</mtext></mrow><mrow><msub><mrow><mtext mathvariant="italic">(N</mtext></mrow><mrow><mtext mathvariant="italic">s</mtext></mrow></msub><mtext mathvariant="italic">-1)</mtext></mrow></msup></mrow></math><img file="EP1589712A2_D0030.tif" /></maths>

0060An accommodatable Node B matrix generator 711 then receives N_s from the Node B number decider 503 and selects N_S Node B preamble matrices, thereby generating the multi-cell preamble matrix x_s = <i>[x</i>^<i>(0)</i><i>x</i>^<i>(1)</i> ...<i>x</i>^<i>(N</i><i>s</i>^<i>-1)</i><i>].</i>

0061FIG 8 is a detailed block diagram illustrating a preamble matrix generator 701 for Node B #0 as illustrated in FIG. 7. Referring to FIG 8, for Node B #0 (the serving Node B), an A-point IFFT 801 generates a time-domain signal <i>x</i><maths id="math0031"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0031.tif" /></maths> by IFFT-processing a preamble signal <i>X</i><maths id="math0032"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0032.tif" /></maths> for transmit antenna #0. <i>x</i><maths id="math0033"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0033.tif" /></maths> is input to a preamble matrix generator 825 for antenna #0 and cyclic shifters 807 to 811.

0062The cyclic shifter 807 cyclically shifts <i>x</i><maths id="math0034"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0034.tif" /></maths>, for example, once, and outputs the resulting signal x<maths id="math0035"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0035.tif" /></maths> to the preamble matrix generator 825 for antenna #0. The cyclic shifter 809 cyclically shifts <i>x</i><maths id="math0036"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0036.tif" /></maths><i>,</i> for example, twice, and outputs the resulting signal <i>x</i><maths id="math0037"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,2</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0037.tif" /></maths> to the preamble matrix generator 825 for antenna #0. Finally, the cyclic shifter 811 cyclically shifts <i>x</i><maths id="math0038"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0038.tif" /></maths> (L-1) times and outputs the resulting signal <i>x</i><maths id="math0039"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,(L-1)</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0039.tif" /></maths> to the preamble matrix generator 825 for antenna #0. Accordingly, preamble signals are generated for all paths for antenna #0.

0063The preamble matrix generator 825 for antenna #0 generates a preamble matrix for antenna #0, x<maths id="math0040"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0040.tif" /></maths> = <i>[x</i><maths id="math0041"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0041.tif" /></maths><i>x</i><maths id="math0042"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,1)</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0042.tif" /></maths> ... <i>x</i><maths id="math0043"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,(L-1)</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0043.tif" /></maths><i>]</i> by combining the outputs of the IFFT processor 801 and the cyclic shifters 807 to 811. The preamble matrix for antenna #0 is shown in Equation (5),<maths id="math0044"><img file="EP1589712A2_D0044.tif" /></maths><maths id="math0045"><img file="EP1589712A2_D0045.tif" /></maths> where <i>x</i><maths id="math0046"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(j)</mtext></mrow><mrow><mtext mathvariant="italic">i</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0046.tif" /></maths><i>(k)</i> is a k^th sample value of a preamble transmitted from an i^th antenna of a j^th Node B.

0064Similarly, a preamble matrix generator 827 for antenna #1 generates a preamble matrix for antenna #1, x<maths id="math0047"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0047.tif" /></maths> = <i>[x</i><maths id="math0048"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">1,0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0048.tif" /></maths><i>x</i><maths id="math0049"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">1,1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0049.tif" /></maths> ... <i>x</i><maths id="math0050"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">1,(L-1)</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0050.tif" /></maths><i>]</i> and outputs it to an antenna preamble matrix combiner 831. A preamble matrix generator 829 for antenna #(N-1) generates a preamble matrix for antenna #(N-1), <i>x</i><maths id="math0051"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">N-1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0051.tif" /></maths><i>= [x</i><maths id="math0052"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">N-1,0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0052.tif" /></maths><i>x</i><maths id="math0053"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">N-1,1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0053.tif" /></maths>... x<maths id="math0054"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">N-1,(L-1)</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0054.tif" /></maths><i>]</i> and outputs it to the antenna preamble matrix combiner 831.

0065The antenna preamble matrix combiner 831 generates the preamble matrix for Node B #0, <i>x</i>⁽⁰⁾ = <i>[x</i><maths id="math0055"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0055.tif" /></maths><i>x</i><maths id="math0056"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0056.tif" /></maths><i>...x</i><maths id="math0057"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">N-1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0057.tif" /></maths><i>]</i> by combining N antenna preamble matrices received from the N antenna preamble matrix generators 825 to 829. The preamble matrix generators 703 to 709 for the other Node Bs, as illustrated in FIG 7, generate preamble matrices for the respective Node Bs in the same manner. The preamble matrix generator for a Node B, as illustrated in FIG 8, involves multi-path propagation in generating a preamble matrix for the Node B. In real implementation of a preamble matrix generator for a Node B, the UE preliminarily stores the preamble sample data of the Node B in a memory and cyclically shifts the preamble sample data when necessary, thereby generating a preamble matrix for the Node B.

0066For better understanding of the present invention, an exemplary application will be presented below.

0067FIG. 9 illustrates a preamble sequence transmission rule for each Node B when N_B=2 and N=4. Referring to FIG. 9, a serving Node B 901 (Node B #0) is provided with four preamble sequence generators 903 to 905. The preamble sequence generators 903 to 905 generate preamble sequences in a predetermined method. The predetermined method may allocate different subcarriers to different transmit antennas.

0068A Node B 907 (Node B #1) is provided with four preamble sequence generators 908 to 910 and four 16-phase shifters 909 to 911. The preamble sequence generators 908 to 910 generate the same four preamble sequences as in Node B #0. The 16-phase shifters 909 to 911 shift the preamble sequences by 16°, thereby generating final preamble sequences. The use of the phase shifters is a known technology for rendering the preambles of Node B #1 to be orthogonal to those of Node B #0.

0069As described above, the description of the present invention is based on the presumption of using the phase shifters, even though the preamble sequences can be generated in a different manner.

0070FIG 10 illustrates an operational principle of 16-phase shifters 907 to 911 as illustrated in FIG. 9. Referring to FIG 10, after 16-phase shifting, the phase of a frequency-domain signal [X₀, X₁, ..., X₁₂₇] is shifted in the frequency domain. If the phase-shifted signal is IFFT-processed to a time-domain signal, it is then a cyclically-shifted signal. Because orthogonality is ensured between IFFT cyclically-shifted signals, a phase-shifter is used in the frequency domain or a cyclic shifter is used in the time domain in generating preamble sequences.

0071FIG 11 illustrates an operation of the Node B number decider 503, when A=128, N=4, L=16, and N_B=2. As described above, because L cannot be measured accurately, L is determined to be a CP length.

0072Under the above conditions, N_s is computed using Equation (6).<maths id="math0058"><img file="EP1589712A2_D0058.tif" /></maths>

0073As noted from Equation (6), when 2 (=N_B) is less than<maths id="math0059"><img file="EP1589712A2_D0059.tif" /></maths> N_s=2. However, when 2 (=N_B) is larger than<maths id="math0060"><img file="EP1589712A2_D0060.tif" /></maths> N_s is<maths id="math0061"><img file="EP1589712A2_D0061.tif" /></maths> Preferably, this computation is implemented by hardware as illustrated in FIG 11.

0074Referring to FIG 11, a multiplier 1101 multiplies 16 (=L) by 4 (=N). A divider 1103 divides 128(=A) by the product of 16x4 (=LxN) by 128 (=A). A floor operator 1105 performs a floor operation on the output of the divider 1103. A smaller-value selector 1107 compares 2 being the output of the floor operator 1105 with 2 (=N_B), and outputs 2 as N_s.

0075FIG. 12 illustrates an operation of the multi-cell preamble matrix generator 505 when N=4, N_B=2, and N_s=2. Referring to FIG 12, a preamble matrix generator 1201 for Node B #0 (the serving Node B) generates a preamble matrix for Node B #0, <i>x</i>^<i>(0)</i> = <i>[x</i><maths id="math0062"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0062.tif" /></maths><i>x</i><maths id="math0063"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0063.tif" /></maths> .<i>.. x</i><maths id="math0064"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">3</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0064.tif" /></maths><i>]</i> using known frequency-domain preamble information associated with four antennas of Node B #0, <i>X</i><maths id="math0065"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0065.tif" /></maths><i>, ..., X</i><maths id="math0066"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">3</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0066.tif" /></maths><i>,</i> which will be described later in more detail with reference to FIG. 13.

0076A preamble matrix generator 1203 for Node B #1 generates a preamble matrix for Node B #1, <i>x</i>^<i>(1)</i><i>= [x</i><maths id="math0067"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(1)</mtext></mrow><mrow><mtext mathvariant="italic">0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0067.tif" /></maths><i>x</i><maths id="math0068"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(1)</mtext></mrow><mrow><mtext mathvariant="italic">1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0068.tif" /></maths><i>... x</i><maths id="math0069"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(1)</mtext></mrow><mrow><mtext mathvariant="italic">3</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0069.tif" /></maths><i>]</i> using known frequency-domain preamble information associated with all transmit antennas of Node B #1, <i>X</i><maths id="math0070"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(1)</mtext></mrow><mrow><mtext mathvariant="italic">0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0070.tif" /></maths><i>,..., X</i><maths id="math0071"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(1)</mtext></mrow><mrow><mtext mathvariant="italic">3</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0071.tif" /></maths>.

0077To increases channel estimation performance, a Node B for which channel estimation is performed must have greater power than the other Node B. Therefore, the Node Bs are indexed in the order expressed in Equation (7).<maths id="math0072" num="(7)"><math display="block"><mrow><msup><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">(0)</mtext></mrow></msup><mtext> ≥ </mtext><msup><mrow><mtext mathvariant="italic">p</mtext></mrow><mrow><mtext mathvariant="italic">(1)</mtext></mrow></msup></mrow></math><img file="EP1589712A2_D0072.tif" /></maths>

0078A Node B matrix generator 1205 generates a multi-cell preamble matrix <i>x</i>_<i>s</i> = <i>[x</i>^<i>(0)</i><i>x</i>^<i>(1)</i><i>]</i> by combining the two Node B preamble matrices from the preamble matrix generators 1201 and 1203 according to N_s (=2) from the Node B number decider 503.

0079FIG 13 illustrates an operation of the preamble matrix generator 701 for Node B #0 when A=128, N=4, and L=16. Referring to FIG 13, a 128-point IFFT 1301 generates a time-domain signal x<maths id="math0073"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0073.tif" /></maths> by IFFT-processing a preamble signal <i>X</i><maths id="math0074"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0074.tif" /></maths> for transmit antenna #0. <i>x</i><maths id="math0075"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0075.tif" /></maths> is input to a preamble matrix generator 1325 for antenna #0 and cyclic shifters 1307 to 1311. The cyclic shifters 1307 to 1311 are used to acquire multi-path signals, not including a signal from the earliest path. Accordingly, the number of the cyclic shifters is less than L by 1. The multi-path signals can be acquired simultaneously using a plurality of cyclic shifters as in this case, or can be sequentially acquired using a single cyclic shifter, changing the number of shifts.

0080The cyclic shifter 1307 cyclically shifts x<maths id="math0076"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0076.tif" /></maths> once and outputs the resulting signal <i>x</i><maths id="math0077"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0077.tif" /></maths> to the preamble matrix generator 1325 for antenna #0. The cyclic shifter 1309 cyclically shifts <i>x</i><maths id="math0078"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0078.tif" /></maths> twice and outputs the resulting signal <i>x</i><maths id="math0079"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,2</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0079.tif" /></maths> to the preamble matrix generator 1325 for antenna #0. Finally, the cyclic shifter 1311 cyclically shifts <i>x</i><maths id="math0080"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0080.tif" /></maths> 15 times and outputs the resulting signal <i>x</i><maths id="math0081"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,15</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0081.tif" /></maths> to the preamble matrix generator 1325 for antenna #0.

0081The preamble matrix generator 1325 for antenna #0 generates a preamble matrix for antenna #0, <i>x</i><maths id="math0082"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0082.tif" /></maths> = <i>[x</i><maths id="math0083"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0083.tif" /></maths><i>x</i><maths id="math0084"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0084.tif" /></maths> ... <i>x</i><maths id="math0085"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,15</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0085.tif" /></maths><i>]</i> by combining the outputs of the IFFT processor 1301 and the cyclic shifters 1307 to 1311. The preamble matrix for antenna #0 is shown in Equation (8).<maths id="math0086"><img file="EP1589712A2_D0086.tif" /></maths>

0082Similarly, a preamble matrix generator 1327 for antenna #1 generates a preamble matrix for antenna #1, <i>x</i><maths id="math0087"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0087.tif" /></maths><i>=[x</i><maths id="math0088"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">1,1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0088.tif" /></maths><i>x</i><maths id="math0089"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">1,1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0089.tif" /></maths>... <i>x</i><maths id="math0090"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">1,15</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0090.tif" /></maths><i>]</i>, a preamble matrix generator for antenna #2 (not shown) generates a preamble matrix for antenna #2, <i>x</i><maths id="math0091"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">2</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0091.tif" /></maths> = <i>[x</i><maths id="math0092"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">2,0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0092.tif" /></maths><i>x</i><maths id="math0093"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">2,1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0093.tif" /></maths> ... <i>x</i><maths id="math0094"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">2,15</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0094.tif" /></maths><i>]</i>, and a preamble matrix generator 1305 for antenna #3 generates a preamble matrix for antenna #3, <i>x</i><maths id="math0095"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">3</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0095.tif" /></maths>= <i>[x</i><maths id="math0096"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">3,1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0096.tif" /></maths><i>x</i><maths id="math0097"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">3,1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0097.tif" /></maths> ... <i>x</i><maths id="math0098"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">3,15</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0098.tif" /></maths><i>]</i>.

0083An antenna preamble matrix combiner 1331 generates a preamble matrix for Node B #0, <i>x</i>⁽⁰⁾<i>= [x</i><maths id="math0099"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0099.tif" /></maths><i>x</i><maths id="math0100"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">1</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0100.tif" /></maths><i>x</i><maths id="math0101"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">2</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0101.tif" /></maths><i>x</i><maths id="math0102"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">3</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0102.tif" /></maths><i>]</i> by combining the four antenna preamble matrices received from the four antenna preamble matrix generators 1325 to 1329. The preamble matrix generators 703 to 709 for the other Node Bs, as illustrated in FIG 7, generate preamble matrices for the respective Node Bs in the same manner. Accordingly, multi-path propagation is considered in generating a preamble matrix for a Node B.

0084FIG. 14 is a flowchart illustrating an operation of a transmitter using N transmit antennas in the OFDM communication system according to an embodiment of the present invention. Referring to FIG 14, the transmitter generates B×N symbols to be transmitted through N transmit antennas, and generates N data signals by encoding the BxN symbols in a predetermined coding method in step 1403. The B×N symbols are signals produced by coding and modulating an information bit stream in a predetermined coding and modulation scheme.

0085In step 1405, the transmitter determines if it is time to transmit preamble sequences. If it is time to transmit preamble sequences, the transmitter selects N predetermined preamble sequences between the N data signals and the N preamble sequences. However, if it is not time to transmit preamble sequences, the transmitter selects the N data signals in step 1409.

0086In steps 1411 and 1413, the transmitter transmits the N data signals or the N preamble signals through the N antennas. More specifically, the transmitter IFFT-processes a signal to be transmitted through antenna #0, serial converts the IFFT signals, converts the serial signal to an analog signal, RF-processes the analog signal, and transmits the RF signal through antenna #0. Additionally, the transmitter IFFT-processes a signal to be transmitted through antenna #1, serial converts the IFFT signals, converts the serial signal to an analog signal, RF-processes the analog signal, and transmits the RF signal through antenna #1. Accordingly, the transmitter IFFT-processes each of signals to be transmitted through the N respective antennas, serial converts the IFFT signals, converts the serial signal to an analog signal, RF-processes the analog signal, and transmits the RF signal through a corresponding antenna.

0087FIG. 15 is a flowchart illustrating an operation of a receiver using M receive antennas in an OFDM communication system according to an embodiment of the present invention. Referring to FIG 15, the receiver acquires M time-domain input signals by RF-processing a signal received through the M antennas, converting it to a digital signal, and parallel converting the digital signal in step 1503.

0088In step 1505, the receiver determines if it is time to receive preamble signals. If it is time to receive the preamble sequences, the receiver performs a multi-cell channel estimation on the M input signals. The resulting channel estimates are provided to the equalizers for the respective antennas, for use in demodulating the input signals.

0089However, if it is not time to receive the preamble sequences, the receiver FFT-processes the M input signals, channel-compensates the FFT signals with the channel estimates, and decodes the M channel-compensated signals in a predetermined method, thereby producing one signal stream in step 1509. The receiver then recovers the original information bit stream by serializing the antenna signal and demodulating the serial signal.

0090FIG 16 is a detailed flowchart illustrating a multi-cell estimation step 1507 as illustrated in FIG. 15. Referring to FIG 16, the receiver calculates a maximum number of accommodatable Node Bs, N_s, selects N_s preamble matrices according to reception power among known preamble matrices of a serving Node B and its neighboring Node Bs, and generates a multi-cell preamble matrix x_s using the N_s preamble matrices in step 1603.

0091In step 1605, the receiver calculates the pseudo-inverse of x_s, (x<maths id="math0103"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">H</mtext></mrow><mrow><mtext mathvariant="italic">s</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0103.tif" /></maths><i>x</i>_<i>s</i>)^-1<i>x</i><maths id="math0104"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">H</mtext></mrow><mrow><mtext mathvariant="italic">s</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0104.tif" /></maths>. The receiver generates a received signal matrix y by combining M signals received through the M antennas, y₀, y₁ ... y_M-1 in step 1607.

0092In step 1609, the receiver multiplies y by <i>(x</i><maths id="math0105"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">H</mtext></mrow><mrow><mtext mathvariant="italic">s</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0105.tif" /></maths><i>x</i>_<i>s</i><i>)</i>^-1<i>x</i><maths id="math0106"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">H</mtext></mrow><mrow><mtext mathvariant="italic">s</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0106.tif" /></maths><i>,</i> thereby producing a channel estimate <i>ĥ</i>. The receiver obtains a frequency-domain channel estimate <i>Ĥ</i> by A-point FFT-processing <i>ĥ</i> in step 1611.

0093FIG. 17 is a detailed flowchart illustrating a multi-cell preamble matrix generation step 1603 as illustrated in FIG. 16. Referring to FIG 17, in step 1703, the receiver generates a preamble matrix for Node B #0, x⁽⁰⁾ using known frequency-domain preamble information associated with Node B #0. Accordingly, the receiver generates time-domain preamble matrices for Node Bs #1 to #(N_B-1).

0094In step 1705, the receiver selects N_S Node B preamble matrices according to reception power among the N_B Node B preamble matrices, and generates the multi-cell preamble matrix x_s.

0095FIG. 18 is a detailed flowchart illustrating a Node B preamble matrix generation step 1703 as illustrated in FIG 17. Referring to FIG. 18, in step 1803, the receiver generates a time-domain signal <i>x</i><maths id="math0107"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0107.tif" /></maths> by IFFT-processing a known preamble signal <i>X</i><maths id="math0108"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0108.tif" /></maths> for transmit antenna #0 and then generates (L-1) time-domain signals by cyclically shifting <i>x</i><maths id="math0109"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext mathvariant="italic">0,0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0109.tif" /></maths> once to (L-1) times. In step 1805, the receiver generates a preamble matrix for Node B #0 by combining <i>x</i><maths id="math0110"><math display="inline"><mrow><mfrac linethickness="0"><mrow><mtext mathvariant="italic">(0)</mtext></mrow><mrow><mtext>0,0</mtext></mrow></mfrac></mrow></math><img file="EP1589712A2_D0110.tif" /></maths> with the (L-1) cyclically-shifted signals. Similarly, preamble matrices are generated for the other Node Bs.

0096Now the performance of the multi-cell channel estimator according to the present invention will be evaluated in the following graphical representations.

0097FIG. 19 is a graph illustrating a comparison in performance between an SCMLE (Single Cell Maximum Likelihood Estimator) and an MCMLE (Multi-Cell Maximum Likelihood Estimator) according to the total number of a serving Node B and its neighboring Node Bs. The SCMLE represents a single cell maximum likelihood estimator, as conventionally used, and the MCMLE represents a multi-cell maximum likelihood estimator. The performance of the MCMLE according to the present invention is evaluated in a system using 128 subcarriers, when the number of Node Bs varies from 1 to 2 and 4.

0098As noted from FIG. 19, when preambles are generated in the procedures described with reference to FIGs. 3 and 4, i.e., when orthogonal preambles are used, the SCMLE and the MCMLE both perform equally. Given non-orthogonal preambles, performance degradation is observed as the number of Node Bs increases. For the conventional SCMLE, severe inter-cellular interference significantly increases MSE (Mean Squared Error), whereas the MCMLE has the same performance despite the increase of inter-cellular interference. However, a different tendency will be shown if N_B is less than N_s.

0099FIG 20 is a graph illustrating another comparison in performance between the SCMLE and the MCMLE according to the total number of a serving Node B and its neighboring Node Bs. In FIG. 20, the number of accommodatable Node Bs is 4, which is less than that of a serving Node B and its neighboring Node Bs, which is 6. Four of six preambles are orthogonal and the other two preambles are non-orthogonal, thereby causing interference. As illustrated in FIG 20, the SCMLE significantly suffers from the interference, while the MCMLE outperforms the SCMLE.

0100In accordance with the present invention as described above, the use of a multi-cell estimation method, which removes inter-cellular interference, enables more accurate channel estimation and increases data demodulation performance as well in an OFDM communication system.

0101While the present invention has been shown and described with reference to certain preferred embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.