US 6,775,329 B2Grant
Transmitter diversity technique for wireless communications
Issue Date:2004-08-10
•37 Claims
•2 Drawing Sheets
Abstract
A simple block coding arrangement is created with symbols transmitted over a plurality of transmit channels, in connection with coding that comprises only of simple arithmetic operations, such as negation and conjugation. The diversity created by the transmitter utilizes space diversity and either time or frequency diversity. Space diversity is effected by redundantly transmitting over a plurality of antennas, time diversity is effected by redundantly transmitting at different times, and frequency diversity is effected by redundantly transmitting at different frequencies. Illustratively, using two transmit antennas and a single receive antenna, one of the disclosed embodiments provides the same diversity gain as the maximal-ratio receiver combining (MRRC) scheme with one transmit antenna and two receive antennas. The principles of this invention are applicable to arrangements with more than two antennas, and an illustrative embodiment is disclosed using the same space block code with two transmit and two receive antennas.
Metadata
Assignee
- AT&T Wireless Services, Inc.
Inventors
- Siavash Alamouti
- Vahid Tarokh
Application Information
Application Number:US 09/730,151
Filing Date:2000-12-05
Priority Date:1997-09-16
Art Unit:7
Classifications
IPC:
H04B 702H04L 102
Field of Search:
375260375347375267375295375299375262375340375341375346714794714795714796714784455132455101
Patent Drawings (2 sheets)
Description
Reference to Related Applications
[0002] This is a continuation of an application bearing the Ser. No. 09/074,224 that was filed on May 7, 1998 now U.S. Pat. No. 6,185,258.
[0003] This application claims the benefit of U.S. Provisional Application No. 60/059,016, filed Sep. 16, 1997; of U.S. Provisional Application No. 60/059,219, filed Sep. 18, 1997; and of U.S. Provisional Application No. 60/063,780, filed Oct. 31, 1997.
Background of the Invention
[0004] This invention relates to wireless communication and, more particularly, to techniques for effective wireless communication in the presence of fading and other degradations.
[0005] The most effective technique for mitigating multipath fading in a wireless radio channel is to cancel the effect of fading at the transmitter by controlling the transmitter's power. That is, if the channel conditions are known at the transmitter (on one side of the link), then the transmitter can pre-distort the signal to overcome the effect of the channel at the receiver (on the other side). However, there are two fundamental problems with this approach. The first problem is the transmitter's dynamic range. For the transmitter to overcome an x dB fade, it must increase its power by x dB which, in most cases, is not practical because of radiation power limitations, and the size and cost of amplifiers. The second problem is that the transmitter does not have any knowledge of the channel as seen by the receiver (except for time division duplex systems, where the transmitter receives power from a known other transmitter over the same channel). Therefore, if one wants to control a transmitter based on channel characteristics, channel information has to be sent from the receiver to the transmitter, which results in throughput degradation and added complexity to both the transmitter and the receiver.
[0006] Other effective techniques are time and frequency diversity. Using time interleaving together with coding can provide diversity improvement. The same holds for frequency hopping and spread spectrum. However, time interleaving results in unnecessarily large delays when the channel is slowly varying. Equivalently, frequency diversity techniques are ineffective when the coherence bandwidth of the channel is large (small delay spread).
[0007] It is well known that in most scattering environments antenna diversity is the most practical and effective technique for reducing the effect of multipath fading. The classical approach to antenna diversity is to use multiple antennas at the receiver and perform combining (or selection) to improve the quality of the received signal.
[0008] The major problem with using the receiver diversity approach in current wireless communication systems, such as IS-136 and GSM, is the cost, size and power consumption constraints of the receivers. For obvious reasons, small size, weight and cost are paramount. The addition of multiple antennas and RF chains (or selection and switching circuits) in receivers is presently not be feasible. As a result, diversity techniques have often been applied only to improve the up-link (receiver to base) transmission quality with multiple antennas (and receivers) at the base station. Since a base station often serves thousands of receivers, it is more economical to add equipment to base stations rather than the receivers
[0009] Recently, some interesting approaches for transmitter diversity have been suggested. A delay diversity scheme was proposed by A. Wittneben in “Base Station Modulation Diversity for Digital SIMULCAST,” Proceeding of the 1991 IEEE Vehicular Technology Conference (VTC 41 st), PP. 848-853, May 1991, and in “A New Bandwidth Efficient Transmit Antenna Modulation Diversity Scheme For Linear Digital Modulation,” in Proceeding of the 1993 IEEE International Conference on Communications (IICC '93), PP. 1630-1634, May 1993. The proposal is for a base station to transmit a sequence of symbols through one antenna, and the same sequence of symbols—but delayed—through another antenna.
[0010] U.S. Pat. No. 5,479,448, issued to Nambirajan Seshadri on Dec. 26, 1995, discloses a similar arrangement where a sequence of codes is transmitted through two antennas. The sequence of codes is routed through a cycling switch that directs each code to the various antennas, in succession. Since copies of the same symbol are transmitted through multiple antennas at different times, both space and time diversity are achieved. A maximum likelihood sequence estimator (MLSE) or a minimum mean squared error (MMSE) equalizer is then used to resolve multipath distortion and provide diversity gain. See also N. Seshadri, J. H. Winters, “Two Signaling Schemes for Improving the Error Performance of FDD Transmission Systems Using Transmitter Antenna Diversity,” Proceeding of the1993 IEEE Vehicular Technology Conference(VTC 43rd), pp. 508-511, May 1993; and J. H. Winters, “The Diversity Gain of Transmit Diversity in Wireless Systems with Rayleigh Fading,” Proceeding of the1994 ICC/SUPERCOMM, New Orleans, Vol. 2, PP. 1121-1125, May 1994.
[0011] Still another interesting approach is disclosed by Tarokh, Seshadri, Calderbank and Naguib in U.S. application, Ser. No. 08/847635, filed Apr. 25, 1997 (based on a provisional application filed Nov. 7, 1996), where symbols are encoded according to the antennas through which they are simultaneously transmitted, and are decoded using a maximum likelihood decoder. More specifically, the process at the transmitter handles the information in blocks of M1 bits, where M1 is a multiple of M2, i.e., M1=k*M2. It converts each successive group of M2 bits into information symbols (generating thereby k information symbols), encodes each sequence of k information symbols into n channel codes (developing thereby a group of n channel codes for each sequence of k information symbols), and applies each code of a group of codes to a different antenna.
Summary
[0012] The problems of prior art systems are overcome, and an advance in the art is realized with a simple block coding arrangement where symbols are transmitted over a plurality of transmit channels and the coding comprises only of simple arithmetic operations, such as negation and conjugation. The diversity created by the transmitter utilizes space diversity and either time diversity or frequency diversity. Space diversity is effected by redundantly transmitting over a plurality of antennas; time diversity is effected by redundantly transmitting at different times; and frequency diversity is effected by redundantly transmitting at different frequencies. Illustratively, using two transmit antennas and a single receive antenna, one of the disclosed embodiments provides the same diversity gain as the maximal-ratio receiver combining (MRRC) scheme with one transmit antenna and two receive antennas. The novel approach does not require any bandwidth expansion or feedback from the receiver to the transmitter, and has the same decoding complexity as the MRRC. The diversity improvement is equal to applying maximal-ratio receiver combining (MRRC) at the receiver with the same number of antennas. The principles of this invention are applicable to arrangements with more than two antennas, and an illustrative embodiment is disclosed using the same space block code with two transmit and two receive antennas. This scheme provides the same diversity gain as four-branch MRRC.
Brief Description of the Drawings
[0013] FIG. 1 is a block diagram of a first embodiment in accordance with the principles of this invention;
[0014] FIG. 2 presents a block diagram of a second embodiment, where channel estimates are not employed;
[0015] FIG. 3 shows a block diagram of a third embodiment, where channel estimates are derived from recovered signals; and
[0016] FIG. 4 illustrates an embodiment where two transmitter antennas and two receiver antennas are employed.
Detail Description
[0017] In accordance with the principles of this invention, effective communication is achieved with encoding of symbols that comprises merely negations and conjugations of symbols (which really is merely negation of the imaginary part) in combination with a transmitter created diversity. Space diversity and either frequency diversity or time diversity are employed.
[0018] FIG. 1 presents a block diagram of an arrangement where the two controllable aspects of the transmitter that are used are space and time. That is, the FIG. 1 arrangement includes multiple transmitter antennas (providing space diversity) and employs multiple time intervals. Specifically, transmitter 10 illustratively comprises antennas 11 and 12, and it handles incoming data in blocks n symbols, where n is the number of transmitter antennas, and in the illustrative embodiment of FIG. 1, it equals 2, and each block takes n symbol intervals to transmit. Also illustratively, the FIG. 1 arrangement includes a receiver 20 that comprises a single antenna 21.
[0019] At any given time, a signal sent by a transmitter antenna experiences interference effects of the traversed channel, which consists of the transmit chain, the air-link, and the receive chain. The channel may be modeled by a complex multiplicative distortion factor composed of a magnitude response and a phase response. In the exposition that follows therefore, the channel transfer function from transmit antenna 11 to receive antenna 21 is denoted by h0and from transmit antenna 12 to receive antenna 21 is denoted by h1, where:
[0020] h0=α0ejΘ″h1=α1ejΘ′. (1)
[0021] Noise from interference and other sources is added at the two received signals and, therefore, the resulting baseband signal received at any time and outputted by reception and amplification section 25 is
[0022] r(t)=α0ejΘ″si+α1ejΘ′sj+n(t), (2)
[0023] where siand sjare the signals being sent by transmit antenna 11 and 12, respectively.
[0024] As indicated above, in the two-antenna embodiment of FIG. 1 each block comprises two symbols and it takes two symbol intervals to transmit those two symbols. More specifically, when symbols siand sjneed to be transmitted, at a first time interval the transmitter applies signal sito antenna 11 and signal sjto antenna 12, and at the next time interval the transmitter applies signal −s1* to antenna 11 and signal s0* to antenna 12. This is clearly a very simple encoding process where only negations and conjugations are employed. As demonstrated below, it is as effective as it is simple. Corresponding to the above-described transmissions, in the first time interval the received signal is
[0025] r(t)=h0si+h1sj+n(t), (3)
[0026] and in the next time interval the received signal is
[0027] r(t+T)=−h0sj*+h1si*+n(t+T). (4)
[0028] Table 1 illustrates the transmission pattern over the two antennas of the FIG. 1 arrangement for a sequence of signals {s0, s1, s2, s3, s4, s5, . . . }.
| TABLE 1 | |||||||
|---|---|---|---|---|---|---|---|
| Time: | t | t + T | t + 2T | t + 3T | t + 4T | t + 5T | |
| Antenna 11 | s | −s | s | −s | s | −s | . . . . . |
| Antenna 12 | s | s | s | s | s | s | . . . . . |
[0029] The received signal is applied to channel estimator 22, which provides signals representing the channel characteristics or, rather, the best estimates thereof. Those signals are applied to combiner 23 and to maximum likelihood detector 24. The estimates developed by channel estimator 22 can be obtained by sending a known training signal that channel estimator 22 recovers, and based on the recovered signal the channel estimates are computed. This is a well known approach.
[0030] Combiner 23 receives the signal in the first time interval, buffers it, receives the signal in the next time interval, and combines the two received signals to develop signals
[0031] {tilde over (s)}i={tilde over (h)}0*r(t)+{tilde over (h)}1r*(t+T) {tilde over (s)}j={tilde over (h)}1*r(t)−{tilde over (h)}0r*(t+T). (5)
[0032] Substituting equation (1) into (5) yields
[0033] {tilde over (s)}i=({tilde over (α)}02+{tilde over (α)}12)si+{tilde over (h)}0*n(t)+{tilde over (h)}1n*(t+T) {tilde over (s)}i=({tilde over (α)}02+{tilde over (α)}12)sj−{tilde over (h)}0n*(t+T)+{tilde over (h)}1*n(t), (6)
[0034] where {tilde over (α)}02={tilde over (h)}0{tilde over (h)}0* and {tilde over (α)}12={tilde over (h)}1{tilde over (h)}1*, demonstrating that the signals of equation (6) are, indeed, estimates of the transmitted signals (within a multiplicative factor). Accordingly, the signals of equation (6) are sent to maximum likelihood detector 24.
[0035] In attempting to recover si, two kind of signals are considered: the signals actually received at time t and t+T, and the signals that should have been received if siwere the signal that was sent. As demonstrated below, no assumption is made regarding the value of sj. That is, a decision is made that si=sxfor that value of x for which
[0036] d2[r(t),(h0sx+h1sj)]+d2[r(t+T),(−h1sj*+h0sx*)]
[0037] is less than
[0038] d2[r(t),(h0sk+h1sj)]+d2[r(t+T),(−h1sj*+h0sk*)], (7)
[0039] where d2(x, y) is the squared Euclidean distance between signals x and y, i.e., d2(x, y)=|x−y|2.
[0040] Recognizing that {tilde over (h)}0=h0+noise that is independent of the transmitted symbol, and that {tilde over (h)}1=h1+noise that is independent of the transmitted symbol, equation (7) can be rewritten to yield
[0041] (α02+α12)|sx|2−{tilde over (s)}isx*−{tilde over (s)}i*sx≦(α02+α12)|sk|2−{tilde over (s)}isk*−{tilde over (s)}i*sk (8)
[0042] where α02=h0h0* and α12=h1h1*; or equivalently,
[0043] (α02+α12−1)|sx|2+d2({tilde over (s)}i,sx)≦(α02+α12−1)|sk|2+d2({tilde over (s)}i,sk). (9)
[0044] In Phase Shift Keying modulation, all symbols carry the same energy, which means that |sx|2=|sk|2and, therefore, the decision rule of equation (9) may be simplified to
[0045] choose signal ŝi=sxiff d2({tilde over (s)}i,sx)≦d2({tilde over (s)}i,sk). (10)
[0046] Thus, maximum likelihood detector 24 develops the signals skfor all values of k, with the aid of {tilde over (h)}0and {tilde over (h)}1from estimator 22, develops the distances d2({tilde over (s)}i,sk), identifies x for which equation (10) holds and concludes that ŝi=sx. A similar process is applied for recovering ŝj.
[0047] In the above-described embodiment each block of symbols is recovered as a block with the aid of channel estimates {tilde over (h)}0and {tilde over (h)}1. However, other approaches to recovering the transmitted signals can also be employed. Indeed, an embodiment for recovering the transmitted symbols exists where the channel transfer functions need not be estimated at all, provided an initial pair of transmitted signals is known to the receiver (for example, when the initial pair of transmitted signals is prearranged). Such an embodiment is shown in FIG. 2, where maximum likelihood detector 27 is responsive solely to combiner 26. (Elements in FIG. 3 that are referenced by numbers that are the same as reference numbers in FIG. 1 are like elements.) Combiner 26 of receiver 30 develops the signals
[0048] then develops intermediate signals A and B
[0049] A=r0r3*−r2r1*B=r2r0*+r1r3, (12)
[0050] and finally develops signals
[0051] {tilde over (s)}2=As1*+Bs0{tilde over (s)}3=−As0*+Bs1, (13)
[0052] where N3and N4are noise terms. It may be noted that signal r2is actually r2=h0ŝ2+h1ŝ3=h0s2+h1s3+n2, and similarly for signal r3. Since the makeup of signals A and B makes them also equal to
[0053] A=(α02+α12)(s2s1−s3s0)+N1B=(α02+α12)(s2s0*+s3s1*)+N2, (14)
[0054] where N1 and N2 are noise terms, it follows that signals {tilde over (s)}2and {tilde over (s)}3are equal to
[0055] {tilde over (s)}2=(α02+α12)(|s0|2+|s1|2)s2+N3{tilde over (s)}3=(α02+α12)(|s0|2+|s1|2)s3+N4. (14)
[0056] When the power of all signals is constant (and normalized to 1) equation (15) reduces to
[0057] {tilde over (s)}2=(α02+α12)s2+N3{tilde over (s)}3=(α02+α12)s3+N4. (16)
[0058] Hence, signals {tilde over (s)}2and {tilde over (s)}3are, indeed, estimates of the signals s2and s3(within a multiplicative factor). Lines 28 and 29 demonstrate the recursive aspect of equation (13), where signal estimates {tilde over (s)}2and {tilde over (s)}3are evaluated with the aid of recovered signals s0and s1that are fed back from the output of the maximum likelihood detector.
[0059] Signals {tilde over (s)}2and {tilde over (s)}3are applied to maximum likelihood detector 24 where recovery is effected with the metric expressed by equation (10) above. As shown in FIG. 2, once signals s2and s3are recovered, they are used together with received signals r2, r3, r4, and r5to recover signals s4and s5, and the process repeats.
[0060] FIG. 3 depicts an embodiment that does not require the constellation of the transmitted signals to comprise symbols of equal power. (Elements in FIG. 3 that are referenced by numbers that are the same as reference numbers in FIG. 1 are like elements.) In FIG. 3, channel estimator 43 of receiver 40 is responsive to the output signals of maximum likelihood detector 42. Having access to the recovered signals s0and s1, channel estimator 43 forms the estimates
[0061] and applies those estimates to combiner 23 and to detector 42. Detector 24 recovers signals s2and s3by employing the approach used by detector 24 of FIG. 1, except that it does not employ the simplification of equation (9). The recovered signals of detector 42 are fed back to channel estimator 43, which updates the channel estimates in preparation for the next cycle.
[0062] The FIGS. 1-3 embodiments illustrate the principles of this invention for arrangements having two transmit antennas and one receive antenna. However, those principles are broad enough to encompass a plurality of transmit antennas and a plurality of receive antennas. To illustrate, FIG. 4 presents an embodiment where two transmit antennas and two receive antennas are used; to wit, transmit antennas 31 and 32, and receive antennas 51 and 52. The signal received by antenna 51 is applied to channel estimator 53 and to combiner 55, and the signal received by antenna 52 is applied to channel estimator 54 and to combiner 55. Estimates of the channel transfer functions h0and h1are applied by channel estimator 53 to combiner 55 and to maximum likelihood detector 56. Similarly, estimates of the channel transfer functions h2and h3are applied by channel estimator 54 to combiner 55 and to maximum likelihood detector 56. Table 2 defines the channels between the transmit antennas and the receive antennas, and table 3 defines the notion for the received signals at the two receive antennas.
| TABLE 2 | ||
|---|---|---|
| Antenna 51 | Antenna 52 | |
| TABLE 3 | ||
|---|---|---|
| Antenna 51 | Antenna 52 | |
[0063] Based on the above, it can be shown that the received signals are
[0064] where n0,n1,n2, and n3are complex random variable representing receiver thermal noise, interferences, etc.
[0065] In the FIG. 4 arrangement, combiner 55 develops the following two signals that are sent to the maximum likelihood detector:
[0066] {tilde over (s)}0=h0*r0+h1r1*+h2*r2+h3r3*{tilde over (s)}1=h1*r0−h0r1*+h3*r2−h2r3*. (16)
[0067] Substituting the appropriate equations results in
[0068] {tilde over (s)}0=(α02+α12+α22
[0069] +α32)s0+h0*n0+h1n1
[0070] *+h2*n2+h3n3*{tilde over (s)}1
[0071] =(α02+α12+α22
[0072] +α32)s1+h1*n0−h0
[0073] n1*+h3*n2−h2n3*, (17)
[0074] which demonstrates that the signal {tilde over (s)}0and {tilde over (s)}1are indeed estimates of the signals s0and s1. Accordingly, signals {tilde over (s)}0and {tilde over (s)}1are sent to maximum likelihood decoder 56, which uses the decision rule of equation (10) to recover the signals ŝ0and ŝ1.
[0075] As disclosed above, the principles of this invention rely on the transmitter to force a diversity in the signals received by a receiver, and that diversity can be effected in a number of ways. The illustrated embodiments rely on space diversity—effected through a multiplicity of transmitter antennas, and time diversity—effected through use of two time intervals for transmitting the encoded symbols. It should be realized that two different transmission frequencies could be used instead of two time intervals. Such an embodiment would double the transmission speed, but it would also increase the hardware in the receiver, because two different frequencies need to be received and processed simultaneously.
[0076] The above illustrated embodiments are, obviously, merely illustrative implementations of the principles of the invention, and various modifications and enhancements can be introduced by artisans without departing from the spirit and scope of this invention, which is embodied in the following claims. For example, all of the disclosed embodiments are illustrated for a space-time diversity choice, but as explained above, one could choose the space-frequency pair. Such a choice would have a direct effect on the construction of the receivers.
Claims
Post-issuance certificates present
The text shown below may not reflect later post-issuance changes.
We claim:
1. A system for wireless communication, comprising:
a transmitter for transmitting signals and comprising a coder that causes diversity, wherein the signals comprise blocks of symbols, the transmitter comprising at least two transmit antennas, and wherein diversity includes space diversity and one type of diversity chosen from a group comprising time diversity and frequency diversity, and wherein at least some blocks of symbols provided to a transmit antenna include negated and complex conjugated replications of transmitted symbols; and
a receiver that receives diverse signals from the transmitter, wherein the receiver comprises a combiner that combines signals received.
2. The system of claim 1, wherein the receiver comprises a channel estimator developing estimates of transmit channel characteristics based on the received signals.
3. The system of claim 2, wherein the receiver further comprises a maximum likelihood detector that receives the combined signals and recovers the transmitted signals based on a developed maximum likelihood decision.
4. The system of claim 3, wherein:
the combiner and the maximum likelihood detector receive the estimates of transmit channel characteristics from the channel estimator, and wherein
the symbols are symbols carrying equal energy.
5. The system of claim 3, wherein the maximum likelihood detector uses a channel transfer function estimated by the channel estimator to determine a distance for which a relationship between the transmitted signals and the estimated channel characteristics holds.
6. The system of claim 1, wherein the receiver further comprises:
more than one antenna configured to receive the diverse signals from the transmitter; and
more than one channel estimator configured to receive the diverse signals from one of the more than one antennas.
7. A transmitter apparatus for wireless signal transmission, the transmitter receiving incoming signals, wherein the incoming signals are in blocks of symbols; wherein the transmitter comprises:
a coder that encodes the incoming signals, wherein encoding includes negation and complex conjugation of selected symbols; and
multiple antennas, for transmitting the encoded signals, wherein the multiple antennas create space diversity in the transmitted signals, and wherein the transmitter creates a further type of diversity in the transmitted signal chosen from a group comprising time diversity and frequency diversity.
8. The transmitter of claim 7, wherein the incoming signals are in blocks of n symbols, and the multiple antennas comprise n antennas.
9. The transmitter of claim 7, wherein the transmitted symbols have equal energy.
10. The transmitter of claim 7, wherein the incoming signals are in blocks of n symbols, and the multiple antennas comprise n transmitting antenna means, and wherein encoding further includes encoding an incoming block of symbols s0and s1into a sequence of symbols s0and −s1*, and into a sequence of symbols s1and s0*, where si* is the complex conjugate of si.
11. The transmitter of claim 10, wherein the multiple antennas comprise n transmitting antennas, and wherein in response to a sequence {s0,s1,s2,s3,s4* . . . } of incoming symbols the coder develops a sequence {s0,−s1*,s2−,s3*,s4−,s5* . . . } that is applied to a first transmitting antenna, and a sequence {s1,s0*,s3,s2*,s5,s4* . . . } that is applied to a second transmitting antenna, where si* is the complex conjugate of s1.
12. A receiver for wireless communication, comprising:
a combiner that combines signals representing estimates of transmit channel characteristics derived from received non-noise signals, wherein the received non-noise signals are space diverse and either time diverse or frequency diverse, and wherein the received non-noise signals comprise sequences of encoded symbols, and wherein encoding includes negating selected symbols and complex conjugating selected symbols; and
a maximum likelihood detector that receives the combined signals and recovers a transmitted signal using a channel transfer function to determine a distance for which a relationship between the transmitted signal and the estimated channel characteristics holds.
13. The receiver of claim 12, further comprising:
at least one receiving antenna, wherein the at least one receiving antenna receives signals from each one of multiple transmitting antennas; and
at least one channel estimator that generates the estimates of transmit channel characteristics and forwards the estimates to the combiner and to the maximum likelihood detector.
14. The receiver of claim 13, wherein the sequences of encoded symbols comprise a block of symbols s0and s1that have been encoded into a sequence of symbols s0and −s1*, and into a sequence of symbols s1and s0*, where si* is the complex conjugate of s1.
15. The receiver of claim 12, wherein,
the sequences of encoded symbols are received from more than one transmitting antenna, including a first transmitting antenna and a second transmitting antenna, and wherein an encoded sequence {s0,−s1*,s2−,s3*,s4−, s5* . . . } is applied to the first transmitting antenna, and an encoded sequence {s1,s0*,s3,s2*,s5,s4* . . . } is applied to the second transmitting antenna, where si* is the complex conjugate of si.
16. The receiver of claim 12, wherein the sequences of encoded symbols are received from more than one transmitting antenna, and wherein the more than one transmitting antenna includes K transmitting antennas to effect K distinct channels, wherein n*m symbols are distributed to the K antennas over L time intervals, where K=m and L=n or K=n and L=m.
17. The receiver of claim 12, wherein the sequences of encoded symbols are received from more than one transmitting antenna, and wherein the more than one transmitting antenna includes K transmitting antennas to effect K distinct channels, wherein n*m symbols are distributed to the K antennas over L frequencies, where K=m and L=n, or K=n and L=m.
18. The receiver of claim 12, wherein the symbols have equal energy.
19. An electronic circuit for coding communication signals, comprising:
coder circuitry that in response to receiving an incoming block of symbols s0, s1encodes the signals into transmission sequences, including a first transmission sequence and a second transmission sequence;
wherein the first transmission sequence comprises symbols s0and −s1*, and second transmission sequence comprises symbols s1and s0*, where si* is the complex conjugate of si; and
wherein the transmission sequences are routed to be forwarded to at least two transmitting antenna inputs to create space diversity, including a first transmitting antenna routing path and a second transmitting antenna routing path, wherein the first transmission sequence is applied to the first transmitting antenna routing path, and the second transmission sequence is applied to the second transmitting antenna routing path.
20. The electronic circuit of claim 19, wherein the incoming block of symbols includes n symbols, and the at least two transmitting antenna inputs comprise n transmitting antenna inputs.
21. The electronic circuit of claim 19, wherein the at least two transmitting antenna inputs include K transmitting antenna inputs to effect K distinct channels, wherein n times m symbols are to be distributed to K antennas over L time intervals, where K=m and L=n, or K=n and L=m.
22. The electronic circuit of claim 19, wherein the at least two transmitting antenna inputs include K transmitting antenna inputs to effect K distinct channels, wherein n times m symbols are to be distributed to K antennas over L frequencies, where K=m and L=n, or K=n and L=m.
23. The electronic circuit of claim 19, wherein the blocks of symbols comprise symbols of equal energy.
24. An electronic circuit for decoding wireless communication signals, comprising:
a combiner that receives an incoming signal stream representing blocks of encoded symbols, wherein the blocks of symbols have been transmitted by a plurality of spatially diverse antennas, wherein the combiner is configured to combine the received encoded symbols, and wherein the received encoded symbols include negating selected symbols and conjugating selected symbols, and
a maximum likelihood detector that receives the combined encoded symbols and recovers a transmitted signal using a channel transfer function to determine a distance for which a relationship between the transmitted signal and an estimated channel characteristics holds.
25. The electronic circuit of claim 24, further comprising:
at least one channel estimator that generates estimates of transmit channel characteristics and forwards the estimates to the combiner and to the maximum likelihood detector.
26. The electronic circuit of claim 25,
wherein the encoded signals comprise block of symbols s0and s1that have been encoded into a sequence of symbols s0and −s1*, and into a sequence of symbols s1and s0*, where si* is the complex conjugate of s1.
27. The electronic circuit of claim 26 wherein the combiner combines 2×2 blocks of symbols.
28. The electronic circuit of claim 24, further comprising a channel estimator that produces a plurality of channel estimates hn, where each channel estimate corresponds to a channel associated with one of the plurality of spatially diverse antennas, and wherein the maximum likelihood detector determines values based in part on the plurality of channel estimates hn.
29. The electronic circuit of claim 24 wherein the maximum likelihood detector receives from the combiner signals that represent complex values corresponding to symbols transmitted by the plurality of spatially diverse antennas, generates likely values for the transmitted symbols and determines a maximum likely value of the transmitted symbols based on a minimum distance between the likely values and the received signals.
30. A method of receiving signals, comprising:
combining at least two non-noise signals received by an antenna to develop sets of information symbol estimates, wherein the combining is responsive to channel estimates developed for at least two concurrent space diverse paths over which the at least two non-noise signals arrive at the antenna, and wherein the combining develops the sets of information symbol estimates by combining the non-noise signals received by the antenna with the channel estimates via operations that involve multiplications, negations, and conjugations; and
developing maximum likelihood decisions regarding information symbols encoded into channel symbols and embedded in the non-noise signals received by the antenna, wherein the developing is responsive to the sets of information symbol estimates.
31. The method of claim 30 further comprising developing the channel estimates responsive to the signals received by the antenna.
32. The method of claim 31 wherein developing the channel estimates includes developing the channel estimates when the signals received by the antenna contain a known sequence.
33. The method of claim 30 further comprising estimating the channel estimates responsive to the sets of information symbols.
34. The method of claim 30 further comprising estimating and developing the channel estimates responsive to output signals from the step of developing.
35. A receiver comprising:
a combiner responsive to non-noise signals received by an antenna from space-diverse paths and to detected information symbols, for developing sets of information symbol estimates, where the combiner develops the sets of information symbol estimates by combining the non-noise signals received by the antenna with the detected information symbols with operations that involve multiplications, negations, and conjugations; and
a detector responsive to the sets of information symbol estimates that employs maximum likelihood decisions regarding information symbols encoded into channel symbols and embedded in the non-noise signals received by the antenna, to develop thereby the detected information symbols.
36. The receiver of claim 35 where the combiner develops a set of n information symbols from n times m received channel symbols, where m is the number of concurrent paths for which the channel estimator develops channel estimates.
37. A receiver comprising:
a first channel estimator responsive to a first antenna, for developing two space-diverse channel estimates;
a second channel estimator responsive to a second antenna, for developing two space-diverse channel estimates;
a combiner responsive to non-noise signals received by a first antenna and a second antenna and to channel estimates developed by the first and the second channel estimators, for developing sets of information symbol estimates, where the combiner develops the sets of information symbol estimates by combining the non-noise signals received by the antenna with the channel estimates obtained from the first and the second channel estimators, with operations that involve multiplications, negations, and conjugations; and
a detector responsive to the sets of information symbol estimates that develops maximum likelihood decisions regarding information symbols encoded into channel symbols and embedded in the non-noise signals received by the first and second antennas.
Patent Citations (67)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3633107(A) | 1972-01-01 | Brady | Applicant |
| US3978408(A) | 1976-08-01 | Gupta | Applicant |
| US4001692(A) | 1977-01-01 | Fenwick | Applicant |
| US4099121(A) | 1978-07-01 | Fang | Applicant |
| US4369516(A) | 1983-01-01 | Byrns | Applicant |
| US4567464(A) | 1986-01-01 | Siegel | Applicant |
| US4577332(A) | 1986-03-01 | Brenig | Applicant |
| US4675880(A) | 1987-06-01 | Davarian | Applicant |
| US4733402(A) | 1988-03-01 | Monsen | Applicant |
| US4763331(A) | 1988-08-01 | Matsumoto | Applicant |
| US4953183(A) | 1990-08-01 | Bergmans et al. | Applicant |
| US5022053(A) | 1991-06-01 | Chung et al. | Applicant |
| US5029185(A) | 1991-07-01 | Wei | Applicant |
| US5088113(A) | 1992-02-01 | Wei | Applicant |
| US5101501(A) | 1992-03-01 | Gilhousen et al. | Applicant |
| US5109390(A) | 1992-04-01 | Gilhousen et al. | Applicant |
| US5202903(A) | 1993-04-01 | Okanone | Applicant |
| US5283780(A) | 1994-02-01 | Schuchman et al. | Applicant |
| US5305353(A) | 1994-04-01 | Weerackody | Applicant |
| US5319677(A) | 1994-06-01 | Kim | Applicant |
| US5396518(A) | 1995-03-01 | How | Applicant |
| US5416797(A) | 1995-05-01 | Gilhousen et al. | Applicant |
| US5418798(A) | 1995-05-01 | Wei | Applicant |
| US5442627(A) | 1995-08-01 | Viterbi et al. | Applicant |
| US5457712(A) | 1995-10-01 | Weerackody | Applicant |
| US5461646(A) | 1995-10-01 | Anvari | Applicant |
| US5461696(A) | 1995-10-01 | Frank et al. | Applicant |
| US5479448(A) | 1995-12-01 | Seshadri | Applicant |
| US5481572(A) | 1996-01-01 | Sköld et al. | Applicant |
| US5499272(A) | 1996-03-01 | Bottomley | Applicant |
| US5553102(A) | 1996-09-01 | Jasper et al. | Applicant |
| US5675590(A) | 1997-10-01 | Alamouti | Applicant |
| US5790570(A) | 1998-08-01 | Heegard et al. | Applicant |
| US5848103(A) | 1998-12-01 | Weerackody | Applicant |
| US5943372(A) | 1999-08-01 | Gans et al. | Applicant |
| US5949833(A) | 1999-09-01 | Weerackody | Applicant |
| US5960039(A) | 1999-09-01 | Martin et al. | Applicant |
| US5991331(A) | 1999-11-01 | Chennakeshu et al. | Applicant |
| US6034987(A) | 2000-03-01 | Chennakeshu et al. | Applicant |
| US6094465(A) | 2000-07-01 | Stein et al. | Applicant |
| US6115427(A) | 2000-09-01 | Calderbank | Applicant |
| US6144711(A) | 2000-11-01 | Raleigh et al. | Applicant |
| US6185258(B1) | 2001-02-01 | Alamouti et al. | Applicant |
| US6188736(B1) | 2001-02-01 | Lo et al. | Applicant |
| US6393074(B1) | 2002-05-01 | Mandyam et al. | Applicant |
| US6470043(B1) | 2002-10-01 | Lo et al. | Applicant |
| US6501803(B1) | 2002-12-01 | Alamouti et al. | Applicant |
| US6549585(B2) | 2003-04-01 | Naguib et al. | Examiner |
| CA2252664 | 1997-11-01 | Applicant | |
| CA2302289 | 1998-03-01 | Applicant | |
| CA2276207 | 2003-02-01 | Applicant | |
| DE29824760(U1) | 2002-06-01 | Applicant | |
| DE29824761(U1) | 2002-06-01 | Applicant | |
| DE29824762(U1) | 2002-06-01 | Applicant | |
| DE29824763(U1) | 2002-06-01 | Applicant | |
| DE29824765(U1) | 2002-06-01 | Applicant | |
| EP767546(A2) | 1997-09-01 | Applicant | |
| EP1016228(B1) | 2003-06-01 | Applicant | |
| GB2280575(A) | 1995-02-01 | Applicant | |
| GB2290010(A) | 1995-12-01 | Applicant | |
| GB2311445(A) | 1997-09-01 | Applicant | |
| WO91/20142(A1) | 1991-12-01 | Applicant | |
| WO95/22214(A1) | 1995-08-01 | Applicant | |
| WO97/24849(A) | 1997-07-01 | Applicant | |
| WO97/41670(A) | 1997-11-01 | Applicant | |
| WO98/09385 | 1998-03-01 | Applicant | |
| WO99/14871 | 1999-03-01 | Applicant |
Non-Patent Literature (27)
- U.S. patent application Ser. No. 60/059,016, filed Sep. 16, 1997.Applicant
- U.S. patent application Ser. No. 60/059,219, filed Sep. 18, 1997.Applicant
- U.S. patent application Ser. No. 60/063,780, filed Oct. 31, 1997.Applicant
- Alamouti, Siavash M., “A Simple Transmit Diversity Technique for Wireless Communications,” IEEE Journal on Select Areas in Communications, Oct. 1998, pp. 1451-1458, vol. 16, No. 8, The Institute of Electrical and Electronics Engineers, Inc., New York, NY.Applicant
- Cavers, James K., “An Analysis of Pilot Symbol Assisted Modulation for Rayleigh Fading Channels,” IEEE Transactions on Vehicular Technology, Nov. 1991, pp. 686-693, vol. 40, No. 4, The Institute of Electrical and Electronics Engineers, Inc., New York, NY.Applicant
- Naguib, Ayman et al., “A Space-Time Coding Modem for High-Data-Rate Wireless Communications,” IEEE Journal On Selected Areas in Communications, Oct. 1998, pp. 1459-1478, The Institute of Electrical and Electronics Engineers, Inc., New York, NY.Applicant
- Sampei, Seiichi et al., “Rayleigh Fading Compensation Method for 16QAM in Digital Land Mobile Radio Channels,” Proceedings of the 1989 IEEE Vehicular Technology Conference, May 1989, pp. 640-646, The Institute of Electrical and Electronics Engineers, Inc., New York, NY.Applicant
- Seshadri, N. et al., “Two Signalling Schemes for Improving the Error Performance of FDD Transmission Systems Using Transmitter Antenna Diversity,” Proceeding of the 1993 IEEE Vehicular Technology Conference (VTC 43rd), May 1993, pp. 508-511, The Institute of Electrical and Electronics Engineers, Inc., New York, NY.Applicant
- Tarokh, Vahid et al., “Combined Array Processing and Space-Time Coding,” IEEE Transactions on Information Theory, May 1999, pp. 1121-1128, vol. 45, No. 4, The Institute of Electrical and Electronics Engineers, Inc., New York, NY.Applicant
- Tarokh, Vahid et al., “Space-Time Codes for High Data Rate Wireless Communication: Performance Criterion and Code Construction,” IEEE Transactions on Information Theory, Mar. 1998, pp. 744-765, vol. 44, No. 2, The Institute of Electrical and Electronics Engineers, Inc., New York, NY.Applicant
- Ungerboeck, Gottfried, “Channel Coding with Multilevel/Phase Signals,” IEEE Transactions on Information Theory, Jan. 1982, pp. 55-67, vol. IT-28, No. 1, The Institute of Electrical and Electronics Engineers, Inc., New York, NY.Applicant
- Winters, J.H., “The Diversity Gain of Transmit Diversity in Wireless Systems with Rayleigh Fading,” Proceeding of the 1994 ICC/SUPERCOMM, New Orleans, May 1994, vol. 2, pp. 1121-1125, The Institute of Electrical and Electronics Engineers, Inc., New York, NY.Applicant
- Wittneben, A. “A New Bandwidth Efficient Transmit Antenna Modulation Diversity Scheme For Linear Digital Modulation,” Proceedings of the 1993 IEEE International Conference on Communications (IICC '93), May 1993, pp. 1630-1634, The Institute of Electrical and Electronics Engineers, Inc., New York, NY.Applicant
- Wittneben, A. “Basestation modulation diversity for digital SIMULCAST,” Proceedings of the 1991 IEEE Vehicular Technology Conference, May 1991, pp. 848-853, The Institute of Electrical and Electronics Engineers, Inc., New York, NY.Applicant
- Blanco, M.A. & Zdunek, K., “Performance and Optimization of Switched Diversity Systems for the Detection of Signals with Rayleigh Fading,” IEEE Transactions on Communications, 27(12):1887-1895, (Dec. 1979).Applicant
- Blanco, M.A. & Zdunek; K., “On the Optimization of Simple Switched Diversity Receivers,” 1978 IEEE Conference on Communications and Power, Montreal, Canada, pp. 114-117, (1978).Applicant
- Foschini, G.J. and GANS, M.J., “On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas,” Wireless Personal Communications 6:311-335, (1998).Applicant
- Foschini, G.J., “Layered Space-Time Architecture for Wireless Communication in a Fading Environment when Using Multi-Element Antennas”, Bell Technical Labs Journal, pp. 41-59, (1996).Applicant
- Hinderling, J. et al., “CDMA Mobile Station Modem ASIC,” IEEE 1992 Custom Integrated Circuits Conference pp. 10.2.1-10.2.5, (1992).Applicant
- Kerr, R. et al., “The CDMA Digital Cellular System: An ASIC Overview,” IEEE 1992 Custom Integrated Circuits Conference pp. 10.1.1-10.1.7, (1992).Applicant
- Pickholtz, R.L. et al., “Theory of Spread Spectrum Communications—A Tutorial,” IEEE Transactions on Communications, 30(5):855-884, (1982).Applicant
- Seshadri, N. et al., “Advanced Techniques for Modulation, Error Correction, Channel Equalization and Diversity,” AT&T Tech. Journal 47(4): 48-63, Jul. 1993.Applicant
- Seshadri, N. et al., “Space-Time Codes for Wireless Communication: Code Construction,” IEEE 47th Vehicular Technology Cont., Phoenix, pp. 637-641, May 1997.Applicant
- Tarokh, V. et al., “Space Time Codes for High Data Rate Wireless Communication: Performance Criteria in the Presence of Channel Estimation Errors, Mobility, and Multiple Paths”, IEEE Transactions on Communications 47(2):199-207, (1999).Applicant
- Tarokh, V., et al., “Space-Time Codes for High Data Rate Wireless Communication: Performance Criteria,” IEEE International Conference on Communications, Montreal, 1:299-303, Jun. 1997.Applicant
- Weerackody, V., “Diversity for the Direct-Sequence Spread Spectrum System Using Multiple Transmit Antennas,” Proceedings of the IEEE International Conference on Communications, May 23-26, 1993, Geneva, vol. 3, pp. 1775-1779.Applicant
- Winters, J.H., Salz, J., Gitlin, R.D., “The Impact of Antenna Diversity on the Capacity of Wireless Communications Systems,” IEEE Transactions on Communications, vol. 42, No. 2, Feb./Mar./Apr. 1994, pp. 1740-1751, IEEE Communications Society, New York.Applicant