Asymmetric resource sharing using stale feedback

The invention disclosed herein generally relates to virtual diversity reception, and more particularly relates to asymmetric resource sharing for virtual diversity reception.

Multi-user downlink systems typically comprise a multi-antenna base station that transmits multiple signals to each of a plurality of single-antenna mobile terminals. Because the mobile terminals typically only have one antenna, the mobile terminals cannot take advantage of simple receive diversity processing techniques. To address this issue, a base station in a multi-user downlink system may use channel state information reported by the mobile terminals to generate additional signals that may be used by the mobile terminals to create a virtual diversity receiver at each mobile station, where the virtual receiver at each mobile station has multiple virtual antennas to enable the mobile station to use linear diversity processing techniques to improve performance. For example, the base station may use previously reported channel state information to estimate signals received by the mobile terminals, where the base station may then use the received signal estimates to generate additional signals for subsequent transmission to the mobile terminals. Upon receipt, the mobile terminals may then use the additional signals to simplify the signal processing required to determine the originally transmitted signals, e.g., by using simple algebraic techniques. Thus, each mobile terminal experiences a performance boost, which may translate into better coverage, higher bit rate, higher cell throughput, etc. “Multi-User ARQ” by P. Larsson and N. Johansson, Vehicular Technology Conference, May 2006, vol. 4, pp. 2052-2057 discloses an exemplary virtual diversity receiver.

For example, a virtual diversity system may include a base station that uses three antennas to transmit information symbols to three single-antenna mobile terminals. After receiving channel estimates representing the channel state information for each of the channels between each of the transmission antennas and each of the mobile terminals at each transmission time, the base station estimates the signals received by the mobile terminals, and combines complementary pairs of the estimated signals to generate three combined signals, which are subsequently transmitted to the mobile terminals during three subsequent transmission times. The mobile terminals then use the originally received signals and the received combined signals to create a simple system of three equations having three unknowns. Each mobile terminal may then algebraically solve the corresponding system of equations to detect the three information symbols originally transmitted to that mobile terminal.

Because the channel may have changed significantly by the time the base station transmits the additional signal(s), the channel state information used to implement virtual diversity reception is generally thought of as stale feedback. However, virtual diversity reception does not rely on channel correlations over time, and therefore effectively assumes the channel is uncorrelated. Thus, the multi-user nature of virtual diversity reception renders stale channel state feedback very useful. “Completely Stale Transmitter Channel State Information is Still Very Useful” by M. Maddah-Ali and D. Tse, Allerton Conference, October 2010 discloses additional details regarding the use of stale channel state information.

Conventional virtual diversity receivers operate in a symmetric fashion, where each mobile terminal acts and benefits equally. As a result, all mobile terminals receive all transmitted signals and feedback all associated channel estimates. While all mobile terminals associated with such symmetric resource sharing benefit equally, implementing symmetric virtual diversity reception may place an unnecessary burden on the required signal processing and signaling overhead. This is especially problematic when all mobile terminals do not require the same benefits and/or overall performance results. Thus, there remains a need for improving the implementation of virtual diversity reception.

These problems may be addressed with the asymmetric resource sharing method and apparatus disclosed herein. A base station implementing asymmetric resource sharing transmits fewer information symbols at some transmission times to one or more mobile terminals than to other mobile terminals at other transmission times. After transmitting the information symbols, the base station receives channel estimates from the mobile terminals, which the base station then use to generate synthesized signals representing estimates of the signals received at the mobile terminals. The base station subsequently combines complementary pairs of the synthesized signals to generate combined signals and transmits at least one of the combined signals to implement at least one virtual antenna for at least one of the mobile terminals. By transmitting fewer information symbols to some mobile terminals than to others, the base station asymmetrically applies the virtual diversity reception principle to the mobile terminals, which reduces the amount of signal processing, transmitted signals, and signaling overhead while maintaining an acceptable performance at each mobile terminal.

An exemplary method of asymmetric resource sharing implemented at a network node creates one or more virtual antennas for one or more of a plurality of mobile terminals. The method comprises transmitting, at a first time, a first set of information symbols intended for a first mobile terminal from respective antennas, and receiving a first set of channel estimates indicating channel conditions at the first time between the second mobile terminal and the respective antennas. The method further comprises transmitting, at a second time, a second set of information symbols intended for the second mobile terminal from respective antennas, wherein the second set of information symbols comprises fewer information symbols than the first set of information symbols, and receiving a second set of channel estimates indicating channel conditions at the second time between the first mobile terminal and the respective antennas. Further, the method includes computing at least two synthesized signals based on the first and second sets of information symbols and the corresponding channel estimates, where the synthesized signals comprise estimates of signals received by the first and second mobile terminals at the first and second times, combining a first complementary pair of the synthesized signals to generate a first combined signal, and transmitting the first combined signal from one of the antennas to create one or more a virtual antennas for the mobile terminals.

