Coded MIMO systems with selective channel inversion applied per eigenmode

Information

  • Patent Grant
  • 8194770
  • Patent Number
    8,194,770
  • Date Filed
    Tuesday, August 27, 2002
    22 years ago
  • Date Issued
    Tuesday, June 5, 2012
    12 years ago
Abstract
Techniques to perform selective channel inversion per eigenmode in a MIMO system to achieve high spectral efficiency while reducing complexity at both the transmitter and receiver are presented. The available transmission channels are arranged into a number of groups, where each group may include all transmission channels (or frequency bins) for a respective eigenmode of a MIMO channel. The total transmit power is allocated to the groups using a particular group power allocation scheme. Selective channel inversion is then performed independently for each group selected for use for data transmission. For each such group, one or more transmission channels in the group are selected for use, and a scaling factor is determined for each selected channel such that all selected channels for the group achieve similar received signal quality (e.g., received SNR).
Description
BACKGROUND

1. Field


The present invention relates generally to data communication, and more specifically to techniques for performing selective channel inversion per eigenmode for MIMO systems.


2. Background


A multiple-input multiple-output (MIMO) communication system employs multiple (NT) transmit antennas and multiple (NR) receive antennas for data transmission. A MIMO channel formed by the NT transmit and NR receive antennas may be decomposed into NS independent channels, with NS≦min {NT, NR}. Each of the NS independent channels is also referred to as a spatial subchannel or eigenmode of the MIMO channel.


The spatial subchannels of a wideband MIMO system may encounter different channel conditions due to various factors such as fading and multipath. Each spatial subchannel may thus experience frequency selective fading, which is characterized by different channel gains at different frequencies of the overall system bandwidth. Assuming no power control, this then results in different signal-to-noise-and-interference ratios (SNRs) at different frequencies of each spatial subchannel, which would then be able to support different data rates for a particular level of performance (e.g., 1% packet error rate).


To combat frequency selective fading in a wideband channel, orthogonal frequency division multiplexing (OFDM) may be used to effectively partition the overall system bandwidth into a number of (NF) subbands, which are also referred to as frequency bins or subchannels. With OFDM, each subband is associated with a respective subcarrier upon which data may be modulated. For a MIMO system that utilizes OFDM (i.e., a MIMO-OFDM system), each subband of each spatial subchannel may be viewed as an independent transmission channel.


A key challenge in a coded communication system is the selection of the appropriate data rates and coding and modulation schemes to use for a data transmission based on the channel conditions. A major goal for the system is to maximize spectral efficiency while reducing complexity for both the transmitter and receiver.


One straightforward technique for selecting data rates and coding and modulation schemes is to “bit load” each transmission channel in the system according to its transmission capability. However, this technique has several major drawbacks. First, coding and modulating individually for each transmission channel can significantly increase the complexity of the processing at both the transmitter and receiver. Second, coding individually for each transmission channel may greatly increase coding and decoding delay.


There is, therefore, a need in the art for techniques to achieve high spectral efficiency in MIMO systems without having to individually code for each transmission channel.


SUMMARY

Techniques are provided herein to perform selective channel inversion per eigenmode in a MIMO system to achieve high spectral efficiency while reducing complexity at both the transmitter and receiver. The available transmission channels are arranged into a number of groups, where each group may include all transmission channels (or frequency bins) for an eigenmode of a MIMO channel. The total transmit power is allocated to the groups using a particular power allocation scheme (e.g., uniform power allocation, water-filling, and so on). Selective channel inversion is then performed independently for each group selected for use for data transmission (i.e., with non-zero allocated transmit power). For each such group, one or more transmission channels in the group is selected for use, and a scaling factor is determined for each selected channel such that all selected channels for the group are inverted and achieve similar received signal quality (e.g., received SNR).


Various aspects and embodiments of the invention are described in further detail below. The invention further provides methods, program codes, digital signal processors, transmitter units, receiver units, and other apparatuses and elements that implement various aspects, embodiments, and features of the invention, as described in further detail below.





BRIEF DESCRIPTION OF THE DRAWINGS

The features, nature, and advantages of the present invention will become more apparent from the detailed description set forth below when taken in conjunction with the drawings in which like reference characters identify correspondingly throughout and wherein:



FIG. 1 graphically illustrates eigenvalue decomposition for a MIMO-OFDM system;



FIG. 2 shows plots of the average spectral efficiency achieved by three transmission schemes for an example 4×4 MIMO system;



FIG. 3 is a block diagram of an access point and a user terminal in the MIMO-OFDM system;



FIG. 4 is a block diagram of a transmitter unit in the access point; and



FIG. 5 is a flow diagram for processing data using selective channel inversion per eigenmode.





DETAILED DESCRIPTION

In a MIMO communication system, such as a multiple-antenna wireless communication system, the data streams transmitted from the NT transmit antennas interfere with each other at the receiver. One technique for combating this interference is to “diagonalize” the MIMO channel to obtain a number of independent channels.


The model for a MIMO system may be expressed as:

y=Hx+n,  Eq (1)

where

    • y is a vector with NR entries, {yi} for iε{1, . . . , NR}, for the symbols received by the NR receive antennas (i.e., the “received” vector);
    • x is a vector with NT entries, {xj} for jε{1, . . . , NT}, for the symbols transmitted from the NT transmit antennas (i.e., the “transmitted” vector);
    • H is an (NR×NT) channel response matrix that contains the transfer functions (i.e., complex gains) from the NT transmit antennas to the NR receive antennas; and
    • n is additive white Gaussian noise (AWGN) with a mean vector of 0 and a covariance matrix of Λn2I, where 0 is a vector of all zeros, I is the identity matrix with ones along the diagonal and zeros everywhere else, and σ2 is the noise variance.


For simplicity, a flat-fading, narrowband channel is assumed. In this case, the channel response can be represented by a constant complex value for the entire system bandwidth, and the elements of the channel response matrix H are scalars. Although the assumption of frequency non-selectivity is assumed here for simplicity, the techniques described herein may be extended for frequency selective channels.


The channel response matrix H may be diagonalized by performing eigenvalue decomposition on the correlation matrix of H, which is R=HH H. The eigenvalue decomposition of the (NT×NT) correlation matrix R may be expressed as:

R=EDEH,  Eq (2)

where

    • E is an (NT×NT) unitary matrix whose columns are the eigenvectors ei of R, for iε{1, . . . , NT};
    • D is an (NT×NT) diagonal matrix with entries on the diagonal corresponding to the eigenvalues of R; and
    • for any matrix M, MH denotes the conjugate transpose of M.


      A unitary matrix is denoted by the property EHE=I.


The eigenvalue decomposition may also be performed using singular value decomposition (SVD), which is known in the art.


The diagonal matrix D contains non-negative real values along the diagonal and zeros elsewhere. These diagonal entries are referred to as the eigenvalues of the matrix R and are indicative of the power gains for the independent channels of the MIMO channel. The number of independent channels for a MIMO system with NT transmit and NR receive antennas is the number of non-zero eigenvalues of R. NS≦min {NT, NR}. These non-zero eigenvalues are denoted as {λi}, for i={1, . . . , NS}.


Without taking into account power constraints for the NT transmit antennas, the MIMO channel may be diagonalized by pre-multiplying (or “preconditioning”) a “data” vector s with the unitary matrix E to obtain the transmitted vector x. The preconditioning at the transmitter may be expressed as:

x=Es.  Eq (3)


At the receiver, the received vector y may be pre-multiplied (or “conditioned”) with EHHH to obtain an estimate of the data vector s. The conditioning to obtain the data vector estimate ŝ may be expressed as:














s
_

^

=



E
_

H




H
_

H



y
_








=




E
_

H




H
_

H



H
_



E
_



s
_


+



E
_

H




H
_

H



n
_










=



D
_



s
_


+


n
_

^



,







Eq






(
4
)









where {circumflex over (n)} is AWGN with a mean vector of 0 and a covariance matrix of Λ{circumflex over (n)}2 D.


As shown in equation (4), the preconditioning at the transmitter and the conditioning at the receiver result in the data vector s being transformed by an effective channel response represented by the matrix D, as well as a scaling of the noise elements. Since D is a diagonal matrix, there are effectively NS non-interfering, parallel channels. Each of these channels has a power gain equal to the square of the corresponding eigenvalue, λi2, and a noise power equal to σ2λi for iε{1, . . . , NS}, yielding a signal-to-noise ratio of λi2. Thus, the power gain of each of these channels is equal to the eigenvalue, λi, for iε{1, . . . , NS}. Parallel channel i is often referred to as eigenmode i or mode i. The diagonalization of the MIMO channel as shown in equations (3) and (4) can be achieved if the transmitter is provided with the channel response matrix H or equivalent information.


The eigenvalue decomposition described above may also be performed for a wideband, frequency-selective channel. For a MIMO-OFDM system, the wideband channel is divided into NF flat-fading, orthogonal frequency bins or subbands. The eigenvalue decomposition may then be performed independently for the channel response matrix H(k) for each frequency bin, k, to determine the NS spatial subchannels or eigenmodes for that frequency bin. Each spatial subchannel of each frequency bin is also referred to as a “transmission” channel.


The model for a MIMO-OFDM system may be expressed as:

y(k)=H(k)x(k)+n(k), for kε{1, . . . , NF}.  Eq (5)

where “(k)” denotes the k-th frequency bin.


