1. Field
The present invention relates generally to communication, and more specifically to data transmission in a multiple-input multiple-output (MIMO) communication system that utilizes orthogonal frequency division multiplexing (OFDM).
2. Background
A MIMO system employs multiple (T) transmit antennas at a transmitting entity and multiple (R) receive antennas at a receiving entity for data transmission. A MIMO channel formed by the T transmit antennas and R receive antennas may be decomposed into S spatial channels, where S≦min {T, R}. The S spatial channels may be used to transmit data in parallel to achieve higher throughput and/or redundantly to achieve greater reliability.
OFDM is a multi-carrier modulation technique that effectively partitions the overall system bandwidth into multiple (K) orthogonal frequency subbands. These subbands are also referred to as tones, subcarriers, bins, and frequency channels. With OFDM, each subband is associated with a respective subcarrier that may be modulated with data.
A MIMO-OFDM system is a MIMO system that utilizes OFDM. The MIMO-OFDM system has S spatial channels for each of the K subbands. Each spatial channel of each subband may be called a “transmission channel”. Each transmission channel may experience various deleterious channel conditions such as, e.g., fading, multipath, and interference effects. The transmission channels for the MIMO channel may also experience different channel conditions and may achieve different signal-to-noise-and-interference ratios (SNRs). The SNR of each transmission channel determines its transmission capacity, which is typically quantified by a particular data rate that may be reliably transmitted on the transmission channel. For a time variant wireless channel, the channel conditions change over time and the SNR of each transmission channel also changes over time. The different SNRs for different transmission channels plus the time varying nature of the SNR for each transmission channel make it challenging to efficiently transmit data in a MIMO system.
If the transmitting entity has knowledge of the channel condition, then it may transmit data in a manner to more fully utilize the capacity of each transmission channel. However, if the transmitting entity does not know the channel condition, then it may need to transmit data at a low rate so that the data transmission can be reliably decoded by the receiving entity even with the worst-case channel condition. Performance would then be dictated by the expected worst-case channel condition, which is highly undesirable.
There is therefore a need in the art for techniques to more efficiently transmit data in a MIMO-OFDM system, especially when the channel condition is not known by the transmitting entity.
The word “exemplary” is used herein to mean “serving as an example, instance, or illustration.” Any embodiment described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments.
Access point 110 is equipped with multiple antennas for data transmission and reception. Each user terminal 120 is also equipped with multiple antennas for data transmission and reception. A user terminal may communicate with the access point, in which case the roles of access point and user terminal are established. A user terminal may also communicate peer-to-peer with another user terminal.
At transmitting entity 210, a TX data processor 212 processes (e.g., encodes, interleaves, and symbol maps) traffic/packet data to generate data symbols. As used herein, a “data symbol” is a modulation symbol for data, a “pilot symbol” is a modulation symbol for pilot (which is data that is known a priori by both the transmitting and receiving entities), a “transmit symbol” is a symbol to be sent on one subband of one transmit antenna, and a “received symbol” is a symbol obtained on one subband of one receive antenna. A TX spatial processor 220 receives and demultiplexes pilot and data symbols onto the proper subbands, performs spatial processing as described below, and provides T streams of transmit symbols for the T transmit antennas. A modulator (MOD) 230 performs OFDM modulation on each of the T transmit symbol streams and provides T streams of time-domain samples to T transmitter units (TMTR) 232a through 232t. Each transmitter unit 232 processes (e.g., converts to analog, amplifies, filters, and frequency upconverts) its sample stream to generate a modulated signal. Transmitter units 232a through 232t provide T modulated signals for transmission from T antennas 234a through 234t, respectively.
At receiving entity 250, R antennas 252a through 252r receive the T transmitted signals, and each antenna 252 provides a received signal to a respective receiver unit (RCVR) 254. Each receiver unit 254 processes its received signal and provides a stream of input samples to a corresponding demodulator (DEMOD) 260. Each demodulator 260 performs OFDM demodulation on its input sample stream to obtain receive data and pilot symbols, provides the received data symbols to a receive (RX) spatial processor 270, and provides the received pilot symbols to a channel estimator 284 within a controller 280. Channel estimator 284 derives a channel response estimate for an actual or effective MIMO channel between transmitting entity 210 and receiving entity 250 for each subband used for data transmission. Controller 280 derives spatial filter matrices based on the MIMO channel response estimates. RX spatial processor 270 performs receiver spatial processing (or spatial matched filtering) on the received data symbols for each subband with the spatial filter matrix derived for that subband and provides detected data symbols for the subband. The detected data symbols are estimates of the data symbols sent by transmitting entity 210. An RX data processor 272 then processes the detected data symbols for all subbands and provides decoded data.
Controllers 240 and 280 direct the operation of the processing units at transmitting entity 210 and receiving entity 250, respectively. Memory units 242 and 282 store data and/or program code used by controllers 240 and 280, respectively.
System 100 may support data transmission using multiple operating modes. Each operating mode utilizes different spatial processing at the transmitting entity. In an embodiment, each operating mode may utilize (1) “eigensteering” to transmit data symbols on orthogonal spatial channels (or “eigenmodes”) of a MIMO channel, (2) “matrix steering” to transmit each data symbol on all S spatial channels of the MIMO channel, or (3) no spatial processing to transmit each data symbol from one transmit antenna. Eigensteering is also called eigenmode transmission or full channel state information (full-CSI) transmission. Matrix steering may be used to achieve spatial diversity. Data transmission without spatial processing is also called partial-CSI transmission. In an embodiment, each operating mode may or may not utilize beamforming to introduce additional diversity for the T sample streams sent from the T transmit antennas.
The operating mode with the combination of matrix steering and beamforming is called “spatial spreading”. The transmitting entity may use spatial spreading to achieve spatial and frequency/time diversity, for example, if the transmitting entity does not know the MIMO channel response.
Transmitter Spatial Processing
In system 100, the MIMO channel formed by the T transmit antennas at transmitting entity 210 and the R receive antennas at receiving entity 250 may be characterized by an R×T channel response matrix H(k) for each subband k, which may be given as:
where entry hi,j(k), for i=0, . . . , R−1 and j=0, . . . , T−1, denotes the coupling or complex channel gain between transmit antenna j and receive antenna i for subband k. For simplicity, the MIMO channel is assumed to be full rank with S=T≦R.
For data transmission with eigensteering, eigenvalue decomposition may be performed on a correlation matrix of H(k) to obtain S eigenmodes of H(k), as follows:
R(k)=HH(k)·H(k)=E(k)·Λ(k)·EH(k) Eq. (2)
where
R(k) is a T×T correlation matrix of H(k);
E(k) is a T×T unitary matrix whose columns are eigenvectors of R(k);
Λ(k) is a T×T diagonal matrix of eigenvalues of R(k); and
“H” denotes a conjugate transpose.
A unitary matrix U is characterized by the property UH·U=I, where I is the identity matrix. The columns of a unitary matrix are orthogonal to one another, and each column has unit power. The matrix E(k) is also called an “eigenmode” matrix or a “transmit” matrix and may be used for spatial processing by the transmitting entity to transmit data on the S eigenmodes of H(k). The eigenmodes may be viewed as orthogonal spatial channels obtained through decomposition. The diagonal entries of Λ(k) are eigenvalues of R(k), which represent the power gains for the S eigenmodes. The eigenvalues in Λ(k) may be ordered from largest to smallest, and the columns of E(k) may be ordered correspondingly. Singular value decomposition may also be performed to obtain matrices of left and right eigenvectors, which may be used for eigensteering.
For data transmission with eigensteering, the transmitting entity may perform spatial processing for each subband k as follows:
zes(k)=E(k)·s(k), Eq. (3)
where s(k) is a vector with up to S data symbols to be sent on subband k; and
z
es(k) is a vector with T spatially processed symbols for subband k.
In general, D data symbols may be sent simultaneously on D(best) eigenmodes of H(k) for each subband k, where 1≦D≦S. The D data symbols in s(k) are spatially processed with D columns of E(k) corresponding to the D selected eigenmodes.
For data transmission with matrix steering, the transmitting entity may perform spatial processing for each subband k as follows:
zss(k)=V(k)·s(k), Eq. (4)
where V(k) is a unitary steering matrix for subband k; and
z
ss(k) is a vector with up to T spread symbols for subband k.
Each data symbol in s(k) is multiplied with a respective column of V(k) to obtain up to T spread symbols. The steering matrix V(k) may be generated in a manner to simplify the matrix multiplication in equation (4), as described below.
In general, D data symbols may be sent simultaneously on each subband k with matrix steering, where 1≦D≦S. The D data symbols in s(k) may be multiplied with a T×D unitary steering matrix V(k) to obtain T spatially processed symbols for zss(k). Each spatially processed symbol for each subband k includes a component of each of the D data symbols being sent on subband k. The T spatially processed symbols for each subband k are then transmitted on the S spatial channels of H(k).
For partial-CSI transmission, the transmitting entity may perform spatial processing for each subband k as follows:
zpcsi(k)=s(k), Eq. (5)
where zpcsi(k) is a vector with up to T data symbols to be sent on subband k. In effect, the transmitting entity performs spatial processing with the identity matrix I for partial-CSI transmission.
The transmitting entity thus spatially processes the data vector s(k) for each subband k to obtain a corresponding vector z(k) of spatially processed symbols for that subband. The vector z(k) is equal to zes(k) for eigensteering, zss(k) for matrix steering, and zpcsi(k) for partial-CSI transmission.
Beamforming
The transmitting entity may selectively perform beamforming on the vector z(k) for each subband k, as follows:
x(k)=B(k)·z(k), Eq. (6)
where B(k) is a T×T beamforming matrix for subband k; and
x(k) is a vector with T transmit symbols to be sent from the T transmit antennas for subband k.
If beamforming is not performed, then the beamforming matrix B(k) is replaced with the identity matrix I in equation (6).
The transmit vector xbes(k) for eigensteering with beamforming may be expressed as:
xbes(k)=B(k)·E(k)·s(k). Eq. (7)
The transmit vector xbss(k) for spatial spreading, which is matrix steering with beamforming, may be expressed as:
xbss(k)=B(k)·V(k)·s(k). Eq. (8)
A matrix B(k)·V(k) may be pre-computed for each subband k. In this case, the transmit vector xbss(k) may be obtained with a single matrix multiply. The matrices V(k) and B(k) may also be applied in two steps and possibly in different manners. For example, the matrix V(k) may be applied in the frequency domain with a matrix multiply and the matrix B(k) may be applied in the time domain with circular or linear delays, as described below.
The transmit vector xbns(k) for partial-CSI transmission with beamforming may be expressed as:
xbns(k)=B(k)·s(k). Eq. (9)
The beamforming matrix B(k) for each subband k is a diagonal matrix having the following form:
where bi(k) is a weight for subband k of transmit antenna i. As shown in equation (6), the i-th element of z(k) is multiplied by the i-th diagonal weight in B(k).
The beamforming matrices for the K subbands may be defined such that continuous beamforming is achieved across the K subbands. The beamforming matrix B(k) for each subband k defines an antenna beam for that subband. K different beamforming matrices may be used for the K subbands to obtain different antenna beams across the subbands. The K beamforming matrices may be varied in a continuous manner (instead of an abrupt or discontinuous manner) so that the antenna beams change in a continuous manner across the K subbands. Continuous beamforming thus refers to a continuous change in the antenna beams across the K subbands.
In an embodiment, the weights in the beamforming matrix B(k) for each subband k are defined as follows:
where g(i) is a complex gain for transmit antenna i.
The magnitude of the complex gain for each transmit antenna may be set to one, or ∥g(i)∥=1.0 for i=0, . . . , T−1. The weights shown in equation (11) correspond to a progressive phase shift across the K subbands of each transmit antenna, with the phase shift changing at different rates for the T transmit antennas. These weights effectively form a different beam for each subband for a linear array of T equally spaced antennas.
In a specific embodiment, the weights are defined as follows:
for i=0, . . . , T−1 and k=0, . . . , K−1. The embodiment shown in equation (12) uses g(i)=e−jπ·i for equation (11). This results in a phase shift of zero being applied to subband K/2+1 for each antenna.
The weights derived based on equation (12) may be viewed as a linear filter having a discrete frequency response of Gi(k′) for each transmit antenna i. This discrete frequency response may be expressed as:
for i=0, . . . , T−1 and k′=(−K/2) . . . (K/2−1). Subband index k is for a subband numbering scheme that places the zero frequency at subband Ncenter=K/2. Subband index k′ is a shifted version of subband index k by K/2, or k′=k−K/2. This results in subband zero being at zero frequency for the new subband numbering scheme with index k′. Ncenter may be equal to some other value instead of K/2 if index k is defined in some other manner (e.g., k=1, . . . , K) or if K is an odd integer value.
A discrete time-domain impulse response gi(n) for the linear filter may be obtained by performing a K-point inverse discrete Fourier transform (IDFT) on the discrete frequency response Gi(k′). The impulse response gi(n) may be expressed as:
where n is an index for sample period and has a range of n=0, . . . , K−1. Equation (14) indicates that the impulse response gi(n) for transmit antenna i has a single tap with unit-magnitude at a delay of i sample periods and is zero at all other delays.
Beamforming may be performed in the frequency domain or time domain. Beamforming may be performed in the frequency domain by (1) multiplying K spatially processed symbols zi(0) through zi(K−1) for each transmit antenna i with K weights bi(0) through bi(K−1) for that antenna to obtain K transmit symbols and (2) performing OFDM modulation on the K transmit symbols for each transmit antenna i to obtain K time-domain samples for that antenna. Equivalently, beamforming may be performed in the time domain by (1) performing a K-point IDFT on the K spatially processed symbols for each transmit antenna i to obtain K time-domain samples for that transmit antenna and (2) performing a circular convolution of the K time-domain samples for each transmit antenna i with the impulse response gi(n) for that antenna.
Beamformer 430 includes T multiplier sets 528a through 528t for the T transmit antennas. For each symbol period, each multiplier set 528 receives the K spatially processed symbols zi(0) through zi(K−1) for its transmit antenna i, multiplies these symbols with K weights bi(0) through bi(K−1) for transmit antenna i, and provides K transmit symbols xi(0) through xi(K−1) for transmit antenna i. For each symbol period, beamformer 430 provides T sets of K transmit symbols for the T transmit antennas.
Modulator 230 includes T OFDM modulator 530a through 530t for the T transmit antennas. Each OFDM modulator 530 receives the transmit symbols xi(0) through xi(K−1) for its transmit antenna i, performs OFDM modulation on the transmit symbols, and provides an OFDM symbol for transmit antenna i for each symbol period.
Beamformer 440a includes T circular shift units 842a through 842t for the T transmit antennas. Shift unit 842 for each transmit antenna i receives the K time-domain samples from P/S converter 634 for transmit antenna i, performs a circular shift of the K time-domain samples by i samples, and provides a circular-shifted transformed symbol {zi′(n)} containing K samples. In particular, shift unit 842a performs a circular shift of zero sample on the transformed symbol {z0′(n)} for transmit antenna 234a, shift unit 842b performs a circular shift of one sample on the transformed symbol {z1′(n)} for transmit antenna 234b, and so on, and shift unit 842t performs a circular shift of (T−1) samples on the transformed symbol {zT-1′(n)} for transmit antenna 234t. T cyclic prefix generators 636a through 636t receive T the circularly-shifted transformed symbols from shift units 842a through 842t, respectively. Each cyclic prefix generator 636 appends a C-sample cyclic prefix to its circularly-shifted transformed symbol {zi′(n)} and provides an OFDM symbol {xi(n)} containing (K+C) samples.
The T different delays may also be provided in the analog domain by transmitter units 232a through 232t. For example, transmitter unit 232a may delay its modulated signal by zero sample period, transmitter unit 232b may delay its modulated signal by one sample period (or Tsam seconds), and so on, and transmitter unit 232t may delay its modulated signal by (T−1) sample periods (or (T−1)·Tsam seconds). A sample period is equal to Tsam=1/[BW·(K+C)], where BW is the overall bandwidth of the system in Hertz.
For the embodiments shown in equations (12) through (14) and in
may also be implemented. For example, the time-domain samples from each P/S converter 634 in
When the number of transmit antennas is less than the cyclic prefix length (or T<C), the cyclic prefix appended to each OFDM symbol makes a linear delay by each delay units 844 appears like a circular rotation for the circular convolution with the time-domain impulse response gi(n). The weights as defined in equation (12) may thus be implemented by a time delay of i sample periods for each transmit antenna i, as shown in
Equations (11) and (12) represent a function that provides linearly changing phase shifts across the K subbands for each transmit antenna. The application of linearly changing phase shifts to symbols in the frequency domain may be achieved by either circularly shifting or delaying the corresponding time-domain samples, as described above. In general, the phase shifts across the K subbands for each transmit antenna may be changed in a continuous manner using any function so that the beams are varied in a continuous instead of abrupt manner across the subbands. A linear function of phase shifts is just one example of a continuous function. For a continuous function, an arbitrarily small change in the function input produces an arbitrarily small change in the function output. Some other exemplary continuous functions include a quadratic function, a cubic function, a parabolic function, and so on. The continuous change ensures that the performance of receiving entities that rely on some amounts of correlation across the subbands (e.g., to simplify channel estimation) is not degraded.
The embodiments shown in
The transmitting entity may selectively perform beamforming so that beamforming is either enabled or disabled. The decision to either apply or disable beamforming may be made based on various factors such as, for example, the channel condition. If the transmitting entity performs continuous beamforming, or if the receiving entity performs channel estimation without relying on correlation between subbands, then the receiving entity may not need to be aware of whether or not beamforming is being applied.
The transmitting entity may adaptively perform beamforming so that beamforming is adjusted in some manner over time. In one embodiment, the transmitting entity may enable or disable beamforming based on channel condition, feedback from the receiving entity, and/or some other factors. For example, the transmitting entity may apply beamforming if the channel is flat fading with unit magnitude complex channel gains that may add to zero or a low value for each subband at a receiving entity.
In another embodiment, the transmitting entity may adjust beamforming in a predetermined or pseudo-random manner. For time-domain beamforming, the amounts of delay for the T transmit antennas may be varied for each time interval, which may correspond to one symbol period, multiple symbol periods, the time duration between consecutive transmissions of a MIMO pilot (described below), and so on. For example, the transmitting entity may apply delays of {0, 1, 2, . . . , T−1} sample periods to the T transmit antennas in one time interval, then delays of {0, 0, 0, . . . , 0} sample periods to the T transmit antennas in the next time interval, then delays of {0, 2, 4, . . . , 2(T−1)} sample periods to the T transmit antennas in the following time interval, and so on. The transmitting entity may also cycle through the delays in a base set in different time intervals. For example, the transmitting entity may apply delays of {0, 1, 2, . . . , T−1} sample periods to the T transmit antennas in one time interval, then delays of {T−1, 0, 1, . . . , T−2} sample periods to the T transmit antennas in the next time interval, then delays of {T−2, T−1, 0, . . . , T−3} sample periods to the T transmit antennas in the following time interval, and so on. The transmitting entity may also apply delays in different orders in different time intervals. For example, the transmitting entity may apply delays of {0, 1, 2, . . . , T−1} sample periods to the T transmit antennas in one time interval, then delays of {2, 1, T−1, . . . , 0} sample periods to the T transmit antennas in the next time interval, then delays of {1, T−1, 0, . . . , 2} sample periods to the T transmit antennas in the following time interval, and so on. The transmitting entity may also apply fractional (e.g., 0.5, 1.5) sample periods of delay to any given transmit antenna.
If the receiving entity is unaware that beamforming is being performed, then the transmitting entity may perform beamforming in the same manner across all symbol periods in each data and pilot transmission interval (e.g., each frame). A data and pilot transmission interval is a time interval in which data as well as a pilot used to recover the data are transmitted. For example, the transmitting entity may use the same set of beamforming matrices B(k) for the K subbands or apply the same set of delays to the T transmit antennas for all symbol periods in each data and pilot transmission interval. This allows the receiving entity to estimate an “effective” MIMO channel response (with beamforming) based on a received MIMO pilot and to perform receiver spatial processing on received symbols for the data and pilot transmission interval with the effective MIMO channel response estimate, as described below.
If the receiving entity is aware of the beamforming being performed, then the transmitting entity may adjust the beamforming across the symbol periods in each data and pilot transmission interval. For example, the transmitting entity may use different sets of beamforming matrices B(k) or apply different sets of delays in different symbol periods. The receiving entity may estimate an initial effective MIMO channel response based on a received MIMO pilot, determine the effective MIMO channel response for each subsequent symbol period t based on the initial effective MIMO channel response estimate and knowledge of the beamforming being applied in symbol period t, and perform receiver spatial processing on received symbols for symbol period t with the effective MIMO channel response estimate for symbol period t.
Receiver Spatial Processing
For data transmission with eigensteering and beamforming, the receiving entity obtains R received symbols from the R receive antennas for each subband k, which may be expressed as:
rbes(k)=H(k)·B(k)·E(k)·s(k)+n(k),
=Heffbes(k)·s(k)+n(k), Eq. (15)
where
r
bes(k) is a vector with R received symbols for subband k;
n(k) is a noise vector for subband k; and
H
eff
bes(k) is an “effective” channel response matrix observed by data vector s(k) with eigensteering and beamforming, which is:
Heffbes(k)=H(k)·B(k)·E(k). Eq. (16)
For simplicity, the noise is assumed to be additive white Gaussian noise (AWGN) with a zero mean vector and a covariance matrix of φnn=σ2·I, where σ2 is the variance of the noise.
The receiving entity can recover the data symbols sent by the transmitting entity using various receiver processing techniques such as a minimum mean square error (MMSE) technique and a channel correlation matrix inversion (CCMI) technique (which is also commonly called a zero-forcing technique).
For the MMSE technique, the receiving entity may derive a spatial filter matrix Mmmsebes(k) for each subband k, as follows:
Mmmsebes(k)=[Heffbes
The spatial filter matrix Mmmsebes(k) minimizes the mean square error between the symbol estimates from the spatial filter and the data symbols in s(k).
The receiving entity may perform MMSE spatial processing for each subband k, as follows:
where Dmmsebes(k)=[diag [Mmmsebes(k)·Heffbes(k)]]−1; and
n
mmse
bes(k) is the MMSE filtered noise.
The symbol estimates from the spatial filter Mmmsebes(k) are unnormalized estimates of the data symbols. The multiplication with the scaling matrix Dmmsebes(k) provides normalized estimates of the data symbols.
Eigensteering attempts to send data on the eigenmodes of H(k). However, a data transmission with eigensteering may not be completely orthogonal due to, for example, an imperfect estimate of H(k), error in the eigenvalue decomposition, finite arithmetic precision, and so on. The MMSE technique can account for (or “clean up”) loss of orthogonality in the data transmission with eigensteering.
For the CCMI technique, the receiving entity may derive a spatial filter matrix Mccmibes(k) for each subband k, as follows:
Mccmibes(k)=[Heffbes
The receiving entity may perform CCMI spatial processing for each subband k, as follows:
where nccmibes(k) is the CCMI filtered noise. The CCMI technique may amplify the noise due to the structure of Reffbes(k)=Heffbes
The receiving entity may perform spatial processing for the other operating modes in similar manner, albeit with different effective channel response matrices and different spatial filter matrices. Table 1 summarizes the spatial processing at the transmitting entity for the various operating modes and the effective MIMO channel for each operating mode. For clarity, the index “(k)” for subband is not shown in Table 1. Beamforming may be performed in the frequency domain, as shown Table 1. Linear continuous beamforming may also be performed in the time domain, as described above. In this case, the beamforming matrix B is omitted from the transmit symbol vector x but is still present in the effective MIMO channel response.
x
es = E · s
H
eff
es = H · E
x
ss = V · s
H
eff
ss = H · V
x
ns = s
H
eff
ns = H
x
bes = B · E · s
H
eff
bes = H · B · E
x
bss = B · V · s
H
eff
bss = H · B · V
x
bns = B · s
H
eff
bns = H · B
In general, the receiving entity may derived an MMSE spatial filter matrix Mmmsex(k) for each subband k, as follows:
Mmmsex(k)=[Heffx
where the superscript “x” denotes the operating mode and may be equal to “es” for eigensteering without beamforming, “ss” for matrix steering without beamforming, “ns” for no spatial processing and no beamforming, “bes” for eigensteering with beamforming, “bss” for matrix steering with beamforming, or “bns” for beamforming only. The MMSE spatial filter matrix Mmmsex(k) may be derived in the same manner for all operating modes, albeit with different effective channel response matrices Heffes(k), Heffss(k), Heffns(k), Heffbes(k), Heffbss(k), and Heffbns(k). The MMSE receiver spatial processing may also be performed in the same manner for all operating modes, albeit with the MMSE spatial filter matrices being derived with different effective channel response matrices. An MMSE-based receiver may thus support all operating modes using the same MMSE spatial processing. In equation (21), the term σ2·I may be replaced with the covariance matrix φnn of the noise, if known.
The receiving entity may also derived a CCMI spatial filter matrix Mccmix(k) for each subband k, as follows:
Mccmix(k)=[Heffx
Again, the receiving entity may derive the CCMI spatial filter matrix in the same manner for all operating modes, albeit with different effective channel response matrices. The receiving entity may also apply the CCMI spatial filter matrices in the same manner for all operating modes.
The receiving entity may utilize other receiver spatial processing techniques to recover the data symbols, and this is within the scope of the invention.
Pilot Transmission
The transmitting entity may transmit a pilot to allow the receiving entity to estimate the actual or effective MIMO channel response. The pilot may be transmitted in various manners. For example, the transmitting entity may transmit an unsteered MIMO pilot, a steered MIMO pilot, a spread MIMO pilot, and so on. A MIMO pilot is a pilot comprised of multiple pilot transmissions sent from the T transmit antennas. An unsteered MIMO pilot is comprised of up to T pilot transmissions sent from the T transmit antennas, one pilot transmission from each antenna. A steered MIMO pilot is comprised of up to S pilot transmissions sent on the S orthogonal spatial channels. A spread MIMO pilot is comprised of up to S pilot transmissions sent on the S spatial channels with matrix steering.
For a MIMO pilot, each of the multiple pilot transmissions is identifiable by the receiving entity. This may be achieved by:
For an unsteered MIMO pilot, the transmitting entity may perform spatial processing for each subband k used for pilot transmission as follows:
zns,np(k,t)=W(t)·p(k), Eq. (23)
where
p(k) is a vector of pilot symbols to be sent on subband k;
W(t) is a diagonal Walsh matrix for symbol period t; and
z
ns,mp(k) is a vector of spatially processed symbols for the unsteered MIMO pilot for subband k in symbol period t.
Different pilot symbols may be sent from the T transmit antennas, as shown in equation (23). Alternatively, the same pilot symbol may also be used for all transmit antennas, in which case the Walsh matrix is simply a Walsh vector.
If T=4, then the four transmit antennas may be assigned 4-symbol Walsh sequences W1=1, 1, 1, 1, W2=1, −1, 1, −1, W3=1, 1, −1, −1, and W4=1, −1, −1, 1 for the MIMO pilot. The four symbols of Walsh sequence Wj are applied to the pilot transmission from transmit antenna j in four symbol periods. W(1) contains the first element of the four Walsh sequences along its diagonal, W(2) contains the second element of the four Walsh sequences, W(3) contains the third element of the four Walsh sequences, and W(4) contains the fourth element of the four Walsh sequences. The j-th Walsh sequence Wj for transmit antenna j is thus carried as the j-th diagonal element of all the Walsh matrices. The four Walsh matrices may be used in four symbol periods to transmit the unsteered MIMO pilot.
The transmitting entity further processes the vector zns,mp(k,t) for either beamforming or no beamforming, e.g., in the same manner as the data vector s(k), to obtain a transmit vector for the unsteered MIMO pilot. The transmitting entity may transmit the unsteered MIMO pilot over T symbol periods by using one Walsh matrix W(t) for each symbol period.
For an unsteered MIMO pilot without beamforming, the receiving entity obtains received pilot symbols for each subband k used for pilot transmission, as follows:
rns,mp(k,t)=H(k)·W(t)·p(k)+n(k). Eq. (24)
The MIMO channel and noise is assumed to be static over the time during which the unsteered MIMO pilot is transmitted. The receiving entity obtains T vectors rns,mp(k,1) through rns,mp(k,T) for T-symbol Walsh sequences used for the unsteered MIMO pilot.
The receiving entity may estimate the actual MIMO channel response H(k) based on the received unsteered MIMO pilot without beamforming. Each column j of H(k) is associated with a respective Walsh sequence Wj. The receiving entity may obtain hi,j(k), which is the i-th element of the j-th column of H(k) by (1) multiplying the i-th element of rns,mp(k,1) through rns,mp(k,T) by the T chips of the Walsh sequence Wj, (2) removing the modulation used for pilot symbol pj(k), which is the j-th element of p(k), and (3) accumulating the T resultant elements to obtain hi,j(k). The process may be repeated for each element of H(k). The receiving entity may then use H(k) to derive the effective MIMO channel response Heffss(k) or Heffes(k), which may be used for receiver spatial processing.
For an unsteered MIMO pilot with beamforming, the receiving entity obtains received pilot symbols for each subband k used for pilot transmission, as follows:
rbns,mp(k,t)=H(k)·B(k)·W(t)·p(k)+n(k). Eq. (25)
The receiving entity may perform similar processing on the received unsteered MIMO pilot with beamforming to obtain Heffbns(k) or Heffbss(k).
For a steered MIMO pilot, the transmitting entity may perform spatial processing for each subband k used for pilot transmission as follows:
zes,mp(k,t)=E(k)·W(t)·p(k), Eq. (26)
where zes,mp(k,t) is a vector of spatially processed symbols for the steered MIMO pilot for subband k in symbol period t. For simplicity, E(k) is assumed to be static over the time during which the steered MIMO pilot is transmitted, and is thus not a function of symbol period t. The transmitter may further process the vector zes,mp(k,t) for either beamforming or no beamforming and may then transmit the steered MIMO pilot.
For a steered MIMO pilot without beamforming, the receiving entity obtains received pilot symbols for each subband k used for pilot transmission, as follows:
res,mp(k,t)=H(k)·E(k)·W(t)·p(k)+n(k). Eq. (27)
For a steered MIMO pilot with beamforming, the receiving entity obtains received pilot symbols for each subband k used for pilot transmission, as follows:
rbes,mp(k,t)=H(k)·B(k)·E(k)·W(t)·p(k)+n(k). Eq. (28)
The receiving entity may estimate Heffes(k) based on res,mp(k,n) and may estimate the Heffbes(k) based on rbes,mp(k,n), in similar manner as described above for H(k).
For a spread MIMO pilot, the transmitting entity may perform spatial processing for each subband k used for pilot transmission as follows:
zss,mp(k,t)=V(k)·W(t)·p(k), Eq. (29)
where zss,mp(k,t) is a vector of spatially processed symbols for the spread MIMO pilot for subband k. The transmitter may further process the vector zss,mp(k,t) for either beamforming or no beamforming, and may then transmit the resultant MIMO pilot.
The receiving entity may estimate Heffss(k) based on a received spread MIMO pilot without beamforming and may estimate Heffbss(k) based on a received spread MIMO pilot with beamforming. The receiving entity may then derive the effective MIMO channel response Heffns(k) or Heffbns(k), which may be used for receiver spatial processing.
Steering Matrix
A set of steering matrices may be generated and used for matrix steering. These steering matrices may be denoted as {V}, or V(i) for i=1 . . . L, where L may be any integer greater than one. Each steering matrix V(i) should be a unitary matrix. This condition ensures that the T data symbols transmitted simultaneously using V(i) have the same power and are orthogonal to one another after the matrix steering with V(i).
The set of L steering matrices may be generated in various manners. For example, the L steering matrices may be generated based on a unitary base matrix and a set of scalars. The base matrix may be used as one of the L steering matrices. The other L−1 steering matrices may be generated by multiplying the rows of the base matrix with different combinations of scalars. Each scalar may be any real or complex value. The scalars are selected to have unit magnitude so that steering matrices generated with these scalars are unitary matrices.
The base matrix may be a Walsh matrix. A 2×2 Walsh matrix W2×2 and a larger size Walsh matrix W2N×2N may be expressed as:
Walsh matrices have dimensions that are powers of two (e.g., 2, 4, 8, and so on).
The base matrix may also be a Fourier matrix. For an N×N Fourier matrix DN×N, the elements dn,m of DN×N may be expressed as:
Fourier matrices of any square dimension (e.g., 2, 3, 4, 5, and so on) may be formed. Other matrices may also be used as the base matrix.
For an N×N base matrix, each of rows 2 through N of the base matrix may be independently multiplied with one of Q different possible scalars. QN-1 different steering matrices may be obtained from QN-1 different permutations of the Q scalars for N−1 rows. For example, each of rows 2 through N may be independently multiplied with a scalar of +1, −1, +j, or −j, where j=√{square root over (−1)}. In general, each row of the base matrix may be multiplied with any scalar having the form ejθ, where θ may be any phase value. Each element of a scalar-multiplied N×N base matrix is further scaled by 1/√{square root over (N)} to obtain an N×N steering matrix having unit power for each column.
Steering matrices derived based on a Walsh matrix (or a 4×4 Fourier matrix) have certain desirable properties. If the rows of the Walsh matrix are multiplied with scalars of ±1 and ±j, then each element of a resultant steering matrix V(i) belongs in a set composed of {+1, −1, +j, −j}. In this case, the multiplication of an element of another matrix with an element of V(i) may be performed with just bit manipulation.
The data transmission techniques described herein may be used for various wireless systems. These techniques may also be used for the downlink (or forward link) as well as the uplink (or reverse link).
Continuous beamforming with or without matrix steering may be used in various manners. For example, a transmitting entity (e.g., an access point or a user terminal) may use continuous beamforming to transmit to a receiving entity (e.g., another access point or user terminal) when accurate information about the wireless channel is not available. Accurate channel information may not be available due to various reasons such as, for example, a feedback channel that is corrupted, a system that is poorly calibrated, the channel conditions changing too rapidly for the transmitting entity to use/adjust beam steering on time (e.g., due to the transmitting and/or receiving entity moving at a high velocity), and so on.
Continuous beamforming may also be used for various applications in a wireless system. In one application, broadcast channels in the system may be transmitted using continuous beamforming, as described above. The use of continuous beamforming allows wireless devices in the system to receive the broadcast channels with improved reliability, thereby increasing the range of the broadcast channels. In another application, a paging channel is transmitted using continuous beamforming. Again, improved reliability and/or greater coverage may be achieved for the paging channel via the use of continuous beamforming. In yet another application, an 802.11a access point uses continuous beamforming to improve the performance of user terminals under its coverage area.
The transmission techniques described herein may be implemented by various means. For example, these techniques may be implemented in hardware, software, or a combination thereof. For a hardware implementation, the processing units at a transmitting entity may be implemented within one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, micro-controllers, microprocessors, other electronic units designed to perform the functions described herein, or a combination thereof. The processing units at a receiving entity may also be implemented with one or more ASICs, DSPs, and so on.
For a software implementation, some of the processing may be implemented with modules (e.g., procedures, functions, and so on) that perform the functions described herein. The software codes may be stored in a memory unit (e.g., memory unit 242 or 282 in
Headings are included herein for reference and to aid in locating certain sections. These headings are not intended to limit the scope of the concepts described therein under, and these concepts may have applicability in other sections throughout the entire specification.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
This application is a continuation of, and claims the benefit of priority from, U.S. patent application Ser. No. 11/050,897, entitled “Continuous Beamforming for a MIMO-OFDM System” and filed Feb. 3, 2005, which claims the benefit of priority from three U.S. Provisional Patent Applications: 1. Ser. No. 60/569,103, entitled “Steering Diversity for an OFDM-Based Multi-Antenna Communication System,” filed May 7, 2004;2. Ser. No. 60/576,719, entitled “Continuous Beamforming for a MIMO-OFDM System,” filed Jun. 2, 2004; and3. Ser. No. 60/578,656, entitled “Continuous Beamforming for a MIMO-OFDM System,” filed Jun. 9, 2004, all of which are assigned to the assignee of this continuation application and are fully incorporated herein by reference for all purposes.
Number | Name | Date | Kind |
---|---|---|---|
5581583 | Conti et al. | Dec 1996 | A |
5668837 | Dent | Sep 1997 | A |
5757845 | Fukawa et al. | May 1998 | A |
6061023 | Daniel et al. | May 2000 | A |
6118758 | Marchok et al. | Sep 2000 | A |
6144711 | Raleigh et al. | Nov 2000 | A |
6175743 | Alperovich et al. | Jan 2001 | B1 |
6198775 | Khayrallah et al. | Mar 2001 | B1 |
6218985 | Adams | Apr 2001 | B1 |
6298035 | Heiskala | Oct 2001 | B1 |
6314147 | Liang et al. | Nov 2001 | B1 |
6351499 | Paulraj et al. | Feb 2002 | B1 |
6441786 | Jasper et al. | Aug 2002 | B1 |
6452981 | Raleigh et al. | Sep 2002 | B1 |
6473467 | Wallace et al. | Oct 2002 | B1 |
6477161 | Hudson et al. | Nov 2002 | B1 |
6486828 | Cahn et al. | Nov 2002 | B1 |
6496535 | Xu | Dec 2002 | B2 |
6542556 | Kuchi et al. | Apr 2003 | B1 |
6545997 | Boehnke et al. | Apr 2003 | B1 |
6618454 | Agrawal et al. | Sep 2003 | B1 |
6642888 | Kishigami et al. | Nov 2003 | B2 |
6678263 | Hammons, Jr. et al. | Jan 2004 | B1 |
6711124 | Khayrallah et al. | Mar 2004 | B2 |
6711528 | Dishman et al. | Mar 2004 | B2 |
6760388 | Ketchum et al. | Jul 2004 | B2 |
6763073 | Foschini et al. | Jul 2004 | B2 |
6788661 | Ylitalo et al. | Sep 2004 | B1 |
6801790 | Rudrapatna | Oct 2004 | B2 |
6804307 | Popovic | Oct 2004 | B1 |
6810506 | Levy | Oct 2004 | B1 |
6816555 | Sakoda | Nov 2004 | B2 |
6842487 | Larsson | Jan 2005 | B1 |
6847306 | Diba et al. | Jan 2005 | B2 |
6859747 | Yutkowitz | Feb 2005 | B2 |
6862271 | Medvedev et al. | Mar 2005 | B2 |
6873606 | Agrawal et al. | Mar 2005 | B2 |
6888789 | Sakoda et al. | May 2005 | B1 |
6937189 | Kim | Aug 2005 | B2 |
6940917 | Menon et al. | Sep 2005 | B2 |
6956897 | Honig | Oct 2005 | B1 |
6975668 | Zhang | Dec 2005 | B2 |
6982946 | Wiberg et al. | Jan 2006 | B2 |
6999472 | Hamalainen et al. | Feb 2006 | B2 |
7020110 | Walton et al. | Mar 2006 | B2 |
7020490 | Khatri | Mar 2006 | B2 |
7031669 | Vaidyanathan et al. | Apr 2006 | B2 |
7057555 | Lewis | Jun 2006 | B2 |
7061969 | Alamouti et al. | Jun 2006 | B2 |
7065144 | Walton et al. | Jun 2006 | B2 |
7065156 | Kuchi | Jun 2006 | B1 |
7079870 | Vaidyanathan | Jul 2006 | B2 |
7092737 | Horng et al. | Aug 2006 | B2 |
7095709 | Walton et al. | Aug 2006 | B2 |
7095987 | Brothers, Jr. et al. | Aug 2006 | B2 |
7099678 | Vaidyanathan | Aug 2006 | B2 |
7099698 | Tarokh et al. | Aug 2006 | B2 |
7110350 | Li et al. | Sep 2006 | B2 |
7110378 | Onggosanusi et al. | Sep 2006 | B2 |
7110463 | Wallace et al. | Sep 2006 | B2 |
7116723 | Kim et al. | Oct 2006 | B2 |
7130580 | Alexiou et al. | Oct 2006 | B2 |
7149254 | Sampath | Dec 2006 | B2 |
7151806 | Hosoda et al. | Dec 2006 | B2 |
7151809 | Ketchum et al. | Dec 2006 | B2 |
7158498 | Lundby et al. | Jan 2007 | B2 |
7190734 | Giannakis et al. | Mar 2007 | B2 |
7194042 | Walton et al. | Mar 2007 | B2 |
7200631 | Mailaender et al. | Apr 2007 | B2 |
7206354 | Wallace et al. | Apr 2007 | B2 |
7218689 | Gupta | May 2007 | B2 |
7227906 | Fukuda et al. | Jun 2007 | B2 |
7236478 | Wu et al. | Jun 2007 | B2 |
7292623 | Reznik | Nov 2007 | B2 |
7298805 | Walton et al. | Nov 2007 | B2 |
7301924 | Gurbuz et al. | Nov 2007 | B1 |
7302009 | Walton et al. | Nov 2007 | B2 |
7317750 | Shattil | Jan 2008 | B2 |
7324429 | Walton et al. | Jan 2008 | B2 |
7324482 | Hammons, Jr. et al. | Jan 2008 | B2 |
7327795 | Oprea | Feb 2008 | B2 |
7327798 | Won | Feb 2008 | B2 |
7327800 | Oprea et al. | Feb 2008 | B2 |
7336727 | Mukkavilli et al. | Feb 2008 | B2 |
7336746 | Walton et al. | Feb 2008 | B2 |
7356073 | Heikkila | Apr 2008 | B2 |
7359466 | Huang et al. | Apr 2008 | B2 |
7385617 | Tahat | Jun 2008 | B2 |
7394754 | Lii et al. | Jul 2008 | B2 |
7436896 | Hottinen et al. | Oct 2008 | B2 |
7447268 | Sadowsky et al. | Nov 2008 | B2 |
7522673 | Giannakis et al. | Apr 2009 | B2 |
7529177 | Celebi et al. | May 2009 | B2 |
7532563 | Shirali et al. | May 2009 | B1 |
7539253 | Li et al. | May 2009 | B2 |
7555053 | Trachewsky et al. | Jun 2009 | B2 |
7583747 | Damen et al. | Sep 2009 | B1 |
7593317 | Yuda et al. | Sep 2009 | B2 |
7653142 | Ketchum et al. | Jan 2010 | B2 |
7742546 | Ketchum et al. | Jun 2010 | B2 |
7787554 | Nabar et al. | Aug 2010 | B1 |
7907689 | Walton et al. | Mar 2011 | B2 |
7974359 | Gorokhov et al. | Jul 2011 | B2 |
8290089 | Howard et al. | Oct 2012 | B2 |
8325844 | Walton et al. | Dec 2012 | B2 |
20010053124 | Ichihara et al. | Dec 2001 | A1 |
20020009125 | Shi | Jan 2002 | A1 |
20020091943 | Lau | Jul 2002 | A1 |
20020102940 | Bohnke et al. | Aug 2002 | A1 |
20020114269 | Onggosanusi et al. | Aug 2002 | A1 |
20020127978 | Khatri | Sep 2002 | A1 |
20020172264 | Wiberg et al. | Nov 2002 | A1 |
20020193146 | Wallace et al. | Dec 2002 | A1 |
20020196742 | Baker et al. | Dec 2002 | A1 |
20030011274 | Saint-Michel et al. | Jan 2003 | A1 |
20030016637 | Khayrallah et al. | Jan 2003 | A1 |
20030026349 | Onggosanusi et al. | Feb 2003 | A1 |
20030072254 | Ma et al. | Apr 2003 | A1 |
20030072382 | Raleigh et al. | Apr 2003 | A1 |
20030076908 | Huang et al. | Apr 2003 | A1 |
20030108117 | Ketchum et al. | Jun 2003 | A1 |
20030112745 | Zhuang et al. | Jun 2003 | A1 |
20030123565 | Fukuda et al. | Jul 2003 | A1 |
20030123567 | Shigemasa et al. | Jul 2003 | A1 |
20030128658 | Walton et al. | Jul 2003 | A1 |
20030161282 | Medvedev et al. | Aug 2003 | A1 |
20030161412 | Niida et al. | Aug 2003 | A1 |
20030181211 | Razavilar et al. | Sep 2003 | A1 |
20030186698 | Holma et al. | Oct 2003 | A1 |
20030189999 | Kadous | Oct 2003 | A1 |
20030204380 | Dishman et al. | Oct 2003 | A1 |
20030228850 | Hwang | Dec 2003 | A1 |
20030235147 | Walton et al. | Dec 2003 | A1 |
20030235238 | Schelm et al. | Dec 2003 | A1 |
20030235255 | Ketchum et al. | Dec 2003 | A1 |
20040002364 | Trikkonen et al. | Jan 2004 | A1 |
20040022183 | Li et al. | Feb 2004 | A1 |
20040042439 | Menon et al. | Mar 2004 | A1 |
20040052315 | Thielecke et al. | Mar 2004 | A1 |
20040066773 | Sun et al. | Apr 2004 | A1 |
20040081263 | Lee et al. | Apr 2004 | A1 |
20040082356 | Walton et al. | Apr 2004 | A1 |
20040085939 | Wallace et al. | May 2004 | A1 |
20040086027 | Shattil et al. | May 2004 | A1 |
20040102157 | Lewis et al. | May 2004 | A1 |
20040136349 | Walton et al. | Jul 2004 | A1 |
20040139137 | Mailaender et al. | Jul 2004 | A1 |
20040157645 | Smith et al. | Aug 2004 | A1 |
20040165675 | Ito et al. | Aug 2004 | A1 |
20040190639 | Pauli et al. | Sep 2004 | A1 |
20040203473 | Liu | Oct 2004 | A1 |
20040248604 | Vaidyanathan et al. | Dec 2004 | A1 |
20050017511 | Dalton | Jan 2005 | A1 |
20050026570 | Han | Feb 2005 | A1 |
20050094552 | Abe et al. | May 2005 | A1 |
20050149320 | Kajala et al. | Jul 2005 | A1 |
20050175115 | Walton et al. | Aug 2005 | A1 |
20050180312 | Walton et al. | Aug 2005 | A1 |
20050195733 | Walton et al. | Sep 2005 | A1 |
20050220199 | Sadowsky et al. | Oct 2005 | A1 |
20050238111 | Wallace et al. | Oct 2005 | A1 |
20050249159 | Abraham et al. | Nov 2005 | A1 |
20050249174 | Lundby et al. | Nov 2005 | A1 |
20050265275 | Howard et al. | Dec 2005 | A1 |
20050267925 | Clue | Dec 2005 | A1 |
20050276347 | Mujtaba et al. | Dec 2005 | A1 |
20060013250 | Howard et al. | Jan 2006 | A1 |
20060050770 | Wallace et al. | Mar 2006 | A1 |
20060067277 | Thomas et al. | Mar 2006 | A1 |
20060067421 | Walton et al. | Mar 2006 | A1 |
20060068718 | Li et al. | Mar 2006 | A1 |
20060106902 | Howard et al. | May 2006 | A1 |
20060155798 | Ketchum et al. | Jul 2006 | A1 |
20060234789 | Tarokh et al. | Oct 2006 | A1 |
20060274844 | Walton et al. | Dec 2006 | A1 |
20060285531 | Howard et al. | Dec 2006 | A1 |
20070009059 | Wallace et al. | Jan 2007 | A1 |
20070217538 | Waxman | Sep 2007 | A1 |
20070249296 | Howard et al. | Oct 2007 | A1 |
20080031372 | Walton et al. | Feb 2008 | A1 |
20080031374 | Walton et al. | Feb 2008 | A1 |
20080095121 | Shattil | Apr 2008 | A1 |
20080095282 | Walton et al. | Apr 2008 | A1 |
20080273617 | Lundby et al. | Nov 2008 | A1 |
20100074301 | Howard et al. | Mar 2010 | A1 |
20100169396 | Howard et al. | Jul 2010 | A1 |
20110142097 | Walton et al. | Jun 2011 | A1 |
20120213181 | Walton et al. | Aug 2012 | A1 |
20120250788 | Walton et al. | Oct 2012 | A1 |
20130188677 | Howard et al. | Jul 2013 | A1 |
Number | Date | Country |
---|---|---|
2490520 | Dec 2003 | CA |
2510840 | Jul 2004 | CA |
1476695 | Feb 2004 | CN |
1592144 | Mar 2005 | CN |
0091999 | Oct 1983 | EP |
0752793 | Jan 1997 | EP |
0905920 | Mar 1999 | EP |
1009124 | Jun 2000 | EP |
1073214 | Jan 2001 | EP |
1185001 | Mar 2002 | EP |
1220506 | Jul 2002 | EP |
1223702 | Jul 2002 | EP |
1241824 | Sep 2002 | EP |
1353452 | Oct 2003 | EP |
1361686 | Nov 2003 | EP |
1396956 | Mar 2004 | EP |
11163822 | Jun 1999 | JP |
11-205026 | Jul 1999 | JP |
2000068975 | Mar 2000 | JP |
2001077788 | Mar 2001 | JP |
2001237751 | Aug 2001 | JP |
2002-503048 | Jan 2002 | JP |
2002524972 | Aug 2002 | JP |
2003249914 | Sep 2003 | JP |
2003530010 | Oct 2003 | JP |
2004-023416 | Jan 2004 | JP |
2004-064654 | Feb 2004 | JP |
2004-072150 | Mar 2004 | JP |
2004-096753 | Mar 2004 | JP |
2004509556 | Mar 2004 | JP |
2004-104790 | Apr 2004 | JP |
2005027294 | Jan 2005 | JP |
2005519567 | Jun 2005 | JP |
2005-524331 | Aug 2005 | JP |
2007504188 | Mar 2007 | JP |
2007-515829 | Jun 2007 | JP |
2007515131 | Jun 2007 | JP |
2007-523549 | Aug 2007 | JP |
2007-523550 | Aug 2007 | JP |
2007527150 | Sep 2007 | JP |
2007-529972 | Oct 2007 | JP |
2007-538414 | Dec 2007 | JP |
200260860 | Jul 2002 | KR |
20040061023 | Jul 2004 | KR |
20040089748 | Oct 2004 | KR |
20060123496 | Dec 2006 | KR |
2103768 | Jan 1998 | RU |
2111619 | May 1998 | RU |
2116698 | Jul 1998 | RU |
2202152 | Apr 2003 | RU |
2238611 | Oct 2004 | RU |
2005115862 | Jan 2006 | RU |
2292116 | Jan 2007 | RU |
341680 | Oct 1998 | TW |
350047 | Jan 1999 | TW |
466385 | Dec 2001 | TW |
508960 | Nov 2002 | TW |
510103 | Nov 2002 | TW |
512602 | Dec 2002 | TW |
200304287 | Sep 2003 | TW |
I337487 | Feb 2011 | TW |
9737456 | Oct 1997 | WO |
0014921 | Mar 2000 | WO |
WO0044144 | Jul 2000 | WO |
WO0156218 | Feb 2001 | WO |
0176110 | Oct 2001 | WO |
WO0205506 | Jan 2002 | WO |
0219565 | Mar 2002 | WO |
0225857 | Mar 2002 | WO |
02078211 | Oct 2002 | WO |
WO02093784 | Nov 2002 | WO |
03015334 | Feb 2003 | WO |
03041300 | May 2003 | WO |
03047118 | Jun 2003 | WO |
WO03050968 | Jun 2003 | WO |
03058871 | Jul 2003 | WO |
03063526 | Jul 2003 | WO |
WO03056742 | Jul 2003 | WO |
WO03071711 | Aug 2003 | WO |
03077492 | Sep 2003 | WO |
WO03073646 | Sep 2003 | WO |
03094386 | Nov 2003 | WO |
04002011 | Dec 2003 | WO |
04002047 | Dec 2003 | WO |
WO03101029 | Dec 2003 | WO |
WO2004021605 | Mar 2004 | WO |
2004038984 | May 2004 | WO |
2004038985 | May 2004 | WO |
WO2004038987 | May 2004 | WO |
WO2004039011 | May 2004 | WO |
WO2004043082 | May 2004 | WO |
WO2004054191 | Jun 2004 | WO |
2005060298 | Jun 2005 | WO |
WO2005060144 | Jun 2005 | WO |
WO2005060192 | Jun 2005 | WO |
WO2005088882 | Sep 2005 | WO |
2005099211 | Oct 2005 | WO |
WO2005114868 | Dec 2005 | WO |
WO2006053340 | May 2006 | WO |
Entry |
---|
Auer, G., Channel Estimation for OFDM With Cyclic Delay Diversity, Personal, Indoor and Mobile Radio Communications, 2004. PIMRC 2004, 15th IEEE International Symposium on, Sep. 5, 2004, vol. 3, pp. 1792-1796. |
Bauch, G. et al., Orthogonal Frequency Division Multiple Access With Cyclic Delay Diversity, Smart Antennas, 2004, ITG Workshop on, Mar. 18, 2004, pp. 17-24. |
Masoud Sharif, Babak Hassibi, On the Capacity of MIMO Broadcast Channel With Partial Side Information, Signals, Systems and Computers, 2003, Conference Record of the Thirty-Seventh Asilomar Conference, Nov. 12, 2003. |
Antenna-Theory.com, “Steering Vector”, http://www.antenna-theory.com, pp. 1., No date given. (Cited by USPTO Examiner in U.S. Appl. No. 10/821,390 on Jan. 1, 2011). |
Doonstnejad et al, “Space-time Spreading Codes for a Multiuser MIMO System,” Institute of Electrical and Electronics Engineers, Conference Record of the 36th. Asilomar Conference on Signals, Systems, & Computers, Pacific Grove, California, Nov. 3-6, 2002, pp. 1374-1378. |
Farrokhi et al., “Link-Optimal Space-Time Processing with Multiple Transmit and Receive Antennas,” IEEE Communications Letters, vol. 5, No. 3, pp. 85-87(2001). |
Goldsmith et al., “Capacity Limits of MIMO Channels,” IEEE Journal on Selected Areas in Communications, vol. 21, No. 5, pp. 684-702, Jun. 2003. |
Hanzo et al., Single and Multi-Carrier Ds-CDMA, “Space-Time Spreading Aided Single-Carrier Wideband CDMA Communicating Over Multipath Nakagami Fading Channels,” Chapter 8, pp. 279-310, John Wiley & Sons, England, 2003 (XP-002357231). |
Hochwald et al., “A Transmitter Diversity Scheme for Wideband CDMA Systems based on Space-time Spreading”, Selected Areas in Communications, vol. 19, No. 1, Jan. 2001. |
Hochwald et al., “Unitary Space-Time Modulation for Multiple-Antenna Communications in Rayleigh Flat Fading,” IEEE Transactions on Information Theory, vol. 46, No. 2, pp. 543-564 (2000). |
Ketchum, John, et al., “PHY Design for Spatial Multiplexing MIMO WLAN,” IEEE 802.11-04/0721r0, IEEE, Jul. 2004, pp. 1-33 (Spatial Spreading Mode, Intrinsic Transmission Mode). |
Li, et al., “Transmit Diversity Over Quasi-Static Fading Channels Using Multiple Antennas and Random Signal Mapping,” IEEE Transactions on Communications, vol. 51, No. 11, Nov. 2003, pp. 1918-1926. |
Liu, Jung-Tao: “Successive decoding of multiple space time coded streams in multi-input multi-output systems,” Global Telecommunications Conference, 2002. Globecom '02. IEEE, USA, Nov. 21, 2002, 1007-1011 vol. 1. |
Marzetta et al., “Structured Unitary Space-Time Autocoding Constellations,”IEEE Transactions on Information Theory, vol. 48, No. 4, Apr. 2002, pp. 942-950. |
Medles et al., “Multistream Space-Time Coding by Spatial Spreading, Scrambling and Delay Diversity,” IEEE International Conference on Acoustics, Speech and Signal Processing, vol. 4 of 4, XP-10803892, pp. 2429-2432 (2002). |
Sharif et al., “On the Capacity of MIMO Broadcast Channel with Partial Side Information”, Department of Electrical Engineering, CA Institute of Engineering, IEEE 2002, pp. 958-962. |
Suthaharan et al.: Space-time coded MIMO-OFDM for high capacity and high data-rate wireless communication over frequency selective fading channels, Mobile and Wireless Communications Networks, 2002. 4th International Workshop on, USA, Sep. 11, 2002, 424-428. |
Winters, J. “Smart antennas for wireless systems”, IEEE Personal Communications, Dec. 5, 2003, pp. 1-113. |
Yao, Huan, “Efficient Signal, Code, and Receiver Designs for MIMO Communication Systems,” Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, 2003. |
Yu and Cioffi, “Trellis Precoding for the Broadcast Channel,” IEEE Global Telecommunications Conference, vol. 2, Electrical Engineering Department, Stanford, University, Stanford, California (2001), pp. 1344-1348. |
Agustin, et al., “LDC Construction With a Defined Structure,”Vehicular Technology Conference, XP010700754, Oct. 2003. |
Alamouti, “A Simple Transmit Diversity Technique for Wireless Communications,” IEEE Journal on Select Areas in Communications, vol. 16, No. 8, Oct. 1998, pp. 1451-1458. |
B.M Hochwald, et al., “Systematic Design of Unitary Space-Time Constellations,”IEEE Trans. on IT,vol. 46, No. 6, Sep. 2000. |
Bem, et al., “Smart Antennas for Mobile Communications Systems,” International Conference on Microwaves, Radar and Wireless Communications, vol. 3, May 22, 2000, pp. 120-130, XP010537479. |
Bourdoux, et al., “Non-reciprocal transceivers in OFDM/SDMA Systems: Impact and Mitigation,” Radio and Wireless Conference, Aug. 10, 2003, pp. 183-186, XP010656728. |
Bruhl, et al., “Investigation of Front-end Requirements for MIMO-Systems Using Downlink Pre-Distortion,” European Personal Mobile Communications Conference, 2003, pp. 472-476, XP002330243. |
Crow, I.: “The Fourier Matrix,” Apr. 27, 2001, http://www.maths.abdn.ac.uk/˜igc/tch/mx4002/notes/node91.html, pp. 1-3. |
Dammann, et al., “Beamforming in Combination with Space-Time Diversity for Broadband OFDM Systems,” IEEE International Conference on Communications, 2002. ICC 2002. New York, NY, Apr. 28-May 2, 2002, vol. 1, pp. 165-171. |
Jungnickel, et al., “A Mimo System with Reciprocal Transceivers for the Time-division Duplex Mode,” Antennas and Propagation Society International Symposium, vol. 2, Jun. 20, 2004, pp. 1267-1270, XP010721570. |
Kaiser, “Spatial Transmit Diversity Techniques for Broadband OFDM Systems,” IEEE Global Telecommunications Conference, 2000. GLOBECOM '00. San Francisco, CA, Nov. 27-Dec. 1, 2000, vol. 3, pp. 1824-1828. |
Laroia R., et al., “Enhanced Opportunistic Beamforming,” Vehicular Technology Conference, 2003. VTC 2003—Fall. IEEE 58th Orlando, FL, USA Oct. 6-9, 2003, pp. 1762-1766, XP010702878. |
Narula, et al., “Performance Limits of Coded Diversity Methods for Transmitter Antenna Arrays,” IEEE Transactions on Information Theory, vol. 45, No. 7, Nov. 1999, pp. 2418-2433. |
Pan, et al., “Dynamic Sub-channel Allocation with Adaptive Beamforming for Broadband OFDM Wireless Systems,” IEEE Global Telecommunications Conference, 2002. GLOBECOM '02. Taipei, Taiwan, Nov. 17-21, 2002, New York, NY, vol. 1, pp. 711-715. |
T.L. Marzetta, B. Hassibi, B.M Hochwald, “Structured Unitary Space-Time Autocoding Constellations,” IEEE Trans. on IT,vol. 48, No. 4, Apr. 2002. |
IEEE Std. 802.11a-1999, Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, Amendment 1: High-Speed Physical Layer in the 5 GHz Band. |
IEEE Std. 802.11g-2003, Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, Amendment 4: Further Higher Data Rate Extension in the 2.4 GHz Band. |
“Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications: High-Speed Physical Layer in the 5GHz Band,” IEEE Standards 802.11a, Sep. 1999. |
International Search Report—PCT/US05/015042, International Search Authority—European Patent Office, Sep. 21, 2005. |
Written Opinion—PCT/US05/015042, International Search Authority—European Patent Office, Sep. 21, 2005. |
Written Opinion of IPEA—PCT/US05/015042—IPEA/US, Apr. 18, 2006. |
International Preliminary Report on Patentability—PCT/US05/015042, IPEA/US, Sep. 11, 2006. |
Bello: “Characterization of Randomly Time-Variante Linear Channels,” Communications Systems, IEEE transactions on, vol. 11, Issue 4, pp. 360-393, Dec. 1963. |
Branka et al., “Performance Limits of Multiple-Input Multiple-Output Wireless Communication Systems”, Space-Time Coding, John Wiley& Sons. Ltd, Apr. 2003, England, pp. 1-9. |
Giacomantone, Javier Oscar, “Tradeoffs in Arithmetic Architectures for CORDIC Algorithm Design.”, pp. 1-9, CeTAD—Fac. De Ingenieria—UNLP, Argentina [presented at IBERCHIP VII Workshop, Session 4, Montevideo, Uruguay, Mar. 21-23, 2001]. |
Gotze, J., et al., “An Algorithm and Architecture Based on Orthonormal Mu-Rotations for Computing the Symmetric EVD” Integration, The VLSI Journal, North-Holland Publishing Company. Amsterdam, NL, vol. 20, No. 1, Dec. 1, 1995, pp. 21-39. |
Griffin, Grant R., “Cordic FAQ,” Iowegian's dspGuru. pp. 1-6. |
Hemkumar N. D., et al. “Efficient Complex Matrix Transformations with CORDIC” Computer Arithmetic, 1994. Proceedings., 11th Symposium on Windsor, Ont., Canada Jun. 29-Jul. 2, 1993, Los Alamitos, CA, USA, IEEE Comput. Soc, pp. 122-129. |
Hsiao, S. et al.: “Parallel Singular Value Decomposition of Complex Matrices Using Multidimensional CORDIC Algorithms” IEEE Transactions of Signal Processing, IEEE Service Center, New York, NY, UA, vol. 44, No. 3, pp. 685-697, Mar. 1, 1996. |
Jihoon Choi et al., “Interpolation Based Transmit Beamforming for MIMO-OFDM with Limited Feedback”, IEEE Communications Society, 2004, 249-253, Austin, Texas. |
Kim, M. et al.: “Design of Jacobi EVD Processor Based on CORDIC for DOA Estimation with Music Algorithm.” Personal, Indoor, and Mobile Radio Communications, 2002. pp. 120-124, The 13th IEEE International Symposium on Sep. 15-18, 2002, Piscataway, NJ, USA, IEEE. |
Liu et al., “OFDM-MIMO WLAN AP Front-end Gain and Phase Mismatch Calibration,” IEEE Radio and Wireless Conference, Sep. 2004, pp. 151-154, XP002330244. |
Michalke C et al: Efficient tracking of eigenspaces and its application to eigenbeanforming Personal, Indoor and Mobile Radio Communications 14th IEEE Proceedings, Sep. 7, 2003, pp. 2847-2851, Sections II.B and III.C XP010678152. |
Nowak, et al., “An Efficient Implementation of a 256-point FFT Processor with CORDIC for OFDM Systems,” Delft University of Technology, Faculty of Information Technology and Systems Circuits and Systems Group, pp. 427-434, ISBN: 90-73461-15-4. 1998. STW, 1998 1026-01. |
Oksa G et al: “Multi-level parallelism in the block-jacobi SVD algorithm” Parallel and Distribution Processing, 2001. Proceedings. Ninth Euromicr O Workshop. IEEE, Feb. 7, 2001, pp. 306-313, XP010532138, ISBN: 978-0-7695-0987-7. |
Ralf Seeger et al: “Advance Eigenbeamforming for the 3GPP UMTS FDD Downlink” ITG IEEE Workshop on Smart Antennas, XX, XX, Apr. 4, 2004, pp. 1-8, XP002468805, Section III. |
Schafer F., et al.: “Efficient Tracking of Eigenspaces and its application to MIMO systems” Proceedings of the IST Mobile and Wireless Communications Summit, Jun. 18, 2003, pp. 1-6, XP002478514. |
Taiwan Search Report—TW094130237—TIPO—Oct. 3, 2011. |
Taiwan Search Report—TW094114588—TIPO—Mar. 14, 2012 |
Bossed, et al., “On Cyclic Delay Diversity in OFDM Based Transmission Schemes,” 7th International OFDM-Workshop (INOWO), Sep. 2002, XP002338873, Hamburg, Germany. |
Damen et al., “Systematic Construction of Full Diversity Algebraic Constellations”, IEEE Transactions on Information Theroty, Vol. 49, No. 12, Dec. 2003. |
Number | Date | Country | |
---|---|---|---|
20090290657 A1 | Nov 2009 | US |
Number | Date | Country | |
---|---|---|---|
60569103 | May 2004 | US | |
60576719 | Jun 2004 | US | |
60578656 | Jun 2004 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11050897 | Feb 2005 | US |
Child | 12533765 | US |