The network node disclosed herein is configured for asymmetric resource sharing to create one or more virtual antennas for one or more of a plurality of mobile terminals. To that end, the network node comprises an information symbol generator, a transmitter, a receiver, a synthesized signal generator, and a combiner. The information symbol generator generates a first set of information symbols intended for a first mobile terminal and a second set of information symbols intended for a second mobile terminal, where the second set of information symbols comprises fewer information symbols than the first set of information symbols. The transmitter transmits, at a first time, the first set of information symbols from respective antennas, and transmits, at a second time, the second set of information symbols from respective antennas. The receiver receives a first set of channel estimates indicating channel conditions at the first time between the second mobile terminal and the respective antennas, and receives a second set of channel estimates indicating channel conditions at the second time between the first mobile terminal and the respective antennas. The synthesized signal generator computes at least two synthesized signals based on the first and second sets of information symbols and the corresponding channel estimates, where the synthesized signals comprise estimates of signals received by the first and second mobile terminals associated with the first and second times. The combiner combines a first complementary pair of the synthesized signals to generate a first combined signal, where the transmitter further transmits the first combined signal from one of the antennas to create one or more virtual antennas for the mobile terminals.

The asymmetric resource sharing method and apparatus disclosed herein applies to base stations with two or more antennas transmitting to two or more mobile terminals, and particularly to base stations with three or more antennas transmitting to three or more mobile terminals.

FIG. 1 shows a wireless communication system between a multi-antenna base station and a plurality of single antenna mobile terminals.

FIG. 2 shows a block diagram of a base station according to one exemplary embodiment.

FIG. 3 shows a process chart for implementing asymmetric resource sharing according to one exemplary embodiment.

The following description provides methods and apparatus for asymmetric resource sharing using stale channel state information to asymmetrically implement virtual diversity reception for a plurality of mobile terminals. Broadly, a base station implementing the asymmetric resource sharing disclosed herein transmits fewer information symbols to some mobile terminals than to other mobile terminals. In other words, the base station “punctures” information symbols relative to conventional symmetric resource sharing. In so doing, the base station reduces the number of symbol transmissions, and may also reduce the additional signaling required for resource sharing, e.g., the signaling required for feeding back channel estimates and/or transmitting combined signals.

Before describing asymmetric resource sharing in further detail, the following first describes conventional symmetric resource sharing as it may be applied to virtual diversity reception. FIG. 1 shows an exemplary wireless system 10 comprising a multi-antenna base station 100 in communication with a plurality of single-antenna mobile terminals, which are generally referred to herein as mobile terminals 200 . In this example, base station 100 comprises J=3 antennas 110 a , 110 b , 110 c , generally referred to herein as antennas 110 . The antennas 110 transmit information to three single-antenna mobile terminals 200 a , 200 b , 200 c . It will be appreciated that mobile terminals 200 communicate directly with the base station 100 , but cannot communicate directly with each other.

Base station 100 transmits a symbol from each antenna 110 during each time interval, where the symbols transmitted at a particular time are intended for a particular mobile terminal 200 . For example, at a first time T=1, base station 100 transmits a first set of information symbols from respective antennas 110 , where each transmitted information symbol is intended for the first mobile terminal 200 a . Subsequently, the base station 100 transmits second and third sets of information symbols from respective antennas, where the information symbols transmitted at time T=2 are intended for the second mobile terminal 200 b and the information symbols transmitted at time T=3 are intended for the third mobile terminal 200 c.

