The present application is related to Chinese Patent Application No. 200610066561.7, filed Apr. 3, 2006, entitled “EQUALIZER-BASED RECEIVER FOR ELIMINATING TRAINING SEQUENCE INTERFERENCE IN A TIME-DIVISION DUPLEX (TDD) COMMUNICATION SYSTEM”. Chinese Patent Application No. 200610066561.7 is assigned to the assignee of the present application and is hereby incorporated by reference into the present disclosure as if fully set forth herein. The present application hereby claims priority under 35 U.S.C. §119(a) to Chinese Patent Application No. 200610066561.7.
The present disclosure relates to time-division duplex (TDD) based communication systems, and particularly to systems and methods for eliminating training sequence interference.
The pulse-shaped signal is transmitted to a channel 12, which could be wired or wireless. The channel 12 has a fading component as well as a noise component. The fading component hw normally introduces a time delay of W chips, whilst the noise component n could be modeled as additive white Gaussian noise (AWGN). A typical fading scenario that causes delay spread is multi-path fading. Due to the effect of delay, inter-symbol interference (ISI) exists in the received signal.
In the receiver, a similar RRC filter 13 is used to match the transmitter RRC filter 11. The filtered signal e is passed to an equalizer 14 to remove the ISI effects. Channel estimates ĥw are provided by a channel estimation unit 15.
As an example of a TDD system, an LCR-TDD system uses a frame length of 10 ms, and each 10 ms frame is divided into two sub-frames of 5 ms. Each sub-frame 200 includes seven normal time slots (see
As shown in
a)-(b) illustrate plots 400a, 400b and 400c the effect of fading on the received signal.
As an example of training sequence interference in a TDD system, midamble interference is discussed as follows. An LCR TD-SCDMA timeslot 500 is shown as
The midamble interference 502a on the first data part 504a can be written as:
I1=H1M1 (Eqn. 1)
In Equation 1, H1 is a matrix consisting of the elements of the channel impulse response estimation, with dimension (W−1)×(W−1). H1=H1(i, j) can be written as:
In Equation 2, h(i−j), 0=<i−j<=W−1 is the estimation of channel impulse response and M1=[m(0), m(1), . . . m(W−2)]T is a vector with dimension W−1, and m(i) (0=<i<=W−2) is the elements of midambles.
The midamble interference 502b on the second data part 504b could be written as shown in Equation 3 below.
I2=H2M2 (Eqn. 3)
In Equation 3, H2 is a matrix consisting of the elements of the channel impulse response estimation, with dimension (W−1)×(W−1). H2=H2(i, j) could be written as shown in Equation 4 below.
For the last W−1 chips of block E1 could be written as shown in Equation 5 below.
E1=H1*D+I1+n (Eqn. 5)
The four W−1 chips of block E2 can be written as shown in Equation 6 below.
E2=H2*D2+I2+n (Eqn. 6)
In Equation 6, D is the transmitted data, and n is white noise. If I1 and I2 are ignored, the error probability will increase for the last W−1 chips of estimated data block {circumflex over (d)}1 and the first W−1 chips of the estimated data block {circumflex over (d)}2.
A conventional equalizer could reduce the degrading effect of ISI. The equalizer is supplied with an estimate of the channel impulse response ĥw associated with the propagation channel.
In the downlink, all signals are distorted by the same propagation channel. This multi-path propagation channel destroys the orthogonality of the spreading codes and therefore causes multiple-access interference (MAI). To a large extent, the orthogonality of user codes can be restored and MAI can be suppressed by employing channel equalization.
The structure of the conventional equalizer 14 for the downlink is shown in
Assuming the channel equalizer is linear and can be represented by the estimation matrix Â, which is independent of user codes, the estimate of the sum vector for data Ŝd could be written as shown in Equation 7 below.
Ŝd=Âe (Eqn. 7)
The choice of  determines the channel equalizer types. Three most common types are listed below as Equations 8-10.
Matched filtering: ŜMF=HH*e (Eqn. 8)
Zero forcing: ŜZD=(HH*H)−1HH*e (Eqn. 9)
Minimum mean square error: ŜMMSE=(HH*H+σ2)−1 HH*e (Eqn. 10)
In order to avoid complex receiver processing tasks such as Cholesky decomposition for solving matrix inversions, channel equalization can be performed efficiently in the frequency domain using fast Fourier transform (FFT) as follows
In Equations 11-13, F denotes the FFT, F−1 is the inverse FFT and * denotes the complex conjugate.
A conventional equalizer with MIC (midamble interference cancellation) 700 is depicted in
Before equalizing, midamble interference cancellation is performed, that is
E1′=E1−I1 (Eqn. 14)
E2′=E2−I2 (Eqn. 15)
Under the condition of beam forming, there are different channels corresponding to different users. At most, there are 16 different radio channels. In this case, the above MIC operation has to be executed 16 times, which will cost around 2-3 million instructions per second (MIPS) in a typical dual-MAC DSP. In addition, since channel estimation is used for assisting MIC, errors in channel estimation will propagate into errors in MIC, thus, introducing additional error into the whole system.
The following documents are incorporated herein by reference:
There is therefore a need for improved systems and methods to provide a low-complexity, high performance solution that can remove training sequence interference in TDD communication system receivers.
One embodiment of the present disclosure is to provide a new method for eliminating training sequence (or pilot or training sequence or any other known sequence) interference in an equalizer-based receiver in a TDD-based communication system.
In one embodiment, the present disclosure provides a a method for eliminating training sequence interference in a time-division duplex (TDD) communication system for use in a communication receiver. The method includes receiving a signal having a training sequence and a data block. The method also includes extracting from the received signal data that includes a desired data portion of the received training sequence. The portion of the training sequence adjacently neighbors the desired data portion and has a length commensurate with a delay spread associated with the training sequence interference. The desired data portion having a length commensurate with a length of the data block combined with the delay spread. The method also includes obtaining a channel estimation based on the training sequence and equalizing the extracted data based on the channel estimation to produce equalized data. The method further includes obtaining desired data by discarding a portion of the equalized data, the discarded portion corresponding to the portion of the received training sequence and having a length commensurate with the delay spread.
In another embodiment, the present disclosure provides a communication receiver. The receiver includes an input to receive a signal having a training sequence and a data block. The receiver also includes a data extracting unit coupled to the input and to extract a desired data portion and a portion of the training sequence from the received signal. The portion of the training sequence adjacently neighbors the desired data portion and has a length commensurate with a delay spread associated with training sequence interference data. The desired data portion comprises a length commensurate with a length of the data block combined with the delay spread. The receiver includes a channel estimation unit coupled to the input to obtain a channel estimation based on the training sequence. The receiver also includes an equalizing unit coupled to the data extracting unit and the channel estimation unit to equalize the extracted data based on the channel estimation to produce equalized data. The receiver could further include a data obtaining unit coupled to the equalizing unit for obtaining desired data by discarding a portion of the equalized data. The discarded portion corresponds to the portion of the training sequence and has a length commensurate with the delay spread.
In still another embodiment, the present disclosure provides a communication receiver for use in a time-division duplex (TDD) communication system. The receiver includes a input to receive a signal having a training sequence and a data block. The receiver also includes a data extracting unit coupled to the input and configured to extract a desired data portion and a portion of the training sequence from the received signal. The receiver further includes a channel estimation unit coupled to the input to obtain a channel estimation based on the training sequence. The receiver could also include an equalizing unit coupled to the data extracting unit and the channel estimation unit to equalize the extracted data based on the channel estimation to produce equalized data. The receiver could still further include a data obtaining unit coupled to the equalizing unit for obtaining desired data by discarding a portion of the equalized data, wherein the discarded portion corresponds to the portion of the training sequence and has a length commensurate with the delay spread.
Other technical features may be readily apparent to one skilled in the art from the following figures, descriptions and claims.
For a more complete understanding of this disclosure and its features, reference is now made to the following description, taken in conjunction with the accompanying drawings, in which:
a)-(b) illustrate the effect of fading on the received signal of
a) shows a band-limited pulse having zeros periodically spaced in time;
b) shows the case of having zeros crossing that are no longer periodically spaced;
c) illustrates the output of the equalizer of
Although an LCR-TDD system is used herein for exposition of exemplary applications of the present disclosure, an embodiment of the present disclosure is applicable to all TDD-based systems that use a training sequence (or pilot or any other known sequence) and an equalizer at the receiver. One embodiment of the present disclosure is also applicable to any other channel scenario that could introduce delay spread from the training sequence to the received signal.
Taking the above midamble interference as example, the last W−1 chips of E1 and the first W−1 chips of E2 could be shown by Equation 16 below.
E=H*D+I
m
+n (Eqn. 16)
In Equation 16, D is the transmitted data, Im is interference of midamble and n is the white noise. If only D and n are considered, ignoring the influence of Im, the bit error rate will increase for the last W−1 chips of the estimated block {circumflex over (d)}1 and the first W−1 chips of the estimated block {circumflex over (d)}2. However, the channel length is finite (W chips), that is to say, midamble interference only affects the last W−1 chips of the first desired data portion (associated with E1) and the first W−1 chips of the second desired data portion (associated with E2). Additional (W−1) chips of neighboring midamble are therefore added to the tail of the first desired data portion and to the head of the second desired data portion, and all data then passes directly to the equalizer without doing MIC. After equalizing, there are 352+(W−1) chips of {circumflex over (d)}1 corresponding to E1, and 352+(W−1) chips of {circumflex over (d)}2 corresponding to E2. Without MIC, the last (W−1) chips of {circumflex over (d)}1 and the first (W−1) chips of {circumflex over (d)}2 may be inaccurate. These parts are not wanted anyway, and can thus be discarded. The rest of {circumflex over (d)}1 and {circumflex over (d)}2 are sent to the match filter.
In one embodiment, instead of passing the conventional 352+(W−1) chips data to the equalizer, 352+(W−1)*2 data chips from the input signals are extracted and sent to the equalizer as seen in
In the conventional equalizer with MIC, 352+W−1 chips1 data are fed into, MIC, then padded with zeros for equalizing (FFTs) (see
According to one embodiment of the present disclosure, neighboring parts of midamble are appended the tail of E1 and to the head of E2 respectively. These data feed into the equalizer (FFTs) block directly (see
At the output of the equalizer, only the useful 352 data chips are used for the de-spreading process. The excess midamble data chips are discarded. In the prior art equalizer with MIC, the midamble interference is eliminated by MIC before the data chips are passed to the equalizer. In contrast, one embodiment of the present disclosure equalizes, without MIC, appending neighbouring midamble chips to the data, so the midamble interference will be present outside the desired data range. Note that one embodiment of the present disclosure need not increase any complexity of the equalizer.
Based on arguments above, the simplified receiver structure 1000 is designed as shown in
Since equalizing is done using the FFT, the effects of using various FFT lengths can be compared to the conventional equalizer with MIC As the length of each data part (E1 or E2) is 352 and the delay spread is W, the minimum FFT lengths required are 352·+W and 352+2*W points, respectively for the conventional and the inventive methods. In order to achieve the same performance, overlaps of a length W are needed when using FFT with a length lower than the minimum required lengths as depicted in relationship 1100
Conventional: n*1−(n−1)*W≧352+W (Eqn. 17)
Present Disclosure: n*1−(n−1)*W≧352+2*W (Eqn. 18)
In these equations, n is the number of FFTs required for each received data block and l is the length of the FFT. Re-arranging Equations 16 and 17, Equation 18 below results.
Conventional:
Present Disclosure
Table 1 shows the number of FFTs required for both the conventional and inventive methods based on Equations 19 and 20 for a typical value of W=16. It can be seen that there is no increased complexity in the FFT using a method according to one embodiment of the present disclosure.
Exemplary simulation results are presented in
The simulation results indicate that under the case when the multi-path delay is very large (case 2), the performance of the conventional equalizer without MIC degrades. However, the performance of the inventive equalizer structure (without MIC) is the same as the conventional equalizer with MIC.
Accordingly, embodiments of the present disclosure are very reliable and stable. In all test cases the performance is the same as the conventional equalizer with MIC.
Exemplary embodiments of the present disclosure are readily implemented, with respect to conventional systems, and can achieve better performance. In an LCR-TDD system, there is no additional memory cost and MIPS cost compared with the conventional equalizer. Moreover, when comparing with the conventional equalizer combined with MIC, about 0.5k words memory cost and 2-3 MIPS cost are saved, without performance degradation.
Exemplary embodiments of the present disclosure are very robust. Under the test conditions specified in 3GPP, the performance of the exemplary embodiments is the same as that of the conventional equalizer with MIC. The conventional equalizer receiver with MIC is affected directly by errors from channel estimation while the exemplary embodiments simplified architecture is less prone to such errors.
Accordingly, exemplary embodiments of the present disclosure could avoid training sequence interference without using interference cancellation, by providing to the equalizer both the desired data portion of the received signal, and a portion of the training sequence that is adjacent the desired data portion and has a length commensurate with the delay spread associated with the training sequence interference. The portion of the equalizer output that corresponds to the adjacent sequence portion can be discarded, while retaining the desired equalized data.
It may be advantageous to set forth definitions of certain words and phrases used in this patent document. The term “couple” and its derivatives refer to any direct or indirect communication between two or more elements, whether or not those elements are in physical contact with one another. The terms “include” and “comprise,” as well as derivatives thereof, mean inclusion without limitation. The term “or” is inclusive, meaning and/or. The phrases “associated with” and “associated therewith,” as well as derivatives thereof, may mean to include, be included within, interconnect with, contain, be contained within, connect to or with, couple to or with, be communicable with, cooperate with, interleave, juxtapose, be proximate to, be bound to or with, have, have a property of, or the like.
While this disclosure has described certain embodiments and generally associated methods, alterations and permutations of these embodiments and methods will be apparent to those skilled in the art. Accordingly, the above description of example embodiments does not define or constrain this disclosure. Other changes, substitutions, and alterations are also possible without departing from the spirit and scope of this disclosure, as defined by the following claims.
Number | Date | Country | Kind |
---|---|---|---|
200610066561.7 | Apr 2006 | CN | national |