1. Field of Invention
This invention relates generally to wireless communications between a base station and a mobile station and more particularly to communications between multiple transmitters and multiple receivers, each having multiple-input-multiple-output (MIMO) antennas.
2. Description of Related Art
Conventionally, in wireless systems, one of three configurations has generally been employed. Referring to
In point-to-point wireless communication systems using multiple antennas (i.e. multiple-input-multiple-output or MIMO systems) there is only one transmitter and one receiver, each of which may include multiple antennas and associated transmit and receive circuitry. In closed loop MIMO operation, the transmitter selects precoding of data based on the channel, which requires channel knowledge at the transmitter. In point-to-point systems, the maximum number of streams is min(nTx,nRx). In the point-to-multipoint communications systems shown in
In closed loop network MIMO operation of a point-to-multipoint system, the transmitters communicate over a backbone network and exchange data and/or channel state information (CSI). The maximum total number of streams for network MIMO is min(ΣnTx, ΣnRx). Using an additional backbone system to connect transmitters or receivers enables implementation of advanced transmit precoding schemes such as dirty paper precoding, for example. While such schemes generally make more efficient use of available bandwidth, there is an additional hardware cost associated with the required data exchange between transmitters and there is also an associated increase in system overhead.
Other approaches to making more efficient use of available bandwidth include configuring more transmit and/or receive antennas for a given number of data streams, which also increases hardware cost.
There remains a need for wireless system configurations and methods that facilitate efficient usage of available bandwidth and/or system hardware and other resources.
In accordance with one aspect of the invention there is provided a method for receiving a wireless transmission of a plurality of data streams in a wireless communication system having a plurality of nodes, each node having multiple antennas. The method involves receiving first and second data streams from respective first and second nodes at a receiver node, causing the receiver node to generate a receive filter for decoding each of the received data streams, and causing the receiver node to transmit receive filter information for each of the first and second data streams, the receive filter information facilitating precoding of the first and second data streams for simultaneous transmission within a common frequency band to the receiver node.
Causing the receiver node to generate the receive filter may involve causing the receiver node to perform channel estimation using first and second pilot signals associated with the respective first and second data streams, comparing the channel estimate for the respective first and second data streams to a plurality of predetermined channel estimates stored on the receiver node to determine a best match between the channel estimate and one of the plurality of predetermined channel estimates for each the channel estimate, and for each of the first and second data streams, transmitting a channel estimate identifier identifying the best match channel estimate.
Causing the receiver node to generate the receive filter may involve using a zero-forcing algorithm to generate the filter.
Causing the receiver node to generate the receive filter may involve causing the receiver node to generate a receive filter for decoding each of the received data streams in the absence of information associated with data streams transmitted to other receiver nodes in the communication system.
The receiver node may be a first receiver node and may further involve receiving third and fourth data streams from respective first and second nodes at a second receiver node, causing the second receiver node to generate a receive filter for decoding each of the received data streams, and causing the second receiver node to transmit receive filter information for each of the third and fourth data streams, the receive filter information facilitating precoding of the third and fourth data streams for simultaneous transmission within a common frequency band to the second receiver node.
Receiving the first and second data streams may involve receiving data within a common frequency band including a plurality of sub-band frequencies.
In accordance with another aspect of the invention there is provided a method for transmitting a plurality of data streams in a wireless communication system having a plurality of nodes, each node having multiple antennas. The method involves causing first and second nodes in the wireless communication system to transmit respective first and second data streams to a receiver node, receiving receive filter information for each of the first and second data streams from the receiver node, and precoding the respective first and second data streams for simultaneous transmission within a common frequency band to the receiver node.
Causing the first and second nodes to transmit the respective first and second data streams may involve causing first and second transmitter nodes to transmit the respective first and second data streams.
The precoding may involve receiving a first channel estimate identifier associated with the first data stream at the first transmitter node and locating a corresponding first predetermined channel estimate stored on the first transmitter node and using the first predetermined channel response to perform the precoding of the first data stream, and receiving a second channel estimate identifier associated with the second data stream at the second transmitter node and locating a corresponding second predetermined channel estimate stored on the second transmitter node and using the second predetermined channel response to perform the precoding of the second data stream.
Performing the precoding of the first data stream and performing the precoding of the second data stream may involve independently precoding each of the respective first and second data streams in the absence of information associated with the other data stream.
Causing the first and second nodes to transmit the respective first and second data streams may involve causing first and second relay nodes to transmit the respective first and second data streams.
Causing the first and second relay nodes to transmit the respective first and second data streams may involve causing at least one transmitter node to transmit the first and second data streams to the first and second relay nodes for relaying to the receiver node.
Causing the at least one transmitter node to transmit the first and second data streams may involve causing a first transmitter node to transmit the first data stream to the first relay node and causing a second transmitter node to transmit the second data stream to the second relay node.
The precoding may involve precoding the respective first and second data streams for simultaneous transmission within a common frequency band including a plurality of sub-band frequencies.
In accordance with another aspect of the invention there is provided a receiver node apparatus for receiving a wireless transmission of a plurality of data streams in a wireless communication system having a plurality of nodes, each node having multiple antennas. The apparatus includes a receiver for receiving first and second data streams from respective first and second nodes at a receiver node, a processor operably configured to generate a receive filter for decoding each of the received data streams, and a transmitter operably configured to transmit receive filter information for each of the first and second data streams, the receive filter information facilitating precoding of the first and second data streams for simultaneous transmission within a common frequency band to the receiver node.
The processor may be operably configured to cause the receiver node to perform channel estimation using pilot signals associated with the respective first and second data streams, compare the channel estimate for the first and second data streams to a plurality of predetermined channel estimates stored on the receiver node to determine a best match between the channel estimate and one of the plurality of predetermined channel estimates for each the channel estimate, and the transmitter may be operably configured to transmit a channel estimate identifier identifying the best match channel estimate for each of the first and second data streams.
The processor may be operably configured to generate the receive filter using a zero-forcing algorithm.
The processor may be operably configured to generate the receive filter in the absence of information associated with data streams transmitted to other receiver nodes in the communication system.
The receiver may be operably configured to receive data within a common frequency band including a plurality of sub-band frequencies.
In accordance with another aspect of the invention there is provided a wireless communication system for transmitting a plurality of data streams. The system includes first and second nodes operably configured to transmit respective first and second data streams, a receiver node operably configured to receive the first and second data streams, the receiver node being further configured to generate a receive filter for decoding each of the received data streams and to transmit receive filter information for each of the first and second data streams. The system also includes at least one transmitter node operably configured to receive the respective receive filter information for each of the first and second data streams from the receiver node and to precode the respective first and second data streams for simultaneous transmission within a common frequency band to the receiver node.
Each of the first and second nodes may include a relay node operably configured to receive the respective first and second data streams from the at least one transmitter node and to relay the data streams to the receiver node.
Other aspects and features of the present invention will become apparent to those ordinarily skilled in the art upon review of the following description of specific embodiments of the invention in conjunction with the accompanying figures.
In drawings which illustrate embodiments of the invention,
Wireless System Overview
Referring to the drawings,
Movement of the mobile stations 16 in relation to the base stations 14 results in significant fluctuation in channel conditions. As illustrated, the base stations 14 and the mobile stations 16 may include multiple antennas to provide spatial diversity for communications. In some configurations, relay stations 15 may assist in communications between the base stations 14 and the mobile stations 16. The mobile stations 16 can be handed off from any of the cells 12, the sectors 13, the zones (not shown), the base stations 14 or the relay stations 15, to another one of the cells 12, the sectors 13, the zones (not shown), the base stations 14 or the relay stations 15. In some configurations, the base stations 14 communicate with each other and with another network (such as a core network or the internet, both not shown) over a backhaul network 11. In some configurations, the base station controller 10 is not needed.
Base Station
With reference to
The baseband processor 22 processes the digitized streams to extract the information or data bits conveyed in the received signal. This processing typically comprises demodulation, decoding, and error correction operations. As such, the baseband processor 22 is generally implemented in one or more digital signal processors (DSPs) or application-specific integrated circuits (ASICs). The information is then sent across a wireless network via the network interface 30 or transmitted to another one of the mobile stations 16 serviced by the base station 14, either directly or with the assistance of one of the relay stations 15.
To perform transmitting functions, the baseband processor 22 receives digitized data, which may represent voice, data, or control information, from the network interface 30 under the control of the control system 20, and produces encoded data for transmission. The encoded data is output to the transmit circuitry 24, where it is modulated by one or more carrier signals having a desired transmit frequency or frequencies. A power amplifier (not shown) will amplify the modulated carrier signals to a level appropriate for transmission, and deliver the modulated carrier signals to the transmit antennas 28 and 29 through a matching network (not shown). Modulation and processing details are described in greater detail below.
Mobile Station
With reference to
Similarly to the base stations 14, the mobile station 16 includes a control system 32, a baseband processor 34, transmit circuitry 36, receive circuitry 38, multiple receive antennas 40 and 41, and user interface circuitry 42. The receive circuitry 38 receives radio frequency signals bearing information from one or more of the base stations 14 and the relay stations 15. A low noise amplifier and a filter (not shown) may cooperate to amplify and remove broadband interference from the signal for processing. Downconversion and digitization circuitry (not shown) will then downconvert the filtered, received signal to an intermediate or baseband frequency signal, which is then digitized into one or more digital streams.
The baseband processor 34 processes the digitized streams to extract information or data bits conveyed in the signal. This processing typically comprises demodulation, decoding, and error correction operations. The baseband processor 34 is generally implemented in one or more digital signal processors (DSPs) and application specific integrated circuits (ASICs).
For transmission, the baseband processor 34 receives digitized data, which may represent voice, video, data, or control information, from the control system 32, which it encodes for transmission. The encoded data is output to the transmit circuitry 36, where it is used by a modulator to modulate one or more carrier signals at a desired transmit frequency or frequencies. A power amplifier (not shown) amplifies the modulated carrier signals to a level appropriate for transmission, and delivers the modulated carrier signal to each of the receive antennas 40 and 41 through a matching network (not shown). Various modulation and processing techniques available to those skilled in the art may be used for signal transmission between the mobile stations 16 and the base stations 14, either directly or via the relay stations 15.
OFDM Modulation
In OFDM modulation, the transmission band is divided into multiple, orthogonal carrier waves. Each carrier wave is modulated according to the digital data to be transmitted. Because OFDM divides the transmission band into multiple carriers, the bandwidth per carrier decreases and the modulation time per carrier increases. Since the multiple carriers are transmitted in parallel, the transmission rate for the digital data, or symbols, on any given carrier is lower than when a single carrier is used.
OFDM modulation includes the use of an Inverse Fast Fourier Transform (IFFT) on the information to be transmitted. For demodulation, a Fast Fourier Transform (FFT) is performed on the received signal to recover the transmitted information. In practice, the IFFT and FFT are provided by digital signal processing involving an Inverse Discrete Fourier Transform (IDFT) and Discrete Fourier Transform (DFT), respectively. Accordingly, a characterizing feature of OFDM modulation is that orthogonal carrier waves are generated for multiple bands within a transmission channel. The modulated signals are digital signals having a relatively low transmission rate and capable of staying within their respective bands. The individual carrier waves are not modulated directly by the digital signals. Instead, all carrier waves are modulated at once by IFFT processing.
In operation, OFDM is preferably used for at least downlink transmission from the base stations 14 to the mobile stations 16. Each of the base stations 14 is equipped with “n” transmit antennas (n≧1), and each of the mobile stations 16 is equipped with “m” receive antennas (m≧1). Notably, the respective antennas can be used for reception and transmission using appropriate duplexers or switches and are so labeled only for clarity.
When the relay stations 15 are used, OFDM is preferably used for downlink transmission from the base stations 14 to the relay stations and from the relay stations to the mobile stations 16.
Relay Station
With reference to
The baseband processor 134 processes the digital streams to extract information or data bits conveyed in the signal. This processing typically comprises demodulation, decoding, and error correction operations. The baseband processor 134 is generally implemented in one or more digital signal processors (DSPs) and application specific integrated circuits (ASICs).
For transmission, the baseband processor 134 receives digitized data, which may represent voice, video, data, or control information, from the control system 132, which it encodes for transmission. The encoded data is output to the transmit circuitry 136, where it is used by a modulator to modulate one or more carrier signals at a desired transmit frequency or frequencies. A power amplifier (not shown) will amplify the modulated carrier signals to a level appropriate for transmission, and deliver the modulated carrier signal to the antennas 130 and 131 through a matching network (not shown). Various modulation and processing techniques available to those skilled in the art may be used for signal transmission between the mobile stations 16 and the base stations 14, either directly or indirectly via the relay stations 15, as described above.
With reference to
Transmitting scheduled data to Mobile Station
Referring to
Bit interleaver logic 54 systematically reorders the bits in the encoded data to minimize loss of consecutive data bits. The re-ordered data bits are systematically mapped into corresponding symbols depending on the chosen baseband modulation by mapping logic 56. Preferably, Quadrature Amplitude Modulation (QAM) or Quadrature Phase Shift Key (QPSK) modulation is used. The degree of modulation is chosen based on the CQI associated with the particular mobile station. The symbols may be systematically reordered using symbol interleaver logic 58 to further bolster the immunity of the transmitted signal to periodic data loss caused by frequency selective fading.
At this point, groups of bits have been mapped into symbols representing locations in an amplitude and phase constellation. When spatial diversity is desired, blocks of symbols are then processed by space-time block code (STC) encoder logic 60, which modifies the symbols in a fashion making the transmitted signals more resistant to interference and more readily decoded at the mobile stations 16. The STC encoder logic 60 will process the incoming symbols and provide “n” outputs corresponding to the number of the transmit antennas (n=2 for the case shown in
For the present example, assume the base station (14 in
Referring to
Reception of signals at the Mobile Station
Reference is now made to
Initially, the digitized signal is provided to synchronization logic shown generally at 76, which includes coarse synchronization function 78, which buffers several OFDM symbols and calculates an auto-correlation between the two successive OFDM symbols. A resultant time index corresponding to the maximum of the correlation result determines a fine synchronization search window, which is used by fine synchronization function 80 to determine a precise framing starting position based on the headers. The output of the fine synchronization function 80 facilitates frame acquisition by frame alignment logic 84. Proper framing alignment is important so that subsequent FFT processing provides an accurate conversion from the time domain to the frequency domain. The fine synchronization algorithm is based on the correlation between the received pilot signals carried by the headers and a local copy of the known pilot data. Once frame alignment acquisition occurs, the prefix of the OFDM symbol is removed with prefix removal logic 86 and resultant samples are sent to a frequency offset/correction function 88, which compensates for the system frequency offset caused by the unmatched local oscillators in a transmitter and a receiver.
Preferably, the synchronization logic 76 includes a frequency offset and clock estimation function 82, which uses the headers to help estimate frequency offset and clock offset in the transmitted signal and provide those estimates to the frequency offset/correction function 88 to properly process OFDM symbols.
At this point, the OFDM symbols in the time domain are ready for conversion to the frequency domain by an FFT processing function 90. The result is a set of frequency domain symbols, which are sent to a processing function 92. The processing function 92 extracts the scattered pilot signals (shown in
Continuing with
The frequency domain symbols and channel reconstruction information, which are derived from the channel responses for each receive path are provided to an STC decoder 100, which provides STC decoding on both received paths associated with the respective antennas 41 and 42 to recover the transmitted symbols. The channel reconstruction information provides equalization information to the STC decoder 100 sufficient to remove the effects of the transmission channel when processing the respective frequency domain symbols.
The recovered symbols are placed back in order using symbol de-interleaver logic 102, which corresponds to the symbol interleaver logic 58 of the transmitter. The de-interleaved symbols are then demodulated or de-mapped to a corresponding bitstream using de-mapping logic 104. The bits are then de-interleaved using bit de-interleaver logic 106, which corresponds to the bit interleaver logic 54 of the transmitter architecture. The de-interleaved bits are then processed by rate de-matching logic 108 and presented to channel decoder logic 110 to recover the initially scrambled data and the CRC checksum. Accordingly, CRC logic 112 removes the CRC checksum, checks the scrambled data in traditional fashion, and provides it to the de-scrambling logic 114 for de-scrambling using the known base station de-scrambling code to reproduce the originally transmitted data as data 116.
Still referring to
In some embodiments, the relay stations may operate in a time division manner using only one radio, or alternatively include multiple radios.
In the embodiments shown in
Referring to
X-MIMO Communications
In this application, the term X-MIMO is used to refer to a Multiple-Input-Multiple-Output communications between transmitter nodes and receiver nodes in which transmissions of data to a particular receiver occur from either different transmitters or different relays.
In the X-MIMO embodiments described herein, more than one multi-antenna transmitter and more than one multi-antenna-receiver are configured to communicate in the absence of data-exchange or channel state information (CSI) exchange between the transmitters (i.e. a non-cooperative transmission). There is also no data or CSI exchange between recievers. However, each transmitter is provided with information of the MIMO channel information by the respective recievers and transmitters and pre-coding or filtering is performed such that a dimension of the interference is minimized.
In general in the X-MIMO embodiments disclosed herein, each transmitter node sends a pilot signal for each antenna, where the pilot signals for each transmitter are orthogonal. Each receiver node estimates all of the incoming MIMO channels, and computes the specific receive filters and provides feedback information to the transmitter node (for example in the form of a compound filter and MIMO channel identification). Each transmitter node then computes a pre-coding filter based on the feedback of information from the receiver node, and sends pre-coded data to the receiver nodes using the computed precoding filter. Each receiver node applies the receive filter to the data to provide a filtered receive signal and then demodulates the signal to recover the data.
The X-MIMO embodiments achieve an increase in spectral efficiency by coordinating interference between data streams arriving at each receiver, such that the signal subspace is expanded resulting in accommodation of a higher number of data streams within the available signal subspace.
Referring to
More specifically, in the system 300 shown in
In the ΔT2 time slot and in ΔF2 bandwidth:
The signals of the nodes 302 and 304 in ΔT1 time slot and in ΔF1 bandwidth and signals of the nodes 302, 304, 310 in ΔT2 time slot and in ΔF2 bandwidth may be dependent or independent.
Referring to
The received vector yr by receiver r, r=1; 2, is given by,
y
1
=H
11
s
1
+H
12
s
2
+w
1 (Eqn 1)
y
21
=H
21
s
1
+H
22
s
2
+w
2 (Eqn 2)
where:
Transmitter t1 sends b11 data streams to receiver r1 and b21 data streams to receiver r2, and transmitter t2 sends b12 data streams to receiver r1 and b22 data streams to receiver r2. Transmitters t1 and t2 cooperate to send b10 data streams to receiver r1, and transmitters t1 and t2 cooperate to send b2c data streams to receiver r2. The six sets of data streams may be dependent or independent. To modulate or deniodulate the data streams, any linear or non-linear scheme or algorithm can be applied and brt and brc can be selected based on design requirements.
Zero-Forcing Precoding
Referring to
For the example shown in
s
1
=V
11
d
11
+V
12
d
12
+V
1c
1
d
1c
+V
2c
1
d
2c (Eqn 3)
s
2
=V
12
d
12
+V
22
d
22
+V
1c
2
d
1c
+V
2c
2
d
2c (Eqn 4)
where
Exemplary, steps for selecting the system parameters follow below.
Step 1: Choosing Integers brt, r, t=1, 2 and brc, r=1, 2
Select integers brt, r, t=1, 2 and brc, r=1, 2 such that the following constraints are satisfied:
b1c:b1c+b2c+b22+b21≦2m (Eqn 5)
b2c:b1c+b2c+b11+b12≦2m (Eqn 6)
b11:b11+b2c+b22+b21≦m (Eqn 7)
b12:b12+b2c+b22+b21≦m (Eqn 8)
b21:b21+b1c+b11+b12≦m (Eqn 9)
b22:b22+b1c+b11+b12≦m (Eqn 10)
b
11
+b
21
+b
1c
≦m (Eqn 11)
b
11
+b
21
+b
2c
≦m (Eqn 12)
b
12
+b
22
+b
1c
≦m (Eqn 13)
b
12
+b
22
+b
1c
≦m (Eqn 14)
b
11
+b
12
+b
21
+b
22
+b
1c
+b
2c≦2m (Eqn 15)
Each of the first four inequalities (Eqns 5-8) correspond to one of the parameters brt, brc, r, t=1, 2, in the sense that if brt, or brc r, t=1, 2, is zero, the corresponding inequality is removed from the set of constraints. Further constraints may be added based on the implementation of the system. If in a particular application, common messages are not of any interest, then b1c and b2c may be set to zero.
Step 2: Choosing Matrices Q1 and Q2
Q1 and Q2 may be chosen based on any selected optimization criteria.
Step 3: Choosing Modulation Matrices:
Step 4: Choosing Demodulation Matrices:
Constraint equations 5-15 above guarantee that such transmit and receive filters can be designed. The above steps are based on nulling the interference of data streams over each other. In other embodiments, alternative linear or nonlinear schemes such as Minimum Mean Square Error (MMSE), successive decoding, dirty-paper-coding, etc. may be used in place of the zero-forcing precoding algorithm as described above.
Zero-Forcing Precoding with Frequency Extension
In the above zero-forcing precoding algorithm, it is assumed that each node has m antennas, providing m spatial dimensions. In another embodiment, additional spatial dimensions may be provided using time and frequency resources. As an example, the above embodiment in which spatial dimensions are provided by physical antennas is extended to a case, where J frequency sub-bands are implemented. In this embodiment each transmitter t, t=1, 2, is equipped with mt antennas and each receiver r, r=1, 2, is equipped with nr antennas. The channel between transmitter t and receiver r is at sub-band j, j=1, . . . , J, represented by the channel matrix Hrt(j), where Hrt(j) is a nr by mt complex matrix. The received vector yr(j) by receiver r, r=1, 2, is given by:
y
1(j)=H11(j)s1(j)+H12(j)+w1(j) (Eqn 16)
y
2(j)=H21(j)s1(j)+H22(j)+w2(j) (Eqn 17)
where:
Hrt, sr, and yr may be defined as follows:
Again, as in the previous embodiment, zero-forcing precoding is used and it is assumed that n1=n2=m1=m2=m. The transmitted vectors may be written as:
s
1
=V
11
d
11
+V
12
d
12
+V
1c
1
d
1c
+V
2c
1
d
2c (Eqn 18)
s
2
=V
12
d
12
+V
22
d
22
+V
1c
2
d
1c
+V
2c
2
d
2c (Eqn 19)
where:
Exemplary, steps for selecting the system parameters follow below.
Step 1: Choosing Integers brt, t=1, 2 and brc, r=1, 2
Select integers brt, r, t=1, 2 and brc, r=1, 2, such that the following constraints are satisfied:
b1c:b1c+b2c+b22+b21≦2J·m (Eqn 20)
b2c:b1c+b2c+b11+b12≦2J·m (Eqn 21)
b11:b11+b2c+b22+b21≦J·m (Eqn 22)
b12:b12+b2c+b22+b21≦J·m (Eqn 23)
b21:b21+b1c+b11+b12≦J·m (Eqn 24)
b22:b22+b1c+b11+b12≦J·m (Eqn 25)
b
11
+b
21
+b
1c
≦J·m (Eqn 26)
b
11
+b
21
+b
2c
≦J·m (Eqn 27)
b
12
+b
22
+b
1c
≦J·m (Eqn 28)
b
12
+b
22
+b
1c
≦J·m (Eqn 29)
b
11
+b
12
+b
21
+b
22
+b
1c
+b
2c≦2J·m (Eqn 30)
Each of the first four inequalities in Eqns 21-23 correspond to one of the parameters brt, brc, r, t=1, 2, in the sense that if brt, or brc r, t=1, 2, is zero, the corresponding inequality is removed from the set of constraints. Further constraints may be added based on the implementation of the system. If in a particular application, common messages are not of any interest, then b1c and b2c may be set to zero.
Step 2: Choosing Matrices Q1 and Q2
Q1 and Q2 can be chosen based on any selected optimizing criteria
Step 3: Choosing Modulation Matrices:
Step 4: Choosing Demodulation Matrices:
Constraint equations 20-30 above guarantee that such transmit and receive filters can be designed.
Referring to
Referring to
Referring to
Case 1: Correlated Signals at the Relays
Considering a period of time T, during a first portion of the time period [0, T/2], the transmitter 422 transmits:
while the transmitter 424 simultaneously transmits:
During a second portion of the period of time T (i.e. [T/2, T]) relays 426 and 428 each simultaneously transmit the received data streams to the respective receivers 430 and 432, using the zero-forcing precoding algorithm described above with b11=b12=b21=b22=b1c=b2c=1. The overall capacity or throughput of the system 420 is thus:
C=3 log(PT)
where PT represents total power, and C represents overall channel capacity. The number of incoming data streams at each relay 426, 428 is the same as the number of outgoing data streams at each relay.
Case 2: Uncorrelated Signals at the Relays
Considering a period of time T, during a first portion of the time period [0.2 T/5], the transmitter 422 transmits:
while the transmitter 424 simultaneously transmits:
In this example data streams b1c and b2c are not transmitted. During a second portion of the time period T (i.e. [2 T/5, T]), relays 426 and 428, simultaneously transmit the data streams to receiver 430 and 432, using the zero-forcing precoding algorithm described above with b11=b12=b21=b22=4, b1c=b2c=0, and J=3 (i.e 3 frequency sub-bands). The overall capacity of this algorithm is:
C=16/5 log(PT)
Again, PT represents total power, C is the overall channel capacity and the number of incoming data streams at each relay 426, 428 is the same as the number of outgoing data streams at each relay.
In contrast, in a conventional scheme during a first portion of the time period T (i.e [0, T/3]), the transmitter 422 transmits four data streams intended for receiver 430 to relay 426, and the transmitter 424 transmits four data streams intended for receiver 432 to relay 428. During a second portion of the time period T, (i.e. [T/3, 2 T/3]), relay 426 transmits four data streams to receiver 430 and during a third portion of the time period T, (i.e. [2 T/3, T], relay 428 transmits four data streams to receiver 432. The overall capacity of this scheme is:
C=8/3 log(PT)
where PT represents total power. This is the best achievable rate with conventional scheme. It is clear that Case 1 and Case 2 of example 3 that are based on the zero-forcing precoding algorithm above thus have better throughput than the conventional scheme described above.
Advantageously, in the above examples, performance of the communication system is improved in terms of overall throughput, with corresponding improvements in reliability and coverage. The zero-forcing precoding may thus be applied to improve the performance of an existing MIMO communication system, and may be generalized to any number of transmitters and receivers. The embodiments shown in
While the embodiments in the above examples and disclosure are implemented using zero-forcing precoding, other linear or non-linear filters or precoding techniques may be implemented. For example, other known schemes such as dirty-paper coding, successive decoding, MMSE filters, etc. may be implemented in place of zero-forcing precoding, depending on the configuration and requirements of the system.
Advantageously, the X-MIMO embodiments disclosed above provide solutions to several fundamental difficulties in distributed broadband wireless networking. For example, achieving a higher multiplexing gain in the absence of data exchange between transmitters and/or receivers overcomes one major obstacle in enable distributed multi-user communications. Furthermore, the multiple-relay examples above enable relay node sharing between the multiple data paths and support distinct source-destination routing.
Additionally, the disclosed X-MIMO embodiments facilitate a reduction in the number of antennas required to achieve a desired spectral efficiency, or increase the spectral efficiency for an existing MIMO antenna configuration. For example, in a communications system of two receivers and two transmitters, a conventional receiver requires four receive antennas for each receiver in order to achieve a multiplexing again of 4. For the X-MIMO embodiments disclosed herein, three receive antennas for each receiver would achieve the same multiplexing gain of 4, without suffering a penalty in required transmit power or bandwidth.
While specific embodiments of the invention have been described and illustrated, such embodiments should be considered illustrative of the invention only and not as limiting the invention as construed in accordance with the accompanying claims.
This application claims the benefit of U.S. provisional patent application 61/245,339 filed on Sep. 24, 2009, which is hereby incorporated by reference in its entirety. This application is a continuation-in-part of the non-provisional application (serial number to be determined) resulting from conversion under 37 C.F.R. §1.53(c)(3) of U.S. provisional patent application 61/245,339 filed on Sep. 24, 2009, which claims the benefit of U.S. provisional patent application 61/100,118 filed on Sep. 25, 2008.
Number | Date | Country | |
---|---|---|---|
61100118 | Sep 2008 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12923520 | Sep 2010 | US |
Child | 13620686 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12806209 | Sep 2009 | US |
Child | 12923520 | US |