Even though each of the transmitted symbols are intended for a specific mobile terminal 200 , each mobile terminal 200 receives all of the transmitted symbols. Each mobile terminal 200 can detect its intended symbols using non-linear signal processing techniques, e.g., joint demodulation. However, such non-linear techniques are complex and consume too much power and time. Linear signal processing techniques are preferred, but require more information than provided by the signals initially received at the single-antenna mobile terminals 200 . For the example in FIG. 1 , each mobile terminal 200 requires three received signals associated with a particular transmission time in order to detect the three symbols intended for that mobile terminal 200 using simple algebraic techniques. To solve this problem, conventional symmetric resource sharing uses channel feedback provided by the mobile terminals 200 to implement a virtual diversity system, which creates multiple virtual antennas at each mobile terminal 200 . For example, at time T=1, the mobile terminals 200 that are not the target for the transmitted symbols, e.g., the second and third mobile terminals 200 b , 200 c , feedback channel estimates for the channels between these mobile terminals 200 b , 200 c and each of the antennas 110 a , 110 b , 110 c . A similar process occurs for times T=2 and T=3. The base station 100 uses the received channel estimates to synthesize the signals received at the mobile terminals 200 , and forwards the synthesized signals to the mobile terminals 200 to facilitate virtual diversity reception and linear signal processing.

The following provides a more detailed and mathematical analysis of conventional symmetric resource sharing. In this example, at time T=1 base station 100 transmits three information symbols intended for a first mobile terminal 200 a . The first mobile terminal 200 a receives the transmitted symbols, as do the other two mobile terminals 200 b , 200 c . At time T=2, base station 100 transmits three information symbols intended for a second mobile terminal 200 b . The second mobile terminal 200 b receives the transmitted symbols, as do the other two mobile terminals 200 a , 200 c . At time T=3, base station 100 transmits three information symbols intended for a third mobile terminal 200 c . The third mobile terminal 200 c receives the transmitted symbols, as do the other two mobile terminals 200 a , 200 b . The signals received by the mobile terminals 200 may be represented by:

r i ⁡ [ T ] = ∑ j ⁢ H ij ⁡ [ T ] ⁢ u j ⁡ [ T ] + z i ⁡ [ T ] , ( 1 )

where u j [T] represents the information symbol transmitted from antenna j at time T, H ij [T] represents the channel between transmit antenna j and mobile terminal i at time T, r i [T] represents the signal received at terminal i associated with time T, and z i [T] represents the noise at mobile terminal i associated with time T. Thus, the signals received by each respective mobile terminal 200 a , 200 b , 200 c at time T=1 comprise:

r 1 [1 ]=H 11 [1] u 1 [1 ]+H 12 [1 ]u 2 [1 ]+H 13 [1 ]u 3 [1 ]+z 1 [1.]

r 2 [1 ]=H 21 [1] u 1 [1 ]+H 22 [1 ]u 2 [1 ]+H 23 [1 ]u 3 [1 ]+z 2 [1.]

r 3 [1 ]=H 31 [1] u 1 [1 ]+H 32 [1 ]u 2 [1 ]+H 33 [1 ]u 3 [1 ]+z 3 [1.]  (2)

where the symbols u j [ 1 ], j=1 to 3, are intended for the first mobile terminal 200 a.

Now consider that the first mobile terminal 200 a has one received signal r 1 [ 1 ], containing its intended information symbols. To enable symbol detection using simple linear processing techniques, mobile terminal 200 a also needs access to the received signals r 2 [ 1 ] and r 3 [ 1 ] received by the other mobile terminals 200 b , 200 c . Providing mobile terminal 200 a with this information requires feedback from the other mobile terminals 200 b , 200 c to the base station 100 , and subsequent transmissions from the base station to deliver the desired information to mobile terminal 200 a . The situation is similar for the other two mobile terminals 200 . Thus, all three mobile terminals 200 feed back information to the base station 100 .

For example, mobile terminal i feeds back the six channel estimates associated with transmitted symbols intended for the other mobile terminals, e.g., H ij [T] for T≠i. For the example in FIG. 1 , it is assumed that the fed back channel estimates are available at the base station 100 before time T=4. Base station 100 synthesizes the signals received at each mobile terminal 100 according to:

r ^ i ⁡ [ T ] = ∑ j ⁢ H ij ⁡ [ T ] ⁢ u j ⁡ [ T ] , ( 3 )

which is equivalent to Equation (1) without the noise. Using Equation (3), base station 100 may synthesize or otherwise recreate each of the signals received by each of the mobile terminals 200 , notably {circumflex over (r)} 2 [ 1 ], {circumflex over (r)} 3 [ 1 ], {circumflex over (r)} 1 [ 2 ], {circumflex over (r)} 3 [ 2 ], {circumflex over (r)} 1 [ 3 ], and {circumflex over (r)} 2 [ 3 ].