The eigenvalue decomposition of the correlation matrix R(k) for each frequency bin may be expressed as:

R(k)=E(k)D(k)EH(k).  Eq (6)

The non-zero eigenvalues for R(k) are denoted as {λi(k)}, for i={1, . . . , NS} and k={1, . . . , NF}. Thus, for the MIMO-OFDM system, performing eigenmode decomposition for each of the NF frequency bins results in NS spatial subchannels or eigenmodes for each frequency bin, or a total of NSNF transmission channels.


The eigenvalues may be provided in two forms—a “sorted” form and a “random-order” form. In the sorted form, the NS eigenvalues for each frequency bin are sorted in decreasing order so that {λ1(k)≧λ2(k)≧ . . . ≧λNS(k)}, where λ1(k) is the largest eigenvalue for frequency bin k and λNS(k) is the smallest eigenvalue for frequency bin k. In the random-order form, the ordering of the eigenvalues may be random and further independent of frequency. The particular form selected for use, sorted or random-ordered, influences the selection of the eigenmodes for use for data transmission and the coding and modulation scheme to be used for each selected eigenmode, as described below.



FIG. 1 graphically illustrates the eigenvalue decomposition for the MIMO-OFDM system. The set of diagonal matrices, D(k) for k={1, . . . , NF}, is shown arranged in order along an axis 110 that represents the frequency dimension. The eigenvalues, {λi(k)} for i={1, . . . , NS}, of each matrix D(k) are located along the diagonal of the matrix. Axis 112 may thus be viewed as representing the spatial dimension. The eigenmode i for all frequency bins (or simply, eigenmode i) is associated with a set of elements, {λi(k)} for k={1, . . . , NF}, which is indicative of the frequency response across all NF frequency bins for that eigenmode. The set of elements {λi(k)} for each eigenmode is shown by the shaded boxes along a dashed line 114. Each shaded box in FIG. 1 represents a transmission channel. For each eigenmode that experiences frequency selective fading, the elements {λi(k)} for that eigenmode may be different for different values of k.


If the eigenvalues in each diagonal matrix D(k) are sorted in descending order, then eigenmode 1 (which is also referred to as the principal eigenmode) would include the largest eigenvalue, λ1(k), in each matrix, and eigenmode NS would include the smallest eigenvalue, λNS(k), in each matrix.


The eigenvalue decomposition for each frequency bin in the MIMO-OFDM system results in a total of NSNF eigenvalues for the NSNF transmission channels over the entire bandwidth. Each transmission channel may achieve a different SNR and may be associated with different transmission capability. Various power allocation schemes (or transmission schemes) may be used to distribute the total transmit power to these transmission channels to achieve high overall spectral efficiency, which is given in units of bit/second per Hertz (bps/Hz). Some of these schemes are described in further detail below.


1. Water-Filling


The “water-filling” or “water-pouring” scheme may be used to optimally distribute the total transmit power across the transmission channels such that the overall spectral efficiency is maximized, under the constraint that the total transmit power at the transmitter is limited to Ptotal. The water-filling scheme distributes power over the NSNF transmission channels such that the channels with increasingly higher SNRs receive increasingly greater fractions of the total transmit power. The transmit power allocated to a given transmission channel is determined by that channel's SNR, which may be given as λi(k)/σ2, where λi(k) is the i-th eigenvalue in the k-th frequency bin.


The procedure for performing water-filling is known in the art and not described herein. The result of the water-filling is a specific transmit power allocation to each of the NSNF transmission channels, which is denoted as Pi(k), for i={1, . . . , NS} and k={1, . . . , NF}. The power allocation is performed such that the following condition is satisfied:











P
total

=




k

K







i

L





P
i



(
k
)





,




Eq






(
7
)









where L={1, . . . , NS} and K={1, . . . , NF}.


Based on the allocated transmit powers of Pi(k), for i={1, . . . , NS} and k={1, . . . , NF}, the received SNR, γi(k), for each transmission channel may be expressed as:












γ
i



(
k
)


=




P
i



(
k
)





λ
i



(
k
)




σ
2



,


for





i

=



{

1
,





,

N
S


}






and





k

=


{

1
,





,

N
F


}

.







Eq






(
8
)








The total spectral efficiency C for the NSNF transmission channels may then be computed based on a continuous, monotonically increasing logarithmic function for capacity, as follows:









C
=




k
=
1


N
F







i
=
1


N
S






log
2

(

1
+


γ
i



(
k
)



)

.







Eq






(
9
)








In a typical communication system, the total range of received SNRs expected to be observed may be partitioned into a number of sub-ranges. Each sub-range may then be associated with a particular coding and modulation scheme chosen to yield the highest spectral efficiency for a given bit error rate (BER), frame error rate (FER), or packet error rate (PER). The water-filling power allocation may result in a different received SNR for each of the NSNF transmission channels. This would then result in the use of many different coding/modulation schemes for the transmission channels. The coding/modulation per transmission channel increases the overall spectral efficiency at the expense of greater complexity for both the transmitter and receiver.


2. Selective Channel Inversion Applied to All Transmission Channels


The “SCI-for-all-channels” scheme performs selective channel inversion (SCI) on all transmission channels such that those selected for use achieve approximately equal received SNRs at the receiver. This would then allow a common coding and modulation scheme to be used for all selected transmission channels. This scheme greatly reduces complexity for both the transmitter and receiver in comparison to the water-filling scheme. The equalization of the received SNRs may be achieved by first selecting all or only a subset of the NSNF available transmission channels for use for data transmission. The channel selection may result in the elimination of poor channels with low SNRs. The total transmit power Ptotal is then distributed across the selected transmission channels in such a way that the received SNR is approximately equal for all selected transmission channels.


If “full” channel inversion is performed for all NSNF available transmission channels, then the total transmit power Ptotal may be allocated such that approximately equal signal power is received for all these channels. An appropriate amount of transmit power Pi(k) to allocate to eigenmode i of frequency bin k may be expressed as:












P
i



(
k
)


=


α






P
total




λ
i



(
k
)




,




Eq






(
10
)









where α is a normalization factor used to distribute the total transmit power among the available transmission channels. This normalization factor, α, may be expressed as:









α
=


1




i

L







k
=
K






λ
i



(
k
)



-
1





.





Eq






(
11
)








The normalization factor, α, ensures approximately equal received signal power for all transmission channels, which is given as αPtotal. The total transmit power is thus effectively distributed (unevenly) across all available transmission channels based on their channel power gains, which is given by the eigenvalues λi(k).


If “selective” channel inversion is performed, then only transmission channels whose received powers are at or above a particular threshold β relative to the total received power are selected for use for data transmission. Transmission channels whose received powers fall below this threshold are discarded and not used. For each selected transmission channel, the transmit power to be allocated to the channel is determined as described above, such that all selected transmission channels are received at approximately equal power levels. The threshold β may be selected to maximize spectral efficiency or based on some other criterion.


The selection of the transmission channels for use may be performed as follows. Initially, an average power gain Pavg is computed for all available transmission channels and may be expressed as:










P
avg

=


1


N
F



N
S








k
=
1


N
F







i
=
1


N
S






λ
i



(
k
)


.








Eq






(
12
)








The transmit power to allocate to each transmission channel may then be expressed as:











P
i



(
k
)


=

