WO2009122136A1 - Channel estimates - Google Patents

Channel estimates Download PDF

Info

Publication number
WO2009122136A1
WO2009122136A1 PCT/GB2009/000781 GB2009000781W WO2009122136A1 WO 2009122136 A1 WO2009122136 A1 WO 2009122136A1 GB 2009000781 W GB2009000781 W GB 2009000781W WO 2009122136 A1 WO2009122136 A1 WO 2009122136A1
Authority
WO
WIPO (PCT)
Prior art keywords
transceiver
channel
estimate
correlation
receiver
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/GB2009/000781
Other languages
French (fr)
Inventor
Michael Robert Fitch
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
British Telecommunications PLC
Original Assignee
British Telecommunications PLC
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by British Telecommunications PLC filed Critical British Telecommunications PLC
Publication of WO2009122136A1 publication Critical patent/WO2009122136A1/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/0413MIMO systems
    • H04B7/0417Feedback systems

Definitions

  • This invention relates to communicating channel estimates, and specifically to determining when to transmit a channel estimate.
  • MIMO multiple ways in which MIMO can be implemented, but two general categories can be distinguished.
  • the transmitter uses no knowledge of the channel in determining what signals to transmit via which antennas.
  • This type of system is called open-loop MIMO.
  • open-loop MIMO the transmitter typically transmits equal energy from each antenna element and applies symbol coding that is resilient to any channel conditions.
  • symbol coding is the Alamouti coding specified by the WiMAX forum.
  • the transmitter uses knowledge of the channel to determine what signals to transmit via which antennas. That knowledge is gained through feedback from the receiver.
  • This type of system is called closed-loop
  • the transmitter can use algorithms to set energy allocation and coding across the antennas in dependence on its knowledge of the channel. This can increase capacity and/or signal to interference ratio. However, in order to achieve these gains it is necessary for the receiver to feed back information about the channel. That feedback uses some capacity, and so there is a need to balance the gains obtained from more detailed channel knowledge against the capacity overhead that is lost to sending channel feedback information.
  • the 3GPP (Third Generation Partnership Project) have adopted a code-book method in their LTE (long term evolution) system.
  • LTE long term evolution
  • a label is sent to the transmitter from which the transmitter can look up the multi- path matrix that most closely resembles the channel, similar to items in a catalogue.
  • this system is restrictive to a certain number of channel types and is far from optimum. (See “Grassmannian Beamforming for MIMO Wireless Systems" by David Love for a general discussion of code-book methods).
  • Another approach to reducing the bandwidth needed to provide channel feedback information is to assess the channel periodically at the receiver and to send back to the transmitter a channel condition number (see for example "Switching Between Diversity and Multiplexing in MIMO systems” by Heath and Paulraj, 2005).
  • a transceiver for operation in a spatial multiplexing antenna communication system, the receiver comprising signal processing equipment configured to: form a channel estimate for a channel between the transceiver and a second transceiver; form an estimate of the correlation between paths of the channel; determine in dependence on the estimated path correlation whether to transmit data indicating that estimate to the second transceiver; and cause the transceiver to transmit data indicating that estimate to the second transceiver only if the said determination is positive.
  • a method for controlling a transceiver for operation in a spatial multiplexing antenna communication system comprising: forming a channel estimate for a channel between the transceiver and a second transceiver; forming an estimate of the correlation between paths of the channel; determining in dependence on the estimated correlation whether to transmit data indicating that estimate to the second transceiver; and transmitting data indicating that estimate to the second transceiver only if the said determination is positive.
  • the path correlation of the channel may be estimated in dependence on the ratio of (i) the product of a first instantaneous correlation matrix for a plurality of subcarriers at a first time and a second instantaneous correlation matrix for the plurality of subcarriers at a second time to (ii) the product of a normalised value of the first instantaneous correlation matrix and a normalised value of the second instantaneous correlation matrix.
  • the instantaneous correlation matrix may be determined as:
  • the transceiver may be arranged to determine that data indicating the channel estimate should be transmitted if the path correlation exceeds a predetermined threshold.
  • the transceiver may be a MIMO transceiver and/or an ODFM transceiver.
  • the transceiver may be configured to determine when to form the channel estimate in dependence on the frequency with which channel estimates have previously been transmitted to the second transceiver.
  • the said data indicating the channel estimate may be data expressing the change in the channel estimate since it was last transmitted to the second transceiver.
  • Figure 1 is a schematic diagram of a communication system
  • Figure 2 illustrates a comparison of the BER performance for SVD with and without water-filling
  • FIG. 3 illustrates change of correlation metric distance (CMD) with time samples
  • Figure 4 illustrates an algorithm for determining when to update a transmitter with channel information.
  • the system of figure 1 is a MIMO system whose receiver employs an algorithm to determine when to feed back channel information.
  • the algorithm involves estimating the path correlation of the channel, and determining when to feed back channel information in dependence on the estimated path correlation of the channel.
  • the path correlation of the channel may be estimated using the correlation matrix distance.
  • Figure 1 shows a spatial multiplexing antenna system in which the present approach can be used.
  • the system comprises a transmitter 1 and a receiver 2.
  • the transmitter and receiver are preferably MIMO arrangements.
  • the transmitter and the receiver each have multiple antenna elements 101 , 102, 201 , 202, so there are four communication channels between them: 11 to 201 , 101 to 202, 102 to 201 and 102 to 202.
  • the transmitter has a baseband processor section 103 which receives traffic data for transmission and generates symbols for transmission by each antenna, and two analogue transmit chains 104, 105 which comprise mixers 106, 107 for upconverting those signals to radio frequency and amplifiers 108, 109 for amplifying the upconverted signals to drive a respective one of the antennas.
  • the receiver has analogue receive chains 203, 204 which comprise amplifiers 205, 206 for amplifying signals received at a respective one of the antennas, mixers 207, 208 for downconverting the amplified signals and analogue-to-digital converters 209, 210 for digitising the downconverted signals to provide an input to baseband processor section 211.
  • the receiver 2 can also provide feedback to the transmitter 1 , and the transmitter 1 can receive that feedback.
  • the receiver 2 has transmit chains 212, 213 which are analogous to those of the transmitter 1
  • the transmitter 1 has receive chains 110, 111 which are analogous to those of the receiver 2.
  • the description below will discuss the feedback of channel estimates from receiver 2 to transmitter 1 , but similar principles could be used to govern the feeding back of channel estimates from transmitter 1 to receiver 2 for use in optimising subsequent transmissions by the receiver 2.
  • the baseband processing sections 103, 211 comprise processors 112, 214. Each processor executes instructions stored in an associated memory 113, 215 in order to perform its functions.
  • the transmitter and receiver operate according to an OFDM (orthogonal frequency division multiplexing) protocol.
  • the receiver 2 can estimate the channels between the transmitter and itself by means of the processing section 211. These estimates are known as ⁇ .
  • the receiver can send messages to the transmitter to update the transmitter's knowledge of the receiver's estimates.
  • the receiver does not feed back H at pre-determined intervals. Instead, it decides when to feed back H based on current channel conditions.
  • the information in the feedback messages may take various forms.
  • Three example forms of the feedback are changes in H (or ⁇ H ), codebook labels or the eigenvectors from singular value decomposition (SVD).
  • the receiver sends changes in H back to the transmitter, and the consequent SVD is performed at both the transmitter and the receiver.
  • this approach could require extra processing, it is typically more efficient overall to send back the changes in H rather than to send H itself.
  • the full H is also sent from time to time.
  • the channel model used in the simulations is based on the ITU channel B Pedestrian 6-tap model (see ITU-R Recommendation M.1225. "Guidelines for Evaluation of Radio Transmission Technologies for IMT-2000,” 1997. Page 28) which has been modified for MIMO use based on correlation methods from Ericsson, "MIMO Channel model for TWG RCT ad-hoc proposal," V16, 2006 and using antenna and angle spread parameters taken from the 3GPP spatial channel model (SCM) (see 3GPP, "Spatial channel model for MIMO simulations” TR 25.996 V 6.1.0 (2003-09), Technical Report. [Online]. Available: http://www.3gpp.org/).
  • SCM 3GPP spatial channel model
  • the Pedestrian B channel was chosen because it is the most demanding of the ITU channel models in terms of bit error rate (BER) performance against signal to noise ratio (SNR). This is caused by one of the taps being comparable in size to the initial signal resulting in very deep fast fading.
  • BER bit error rate
  • SNR signal to noise ratio
  • STBC space-time block coding
  • the channel model used in the present simulations generates any required number of H MIMO channel matrices and is 'non-physical' in the sense that the path is treated as baseband from the transmitter to receiver, including the correlation of the antennas.
  • This dependency on the antennas is slightly restrictive but leads to a much simpler model than ray-tracing or geometrical methods.
  • the restriction is not considered important since potentially typical antenna configurations of 4 ⁇ spacing at the transmitter (assumed to be a base-station) and ⁇ /2 at the receiver (assumed to be a user terminal) are used.
  • R MIM0 represents the spatial correlation matrix for all the MIMO channels, which can be split into correlation seen at the transmitter end from that at the receiver end by the Kronecker function: which carries the assumption that each transmitter antenna element identically illuminates every element in the receiver array.
  • the R 3x and R ⁇ have the following elements:
  • N R ⁇ N ⁇ matrix G is comprised of i.i.d.
  • the channel matrices H delivered by the model are 4 dimensional, the first two dimensions containing the index of receiver and transmitter antennas and the third and fourth dimensions containing the tap index and time samples of the channel impulse response respectively.
  • the receiver estimates the channel and sends updates on the channel state to the transmitter.
  • the transmitter uses these updates to choose the most appropriate transmission scheme.
  • CSI perfect channel state information
  • the MIMO channels on each subcarrier can be decomposed into parallel non-interfering sub-channels using the singular value decomposition (SVD).
  • SVD singular value decomposition
  • the transmitter can allocate the total available power across all the sub-channels for all the subcarriers since it has the CSI.
  • the optimal power allocation can be obtained by using the water-filling algorithm (see M. A. Khalighi, J. -M. Brassier, G. Jourdain, and K. Raoof, "Water filling Capacity of Rayleigh MIMO channels," IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, vol. 1 , pp. 155-158, 2001 and I. E. Telatar, "Capacity of multi-antenna Gaussian channels," Europ. Trans. Telecommun., vol. 10, no. 6, pp. 585-595, Nov.-Dec. 1999).
  • the simulations are done in a 2x2 MIMO-OFDM system with a FFT size of 256 for a speed of 3 km/hr for independently Rayleigh fading channels.
  • the water-filling algorithm gives greatest benefit at low SNRs. At high SNR the water-filling algorithm almost indentically allocates power on the sub-channels and hence the curves converge. This emphasises that CSI feedback from the receiver to transmitter is of significant value.
  • the CSI at the transmitter will be delayed by an amount that depends upon the system protocols.
  • the received signal will be, from (5) and (7), where the t x is a time sample in the past. Simulations having a bearing on the selection of the maximum interval between t n and t ⁇ will now be described.
  • H(f) i.e. ⁇ H(f)
  • Table 1 shows the number of bits that must be sent back for each real and imaginary part of every element for the ITU-B Pedestrian model at various speeds for the 2x2 system.
  • the quantisation bits are composed of 1 sign bit to denote whether the change is increasing or decreasing, and the other bits to denote the changes in the absolute values.
  • the metric used to control the feedback interval will be referred to as the correlation matrix distance (CMD) metric.
  • CMD correlation matrix distance
  • the receiver calculates the correlation matrix R, which contains the total correlation including the antennas.
  • the receiver knows the antenna correlations and so can deduce the channel path correlation.
  • the intervals at which the receiver calculates the path correlation is adapted to the rate of change of the channel, in the example below.it is set to 500 symbols which is suitable for a user moving at 10km / hr.
  • R,.(/,,) (vec(H(f),.(/ n ))vec(H(f)f ( ⁇ )) ⁇ for the ⁇ th subcarrier and at the f n thtime sample.
  • the CMD is introduced as a metric to measure the time variation of the spatial structure for narrowband MIMO channels. The metric has been extended in H.
  • Figure 3 is a plot of CMD for the ITU-B Pedestrian model at 10km/hr for a 2x2 system with FFT size 256. It shows that, when the velocity is 10km/hr, for approximately 500 time samples, the MIMO channels approach the maximum probable correlation, thereby reducing the capacity, which suggests that this is the maximum time interval for this speed.
  • the threshold could be set at a value determined to be the maximum tolerable correlation between signal paths, so that an update is sent when that threshold is exceeded.
  • equation 9 gives one such method that directly computes it from the correlation matrix R. Another would be to detect symbol energy that crosses over from one path to another, which would require exhaustive correlation calculations across all the symbol streams.
  • the time variation could be determined in dependence on the ratio of (i) the product of a first instantaneous correlation matrix for a plurality of subcarriers at a first time and a second instantaneous correlation matrix for the plurality of subcarriers at a second time to (ii) the product of a normalised value of the first instantaneous correlation matrix and a normalised value of the second instantaneous correlation matrix.
  • CMD has advantages over other methods, such as computing the correlation across several symbol streams, in that it requires relatively little computational overhead.
  • whether to send an update to the transmitter is determined in dependence on the CMD (R1 ).
  • updating is performed if R1 deteriorates below a predetermined threshold (R2).
  • R2 a predetermined threshold
  • Figure 4 also illustrates that the interval at which R1 (and accordingly the underlying channel estimates) are calculated can be varied in dependence on the frequency with which updates are sent to the transmitter.
  • the receiver will periodically carry out the CMD calculations and decide whether to send feed-back based on whether the difference threshold is exceeded.
  • the receiver can alter the period between calculations adaptively, based on the amount by which the threshold is exceeded and on the threshold value history. This is the function carried out by the 'changes too frequent' box in figure 4.
  • the metrics described herein are independent of system type and can therefore be modified to fit with the protocol and frame structure of any adopting system.
  • WiMAX although a user terminal can decide when to send an update, the 802.16 protocol demands that the base-station has to allocate slots to transmit it and this process will add delay.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Radio Transmission System (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

A transceiver for operation in a spatial multiplexing antenna communication system, the receiver comprising signal processing equipment configured to: form a channel estimate for a channel between the transceiver and a second transceiver; form an estimate of the correlation between paths of the channel; determine in dependence on the estimated correlation whether to transmit data indicating that estimate to the second transceiver; and cause the transceiver to transmit data indicating that estimate to the second transceiver only if the said determination is positive.

Description

CHANNEL ESTIMATES
This invention relates to communicating channel estimates, and specifically to determining when to transmit a channel estimate.
Multiple element antennas have been the subject of intense research over the past few years as a way of increasing the coverage or capacity of a wireless link. (See "Introduction to Space-Time Wireless Communications" by Paulraj, Nabar and Gore). The generic case is where both the transmitter and receiver(s) on a link have multiple antenna elements all operating on the same radio channel and advantage is taken of the spatial and time differences between them (spatial multiplexing). This system is known as MIMO (multiple input, multiple output).
There are several ways in which MIMO can be implemented, but two general categories can be distinguished.
In a first type of system, the transmitter uses no knowledge of the channel in determining what signals to transmit via which antennas. This type of system is called open-loop MIMO. In open-loop MIMO the transmitter typically transmits equal energy from each antenna element and applies symbol coding that is resilient to any channel conditions. An example of such coding is the Alamouti coding specified by the WiMAX forum.
In a second type of system the transmitter uses knowledge of the channel to determine what signals to transmit via which antennas. That knowledge is gained through feedback from the receiver. This type of system is called closed-loop
MIMO. In a closed-loop MIMO system, the transmitter can use algorithms to set energy allocation and coding across the antennas in dependence on its knowledge of the channel. This can increase capacity and/or signal to interference ratio. However, in order to achieve these gains it is necessary for the receiver to feed back information about the channel. That feedback uses some capacity, and so there is a need to balance the gains obtained from more detailed channel knowledge against the capacity overhead that is lost to sending channel feedback information.
To address this balance, a considerable amount of research has looked for ways of maximising the coverage and capacity of closed-loop MIMO systems using a minimum of feedback. The problem with this approach is that the characteristics of the channel change when any part of the channel alters: for example when the transmitter or the receiver moves, or when an object moves in the propagation path. Therefore, when a minimum of feedback is employed the coverage and capacity are not increased greatly beyond open-loop conditions.
The 3GPP (Third Generation Partnership Project) have adopted a code-book method in their LTE (long term evolution) system. In the code-book system a label is sent to the transmitter from which the transmitter can look up the multi- path matrix that most closely resembles the channel, similar to items in a catalogue. However, this system is restrictive to a certain number of channel types and is far from optimum. (See "Grassmannian Beamforming for MIMO Wireless Systems" by David Love for a general discussion of code-book methods). Another approach to reducing the bandwidth needed to provide channel feedback information is to assess the channel periodically at the receiver and to send back to the transmitter a channel condition number (see for example "Switching Between Diversity and Multiplexing in MIMO systems" by Heath and Paulraj, 2005).
There is a need to improve the balance between gains that can be had from making use of channel information at a spatial multiplexing MIMO transmitter and the loss of bandwidth that results from feeding back channel information to the transmitter.
According to one aspect of the present invention there is provided a transceiver for operation in a spatial multiplexing antenna communication system, the receiver comprising signal processing equipment configured to: form a channel estimate for a channel between the transceiver and a second transceiver; form an estimate of the correlation between paths of the channel; determine in dependence on the estimated path correlation whether to transmit data indicating that estimate to the second transceiver; and cause the transceiver to transmit data indicating that estimate to the second transceiver only if the said determination is positive.
According to a second aspect of the invention there is provided a method for controlling a transceiver for operation in a spatial multiplexing antenna communication system, the method comprising: forming a channel estimate for a channel between the transceiver and a second transceiver; forming an estimate of the correlation between paths of the channel; determining in dependence on the estimated correlation whether to transmit data indicating that estimate to the second transceiver; and transmitting data indicating that estimate to the second transceiver only if the said determination is positive.
The path correlation of the channel may be estimated in dependence on the ratio of (i) the product of a first instantaneous correlation matrix for a plurality of subcarriers at a first time and a second instantaneous correlation matrix for the plurality of subcarriers at a second time to (ii) the product of a normalised value of the first instantaneous correlation matrix and a normalised value of the second instantaneous correlation matrix.
The instantaneous correlation matrix may be determined as:
R, (*„) = (vec(H(f),. (.„)) vec(H(f)? (*„))) for the zth subcarrier and at the /,,thtime sample, where H(f); is the frequency response of the channel corresponding to the /th subcarrier.
The transceiver may be arranged to determine that data indicating the channel estimate should be transmitted if the path correlation exceeds a predetermined threshold. The transceiver may be a MIMO transceiver and/or an ODFM transceiver.
The transceiver may be configured to determine when to form the channel estimate in dependence on the frequency with which channel estimates have previously been transmitted to the second transceiver.
The said data indicating the channel estimate may be data expressing the change in the channel estimate since it was last transmitted to the second transceiver.
The present invention will now be described by way of example with reference to the accompanying drawings. In the drawings:
Figure 1 is a schematic diagram of a communication system;
Figure 2 illustrates a comparison of the BER performance for SVD with and without water-filling;
Figure 3 illustrates change of correlation metric distance (CMD) with time samples;
Figure 4 illustrates an algorithm for determining when to update a transmitter with channel information.
The system of figure 1 is a MIMO system whose receiver employs an algorithm to determine when to feed back channel information. Broadly speaking, the algorithm involves estimating the path correlation of the channel, and determining when to feed back channel information in dependence on the estimated path correlation of the channel. For example, the path correlation of the channel may be estimated using the correlation matrix distance. Figure 1 shows a spatial multiplexing antenna system in which the present approach can be used. The system comprises a transmitter 1 and a receiver 2. The transmitter and receiver are preferably MIMO arrangements. The transmitter and the receiver each have multiple antenna elements 101 , 102, 201 , 202, so there are four communication channels between them: 11 to 201 , 101 to 202, 102 to 201 and 102 to 202. The transmitter has a baseband processor section 103 which receives traffic data for transmission and generates symbols for transmission by each antenna, and two analogue transmit chains 104, 105 which comprise mixers 106, 107 for upconverting those signals to radio frequency and amplifiers 108, 109 for amplifying the upconverted signals to drive a respective one of the antennas. The receiver has analogue receive chains 203, 204 which comprise amplifiers 205, 206 for amplifying signals received at a respective one of the antennas, mixers 207, 208 for downconverting the amplified signals and analogue-to-digital converters 209, 210 for digitising the downconverted signals to provide an input to baseband processor section 211.
The receiver 2 can also provide feedback to the transmitter 1 , and the transmitter 1 can receive that feedback. For this purpose, the receiver 2, has transmit chains 212, 213 which are analogous to those of the transmitter 1 , and the transmitter 1 has receive chains 110, 111 which are analogous to those of the receiver 2. The description below will discuss the feedback of channel estimates from receiver 2 to transmitter 1 , but similar principles could be used to govern the feeding back of channel estimates from transmitter 1 to receiver 2 for use in optimising subsequent transmissions by the receiver 2.
The baseband processing sections 103, 211 comprise processors 112, 214. Each processor executes instructions stored in an associated memory 113, 215 in order to perform its functions.
In this example the transmitter and receiver operate according to an OFDM (orthogonal frequency division multiplexing) protocol. As in other closed-loop MIMO-OFDM systems, the receiver 2 can estimate the channels between the transmitter and itself by means of the processing section 211. These estimates are known as ή. The receiver can send messages to the transmitter to update the transmitter's knowledge of the receiver's estimates. As indicated above, the receiver does not feed back H at pre-determined intervals. Instead, it decides when to feed back H based on current channel conditions.
The information in the feedback messages may take various forms. Three example forms of the feedback are changes in H (or ΔH ), codebook labels or the eigenvectors from singular value decomposition (SVD). In the present example, the receiver sends changes in H back to the transmitter, and the consequent SVD is performed at both the transmitter and the receiver. Although this approach could require extra processing, it is typically more efficient overall to send back the changes in H rather than to send H itself. Preferably, in addition to reporting changes in H the full H is also sent from time to time.
A simulation of the present approach will now be described. Although the metrics presented for determining when to feed back information are independent of the modulation scheme that is used, the simulation uses gray-coded QPSK without forward-error correction. OFDM is used with a fast Fourier transformation (FFT) size of 256.
The channel model used in the simulations is based on the ITU channel B Pedestrian 6-tap model (see ITU-R Recommendation M.1225. "Guidelines for Evaluation of Radio Transmission Technologies for IMT-2000," 1997. Page 28) which has been modified for MIMO use based on correlation methods from Ericsson, "MIMO Channel model for TWG RCT ad-hoc proposal," V16, 2006 and using antenna and angle spread parameters taken from the 3GPP spatial channel model (SCM) (see 3GPP, "Spatial channel model for MIMO simulations" TR 25.996 V 6.1.0 (2003-09), Technical Report. [Online]. Available: http://www.3gpp.org/). The Pedestrian B channel was chosen because it is the most demanding of the ITU channel models in terms of bit error rate (BER) performance against signal to noise ratio (SNR). This is caused by one of the taps being comparable in size to the initial signal resulting in very deep fast fading. When in space-time block coding (STBC) mode, the Alamouti code is used (see S. M. Alamouti, "A simple transmit diversity technique for wireless communications ," IEEE J. SeI. Area Commun., vol. 16, no. 8, pp. 1451-1458, Oct. 1998).
The channel model used in the present simulations generates any required number of H MIMO channel matrices and is 'non-physical' in the sense that the path is treated as baseband from the transmitter to receiver, including the correlation of the antennas. This dependency on the antennas is slightly restrictive but leads to a much simpler model than ray-tracing or geometrical methods. The restriction is not considered important since potentially typical antenna configurations of 4λ spacing at the transmitter (assumed to be a base-station) and λ/2 at the receiver (assumed to be a user terminal) are used.
The calculation of the channel matrix H is performed using the following formula, for a MIMO system with NR receiver antennas and N7, transmitter antennas: Ve0(H) = R^0VeC(G) (1 ) where vec(-) is to vectorize a given matrix. RMIM0 represents the spatial correlation matrix for all the MIMO channels, which can be split into correlation seen at the transmitter end from that at the receiver end by the Kronecker function:
Figure imgf000008_0001
which carries the assumption that each transmitter antenna element identically illuminates every element in the receiver array.
In the 2x2 MIMO system the R3x and Rω have the following elements:
1 a
»«- a.. : 1 l R*««χ -=\ βi* P(3) where the complex values of a and /3 are taken from Ericsson, "MIMO Channel model for TWG RCT ad-hoc proposal," V16, 2006 for the antenna element spacings listed above and are different for each tap. This reference also contains values for other common element spacings. The NR χNτ matrix G is comprised of i.i.d. elements derived from Rayleigh, Ricean and log-normal shadowing distribution functions, and it also incorporates the Doppler effect according to 3GPP, "Spatial channel model for MIMO simulations" TR 25.996 V 6.1.0 (2003- 09) by multiplying a time varying factor φv to each of its elements.
The channel matrices H delivered by the model are 4 dimensional, the first two dimensions containing the index of receiver and transmitter antennas and the third and fourth dimensions containing the tap index and time samples of the channel impulse response respectively.
In an OFDM system it is desirable to apply MIMO techniques to every subcarrier or every group. Because of this segmentation in the frequency domain, it is more convenient to have H in terms of the channel frequency response, which can be obtained from the impulse response by performing an FFT, denoting the result as
H(f) .
As described above, in a closed-loop MIMO-OFDM system, the receiver estimates the channel and sends updates on the channel state to the transmitter. The transmitter uses these updates to choose the most appropriate transmission scheme. If perfect channel state information (CSI) is known at the receiver and transmitter, then the MIMO channels on each subcarrier can be decomposed into parallel non-interfering sub-channels using the singular value decomposition (SVD). Thus for a certain time sample, the instantaneous channel transfer matrix on the ith channel segment can be expressed as:
H(^ = U1D1-V/1 (4) where U1. and v, are unitary matrices, and D. is the diagonal matrix of the singular values of H(O, , the operator ( )His the conjugate transpose operator. Then the received symbol vector on the zth subcarrier has the form:
Figure imgf000010_0001
where s; is the transmitted symbol vector and n is the additive noise. Now if one uses a precoding matrix v, and a decoding matrix u( H at the transmitter and receiver respectively, the received symbol becomes: r, =DΛ +_i (6)
Since the u, matrix is unitary, the variance of the noise in (5) and (6) is the same. Equation (6) also implies that the transmitted symbol vector put into K = min(NR,NT) parallel sub-channels will be amplified or diminished by the singular values and those put into channels which have index larger than K will be lost.
Meanwhile the transmitter can allocate the total available power across all the sub-channels for all the subcarriers since it has the CSI. The optimal power allocation can be obtained by using the water-filling algorithm (see M. A. Khalighi, J. -M. Brassier, G. Jourdain, and K. Raoof, "Water filling Capacity of Rayleigh MIMO channels," IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, vol. 1 , pp. 155-158, 2001 and I. E. Telatar, "Capacity of multi-antenna Gaussian channels," Europ. Trans. Telecommun., vol. 10, no. 6, pp. 585-595, Nov.-Dec. 1999). Note that the constraint of the total power for the optimisation becomes N7. -nf for this MIMO-OFDM case, where ^ stands for the number of the subcarriers in use. Therefore, the transmitted symbol vector on the zth subcarrier after precoding and power allocation becomes: i, =V,QA (7) where the diagonal matrix Q1. represents the power allocation matrix including the power allocated to each sub-channel. A demonstration of the improvement to the BER performance due to the water- filling algorithm is shown in the simulation results in figure 2. The simulations are done in a 2x2 MIMO-OFDM system with a FFT size of 256 for a speed of 3 km/hr for independently Rayleigh fading channels. The water-filling algorithm gives greatest benefit at low SNRs. At high SNR the water-filling algorithm almost indentically allocates power on the sub-channels and hence the curves converge. This emphasises that CSI feedback from the receiver to transmitter is of significant value.
In a feedback system, the CSI at the transmitter will be delayed by an amount that depends upon the system protocols. At time tn, the received signal will be, from (5) and (7),
Figure imgf000011_0001
where the tx is a time sample in the past. Simulations having a bearing on the selection of the maximum interval between tn and tχ will now be described.
Assuming a perfect channel estimation at the receiver, the changes in H(f) at time samples *, =^oand ^1 = ^0 +500 for each subcarrier using the ITU-B Pedestrian model at 1 km/hr for the 2x2 system have been simulated, with each time sample being one OFDM symbol and a symbol rate of 10kbaud. Taking the first subcarrier as an example, the detailed values of H(f) for two time samples with 500 samples interval are shown below:
"0.4022 - 0.5119i -0.6935 - 0.116Oi]
H(f)(.,.,U) [.0- 1292 + 0.5553i 0.6860 - 0.0247iJ
"0.3588 - 0.4263i -0.6672 - 0.0832il
( ){■>■> > ) [-0.0131 + 0.5477i 0.6969 - 0.1626iJ This demonstrates the advantage of feeding back the changes in H(f) rather than feeding back H(f) itself, to reduce the overhead of the feedback.
Assuming that both the transmitter and receiver have perfect CSI at the start of the simulation, the effect of sending changes in H(f) (i.e. ΔH(f)) back to the transmitter with a uniform quantization of 0.03 and a 500 samples update rate can be modelled. Table 1 shows the number of bits that must be sent back for each real and imaginary part of every element for the ITU-B Pedestrian model at various speeds for the 2x2 system. The quantisation bits are composed of 1 sign bit to denote whether the change is increasing or decreasing, and the other bits to denote the changes in the absolute values.
Figure imgf000012_0001
Table 1 Time varying range of the amplitude in H(f)
The metric used to control the feedback interval will be referred to as the correlation matrix distance (CMD) metric. Essentially, the capacity gain obtained by spatially multiplexing different symbols into the different multiple paths will be eroded as the channel moves, because of increase in correlation between the paths. This correlation is measured and, when it exceeds a certain threshold, the decision is taken to feed-back ΔH to enable the transmitter to change its coding and hence restore the low path correlation. The receiver calculates the correlation matrix R, which contains the total correlation including the antennas. The receiver knows the antenna correlations and so can deduce the channel path correlation. The intervals at which the receiver calculates the path correlation is adapted to the rate of change of the channel, in the example below.it is set to 500 symbols which is suitable for a user moving at 10km / hr.
At the receiver, assuming perfect channel estimation, the instantaneous spatial correlation matrix is calculated as R,.(/,,) = (vec(H(f),.(/n))vec(H(f)f (^))^ for the ϊth subcarrier and at the fnthtime sample. In M. Herdin and E. Bonek "A MIMO Correlation Matrix based Metric for Characterizing Non-Stationarity", lnstitut fur Nachrichtentechnik und Hochfrequenztechnik, Technische Universitat Wien, Austria, published in IST Mobile and Wireless Communications Summit Lyon, 2004, the CMD is introduced as a metric to measure the time variation of the spatial structure for narrowband MIMO channels. The metric has been extended in H. Xiao, A. G. Burr and L. Song, "A Time-Variant Wideband Spatial Channel Model Based on the 3GPP Mode," IEEE Vehicular Technology Conference (VTC), Montreal, Canada, September 2006 to the wideband fast fading MIMO channels. It is based on the inner product of two instantaneous correlation matrices R1 (J1) and R1 (t2) , //-(R1 (V1) .R1 (J2)) is this inner product, and ||2 denotes the Frobenius norm. In the wideband case, the CMD at each time sample is the averaged value over all the CMDs at all the subcarriers. The value of CMD denotes that, if the instantaneous correlation matrices are identical for all the subcarriers (apart from a scalar factor), the CMD is zero; while if they vary radically, it will tend to unity.
Figure imgf000013_0001
Using equation 9, Figure 3 is a plot of CMD for the ITU-B Pedestrian model at 10km/hr for a 2x2 system with FFT size 256. It shows that, when the velocity is 10km/hr, for approximately 500 time samples, the MIMO channels approach the maximum probable correlation, thereby reducing the capacity, which suggests that this is the maximum time interval for this speed.
The threshold could be set at a value determined to be the maximum tolerable correlation between signal paths, so that an update is sent when that threshold is exceeded.
It does not matter which method is used to determine how much correlation there is between the paths, equation 9 gives one such method that directly computes it from the correlation matrix R. Another would be to detect symbol energy that crosses over from one path to another, which would require exhaustive correlation calculations across all the symbol streams.
Preferably, but not essentially, the time variation could be determined in dependence on the ratio of (i) the product of a first instantaneous correlation matrix for a plurality of subcarriers at a first time and a second instantaneous correlation matrix for the plurality of subcarriers at a second time to (ii) the product of a normalised value of the first instantaneous correlation matrix and a normalised value of the second instantaneous correlation matrix.
CMD has advantages over other methods, such as computing the correlation across several symbol streams, in that it requires relatively little computational overhead.
In one embodiment of the present approach, whether to send an update to the transmitter is determined in dependence on the CMD (R1 ). As described above, updating is performed if R1 deteriorates below a predetermined threshold (R2). An example of this method is illustrated in figure 4. Figure 4 also illustrates that the interval at which R1 (and accordingly the underlying channel estimates) are calculated can be varied in dependence on the frequency with which updates are sent to the transmitter. The receiver will periodically carry out the CMD calculations and decide whether to send feed-back based on whether the difference threshold is exceeded. The receiver can alter the period between calculations adaptively, based on the amount by which the threshold is exceeded and on the threshold value history. This is the function carried out by the 'changes too frequent' box in figure 4.
The metrics described herein are independent of system type and can therefore be modified to fit with the protocol and frame structure of any adopting system. For example with WiMAX, although a user terminal can decide when to send an update, the 802.16 protocol demands that the base-station has to allocate slots to transmit it and this process will add delay.
The applicant hereby discloses in isolation each individual feature described herein and any combination of two or more such features, to the extent that such features or combinations are capable of being carried out based on the present specification as a whole in the light of the common general knowledge of a person skilled in the art, irrespective of whether such features or combinations of features solve any problems disclosed herein, and without limitation to the scope of the claims. The applicant indicates that aspects of the present invention may consist of any such individual feature or combination of features. In view of the foregoing description it will be evident to a person skilled in the art that various modifications may be made within the scope of the invention.

Claims

1. A transceiver for operation in a spatial multiplexing antenna communication system, the receiver comprising signal processing equipment configured to: form a channel estimate for a channel between the transceiver and a second transceiver; form an estimate of the correlation between paths of the channel; determine in dependence on the estimated path correlation whether to transmit data indicating that estimate to the second transceiver; and cause the transceiver to transmit data indicating that estimate to the second transceiver only if the said determination is positive.
2. A transceiver as claimed in claim 1 , wherein the path correlation of the channel is estimated in dependence on the ratio of (i) the product of a first instantaneous correlation matrix for a plurality of subcarriers at a first time and a second instantaneous correlation matrix for the plurality of subcarriers at a second time to (ii) the product of a normalised value of the first instantaneous correlation matrix and a normalised value of the second instantaneous correlation matrix.
3. A transceiver as claimed in claim 2, wherein the instantaneous correlation matrix is determined as Ri(tn) = (vec(μ(f)i(tn))vec(ii(f)f (tl!)f) for the zth subcarrier and at the *πthtime sample, where H(f); is the frequency response of the channel corresponding to the /th subcarrier.
4. A transceiver as claimed in any preceding claim, wherein the transceiver is arranged to determine that data indicating the channel estimate should be transmitted if the path correlation exceeds a predetermined threshold.
5. A transceiver as claimed in any preceding claim, wherein the transceiver is a MIMO transceiver.
6. A transceiver as claimed in any preceding claim, wherein the transceiver is an ODFM transceiver.
7. A transceiver as claimed in any preceding claim, wherein the transceiver is configured to determine when to form the channel estimate in dependence on the frequency with which channel estimates have previously been transmitted to the second transceiver.
8. A transceiver as claimed in any preceding claim wherein the said data indicating the channel estimate is data expressing the change in the channel estimate since it was last transmitted to the second transceiver.
9. A method for controlling a transceiver for operation in a spatial multiplexing antenna communication system, the method comprising: forming a channel estimate for a channel between the transceiver and a second transceiver; forming an estimate of the correlation between paths of the channel; determining in dependence on the estimated correlation whether to transmit data indicating that estimate to the second transceiver; and transmitting data indicating that estimate to the second transceiver only if the said determination is positive.
PCT/GB2009/000781 2008-03-31 2009-03-25 Channel estimates Ceased WO2009122136A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
EP08251246A EP2107697A1 (en) 2008-03-31 2008-03-31 Channel estimates for an antenna diversity communication system
EP08251246.8 2008-03-31

Publications (1)

Publication Number Publication Date
WO2009122136A1 true WO2009122136A1 (en) 2009-10-08

Family

ID=39720649

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/GB2009/000781 Ceased WO2009122136A1 (en) 2008-03-31 2009-03-25 Channel estimates

Country Status (2)

Country Link
EP (1) EP2107697A1 (en)
WO (1) WO2009122136A1 (en)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040008648A1 (en) * 2002-07-11 2004-01-15 Schmidl Timothy M. Diversity decisions for downlink antenna transmission
WO2004015887A1 (en) * 2002-08-05 2004-02-19 Nokia Corporation Transmission diversity with two cross-polarised antennas arrays
EP1643661A2 (en) * 2004-09-07 2006-04-05 Samsung Electronics Co.,Ltd. MIMO system with adaptive switching of transmission scheme
EP1865619A1 (en) * 2005-04-28 2007-12-12 Matsushita Electric Industrial Co., Ltd. Wireless communication apparatus, and feedback information generating method
WO2008081453A1 (en) * 2007-01-04 2008-07-10 Runcom Technologies Ltd. Mimo communication system and method for diversity mode selection

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040008648A1 (en) * 2002-07-11 2004-01-15 Schmidl Timothy M. Diversity decisions for downlink antenna transmission
WO2004015887A1 (en) * 2002-08-05 2004-02-19 Nokia Corporation Transmission diversity with two cross-polarised antennas arrays
EP1643661A2 (en) * 2004-09-07 2006-04-05 Samsung Electronics Co.,Ltd. MIMO system with adaptive switching of transmission scheme
EP1865619A1 (en) * 2005-04-28 2007-12-12 Matsushita Electric Industrial Co., Ltd. Wireless communication apparatus, and feedback information generating method
WO2008081453A1 (en) * 2007-01-04 2008-07-10 Runcom Technologies Ltd. Mimo communication system and method for diversity mode selection

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
HEATH R W ET AL: "Switching Between Diversity and Multiplexing in MIMO Systems", IEEE TRANSACTIONS ON COMMUNICATIONS, IEEE SERVICE CENTER, PISCATAWAY, NJ, US, vol. 53, no. 6, 1 June 2005 (2005-06-01), pages 962 - 968, XP011134653, ISSN: 0090-6778 *
HUI XIAO ET AL: "Full Channel Correlation Matrix of a Time-Variant Wideband Spatial Channel Model", PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, 2006 IEEE 17TH INTER NATIONAL SYMPOSIUM ON, IEEE, PI, 1 September 2006 (2006-09-01), pages 1 - 5, XP031023760, ISBN: 978-1-4244-0329-5 *

Also Published As

Publication number Publication date
EP2107697A1 (en) 2009-10-07

Similar Documents

Publication Publication Date Title
EP2266220B1 (en) Selecting either open or closed-loop MIMO according to which has the greatest estimated channel capacity
US8824583B2 (en) Reduced complexity beam-steered MIMO OFDM system
CN1691536B (en) wireless communication system
KR101088643B1 (en) MIO communication system with variable slot structure
CN1890895B (en) Apparatus and method for transmitting data through selected eigenvector in closed loop mimo mobile communication system
US8848815B2 (en) Differential closed-loop transmission feedback in wireless communication systems
CA2774818A1 (en) Providing antenna diversity in a wireless communication system
Sadek et al. Leakage based precoding for multi-user MIMO-OFDM systems
US7907552B2 (en) MIMO communication system with user scheduling and modified precoding based on channel vector magnitudes
Abe et al. Differential codebook MIMO precoding technique
Zhang et al. Adaptive signaling based on statistical characterizations of outdated feedback in wireless communications
Chehri et al. PHY-MAC MIMO precoder design for sub-6 GHz backhaul small cell
Zhu et al. Efficient CQI update scheme for codebook based MU-MIMO with single CQI feedback in E-UTRA
EP2107697A1 (en) Channel estimates for an antenna diversity communication system
Yoo et al. Capacity and optimal power allocation for fading MIMO channels with channel estimation error
Hellings et al. Energy-efficient rate balancing in vector broadcast channels with linear transceivers
Sun et al. A study of precoding for LTE TDD using cell specific reference signals
Davis et al. Multi-antenna downlink broadcast using compressed-sensed medium access
Hara et al. Spatial scheduling using partial CSI reporting in multiuser MIMO systems
Abou Saleh et al. Single-cell vs. multicell MIMO downlink signalling strategies with imperfect CSI
Sadek et al. Joint optimization of CQI calculation and interference mitigation for user-scheduling in MIMO-OFDM systems
Bharath et al. Reverse channel training for reciprocal MIMO systems with spatial multiplexing
Kobayashi et al. MMSE precoder with mode selection for MIMO systems
Zhang et al. Adaptive signaling under statistical measurement uncertainty in wireless communications
Fu et al. Precoding for multiuser orthogonal space-time block-coded ofdm: Mean or covariance feedback?

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 09727913

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 09727913

Country of ref document: EP

Kind code of ref document: A1