The base station 100 now has six synthesized values {circumflex over (r)} i [T], T≠i, to transmit to the mobile terminals 200 . To minimize the number of additional transmission times needed to transmit the synthesized signals, base station 100 may exploit the multi-user nature of the scenario to efficiently pack information for more than one terminal 200 into combined signals transmitted during the subsequent transmission times. For example, the base station 100 may combine complementary pairs of synthesized signals such that each mobile terminal 200 can recover the information it needs. As used herein, the term “complementary pairs” refer to pairs of signals associated with complementary transmission times and mobile terminals. For example, a complementary pair of signals comprises the synthesized signal for terminal “i” transmitted at time “T,” and the synthesized signal for terminal “T” transmitted at time “i.” Thus, the base station 100 combines {circumflex over (r)} i [T] (corresponding to the terminal i at time T) and {circumflex over (r)} T [i] (corresponding to the terminal T at time i) to form the combined signal according to:

{circumflex over (r)} i [T]+{circumflex over (r)} T [i].   (4)

While “T” and “i” are generally used herein to designate time and mobile terminal, respectively, it will be appreciated that the notation of Equation (4) used above to generally define the complementary pairs of a combined signal, the subscript for the synthesized signal {circumflex over (r)} always represents the mobile terminal and the variable in brackets always represents transmission time.

Base station 100 transmits one combined signal per time T. For simplicity and without loss of generality, it is assumed that the combined signals are transmitted from the first antenna 110 a (j=1); the other antennas 110 b , 110 c do not send any information symbols or signals during these subsequent transmission times. The order of transmission does not matter. For instance, the base station may transmit the following combined signals at transmission times T=4, 5, and 6, respectively.

u 1 [4 ]={circumflex over (r)} 1 [2 ]+{circumflex over (r)} 2 [1]  (5)

u 1 [5 ]={circumflex over (r)} 1 [3 ]+{circumflex over (r)} 3 [1]  (6)

u 1 [6 ]={circumflex over (r)} 2 [3 ]+{circumflex over (r)} 3 [2]  (7)

Mobile terminal 200 a (i=1) is interested in u 1 [ 4 ] in Equation (5) because it contains {circumflex over (r)} 2 [ 1 ]. Responsive to the transmission of u 1 [ 4 ] at T=4, mobile terminal 200 a receives:

r 1 [4 ]=H 11 [4 ]u 1 [4]+ z 1 [4 ]=H 11 [4]( {circumflex over (r)} 1 [2 ]+{circumflex over (r)} 2 [1])+ z 1 [4]  (8)

Mobile terminal 200 a can use r 1 [ 2 ], received earlier with the transmissions of u j [ 2 ], j=1 to 3, to eliminate {circumflex over (r)} 1 [ 2 ] from Equation (8) to obtain:

r 1 ′ ⁡ [ 4 ] = ⁢ r 1 ⁡ [ 4 ] - H 11 ⁡ [ 4 ] ⁢ r 1 ⁡ [ 2 ] = ⁢ H 11 ⁡ [ 4 ] ⁢ r ^ 2 ⁡ [ 1 ] + ( z 1 ⁡ [ 4 ] - H 11 ⁡ [ 4 ] ⁢ z 1 ⁡ [ 2 ] ) = ⁢ H 11 ⁡ [ 4 ] ⁢ ∑ j ⁢ H 2 ⁢ j ⁡ [ 1 ] ⁢ u j ⁡ [ 1 ] + ( z 1 ⁡ [ 4 ] - H 11 ⁡ [ 4 ] ⁢ z 1 ⁡ [ 2 ] ) = ⁢ ∑ j ⁢ H 2 ⁢ j ′ ⁡ [ 1 ] ⁢ u j ⁡ [ 1 ] + z 1 ′ ⁡ [ 4 ] ( 9 )

where

H′ 2j [1]= H 11 [4 ]H 2j [1]  (10)

represents the effective channel, and z′ 1 [ 4 ] represents the effective noise. Thus, r′ 1 [ 4 ] looks like a signal received by a virtual antenna at mobile terminal 200 a.

Mobile terminal 200 b (i=2) is also interested in u 1 [ 4 ] because it contains {circumflex over (r)} 1 [ 2 ]. The mobile terminal 200 b similarly eliminates {circumflex over (r)} 2 [ 1 ] from r 1 [ 4 ]. Continuing with this approach, each mobile terminal 200 ends up with two additional signals received by two virtual antennas. Overall, implementing the conventional virtual diversity system requires six channel uses, i.e., transmission times T=1 to 6, to transmit nine information symbols. The total rate is R=9/6=3/2 symbols per channel use. The individual rate is ρ=1/2 symbols per channel use.