{







α
~



P
total




λ
i



(
k
)



,






λ
i



(
k
)




β






P
avg








0
,




otherwise
,









Eq






(
13
)









where β the threshold and {tilde over (α)} is a normalization factor that is similar to α in equation (11). However, the normalization factor ã is computed over only the selected transmission channels and may be expressed as:










α
~

=


1






λ
i



(
k
)




β






P
avg








λ
i



(
k
)



-
1




.





Eq






(
14
)









The threshold β may be derived as described below (in Section 3.2).


As shown in equation (13), a transmission channel is selected for use if its eigenvalue (or channel power gain) is greater than or equal to a power threshold (i.e., λi(k)≧βPavg). Since the normalization factor {tilde over (α)} is computed based only on the selected transmission channels, the total transmit power Ptotal is distributed to the selected transmission channels based on their channel gains such that all selected transmission channels have approximately equal received power, which may be expressed as {tilde over (α)}Ptotal.


The equalization of the received SNRs for all selected transmission channels can thus be achieved by non-uniform distribution of the total transmit power across these channels. The approximately equal received SNRs would then allow the use of a single data rate and a common coding/modulation scheme for all selected transmission channels, which would greatly reduce complexity.


3. Selective Channel Inversion Applied Per Eigenmode


The “SCI-per-eigenmode” scheme performs selective channel inversion independently for each eigenmode to provide improved performance. In an embodiment, the NSNF transmission channels are arranged into NS groups such that each group includes all NF frequency bins for a given eigenmode (i.e., group i includes the spatial subchannels for all NF frequency bins for eigenmode i). There is thus one group for each eigenmode.


The SCI-per-eigenmode scheme includes two steps. In the first step, the total transmit power Ptotal is distributed to the NS groups based on a particular group power allocation scheme. In the second step, selective channel inversion is performed independently for each group to distribute that group's allocated transmit power to the NF frequency bins in the group. Each of these steps is described in further detail below.


3.1 Power Allocation Across Groups


The total transmit power Ptotal may be distributed to the NS groups in various manners, some of which are described below.


In a first embodiment, the total transmit power Ptotal is distributed uniformly across all NS groups such that they are all allocated equal power. The transmit power PG(i) allocated to each group may be expressed as:












P
G



(
i
)


=


P
total


N
S



,


for





i




{

1
,





,

N
S


}

.






Eq






(
15
)








In a second embodiment, the total transmit power Ptotal is distributed to the NS groups based on water-filling across all available transmission channels. For this embodiment, the total transmit power, Ptotal, is first distributed to all NSNF transmission channels using water-filling, as described above. Each transmission channel is allocated Pi(k), for iε{1, . . . , NS} and k={1, . . . , NF}. The transmit power allocated to each group can then be determined by summing over the transmit powers allocated to the NF transmission channels in that group. The transmit power allocated to group i may be expressed as:












P
G



(
i
)


=




k
=
1


N
F





P
i



(
k
)




,


for





i




{

1
,





,

N
S


}

.






Eq






(
16
)








In a third embodiment, the total transmit power Ptotal is distributed to the NS groups based on water-filling across all groups using their average channel SNRs. Initially, the average channel SNR, γavg(i), for each group is determined as:












γ
avg



(
i
)


=


1

N
F







k
=
1


N
F






λ
i



(
k
)



σ
2





,


for





i




{

1
,





,

N
S


}

.






Eq






(
17
)









Water-filling is then performed to distribute the total transmit power Ptotal across the NS groups based on their average channel SNRs. The transmit power allocated to each of the NS groups is denoted as PG(i), for iε{1, . . . , NS}.


In a fourth embodiment, the total transmit power Ptotal is distributed to the NS groups based on water-filling across all groups using the received SNRs of the transmission channels after channel inversion. For this embodiment, the total transmit power Ptotal is first distributed uniformly to the NS groups as shown above in equation (15) such that each group is allocated an initial transmit power of {tilde over (P)}G(i)=Ptotal/NS, for iε{1, . . . , NS}. Selective channel inversion is then performed independently on each group to determine an initial power allocation, {tilde over (P)}i(k) for k={1, . . . , NF}, for each frequency bin in the group. The received SNR, {tilde over (γ)}i(k), for each frequency bin is next determined based on the initial power allocation {tilde over (P)}i(k), as shown in equation (8). The average received SNR {tilde over (γ)}avg(i) for each group is then computed as follows:













γ
~

avg



(
i
)


=


1

N
F







k
=
1


N
F






γ
~

i



(
k
)





,


for





i




{

1
,





,

N
S


}

.






Eq






(
18
)








The total transmit power Ptotal is then distributed to the NS groups using water-filling based on their average received SNRs, {tilde over (γ)}avg(i) for iε{1, . . . , NS}. The results of the water-filling power allocation are revised (i.e., final) transmit power allocations PG(i), for iε{1, . . . , NS}, for the NS groups. Selective channel inversion is again performed independently for each group to distribute the group's allocated transmit power PG(i) to the frequency bins in the group. Each frequency bin would then be allocated transmit power Pi(k) by the second selective channel inversion.


The second selective channel inversion need not be performed for a given group if (1) the revised transmit power allocated to the group by the water-filling is greater than the initial uniform power allocation (i.e., PG(i)>{tilde over (P)}G(i)) and (2) all frequency bins in the group were selected for use in the initial selective channel inversion. For this specific case, the new power allocation Pi(k) for each frequency bin in the group may be expressed as:












P
i



(
k
)


=




P
G



(
i
)





P
~

G



(
i
)







P
~

i



(
k
)




,


for





k




{

1
,





,

N
F


}

.






Eq






(
19
)









Equation (19) may be used because (1) all frequency bins in the group have already been selected for use and no additional frequency bin can be selected even though the revised power allocation PG(i) for the group is higher than the initial power allocation {tilde over (P)}G(i), and (2) the initial selective channel inversion already determines the proper distribution of power to the frequency bins in the group to achieve approximately equal received SNRs for these channels. In all other cases, the selective channel inversion is performed again for each group to determine the transmit power allocations, P1(k) for kε{1, . . . , NF}, for the frequency bins in the group.


3.2 Selective Channel Inversion Applied to Each Group


Once the total transmit power Ptotal has been distributed to the NS groups using any one of the group power allocation schemes described above, selective channel inversion is performed independently for each of the NS groups and on the NF frequency bins within each group. The selective channel inversion for each group may be performed as follows.


Initially, the average power gain, Pavg(i), for each group is determined as:












P
avg



(
i
)


=


1

N
F







k
=
1


N
F





λ
i



(
k
)





,


for





i




{

1
,





,

N
S


}

.






Eq






(
20
)









The transmit power allocated to frequency bin k in group i may then be expressed as:











P
i



(
k
)


=

{








α
~

i



P
total




λ
i



(
k
)



,






λ
i



(
k
)





β
i




P
avg



(
i
)









0
,




otherwise
,









Eq






(
21
)









where βi is the threshold and {tilde over (α)}i is the normalization factor for group i. The normalization factor {tilde over (α)}i for each group is computed over only the selected transmission channels for that group, and may be expressed as:











α
~

i

=


1






λ
i



(
k
)





β
i




P
avg



(
i
)









λ
i



(
k
)



-
1




.





Eq






(
22
)









The summation of the inverse channel power gains in equation (22) takes into account the channel power gains over all selected frequency bins of group i.


The threshold βi to select frequency bins for use in each group may be set based on various criteria, e.g., to optimize spectral efficiency. In one embodiment, the threshold βi is set based on the channel power gains (or eigenvalues) and the spectral efficiencies of the selected frequency bins based on uniform transmit power allocation across the frequency bins in each group, as described below.


For this embodiment, the derivation of the threshold βi for group i proceeds as follows (where the derivation is performed independently for each group). Initially, the eigenvalues for all NF frequency bins in the group are ranked and placed in a list Gi(l), for lε{1, . . . , NF}, in descending order such that Gi(1)=max{λi(k)} and Gi(NF)=min{λi(k)} for iε{1, . . . , NS}.


For each l, where lε{1, . . . , NF}, the spectral efficiency for the l best frequency bins is computed, where “best” refers to the frequency bins with the highest power gains, Gi(l). This can be achieved as follows. First, the total transmit power available to the group, PG(i), is distributed to the l best frequency bins using any one of the power allocation schemes described above. For simplicity, the uniform power allocation scheme is used, and the transmit power for each of the l frequency bins is PG(i)/l. Next, the received SNR for each of the l frequency bins is computed as:












γ
i
l



(
j
)


=




P
G



(
i
)





G
i



(
j
)





σ
2


l



,


for





j




{

1
,





,
l

}

.






Eq






(
23
)








The spectral efficiency Ci(l) for the l best frequency bins in group i is then computed as:












C
i



(
l
)


=

ρ









j
=
1

l




log
2

(

1
+


γ
i
l



(
j
)



)




,




Eq






(
24
)









where ρ is a scale factor used to account for inefficiencies in the coding and modulation scheme selected for use.


The spectral efficiency Ci(l) is computed for each value of l, where lε{1, . . . , NF}, and stored in an array. After all NF values of Ci(l) have been computed for the NF possible combinations of selected frequency bins, the array of spectral efficiencies is traversed and the largest value of Ci(l) is determined. The value of l, lmax, corresponding to the largest Ci(l) is then the number of frequency bins that results in the maximum spectral efficiency for the channel conditions being evaluated and using uniform transmit power allocation.


Since the eigenvalues for the NF frequency bins in group i are ranked in decreasing order in the list Gi(l), the spectral efficiency increases as more frequency bins are selected for use until the optimal point is reached, after which the spectral efficiency decreases because more of the group's transmit power is allocated to poorer frequency bins. Thus, instead of computing the spectral efficiency Ci(l) for all possible values of l, the spectral efficiency Ci(l) for each new value of l may be compared against the spectral efficiency Ci(l−1) for the previous value of l. The computation may then be terminated if the optimal spectral efficiency is reached, which is indicated by Ci(l)<Ci(l−1).


The threshold βi may then be expressed as:











β
i

=



G
i



(

l
max

)




P
avg



(
i
)




,




Eq






(
25
)









where Pavg(i) is determined as shown in equation (20).


The threshold βi may also be set based on some other criterion or some other power allocation scheme (instead of uniform allocation).


Selective channel inversion is described in further detail in U.S. patent application Ser. No. 09/860,274, filed May 17, 2001, Ser. No. 09/881,610, filed Jun. 14, 2001, and Ser. No. 09/892,379, filed Jun. 26, 2001, all three entitled “Method and Apparatus for Processing Data for Transmission in a Multi-Channel Communication System Using Selective Channel Inversion,” assigned to the assignee of the present application and incorporated herein by reference.


Performing selective channel inversion independently for each group results in a set of transmit power allocations, Pi(k) for kε{1, . . . , NF}, for the NF frequency bins in each group. The selective channel inversion may result in less than NF frequency bins being selected for use for any given group. The unselected frequency bins would be allocated no transmit power (i.e., Pi(k)=0 for these bins). The power allocations for the selected frequency bins are such that these bins achieve approximately equal received SNRs. This then allows a single data rate and a common coding/modulation scheme to be used for all selected frequency bins in each group.


For the sorted form, the eigenvalues λi(k), for iε{1, . . . , NS}, for each diagonal matrix D(k) are sorted such that the diagonal elements with smaller indices are generally larger. Eigenmode 1 would then be associated with the largest eigenvalue in each of the NF diagonal matrices, eigenmode 2 would be associated with the second largest eigenvalue, and so on. For the sorted form, even though the channel inversion is performed over all NF frequency bins for each eigenmode, the eigenmodes with lower indices are not likely to have too many bad frequency bins (if any) and excessive transmit power is not used for bad bins.


If water-filling is used to distribute the total transmit power to the NS eigenmodes, then the number of eigenmodes selected for use may be reduced at low SNRs. The sorted form thus has the advantage that at low SNRs, the coding and modulation are further simplified through the reduction in the number of eigenmodes selected for use.


For the random-ordered form, the eigenvalues for each diagonal matrix D(k) are randomly ordered. This may result in a smaller variation in the average received SNRs for all of the eigenmodes. In this case, fewer than NS common coding and modulation schemes may be used for the NS eigenmodes.


In one transmission scheme, if a group is to be used for data transmission, then all NF frequency bins in that group are selected (i.e., any active eigenmode needs to be a complete eigenmode). The frequency selective nature of an eigenmode can be exaggerated if one or more frequency bins are omitted from use. This greater frequency selective fading can cause higher level of inter-symbol interference (ISI), which is a phenomenon whereby each symbol in a received signal acts as distortion to subsequent symbols in the received signal. Equalization may then be required at the receiver to mitigate the deleterious effects of ISI distortion. This equalization may be avoided by performing full channel inversion on all frequency bins of each eigenmode that is selected for use. This transmission scheme may be advantageously used in conjunction with the sorted form and the water-filling power allocation since, as noted above, the eigenmodes with lower indices are not likely to have too many bad frequency bins.



FIG. 2 shows plots of the average spectral efficiency achieved by three transmission schemes for an example 4×4 MIMO system with total transmit power of Ptotal=4. Three plots are shown in FIG. 2 for three transmission schemes: (1) water-filling power allocation over all transmission channels, (2) selective channel inversion applied to all transmission channels (SCI-for-all-channels), and (3) selective channel inversion applied to each eigenmode independently (SCI-per-eigenmode) with the total transmit power being distributed among the four groups using water-filling based on their average channel SNRs.


The average spectral efficiency is plotted versus operating SNR, which is defined as γop=1/σ2. FIG. 2 indicates that the water-filling power allocation (plot 210) yields the highest spectral efficiency, as expected. The performance of the SCI-for-all-channels scheme (plot 230 is approximately 2.5 dB worse than that of the optimal water-filling scheme at a spectral efficiency of 15 bps/Hz. However, the SCI-for-all channels scheme results in much lower complexity for both the transmitter and receiver since a single data rate and a common coding/modulation scheme may be used for all selected transmission channels. The performance of the SCI-per-eigenmode scheme (plot 220) is approximately 1.5 dB worse than that of the water-filling scheme and 1.0 dB better than that of the SCI-for-all-channels scheme at 15 bps/Hz spectral efficiency. This result is expected since the SCI-per-eigenmode scheme combines water-filling with selective channel inversion. Although the SCI-per-eigenmode scheme is more complex than the SCI-for-all-channels scheme, it is less complex than the water-filling scheme and achieves comparable performance.



FIG. 3 is a block diagram of an embodiment of an access point 310 and a user terminal 350 in a MIMO-OFDM system 300.


At access point 310, traffic data (i.e., information bits) from a data source 312 is provided to a transmit (TX) data processor 314, which codes, interleaves, and modulates the data to provide modulation symbols. A TX MIMO processor 320 further processes the modulation symbols to provide preconditioned symbols, which are then multiplexed with pilot data and provided to NT modulators (MOD) 322a through 322t, one for each transmit antenna. Each modulator 322 processes a respective stream of preconditioned symbols to generate a modulated signal, which is then transmitted via a respective antenna 324.


At user terminal 350, the modulated signals transmitted from the NT antennas 324a through 324t are received by NR antennas 352a through 352r. The received signal from each antenna 352 is provided to a respective demodulator (DEMOD) 354. Each demodulator 354 conditions (e.g., filters, amplifies, and frequency downconverts) and digitizes the received signal to provide a stream of samples, and further processes the samples to provide a stream of received symbols. An RX MIMO processor 360 then processes the NR received symbol streams to provide NT streams of recovered symbols, which are estimates of the modulation symbols sent by the access point.


The processing for the reverse path from the user terminal to the access point may be similar to, or different from, the processing for the forward path. The reverse path may be used to send channel state information (CSI) from the user terminal back to the access point. The CSI is used at the access point to select the proper coding and modulation schemes for use and to perform the selective channel inversion.


Controllers 330 and 370 direct the operation at the access point and user terminal, respectively. Memories 332 and 372 provide storage for program codes and data used by controllers 330 and 370, respectively.



FIG. 4 is a block diagram of an embodiment of a transmitter unit 400, which is an embodiment of the transmitter portion of access point 310 in FIG. 3. Transmitter unit 400 may also be used for user terminal 350.


Within TX data processor 314, an encoder/puncturer 412 receives and codes the traffic data (i.e., the information bits) in accordance with one or more coding schemes to provide coded bits. A channel interleaver 414 then interleaves the coded bits based on one or more interleaving schemes to provide a combination of time, spatial, and/or frequency diversity. A symbol mapping element 416 then maps the interleaved data in accordance with one or more modulation schemes (e.g., QPSK, M-PSK, M-QAM, and so on) to provide modulation symbols.


The coding and modulation for the NS groups may be performed in various manners. In one embodiment, a separate coding and modulation scheme is used for each group of transmission channels for which selective channel inversion is applied. For this embodiment, a separate set of encoder, interleaver, and symbol mapping element may be used for each group. In another embodiment, a common coding scheme is used for all groups, followed by a variable-rate puncturer and a separate modulation scheme for each group. This embodiment reduces hardware complexity at both the transmitter and the receiver. In other embodiments, trellis coding and Turbo coding may also be used to code the information bits.


Within TX MIMO processor 320, estimates of the impulse response of the MIMO channel are provided to a fast Fourier transform (FFT) unit 422 as a sequence of matrices of time-domain samples, Ĥ(n). FFT unit 422 then performs an FFT on each set of NF matrices Ĥ(n) to provide a corresponding set of NF estimated channel frequency response matrices, Ĥ(k) for kε{1, . . . , NF}.


A unit 424 then performs eigenvalue decomposition on each matrix Ĥ(k) to provide the unitary matrix E (k) and the diagonal matrix D(k), as described above. The diagonal matrices D(k) are provided to a power allocation unit 430 and the unitary matrices E(k) are provided to a spatial processor 450.


Power allocation unit 430 distributes the total transmit power Ptotal to the NS groups using any one of the group power allocation schemes described above. This results in power allocations of PG(i), for iε{1, . . . , NS}, for the NS groups. Unit 430 then performs selective channel inversion independently for each group based on that group's allocated transmit power PG(i). This results in power allocations of Pi(k), for kε{1, . . . , NF}, for the NF frequency bins in each group, where Pi(k) may be equal to zero for one or more bins in the group (if it is not required that any active eigenmode be complete eigenmode). Unit 432 performs water-filling to distribute the total transmit power, and unit 434 performs selective channel inversion for each group. The power allocations Pi(k) for all transmission channels are provided to a signal scaling unit 440.


Unit 440 receives and scales the modulation symbols based on the power allocations to provide scaled modulation symbols. The signal scaling for each modulation symbol may be expressed as:

si′(k)=si(k)√{square root over (Pi(k))}, for iε{1, . . . , NS} and kε{1, . . . , NF},  Eq (26)

where si(k) is the modulation symbol to be transmitted on eigenmode i of frequency bin k, si′(k) is the corresponding scaled modulation symbol, and √{square root over (Pi(k))} is the scaling factor for this symbol to achieve the channel inversion.


A spatial processor 450 then preconditions the scaled modulation symbols based on the unitary matrices E(k) to provide preconditioned symbols, as follows:

x(k)=E(k){tilde over (s)}(k), for kε{1, . . . , NF},  Eq (27)

where {tilde over (s)}(k)=[s1(k) s2(k) . . . sN1(k)]T, x(k)=[x1(k) x2(k) . . . xNT(k)]T, and xi(k) is the preconditioned symbol to be sent on frequency bin k of transmit antenna i. If NS<NT, then {tilde over (s)}(k) would include NS none-zero entries and the remaining NT−NS entries would be zero.


A multiplexer (MUX) 452 receives and multiplexes pilot data with the preconditioned symbols. The pilot data may be transmitted on all or a subset of the transmission channels, and is used at the receiver to estimate the MIMO channel. Multiplexer 452 provides one stream of preconditioned symbols to each OFDM modulator 322.


Within each OFDM modulator 322, an IFFT unit receives the preconditioned symbol stream and performs an inverse FFT on each set of NF symbols for the NF frequency bins to obtain a corresponding time-domain representation, which is referred to as an OFDM symbol. For each OFDM symbol, a cyclic prefix generator repeats a portion of the OFDM symbol to form a corresponding transmission symbol. The cyclic prefix ensures that the transmission symbol retains its orthogonal properties in the presence of multipath delay spread. A transmitter unit then converts the transmission symbols into one or more analog signals and further conditions (e.g., amplifies, filters, and frequency upconverts) the analog signals to generate a modulated signal that is then transmitted from the associated antenna 324.



FIG. 5 is a flow diagram of an embodiment of a process 500 for processing data using selective channel inversion per eigenmode. Initially, data to be transmitted is coded and modulated based on one or more coding and modulation schemes (step 512).


The available transmission channels are arranged into a number of groups, where each group may include all frequency bins for a given eigenmode (step 514). (Each group may also be defined to include frequency bins for multiple eigenmodes, or only a subset of the frequency bins for a single eigenmode.) The total transmit power is then allocated to the groups using a particular group power allocation scheme (step 516).


Selective channel inversion is then performed independently for each group. For each group selected for use (i.e., with non-zero allocated transmit power), one or more frequency bins in the group is selected for use for data transmission based on the transmit power allocated to the group (step 518). Alternatively, all frequency bins in the group may be selected if the group is to be used. A scaling factor is then determined for each selected frequency bin such that all selected frequency bins for each group have similar received signal quality, which may be quantified by received SNR, received power, or some other measure (step 520).


Each modulation symbol is then scaled by the scaling factor for the frequency bin to be used to transmit that modulation symbol (step 522). The scaled modulation symbols may further be preconditioned to diagonalize the MIMO channel (step 524). The preconditioned symbols are further processed and transmitted.


For clarity, specific embodiments have been described above. Variations to these embodiments and other embodiments may also be derived based on the teachings described herein. For example, it is not necessary to use the SCI-per-eigenmode scheme with spatial processing (i.e., preconditioning) at the transmitter. Other techniques may also be used to diagonalize the MIMO channel without performing preconditioning at the transmitter. Some such techniques are described in U.S. patent application Ser. No. 09/993,087, entitled “Multiple-Access Multiple-Input Multiple-Output (MIMO) Communication System,” filed Nov. 6, 2001, assigned to the assignee of the present application and incorporated herein by reference. If spatial processing is not performed at the transmitter, then the selective channel inversion may be applied per transmit antenna or some other group unit.


The selective channel inversion may be performed at the transmitter based on the estimated channel response matrix Ĥ(k), as described above. The selective channel inversion may also be performed at the receiver based on the channel gains, the received SNRs, or some other measure of received signal quality. In any case, the transmitter is provided with sufficient channel state information (CSI), in whatever form, such that it is able to determine (1) the particular data rate and coding and modulation scheme to use for each eigenmode and (2) the transmit power (or scaling factor) to use for each selected transmission channel such that the channels in each group have similar signal quality at the receiver (i.e., to invert the selected transmission channels).


The techniques described herein may also be used to perform selective channel inversion on groups that are defined to be something other than single eigenmode. For example, a group may be defined to include the frequency bins for multiple eigenmodes, or only some of the frequency bins for one or more eigenmodes, and so on.


For clarity, the techniques for performing selective channel inversion per eigenmode have been described specifically for a MIMO-OFDM system. These techniques may also be used for a MIMO system that does not employ OFDM. Moreover, although certain embodiments have been specifically described for the forward link, these techniques may also be applied for the reverse link.


The 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 elements used to implement any one or a combination of the techniques 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.


For a software implementation, the techniques described herein 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 332 or 372 in FIG. 3) and executed by a processor (e.g., controller 330 or 370). The memory unit may be implemented within the processor or external to the processor, in which case it can be communicatively coupled to the processor via various means as is known in the art.


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.

Claims
  • 1. A method for processing data for transmission in a multiple-input, multiple-output (MIMO) communication system, comprising: arranging a plurality of available transmission channels into a plurality of groups, each group comprising multiple transmission channels;allocating total transmit power to the plurality of groups; andfor each group of transmission channels to be used for data transmission, determining a group threshold,selecting one or more of the multiple transmission channels in the group for use, wherein the selecting is based on the group threshold, anddetermining a scaling factor for each of the one or more selected transmission channels such that the one or more selected transmission channels in each group have similar received signal quality,wherein a first determined group threshold for a first group of transmission channels is different than a second determined group threshold for a second group of transmission channels.
  • 2. The method of claim 1, wherein each group includes all transmission channels corresponding to a particular eigenmode of a MIMO channel.
  • 3. The method of claim 1, wherein the total transmit power is uniformly allocated to the plurality of groups.
  • 4. The method of claim 1, wherein the total transmit power is allocated to the plurality of groups based on water-filling.
  • 5. The method of claim 4, wherein the water-filling is performed across the plurality of available transmission channels, and wherein the transmit power allocated to each group is based on transmit powers allocated to the multiple transmission channels in the group.
  • 6. The method of claim 4, wherein the water-filling is performed based on average signal-to-noise-and-interference ratios (SNRs) for the plurality of groups.
  • 7. The method of claim 4, wherein the water-filling is performed based on signal-to-noise-and-interference ratios (SNRs) for the plurality of available transmission channels after channel inversion.
  • 8. The method of claim 1, further comprising: coding and modulating data based on one or more coding and modulation schemes to provide modulation symbols; andscaling each modulation symbol based on the scaling factor for the transmission channel used to transmit the modulation symbol.
  • 9. The method of claim 8, wherein the data for each group of transmission channels is coded based on a separate coding scheme.
  • 10. The method of claim 8, wherein the data for the plurality of groups of transmission channels is coded based on a common coding scheme, and wherein coded data for each group is punctured with a rate selected for the group.
  • 11. The method of claim 8, further comprising: preconditioning scaled modulation symbols.
  • 12. The method of claim 1, wherein the MIMO system implements orthogonal frequency division multiplexing (OFDM).
  • 13. A method for processing data for transmission in a multiple-input, multiple-output (MIMO) communication system that implements orthogonal frequency division multiplexing (OFDM), comprising: arranging a plurality of available transmission channels into a plurality of groups, wherein each group includes multiple transmission channels corresponding to a particular eigenmode of a MIMO channel;allocating total transmit power to the plurality of groups; andfor each group of transmission channels to be used for data transmission, determining a group threshold,selecting one or more of the multiple transmission channels in the group for use, wherein the selecting is based on the group threshold, anddetermining a scaling factor for each of the one or more selected transmission channels, such that the one or more selected transmission channels in each group have similar received signal quality,wherein a first determined group threshold for a first group of transmission channels is different than a second determined group threshold for a second group of transmission channels.
  • 14. A transmitter unit in a multiple-input, multiple-output (MIMO) communication system, comprising: a transmit data processor operative to code and modulate data based on one or more coding and modulation schemes to provide modulation symbols; anda transmit MIMO processor operative to select one or more of multiple transmission channels in each of a plurality of groups of transmission channels for use for data transmission, wherein the selecting is based on a group threshold selected for each group, to determine a scaling factor for each of the one or more selected transmission channels in each group such that the one or more selected transmission channels in the group have similar received signal quality, to scale each modulation symbol based on the scaling factor for the transmission channel used to transmit the modulation symbol, and to allocate total transmit power to the plurality of groups,wherein a first determined group threshold for a first group of transmission channels is different than a second determined group threshold for a second group of transmission channels.
  • 15. The transmitter unit of claim 14, wherein the one or more scaling factors for the one or more selected transmission channels in each group is determined based in part on the transmit power allocated to the group.
  • 16. An apparatus in a multiple-input, multiple-output (MIMO) communication system that implements orthogonal frequency division multiplexing (OFDM), comprising: a transmit data processor operative to code and modulate data based on one or more coding and modulation schemes to provide modulation symbols; anda transmit MIMO processor operative to allocate total transmit power to a plurality of groups of transmission channels, wherein each group includes multiple transmission channels corresponding to a particular eigenmode of a MIMO channel, to select a group threshold for each group, to select one or more of the multiple transmission channels in each group for use for data transmission, wherein the selecting is based on the group threshold, to determine a scaling factor for each of the one or more selected transmission channels in each group such that the one or more selected transmission channels in the group have similar received signal quality, and to scale each modulation symbol based on the scaling factor for the transmission channel used to transmit the modulation symbol,wherein a first determined group threshold for a first group of transmission channels is different than a second determined group threshold for a second group of transmission channels.
  • 17. The apparatus of claim 16, wherein the transmit MIMO processor is further operative to precondition scaled modulation symbols.
  • 18. An apparatus in a multiple-input, multiple-output (MIMO) communication system, comprising: means for arranging a plurality of available transmission channels into a plurality of groups, each group comprising multiple transmission channels;means for selecting a group threshold for each group;means for selecting one or more of the multiple transmission channels in each group for use for data transmission, wherein the selecting is based on the group threshold;means for allocating total transmit power to the plurality of groups; andmeans for determining a scaling factor for each of the one or more selected transmission channels in each group such that the one or more selected transmission channels in the group have similar received signal quality,wherein a first determined group threshold for a first group of transmission channels is different than a second determined group threshold for a second group of transmission channels.
  • 19. The apparatus of claim 18, further comprising: means for coding and modulating data based on one or more coding and modulation schemes to provide modulation symbols; andmeans for scaling each modulation symbol based on the scaling factor for the transmission channel used to transmit the modulation symbol.
  • 20. The apparatus of claim 16, wherein each group includes all transmission channels corresponding to a particular eigenmode of a MIMO channel.
  • 21. The apparatus of claim 16, wherein the transmit MIMO processor is configured to uniformly allocate the total transmit power to the plurality of groups.
  • 22. The apparatus of claim 16, wherein the transmit MIMO processor is configured to allocate the total transmit power to the plurality of groups utilizing a water-filling technique.
  • 23. The apparatus of claim 22, wherein the transmit MIMO processor is configured to utilize average signal-to-noise-and-interference ratios (SNRs) for the plurality of groups for water-filling.
  • 24. The apparatus of claim 22, wherein the transmit MIMO processor is configured to utilize signal-to-noise-and-interference ratios (SNRs) for the plurality of available transmission channels after channel inversion for water-filling.
  • 25. The apparatus of claim 16, wherein the transmit data processor is configured to code and modulate data for each group of transmission channels based on a separate coding scheme.
  • 26. The apparatus of claim 16, wherein the transmit data processor is configured to code and modulate data for the plurality of groups of transmission channels based on a common coding scheme, and to puncture coded data for each group with a rate selected for the group.
  • 27. The apparatus of claim 18, wherein each group includes all transmission channels corresponding to a particular eigenmode of a MIMO channel.
  • 28. The apparatus of claim 18, wherein the means for allocating comprises means for uniformly allocating the total transmit power to the plurality of groups.
  • 29. The apparatus of claim 18, wherein the means for allocating comprises means for allocating the total transmit power to the plurality of groups utilizing a water-filling technique.
  • 30. The apparatus of claim 29, wherein the means for allocating comprises means for utilizing average signal-to-noise-and-interference ratios (SNRs) for the plurality of groups for water-filling.
  • 31. The apparatus of claim 29, wherein the means for allocating comprises means for utilizing signal-to-noise-and-interference ratios (SNRs) for the plurality of available transmission channels after channel inversion for water-filling.
  • 32. The apparatus of claim 19, wherein the means for coding and modulating comprises means for coding and modulating data for each group of transmission channels based on a separate coding scheme.
  • 33. The apparatus of claim 19, wherein the means for coding and modulating comprises: means for coding and modulating data for the plurality of groups of transmission channels based on a common coding scheme, andmeans for puncturing coded data for each group with a rate selected for the group.
  • 34. A non-transitory machine-readable storing executable instructions, the instructions comprising: code for arranging a plurality of available transmission channels into a plurality of groups, wherein each group includes multiple transmission channels corresponding to a particular eigenmode of a MIMO channel;code for allocating total transmit power to the plurality of groups; andfor each group of transmission channels to be used for data transmission, code for determining a group threshold;code for selecting one or more of the multiple transmission channels in the group for use, wherein the selecting is based on the group threshold, andcode for determining a scaling factor for each of the one or more selected transmission channels, such that the one or more selected transmission channels in each group have similar received signal quality,wherein a first determined group threshold for a first group of transmission channels is different than a second determined group threshold for a second group of transmission channels.
  • 35. The machine-readable medium of claim 34, wherein each group includes all transmission channels corresponding to a particular eigenmode of a MIMO channel.
  • 36. The machine-readable medium of claim 34, wherein said code for allocating further comprises code for uniformly allocating the total transmit power to the plurality of groups.
  • 37. The machine-readable medium of claim 34, wherein said code for allocating further comprises code for allocating the total transmit power to the plurality of groups based on water-filling.
  • 38. The non-transitory machine-readable medium storing executable instructions of claim 34, the instructions further comprising: code for coding and modulating data based on one or more coding and modulation schemes to provide modulation symbols; andcode for scaling each modulation symbol based on the scaling factor for the transmission channel used to transmit the modulation symbol.
  • 39. The method of claim 1, wherein determining a threshold comprises: arranging the multiple transmission channels in the group in a list having a descending order based on an eigenvalue of each transmission channel;computing a spectral efficiency when using the first n transmission channels in the list, where n is an integer having an initial value greater than or equal to 1 that is increased incrementally; anddetermining the threshold based at least in part on when the computed spectral efficiency of using the first n+1 transmission channels is lower than using the first n transmission channels.
US Referenced Citations (348)
Number Name Date Kind
4736371 Tejima et al. Apr 1988 A
4750198 Harper Jun 1988 A
4797879 Habbab et al. Jan 1989 A
5241544 Jasper et al. Aug 1993 A
5295159 Kerpez Mar 1994 A
5404355 Raith Apr 1995 A
5471647 Gerlach et al. Nov 1995 A
5479447 Chow et al. Dec 1995 A
5493712 Ramesh et al. Feb 1996 A
5506861 Bottomley Apr 1996 A
5509003 Snijders et al. Apr 1996 A
5606729 D'Amico Feb 1997 A
5638369 Ayerst et al. Jun 1997 A
5677909 Heide Oct 1997 A
5729542 Dupont Mar 1998 A
5790550 Peeters et al. Aug 1998 A
5818813 Saito et al. Oct 1998 A
5822374 Levin Oct 1998 A
5832387 Bae et al. Nov 1998 A
5867478 Baum et al. Feb 1999 A
5867539 Koslov Feb 1999 A
5886988 Yun et al. Mar 1999 A
5959965 Ohkubo et al. Sep 1999 A
5973638 Robbins et al. Oct 1999 A
5982327 Vook et al. Nov 1999 A
6049548 Bruno et al. Apr 2000 A
6072779 Tzannes et al. Jun 2000 A
6084915 Williams Jul 2000 A
6097771 Foschini Aug 2000 A
6115354 Weck Sep 2000 A
6122247 Levin et al. Sep 2000 A
6131016 Greenstein et al. Oct 2000 A
6141388 Servais et al. Oct 2000 A
6141542 Kotzin et al. Oct 2000 A
6141567 Youssefmir et al. Oct 2000 A
6144711 Raleigh et al. Nov 2000 A
6163296 Lier et al. Dec 2000 A
6167031 Olofsson et al. Dec 2000 A
6178196 Naguib et al. Jan 2001 B1
6205410 Cai Mar 2001 B1
6222888 Kao et al. Apr 2001 B1
6232918 Wax et al. May 2001 B1
6266528 Farzaneh Jul 2001 B1
6275543 Petrus et al. Aug 2001 B1
6278726 Mesecher et al. Aug 2001 B1
6292917 Sinha et al. Sep 2001 B1
6298035 Heiskala Oct 2001 B1
6298092 Heath, Jr. et al. Oct 2001 B1
6308080 Burt et al. Oct 2001 B1
6314113 Guemas Nov 2001 B1
6314289 Eberlein et al. Nov 2001 B1
6317612 Farsakh Nov 2001 B1
6330277 Gelblum et al. Dec 2001 B1
6330293 Klank et al. Dec 2001 B1
6330462 Chen Dec 2001 B1
6333953 Bottomley et al. Dec 2001 B1
6339399 Andersson et al. Jan 2002 B1
6345036 Sudo et al. Feb 2002 B1
6346910 Ito Feb 2002 B1
6351499 Paulraj et al. Feb 2002 B1
6363267 Lindskog et al. Mar 2002 B1
6377812 Rashid-Farrokhi et al. Apr 2002 B1
6385264 Terasawa et al. May 2002 B1
6426971 Wu et al. Jul 2002 B1
6452981 Raleigh et al. Sep 2002 B1
6463290 Stilp et al. Oct 2002 B1
6473467 Wallace et al. Oct 2002 B1
6478422 Hansen Nov 2002 B1
6492942 Kezys Dec 2002 B1
6510184 Okamura Jan 2003 B1
6515617 Demers et al. Feb 2003 B1
6532225 Chang et al. Mar 2003 B1
6532255 Gunzelmann et al. Mar 2003 B1
6532562 Chou et al. Mar 2003 B1
6545997 Bohnke et al. Apr 2003 B1
6574211 Padovani et al. Jun 2003 B2
6574267 Kanterakis et al. Jun 2003 B1
6574271 Mesecher et al. Jun 2003 B2
6594473 Dabak et al. Jul 2003 B1
6594798 Chou et al. Jul 2003 B1
6597682 Kari Jul 2003 B1
6608874 Beidas et al. Aug 2003 B1
6611231 Crilly, Jr. et al. Aug 2003 B2
6631121 Yoon Oct 2003 B1
6636496 Cho et al. Oct 2003 B1
6636568 Kadous Oct 2003 B2
6654590 Boros et al. Nov 2003 B2
6654613 Maeng et al. Nov 2003 B1
6668161 Boros et al. Dec 2003 B2
6683916 Sartori et al. Jan 2004 B1
6690660 Kim et al. Feb 2004 B2
6693992 Jones et al. Feb 2004 B2
6697346 Halton et al. Feb 2004 B1
6728233 Park et al. Apr 2004 B1
6731668 Ketchum May 2004 B2
6735188 Becker et al. May 2004 B1
6738020 Lindskog et al. May 2004 B1
6744811 Kantschuk Jun 2004 B1
6751187 Walton et al. Jun 2004 B2
6751444 Meiyappan Jun 2004 B1
6751480 Kogiantis et al. Jun 2004 B2
6757263 Olds Jun 2004 B1
6760313 Sindhushayana et al. Jul 2004 B1
6760388 Ketchum et al. Jul 2004 B2
6760882 Gesbert et al. Jul 2004 B1
6768727 Sourour et al. Jul 2004 B1
6771706 Ling et al. Aug 2004 B2
6785341 Walton et al. Aug 2004 B2
6785513 Sivaprakasam Aug 2004 B1
6788948 Lindskog et al. Sep 2004 B2
6792041 Kim et al. Sep 2004 B1
6795424 Kapoor et al. Sep 2004 B1
6798738 Do et al. Sep 2004 B1
6801790 Rudrapatna Oct 2004 B2
6802035 Catreux et al. Oct 2004 B2
6804191 Richardson Oct 2004 B2
6821535 Nurmi et al. Nov 2004 B2
6847828 Miyoshi et al. Jan 2005 B2
6850252 Hoffberg Feb 2005 B1
6850498 Heath et al. Feb 2005 B2
6859503 Pautler et al. Feb 2005 B2
6862271 Medvedev et al. Mar 2005 B2
6862440 Sampath Mar 2005 B2
6868079 Hunt Mar 2005 B1
6873651 Tesfai et al. Mar 2005 B2
6879578 Pan et al. Apr 2005 B2
6879579 Myles et al. Apr 2005 B1
6885708 Thomas et al. Apr 2005 B2
6888809 Foschini et al. May 2005 B1
6888899 Raleigh et al. May 2005 B2
6891858 Mahesh et al. May 2005 B1
6920192 Laroia et al. Jul 2005 B1
6920194 Stopler et al. Jul 2005 B2
6927728 Vook et al. Aug 2005 B2
6937592 Heath, Jr. et al. Aug 2005 B1
6940917 Menon et al. Sep 2005 B2
6950632 Yun et al. Sep 2005 B1
6952426 Wu et al. Oct 2005 B2
6952454 Jalali et al. Oct 2005 B1
6956813 Fukuda Oct 2005 B2
6956906 Tager et al. Oct 2005 B2
6959171 Tsien et al. Oct 2005 B2
6963742 Boros et al. Nov 2005 B2
6965762 Sugar et al. Nov 2005 B2
6980601 Jones Dec 2005 B2
6980800 Noerpel et al. Dec 2005 B2
6985434 Wu et al. Jan 2006 B2
6985534 Meister Jan 2006 B1
6987819 Thomas et al. Jan 2006 B2
6990059 Anikhindi et al. Jan 2006 B1
6992972 Van Nee Jan 2006 B2
6996380 Dent Feb 2006 B2
7006464 Gopalakrishnan et al. Feb 2006 B1
7006483 Nelson, Jr. et al. Feb 2006 B2
7006848 Ling et al. Feb 2006 B2
7009931 Ma et al. Mar 2006 B2
7012978 Talwar Mar 2006 B2
7020110 Walton et al. Mar 2006 B2
7020482 Medvedev et al. Mar 2006 B2
7020490 Khatri Mar 2006 B2
7023826 Sjoberg et al. Apr 2006 B2
7031671 Mottier Apr 2006 B2
7035359 Molnar Apr 2006 B2
7039125 Friedman May 2006 B2
7058367 Luo et al. Jun 2006 B1
7062294 Rogard et al. Jun 2006 B1
7068628 Li et al. Jun 2006 B2
7072381 Atarashi et al. Jul 2006 B2
7072410 Monsen Jul 2006 B1
7088671 Monsen Aug 2006 B1
7095709 Walton et al. Aug 2006 B2
7099377 Berens et al. Aug 2006 B2
7103325 Jia et al. Sep 2006 B1
7110378 Onggosanusi et al. Sep 2006 B2
7110463 Wallace et al. Sep 2006 B2
7113499 Nafie et al. Sep 2006 B2
7116652 Lozano Oct 2006 B2
7127009 Berthet et al. Oct 2006 B2
7130362 Girardeau et al. Oct 2006 B2
7133459 Onggosanusi et al. Nov 2006 B2
7137047 Mitlin et al. Nov 2006 B2
7149239 Hudson Dec 2006 B2
7151809 Ketchum et al. Dec 2006 B2
7155171 Ebert et al. Dec 2006 B2
7158563 Ginis et al. Jan 2007 B2
7164669 Li et al. Jan 2007 B2
7184713 Kadous et al. Feb 2007 B2
7187646 Schramm Mar 2007 B2
7190749 Levin et al. Mar 2007 B2
7191381 Gesbert et al. Mar 2007 B2
7194237 Sugar et al. Mar 2007 B2
7197084 Ketchum et al. Mar 2007 B2
7200404 Panasik et al. Apr 2007 B2
7206354 Wallace et al. Apr 2007 B2
7218684 Bolourchi et al. May 2007 B2
7224704 Lu et al. May 2007 B2
7231184 Eilts et al. Jun 2007 B2
7233625 Ma et al. Jun 2007 B2
7238508 Lin et al. Jul 2007 B2
7242727 Liu et al. Jul 2007 B2
7248638 Banister Jul 2007 B1
7248841 Agee et al. Jul 2007 B2
7254171 Hudson Aug 2007 B2
7260153 Nissani Aug 2007 B2
7260366 Lee et al. Aug 2007 B2
7263119 Hsu et al. Aug 2007 B1
7274734 Tsatsanis Sep 2007 B2
7280625 Ketchum et al. Oct 2007 B2
7283508 Choi et al. Oct 2007 B2
7289570 Schmidl et al. Oct 2007 B2
7292854 Das et al. Nov 2007 B2
7298778 Visoz et al. Nov 2007 B2
7308035 Rouquette et al. Dec 2007 B2
7310304 Mody et al. Dec 2007 B2
7317750 Shattil Jan 2008 B2
7324429 Walton et al. Jan 2008 B2
7327800 Oprea et al. Feb 2008 B2
7342912 Kerr et al. Mar 2008 B1
7356004 Yano et al. Apr 2008 B2
7356089 Jia et al. Apr 2008 B2
7379492 Hwang May 2008 B2
7386076 Onggosanusi et al. Jun 2008 B2
7392014 Baker et al. Jun 2008 B2
7403748 Keskitalo et al. Jul 2008 B1
7421039 Malaender et al. Sep 2008 B2
7453844 Lee et al. Nov 2008 B1
7480278 Pedersen et al. Jan 2009 B2
7492737 Fong et al. Feb 2009 B1
7548506 Ma et al. Jun 2009 B2
7551546 Ma et al. Jun 2009 B2
7551580 Du Crest et al. Jun 2009 B2
7599443 Ionescu et al. Oct 2009 B2
7603141 Dravida Oct 2009 B2
7606296 Hsu et al. Oct 2009 B1
7636573 Walton et al. Dec 2009 B2
7653142 Ketchum et al. Jan 2010 B2
7653415 Van Rooyen Jan 2010 B2
20010017881 Bhatoolaul et al. Aug 2001 A1
20010031621 Schmutz Oct 2001 A1
20010046205 Easton et al. Nov 2001 A1
20020003774 Wang et al. Jan 2002 A1
20020018310 Hung Feb 2002 A1
20020018453 Yu et al. Feb 2002 A1
20020027951 Gormley et al. Mar 2002 A1
20020041632 Sato et al. Apr 2002 A1
20020044591 Lee et al. Apr 2002 A1
20020044610 Jones Apr 2002 A1
20020057659 Ozluturk et al. May 2002 A1
20020064214 Hattori et al. May 2002 A1
20020075830 Hartman, Jr. Jun 2002 A1
20020085620 Mesecher Jul 2002 A1
20020085641 Baum Jul 2002 A1
20020098872 Judson Jul 2002 A1
20020105928 Kapoor et al. Aug 2002 A1
20020115473 Hwang et al. Aug 2002 A1
20020122381 Wu et al. Sep 2002 A1
20020122393 Caldwell et al. Sep 2002 A1
20020154705 Walton et al. Oct 2002 A1
20020183010 Catreux et al. Dec 2002 A1
20020184453 Hughes et al. Dec 2002 A1
20020191535 Sugiyama et al. Dec 2002 A1
20020193146 Wallace et al. Dec 2002 A1
20020196842 Onggosanusi et al. Dec 2002 A1
20030002450 Jalali et al. Jan 2003 A1
20030003863 Thielecke et al. Jan 2003 A1
20030012308 Sampath et al. Jan 2003 A1
20030039317 Taylor et al. Feb 2003 A1
20030043929 Sampath Mar 2003 A1
20030045288 Luschi et al. Mar 2003 A1
20030048856 Ketchum et al. Mar 2003 A1
20030076812 Benedittis Apr 2003 A1
20030078024 Magee et al. Apr 2003 A1
20030095197 Wheeler et al. May 2003 A1
20030099306 Nilsson et al. May 2003 A1
20030112745 Zhuang et al. Jun 2003 A1
20030112880 Walton et al. Jun 2003 A1
20030119452 Kim et al. Jun 2003 A1
20030123381 Zhuang et al. Jul 2003 A1
20030123389 Russell et al. Jul 2003 A1
20030125040 Walton et al. Jul 2003 A1
20030128656 Scarpa Jul 2003 A1
20030139194 Onggosanusi et al. Jul 2003 A1
20030153360 Burke et al. Aug 2003 A1
20030157954 Medvedev et al. Aug 2003 A1
20030162519 Smith et al. Aug 2003 A1
20030185311 Kim Oct 2003 A1
20030202492 Akella et al. Oct 2003 A1
20030202612 Halder et al. Oct 2003 A1
20030206558 Parkkinen et al. Nov 2003 A1
20030235149 Chan et al. Dec 2003 A1
20030235255 Ketchum et al. Dec 2003 A1
20040005887 Bahrenburg et al. Jan 2004 A1
20040037257 Ngo Feb 2004 A1
20040052228 Tellado et al. Mar 2004 A1
20040071104 Boesel et al. Apr 2004 A1
20040071107 Kats et al. Apr 2004 A1
20040076224 Onggosanusi et al. Apr 2004 A1
20040082356 Walton et al. Apr 2004 A1
20040085939 Wallace et al. May 2004 A1
20040120411 Walton et al. Jun 2004 A1
20040136349 Walton et al. Jul 2004 A1
20040151108 Blasco Claret et al. Aug 2004 A1
20040151122 Lau et al. Aug 2004 A1
20040156328 Walton et al. Aug 2004 A1
20040160987 Sudo et al. Aug 2004 A1
20040176097 Wilson et al. Sep 2004 A1
20040179627 Ketchum et al. Sep 2004 A1
20040184398 Walton et al. Sep 2004 A1
20040198276 Tellado et al. Oct 2004 A1
20040252632 Bourdoux et al. Dec 2004 A1
20050047384 Wax et al. Mar 2005 A1
20050047515 Walton et al. Mar 2005 A1
20050099974 Kats et al. May 2005 A1
20050111599 Walton et al. May 2005 A1
20050120097 Walton et al. Jun 2005 A1
20050128953 Wallace et al. Jun 2005 A1
20050135284 Nanda et al. Jun 2005 A1
20050135295 Walton et al. Jun 2005 A1
20050135318 Walton et al. Jun 2005 A1
20050147177 Seo et al. Jul 2005 A1
20050185575 Hansen et al. Aug 2005 A1
20050208959 Chen et al. Sep 2005 A1
20050220211 Shim et al. Oct 2005 A1
20050227628 Inanoglu Oct 2005 A1
20050276343 Jones Dec 2005 A1
20060018395 Tzannes Jan 2006 A1
20060067417 Park et al. Mar 2006 A1
20060072649 Chang et al. Apr 2006 A1
20060077935 Hamalainen et al. Apr 2006 A1
20060104196 Wu et al. May 2006 A1
20060153237 Hwang et al. Jul 2006 A1
20060159120 KIm Jul 2006 A1
20060183497 Paranchych et al. Aug 2006 A1
20060209894 Tzannes et al. Sep 2006 A1
20060209937 Tanaka et al. Sep 2006 A1
20070177681 Choi et al. Aug 2007 A1
20070274278 Choi et al. Nov 2007 A1
20080069015 Walton et al. Mar 2008 A1
20080267098 Walton et al. Oct 2008 A1
20080267138 Walton et al. Oct 2008 A1
20080285488 Walton et al. Nov 2008 A1
20080285669 Walton et al. Nov 2008 A1
20080285670 Walton et al. Nov 2008 A1
20100067401 Medvedev et al. Mar 2010 A1
20100119001 Walton et al. May 2010 A1
20100142636 Heath, Jr. et al. Jun 2010 A1
20100183088 Inanoglu Jul 2010 A1
20100260060 Abraham et al. Oct 2010 A1
Foreign Referenced Citations (177)
Number Date Country
2002259221 Nov 2002 AU
2690247 Oct 2001 CA
1086061 Apr 1994 CN
1234661 Nov 1999 CN
1308794 Aug 2001 CN
1347609 May 2002 CN
1469662 Jan 2004 CN
1489836 Apr 2004 CN
1537371 Oct 2004 CN
19951525 Jun 2001 DE
0755090 Jan 1997 EP
0762701 Mar 1997 EP
0772329 May 1997 EP
0805568 Nov 1997 EP
0869647 Oct 1998 EP
0895387 Feb 1999 EP
0929172 Jul 1999 EP
0951091 Oct 1999 EP
0991221 Apr 2000 EP
0993211 Apr 2000 EP
1 117 197 Dec 2000 EP
1061446 Dec 2000 EP
1075093 Feb 2001 EP
1087545 Mar 2001 EP
1117197 Jul 2001 EP
1 185 001 Aug 2001 EP
1126673 Aug 2001 EP
1133070 Sep 2001 EP
1137217 Sep 2001 EP
1143754 Oct 2001 EP
1170879 Jan 2002 EP
1175022 Jan 2002 EP
1182799 Feb 2002 EP
1185001 Mar 2002 EP
1185015 Mar 2002 EP
1185048 Mar 2002 EP
1207635 May 2002 EP
1207645 May 2002 EP
1223702 Jul 2002 EP
1241824 Sep 2002 EP
1265411 Dec 2002 EP
1315311 May 2003 EP
1379020 Jan 2004 EP
1387545 Feb 2004 EP
1416688 May 2004 EP
1447934 Aug 2004 EP
1556984 Jul 2005 EP
2300337 Oct 1996 GB
2373973 Oct 2002 GB
1132027 May 1989 JP
03104430 May 1991 JP
06003956 Jan 1994 JP
6501139 Jan 1994 JP
8274756 Oct 1996 JP
9135230 May 1997 JP
9266466 Oct 1997 JP
9307526 Nov 1997 JP
09327073 Dec 1997 JP
9512156 Dec 1997 JP
10028077 Jan 1998 JP
10084324 Mar 1998 JP
10209956 Aug 1998 JP
10303794 Nov 1998 JP
10327126 Dec 1998 JP
1141159 Feb 1999 JP
11069431 Mar 1999 JP
11074863 Mar 1999 JP
11163823 Jun 1999 JP
11205273 Jul 1999 JP
11252037 Sep 1999 JP
2991167 Dec 1999 JP
2000078105 Mar 2000 JP
2000092009 Mar 2000 JP
2001044930 Feb 2001 JP
200186045 Mar 2001 JP
2001186051 Jul 2001 JP
2001217896 Aug 2001 JP
2001231074 Aug 2001 JP
2001237751 Aug 2001 JP
200264879 Feb 2002 JP
2002504283 Feb 2002 JP
200277098 Mar 2002 JP
200277104 Mar 2002 JP
2002111627 Apr 2002 JP
2002-176379 Jun 2002 JP
2002164814 Jun 2002 JP
2002204217 Jul 2002 JP
2002232943 Aug 2002 JP
2003504941 Feb 2003 JP
2003198442 Jul 2003 JP
2003530010 Oct 2003 JP
2004266586 Sep 2004 JP
2004297172 Oct 2004 JP
2004535694 Nov 2004 JP
2005519520 Jun 2005 JP
2006504372 Feb 2006 JP
200011799 Feb 2000 KR
20010098861 Nov 2001 KR
20020003370 Jan 2002 KR
20030085040 Nov 2003 KR
20060095576 Aug 2006 KR
2015281 Jun 1994 RU
2139633 Oct 1999 RU
2141168 Nov 1999 RU
2149509 May 2000 RU
2152132 Jun 2000 RU
2157592 Oct 2000 RU
2158479 Oct 2000 RU
2168278 May 2001 RU
2197781 Jan 2003 RU
2201034 Mar 2003 RU
2335852 Oct 2008 RU
419912 Jan 2001 TW
545006 Aug 2003 TW
583842 Apr 2004 TW
I230525 Apr 2005 TW
WO8607223 Dec 1986 WO
WO9307684 Apr 1993 WO
WO9507578 Mar 1995 WO
WO9530316 Nov 1995 WO
WO9532567 Nov 1995 WO
WO9622662 Jul 1996 WO
WO9635268 Nov 1996 WO
WO9719525 May 1997 WO
WO9736377 Oct 1997 WO
WO9809381 Mar 1998 WO
WO9809395 Mar 1998 WO
WO9824192 Jun 1998 WO
WO98026523 Jun 1998 WO
WO9830047 Jul 1998 WO
WO9857472 Dec 1998 WO
WO9903224 Jan 1999 WO
WO99014878 Mar 1999 WO
WO9916214 Apr 1999 WO
WO9944379 Sep 1999 WO
WO9957820 Nov 1999 WO
WO0011823 Mar 2000 WO
WO0036764 Jun 2000 WO
WO0062456 Oct 2000 WO
WO0105067 Jan 2001 WO
WO0126269 Apr 2001 WO
WO0169801 Sep 2001 WO
WO0171928 Sep 2001 WO
0176110 Oct 2001 WO
WO0180510 Oct 2001 WO
WO0182521 Nov 2001 WO
WO0197400 Dec 2001 WO
0203557 Jan 2002 WO
WO0201732 Jan 2002 WO
WO0215433 Feb 2002 WO
WO0225853 Mar 2002 WO
WO02060138 Aug 2002 WO
WO02062002 Aug 2002 WO
WO02065664 Aug 2002 WO
WO02069523 Sep 2002 WO
WO02069590 Sep 2002 WO
WO02073869 Sep 2002 WO
WO02078211 Oct 2002 WO
WO02082689 Oct 2002 WO
WO02088656 Nov 2002 WO
WO02093784 Nov 2002 WO
WO02099992 Dec 2002 WO
WO03010984 Feb 2003 WO
WO03010994 Feb 2003 WO
WO03028153 Apr 2003 WO
WO03034646 Apr 2003 WO
WO03047140 Jun 2003 WO
WO03075479 Sep 2003 WO
WO2004002011 Dec 2003 WO
WO2004002047 Dec 2003 WO
WO2004038985 May 2004 WO
WO2004038986 May 2004 WO
WO2004039011 May 2004 WO
WO2004039022 May 2004 WO
WO2005041515 May 2005 WO
WO2005043855 May 2005 WO
WO2005046113 May 2005 WO
Related Publications (1)
Number Date Country
20040042556 A1 Mar 2004 US