The above example generalizes directly to the case of a base station 100 with J antennas 110 and J single antenna mobile terminals 200 . In each of the first J channel uses associated with the J transmission times, the base station 100 transmits J information symbols intended for one mobile terminal 200 from respective antennas, where each antenna 110 transmits one information symbol. The mobile terminals 200 feed back channel estimates, and the base station 100 forms synthesized signals, as in Equation (3). Then base station 100 pairs complementary synthesized signals to form combined signals, as in Equation (4). The base station 100 transmits the combined signals, one at a time in subsequent channel uses associated with subsequent transmission times.

In the general case with J antennas and J mobile terminals 200 , each mobile terminal 200 feeds back J(J−1) channel estimates, and the mobile terminals 200 combined feed back J 2 (J−1) channel estimates. The base station 100 forms J(J−1) synthesized signals, and J(J−1)/2. combined signals. The total number of channel uses comprises the initial J transmissions and the subsequent J(J−1)/2 combined signal transmission, for a total of J(J+1)/2 transmission times/channel uses. The total rate in symbols per channel use is therefore:

R = J 2 J ⁡ ( J + 1 ) / 2 = 2 ⁢ J J + 1 , ( 11 )

and the individual mobile terminal rate is:

The conventional cooperative virtual diversity system described above achieves both a higher total rate and higher individual user rates when compared to non-cooperative systems. For example, if each mobile terminal 200 acts individually, and does not feed back channel estimates to help the base station 100 synthesize received values to benefit other mobile terminals, the base station 100 can only send one symbol to a mobile terminal 200 during each time T to avoid interference. In such non-cooperative systems, the total rate in symbols per channel use is R=1, and the individual rate is ρ=1/J. Thus, as shown by Equations (11) and (12), the simple cooperative virtual diversity system described above achieves both higher total rate and individual user rate.

The conventional symmetric virtual diversity system uses symmetric resource sharing, in the sense that all mobile terminals 200 benefit in the same way. In some cases, it may be beneficial to differentiate between mobile terminals 200 , such that some mobile terminals 200 benefit more or less than other mobile terminals 200 . To satisfy this goal, the following presents an asymmetric virtual diversity system that uses asymmetric resource sharing. In general, asymmetric virtual diversity systems “puncture” one or more of the information symbols to send fewer information symbols to some mobile terminals 200 . The number of required synthesized signals may therefore also become smaller, as may the number of transmitted combined signals. Thus, the asymmetric virtual diversity system may also “puncture” one or more combined signals to reduce the number of transmitted combined signals. As a result, some individual mobile terminal rates are higher than in the baseline symmetric scheme, and some are lower. The following first describes asymmetric virtual diversity for a base station 100 having J=3 antennas 110 transmitting to three single-antenna mobile terminals 200 . As subsequently described, asymmetric virtual diversity also applies to a base station 100 having any number of antennas 110 .

FIG. 2 shows a block diagram of a base station 100 comprising a transmitter 105 , a plurality of transmission antennas 110 , an information symbol generator 120 , a reception antenna 130 , a receiver 135 , a synthesized signal generator 140 , a combiner 150 , and a controller 160 . Information symbol generator 120 generates information symbols intended for remote mobile terminals 200 . Transmitter 105 transmits the information symbols intended for a particular mobile terminal 200 at a corresponding time via one or more of the transmission antennas 110 , where different numbers of information symbols are transmitted at different transmission times.

Reception antenna(s) 130 receive channel estimates from the mobile terminals 200 for each transmission time and provide them to the receiver 135 . Receiver 135 provides the channel estimates to the synthesized signal generator 140 , which synthesizes signals based on the information symbols generated by the information symbol generator 120 and the channel estimates received by the receiver 135 . Each synthesized signal represents an estimate of the signal received by a particular mobile terminal 200 for a particular transmission time. Combiner 150 combines complementary pairs of synthesized signals to generate combined signals for transmission by the transmitter 105 at transmission times following the information symbol transmission times.

In some embodiments, transmitter 105 transmits only those information symbols and combined signals designated by the controller 160 . Thus, while information symbol generator 120 and synthesized signal generator 140 may generate all possible information symbols and combined signals, transmitter 105 may transmit only a subset of the generated symbols and/or signals. For example, when J=3 as in FIG. 1 , the information signal generator may generate u 1 [ 1 ], u 2 [ 1 ], u 3 [ 1 ], u 1 [ 2 ], u 2 [ 2 ], u 3 [ 2 ], u 1 [ 3 ], u 2 [ 3 ], and u 3 [ 3 ], but transmitter 105 may only transmit u 1 [ 1 ], u 2 [ 1 ], u 3 [ 1 ], u 1 [ 2 ], u 2 [ 2 ], u 1 [ 3 ], and u 2 [ 3 ] from respective antennas 110 . Because they will be punctured, the content of the un-transmitted symbols u 3 [ 2 ] and u 3 [ 3 ] is irrelevant. For example, the un-transmitted symbols may be generated as dummy symbols, containing no useful information. The un-transmitted symbols may also be generated as repetitions of other symbols, or generated from the punctured bits of a punctured coding scheme. Alternatively, the transmitter 105 may transmit all generated symbols and/or signals, wherein the information symbol generator 120 and synthesized signal generator 140 only generate those symbols and/or signals designated by the controller 160 . For example, information symbol generator 120 may only generate u 1 [ 1 ], u 2 [ 1 ], u 3 [ 1 ], u 1 [ 2 ], u 2 [ 2 ], u 1 [ 3 ], and u 2 [ 3 ], in which transmitter 105 will transmit all of the generated symbols from respective antennas 110 .

FIG. 3 shows a process diagram for a process 300 implemented by the base station 100 . While process 300 corresponds to J=2 antennas 110 , it will be appreciated that process 300 may be extended to any number of antennas 110 . Transmitter 105 transmits a first set of information symbols at a first time {u j [ 1 ]}, where the first set of information symbols are intended for a first mobile terminal, e.g., mobile terminal 200 a (block 310 ). The receiver 135 receives a first set of channel estimates for the first time from a second mobile terminal {H 2j [ 1 ]}, where the first set of channel estimates indicate the channel conditions at the first time between the second mobile terminal, e.g., mobile terminal 200 b , and the respective antennas 110 (block 320 ). Transmitter 105 also transmits a second set of information symbols at a second time {u j [ 2 ]}, where the second set of information symbols are intended for the second mobile terminal, e.g., mobile terminal 200 b (block 330 ). The receiver 135 receives a second set of channel estimates for the second time from the first mobile terminal {H 1j [ 2 ]}, where the second set of channel estimates indicate the channel conditions at the second time between the first mobile terminal, e.g., mobile terminal 200 a , and the respective antennas 110 (block 340 ). Synthesized signal generator 140 computes the synthesized signals based on the first and second sets of information symbols and the received channel estimates, where the synthesized signals represent estimates of signals received by the first and second mobile terminals associated with the first and second times (block 350 ). Combiner 150 combines complementary pairs of synthesized signals to generate combined signals (block 360 ). Transmitter 105 then transmits one or more of the combined signals at a subsequent transmission time (block 370 ).

The asymmetric resource sharing disclosed herein reduces the number of information symbols, and in some cases the number of combined signals, transmitted from the base station 100 . For example, in the J=3 antenna example of FIG. 1 , assume the transmitter 105 of the base station 100 transmits a first set of information symbols {u j [ 1 ]}={u 1 [ 1 ],u 2 [ 1 ],u 3 [ 1 ]} at time T=1, where different information symbols are transmitted from different antennas 110 . At times T=2 and T=3, the transmitter 105 transmits second and third sets of information symbols having fewer information symbols than the first set. For example, the second set of information symbols may comprise {u j [ 2 ]}={u 1 [ 2 ],u 2 [ 2 ]}, while the third set of information symbols may comprise {u j [ 3 ]}={u 1 [ 3 ],u 2 [ 3 ]}. Thus, u 3 [ 2 ] and u 3 [ 3 ] have been punctured from the conventional sets of information symbols. As a result, transmitter 105 transmits three information symbols intended for mobile terminal 200 a at time T=1, each form respective antennas 110 , and at respective times T=2 and T=3 transmits two information symbols intended for each of mobile terminals 200 b , 200 c , respectively, from the first antenna 110 a and the second antenna 110 b . During times T=2 and T=3, the third antenna 110 c does not transmit information symbols.

Note that for this example, while mobile terminal 200 a needs to receive two additional synthesized signals to detect its symbols using linear signal processing, mobile terminals 200 b , 200 c each need only one synthesized signal. Specifically, mobile terminal 200 a needs {circumflex over (r)} 2 [ 1 ] and {circumflex over (r)} 3 [ 1 ], as before. However, mobile terminal 200 b only needs {circumflex over (r)} 1 [ 2 ] or {circumflex over (r)} 3 [ 2 ], while mobile terminal 200 c only needs {circumflex over (r)} 1 [ 3 ] or {circumflex over (r)} 2 [ 3 ] to detect symbols using linear signal processing techniques. It is desirable to use the same complementary pairing for the combined signal as in Equation (4), and to minimize the number of channel uses. Equations (5)-(7) show that the number of channel uses can be reduced by only transmitting u 1 [ 4 ] and u 1 [ 5 ], and in effect puncturing u 1 [ 6 ]. The three mobile terminals 200 can then proceed as before, to obtain their desired virtual antenna signals. The transmitter 105 may handle the punctured combined symbols, e.g., u 1 [ 6 ], in the same way as it does the punctured information symbols. That is, the transmitter 105 may generate the punctured combined symbols as dummy symbols and then puncture them. Alternatively, the transmitter 105 may generate the punctured combined symbols from the corresponding punctured information symbols and then puncture them. In another example, the transmitter 105 may not generate the combined symbols at all.

In this J=3 example, two information symbols and one combined signal are punctured, resulting in individual rates of ρ 1 =3/5 and ρ 2 =ρ 3 =2/5. Thus, mobile terminal 200 a benefits from asymmetric resource sharing, in comparison to conventional systems, whereas mobile terminals 200 b , 200 c suffer. The overall rate is R=7/5, which is slightly less than that achieved with conventional symmetric resource sharing. Compared to symmetric non-cooperative systems, however, the disclosed asymmetric resource sharing achieves a higher overall rate and also higher individual rates for all mobile terminals.

It will be appreciated that it does not matter which mobile terminal's information symbols get punctured. The resulting design is equivalent. For simplicity, the remainder of the disclosure describes different embodiments in terms of information symbols punctured “from the bottom right.” It will be appreciated, however, that such an approach is not required.

Conventional symmetric resource sharing for J=4 antennas transmits sixteen information symbols and six combined signals, requiring ten channel uses (i.e., transmission times) in total, resulting in an individual rate of ρ=2/5, and an overall rate of R=8/5. The asymmetric resource sharing disclosed herein may also be generalized to J=4 antennas by puncturing the u 4 [ 3 ] and u 4 [ 4 ] information symbols, for example. While not required, the J=4 example may also puncture the combined value {circumflex over (r)} 3 [ 4 ]+{circumflex over (r)} 4 [ 3 ]. In this example, transmitter 105 transmits fourteen information symbols and five combined signals, requiring nine channel uses in total, resulting in individual rates of ρ 1 =ρ 2 =4/9 and ρ 3 =ρ 4 =1/3, and an overall rate of R=14/9. When compared with conventional symmetric resource sharing, two of the mobile terminals 200 benefit, while the other two mobile terminals 200 suffer, as does the overall rate.

In an alternative implementation of asymmetric resource sharing where J=4, the base station 100 punctures u 4 [ 2 ], u 4 [ 3 ], u 3 [ 4 ] and u 4 [ 4 ], and may further puncture the combined values {circumflex over (r)} 3 [ 4 ]+{circumflex over (r)} 4 [ 3 ] and {circumflex over (r)}[ 4 ]+{circumflex over (r)} 4 [ 2 ]. In this case, the base station 100 transmits twelve information symbols and four combined signals, requiring eight channel uses in total, resulting in individual rates of ρ 1 =1/2, ρ 2 =ρ 3 =3/8, and ρ 4 =1/4, and an overall rate of R=3/2. In comparison with conventional symmetric resource sharing, one mobile terminal 200 benefits, while the remaining three mobile terminals 200 suffer, as does the overall rate. In comparison to the first J=4 implementation of asymmetric resource sharing, three mobile terminals 200 benefit, and one mobile terminal 200 suffers, as does the overall rate.

The asymmetric resource sharing may be further generalized for any value of J, where the base station 100 may puncture information symbols u J [J−1] and u J [J], and combined signal {circumflex over (r)} J-1 [J]+{circumflex over (r)} J [J−1]. The total rate for this example is given by:

R = J 2 - 2 J ⁡ ( J + 1 ) / 2 - 1 , ( 13 )

where the individual rate for i<J−1 is given by:

ρ i = J J ⁡ ( J + 1 ) / 2 - 1 , ( 14 )

and the individual rate for the remaining mobile terminals is given by:

Alternatively, for a general value of J, the base station 100 may puncture information symbols u J [J−2],u J [J−1], u J-1 [J] and u J [J], and combined signals {circumflex over (r)} J-1 [J]+{circumflex over (r)} J [J−1] and {circumflex over (r)} J-2 [J]+{circumflex over (r)} J [J−2]. The total rate for this example is given by:

R = J 2 - 4 J ⁡ ( J + 1 ) / 2 - 2 , ( 16 )

and the individual rate for i<J−2 is given by:

ρ i = J J ⁡ ( J + 1 ) / 2 - 2 , ( 17 )

and the individual rate for the remaining mobile terminals is given by:

The design ideas presented herein can be extended in a natural way. That is, the base station 100 may puncture information symbols in pairs, such that the pairing efficiency of Equation (4) is maintained. Puncturing more symbols from non-prioritized terminals increases the transmission rate to one or more prioritized terminals.

Note that in some embodiments, at least one antenna 110 does not transmit information symbols or pilot symbols. For example, if the third antenna 110 c does not transmit information or pilot symbols, channel estimates H i3 [ 2 ] and H i3 [ 3 ] are unknown for all mobile terminals 200 . Consequently, the mobile terminals 200 cannot feed back these channel estimates. This inability to feed back channel estimates necessarily reduces the amount of channel feedback required of the mobile terminals 200 . It will be appreciated that the base station 100 can still synthesize the required signals because the punctured information symbols eliminate the need for the missing channel estimates.

In other embodiments, the base station 100 transmits pilot symbols from the third antenna 110 c even when the third antenna 110 c does not transmit information symbols. This feature is important for systems where the base station 100 may have a need to know these channel estimates for purposes unrelated to the asymmetrical virtual diversity reception disclosed herein. For example, base station 100 may use knowledge of the channel estimates from all of the transmit antennas 110 to estimate the average channel strength, and/or to predict which antennas 110 should be chosen for future transmissions. For example, the base station 100 may predict that the second and third antennas 110 b , 110 c yield larger channel estimates than the first antenna 110 a , and therefore, that the first antenna 110 a should be silenced in future punctured transmissions. Even in this embodiment, channel feedback may be reduced. For example, base station 100 may transmit pilots periodically (instead of every transmission time), according to some predetermined schedule, and/or the mobile terminals 200 may feed back channel estimates according to another periodic schedule.

While not required, certain synthesized signal pairings reduce the efficiency of the asymmetric virtual antenna diversity. For example, when J=3 puncturing an odd number of information symbols, e.g., only u 3 [ 3 ], causes mobile terminals 200 a and 200 b to each need two synthesized signals, while causing mobile terminal 200 c to only need one synthesized signal. This implementation would leave one value unpaired, which would result in an inefficiency in the additional combined signal transmissions. In another example, inefficiencies result when punctured information symbols lead to unpairable combinations. For example, suppose u 2 [ 3 ] and u 3 [ 3 ] are punctured. Now mobile terminals 200 a and 200 b each need two synthesized signals, while mobile terminal 200 c needs none. As a result, {circumflex over (r)} 3 [ 1 ] and {circumflex over (r)} 3 [ 2 ] are unpairable, according to Equation (4) because their counterparts {circumflex over (r)} 1 [ 3 ] and {circumflex over (r)} 2 [ 3 ] are not needed. The examples discussed herein focus on puncturing schemes where pairings are possible. While the asymmetric resource sharing disclosed herein still works when other puncturing schemes are used, they will not be as efficient.

Virtual diversity reception is described herein in terms of symbols. It will be appreciated, however, that a symbol may in fact represent a block of multiple symbols, such as in the time, frequency, or code domains, or any combination thereof. In theory, all symbols in a block experience the same channel.

Moreover, the above details assume that the mobile terminals 200 estimate the channel accurately. Without much loss of generality, we further assume that base station 100 incorporates a pilot signal with each symbol or block of symbols, to facilitate channel estimation at the mobile terminal 200 . The pilot signal may take on any form of known information, such as known symbol values in time, frequency, code or domains, or any combination thereof. In particular, mobile terminal 200 is able to handle the combined channel transmission by first estimating H 11 [ 4 ] in Equation (8) using the pilot in combined signal u 1 [ 4 ], which enables base station 100 to do the subtraction step in Equation (9). Subsequently, base station 100 can estimate the product channel H′ 2j [ 1 ] in Equation (10) using the pilot in information symbol u j [ 1 ].

The present invention may, of course, be carried out in other ways than those specifically set forth herein without departing from essential characteristics of the invention. The present embodiments are to be considered in all respects as illustrative and not restrictive, and all changes coming within the meaning and equivalency range of the appended claims are intended to be embraced therein.