Low complexity maximum likelihood detection of concatenated space codes for wireless applications

Information

  • Patent Grant
  • 8351545
  • Patent Number
    8,351,545
  • Date Filed
    Wednesday, December 30, 2009
    14 years ago
  • Date Issued
    Tuesday, January 8, 2013
    11 years ago
Abstract
Good transmission characteristics are achieved in the presence of fading with a transmitter that employs a trellis coder followed by a block coder. Correspondingly, the receiver comprises a Viterbi decoder followed by a block decoder. Advantageously, the block coder and decoder employ time-space diversity coding which, illustratively, employs two transmitter antennas and one receiver antenna.
Description
BACKGROUND OF THE INVENTION

This invention relates to wireless communication and, more particularly, to techniques for effective wireless communication in the presence of fading and other degradations.


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.


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).


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.


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


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 41st), 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.


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 the 1993 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 the 1994 ICC/SUPERCOMM, New Orleans, Vol. 2, PP, 1121-1125, May 1994.


Still another interesting approach is disclosed by Tarokh, Seshadri, Calderbank and Naguib in U.S. application, Ser. No. 08/847,635, 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.


Yet another approach is disclosed by Alamouti and Tarokh in U.S. application Ser. No. 09/074,224, filed May 5, 1998, and titled “Transmitter Diversity Technique for Wireless Communications” where symbols are encoded using only negations and conjugations, and transmitted in a manner that employs channel diversity.


Still another approach is disclosed by the last-mentioned inventors in a US application filed Jul. 14, 1998, based on provisional application 60/052,689 filed Jul. 17, 1997, titled “Combined Array Processing and Space-Time Coding” where symbols are divided into groups, where each group is transmitted over a separate group of antennas and is encoded with a group code C that is a member of a product code.


SUMMARY

An advance in the art is realized with a transmitter that employs a trellis coder followed by a block coder. Correspondingly, the receiver comprises a Viterbi decoder followed by a block decoder. Advantageously, the block coder and decoder employ time-space diversity coding which, illustratively, employs two transmitter antennas and one receiver antenna.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 presents a block diagram of an embodiment in conformance with the principles of this invention.





DETAILED DESCRIPTION


FIG. 1 presents a block diagram of an arrangement comporting with the principles of this invention. It comprises a trellis code modulation (TCM) encoder 10 followed by a two-branch space block encoder 20. The output is applied to antenna circuitry 30, which feeds antenna 31, and antenna 32. FIG. 1 shows only two antennas, but this is merely to illustrative. Arrangements can be had with a larger number of antennas, and it should be understood that the principles disclosed herein apply with equal advantage to such arrangements.


TCM encoder 10 generates complex numbers that represent constellation symbols, and block encoder 20 encodes (adjacent) pairs of symbols in the manner described in the aforementioned Ser. No. 09/074,224 application. That is, symbols s0 and s1, forming a pair, are sent to antenna 31 and antenna 32, respectively, and in the following time period symbols—s1* and s0* are sent to antennas 31 and 32, respectively. Thereafter, symbols s2 and s3 are sent to antenna 31 and 32, respectively, etc. Thus, encoder 20 creates channel diversity that results from signals traversing from the transmitter to the receiver at different times and over different channels.


The signals transmitted by antennas 31 and 32 are received by a receiver after traversing the airlink and suffering a multiplicative distortion and additive noise. Hence, the received signals at the two consecutive time intervals during which the signals s0, S1, −s1*, and s0* are sent correspond to:

r0(t)=h0s0+h1s1+n0,  (1)
and r1(t)=h1s0*−h0s1*+n1,  (2)

where h0 represents the channel from antenna 31, h1 represents the channel from antenna 32, n0 is the received noise at the first time interval, and n1 is the received noise at the second time interval.


The receiver comprises a receive antenna 40, a two-branch space block combiner 50, and a Viterbi decoder 60. The receiver also includes a channel estimator; but since that is perfectly conventional and does not form a part of the invention, FIG. 1 does not explicitly show it. The following assumes that the receiver possesses {tilde over (h)}0 and {tilde over (h)}1, which are estimates of h0 and h1, respectively. Thus, the received signals at the first and second time intervals are combined in element 50 to form signals

{tilde over (s)}0={tilde over (h)}0*r0*+{tilde over (h)}1r1*  (3)
and {tilde over (s)}1={tilde over (h)}1*r0−{tilde over (h)}0r1*,  (4)

and those signals are applied to Viterbi decoder 60.


The Viterbi decoder builds the following metric for the hypothesized branch symbol si corresponding to the first transmitted symbol s0:

M(s0,si)=d2[{tilde over (s)}0,(|{tilde over (h)}0|2+|{tilde over (h)}1|2)si].  (5)

Similarly, the Viterbi decoder builds the following metric for the hypothesized branch symbol si corresponding to the first transmitted symbol s1:

M(s1,si)=d2[{tilde over (s)}1,(|{tilde over (h)}0|2+|{tilde over (h)}1|2)si].  (6)

(Additional metrics are similarly constructed in arrangements that employ a larger number of antennas and a correspondingly larger constellation of signals transmitted at any one time.) If Trellis encoder 10 is a multiple TCM encoder, then the Viterbi decoder builds the following metric:

M[(s0,s1),(si,sj)]=M(s0,si)+M(s1,sj).  (7)
or equivalently,
M[(s0,s1),(si,sj)]=d2(r0,{tilde over (h)}0si+{tilde over (h)}1sj)+d2(r1,{tilde over (h)}1si*−{tilde over (h)}0sj*).  (8)

The Viterbi decoder outputs estimates of the transmitted sequence of signals.


The above presented an illustrative embodiment. However, it should be understood that various modifications and alternations might be made by a skilled artisan without departing from the spirit and scope of this invention.

Claims
  • 1. An apparatus comprising: a trellis encoder, wherein the trellis encoder generates a first symbol and a second symbol; anda block encoder responsive to the trellis encoder and adapted to feed a plurality of antennas, wherein the block encoder generates a block including the first symbol, the second symbol, a third symbol generated using a negative complex conjugation of the second symbol, and a fourth symbol generated using a complex conjugation of the first symbol.
  • 2. The apparatus as recited in claim 1 further comprising the plurality of antennas.
  • 3. In a transmitter, a method for linking trellis codes with block codes, the method comprising: trellis encoding received data to generate a first symbol and a second symbol;block encoding the first and second symbols to generate a block of symbols that includes the first and second symbols, the block encoding including generating a third symbol for the block of symbols using a negative complex conjugation of the second symbol, and generating a fourth symbol for the block of symbols using a complex conjugation of the first symbol; andsupplying the block of symbols for transmission over a plurality of antennas.
  • 4. The method as recited in claim 3 wherein the plurality of antennas comprises a first and a second antenna.
  • 5. The method as recited in claim 3 further comprising transmitting the block of symbols over the first and the second antenna by transmitting the first and second symbols over the first and second antennas, respectively, during a first time period, and transmitting the third and fourth symbols over the first and second antennas, respectively, during a second time period.
  • 6. A receiver comprising: a receive antenna;a space block combiner configured to combine signals transmitted from at least a first and a second transmit antenna and received at the receive antenna at a first and second time interval, the received signals including a first signal received at the first time interval, the first signal including a first symbol and a second symbol transmitted from the first and second transmit antennas, respectively, and the received signals including a second signal received at the second time interval, the second signal including a negative complex conjugate of the second symbol and a complex conjugate of the first symbol, transmitted from the first and second transmit antennas, respectively; anda Viterbi decoder responsive to output signals of the space block combiner to output estimates of transmitted symbols.
  • 7. The receiver as recited in claim 6 wherein the space block combiner combines a frame of received symbols, wherein the frame comprises m symbols received over each of the first and second time intervals.
  • 8. The receiver as recited in claim 7 wherein m=2.
  • 9. The receiver as recited in claim 6 wherein received signals r0 and r1 received over the first and second time intervals by the receive antenna, respectively, are r0(t)=h0s0+h1s1+n0 and r1(t)=h1s0*−h0s1*+n1, where h0 represents characteristics of a first channel from a first transmit antenna to the receive antenna, h1 represents characteristics of a second channel from a second transmit antenna to the receive antenna, n0 is the received noise at the first time interval, and n1 is the received noise at the second time interval, s0 and s1 are the first and second symbols respectively transmitted from the first and second transmit antennas and −s1* and so* are the negative complex conjugate and the complex conjugate respectively transmitted from the first and second transmit antennas.
  • 10. The receiver as recited in claim 9 wherein the combiner generates signals {tilde over (s)}0={tilde over (h)}0*r0+{tilde over (h)}1r1* and {tilde over (s)}1={tilde over (h)}1* r0−{tilde over (h)}0r1*, where {tilde over (h)}0 and {tilde over (h)}1 are estimates of h0 and h1, respectively.
  • 11. The receiver as recited in claim 9 wherein the Viterbi decoder develops a metric M(s0,si)=d2[{tilde over (s)}0,(|{tilde over (h)}0|2+|{tilde over (h)}1|2)si] for the hypothesized branch symbol si corresponding to the symbol s0, where {tilde over (h)}0 {tilde over (h)}1 are estimates of h0 and h1, respectively and d2 represents the squared Euclidean distance.
  • 12. The receiver as recited in claim 6 wherein the Viterbi decoder builds a metric M[(s0,s1),(si,sj)]=d2(r0, {tilde over (h)}0si+{tilde over (h)}1sj)+d2(r1{tilde over (h)}1si*−{tilde over (h)}0sj*), wherein si is a hypothesized signal at the first time interval, Sj is a hypothesized signal at the second time interval, s0 is a transmitted symbol at the first time interval, sj is a transmitted symbol at the second time interval, where {tilde over (h)}0 is an estimate of channel characteristics between the first transmit antenna that transmits symbol s0 and the receive antenna, and {tilde over (h)}1 is an estimate of channel characteristics between the second transmit antenna that transmits symbol s1 and the receive antenna, where d2 represents the squared Euclidean distance, r0 is the signal received at the first time interval and r1 is the signal received at the second time interval.
CROSS-REFERENCE TO RELATED APPLICATION(S)

This application is a continuation of U.S. patent application Ser. No. 11/018,780, filed Dec. 21, 2004, which is a continuation of U.S. patent application Ser. No. 10/334,343, filed Dec. 30, 2002 (now U.S. Pat. No. 6,853,688), which is a continuation of U.S. patent application Ser. No. 10/005,095, filed Dec. 3, 2001 (now U.S. Pat. No. 6,807,240), which is a divisional of U.S. patent application Ser. No. 09/167,422, filed Oct. 5, 1998 (now U.S. Pat. No. 6,501,803), which claims the benefit of U.S. Provisional Application No. 60/063,794, filed Oct. 31, 1997, all of which are incorporated herein by reference in their entirety.

US Referenced Citations (119)
Number Name Date Kind
3633107 Brady Jan 1972 A
3978408 Gupta et al. Aug 1976 A
4001692 Fenwick et al. Jan 1977 A
4099121 Fang Jul 1978 A
4281411 Bonn et al. Jul 1981 A
4369516 Byrns Jan 1983 A
4567464 Siegel Jan 1986 A
4577332 Brenig Mar 1986 A
4675880 Davarian Jun 1987 A
4733402 Monsen Mar 1988 A
4763331 Matsumoto Aug 1988 A
4953183 Bergmans et al. Aug 1990 A
5022053 Chung et al. Jun 1991 A
5029185 Wei Jul 1991 A
5088113 Wei Feb 1992 A
5101501 Gilhousen et al. Mar 1992 A
5109390 Gilhousen et al. Apr 1992 A
5127025 Okanoue Jun 1992 A
5170413 Hess et al. Dec 1992 A
5202903 Okanoue Apr 1993 A
5283780 Schuchman et al. Feb 1994 A
5305353 Weerackody Apr 1994 A
5319677 Kim Jun 1994 A
5369412 Tsujimoto Nov 1994 A
5396518 How Mar 1995 A
5416797 Gilhousen et al. May 1995 A
5418798 Wei May 1995 A
5442627 Viterbi et al. Aug 1995 A
5457712 Weerackody Oct 1995 A
5461646 Anvari Oct 1995 A
5461696 Frank et al. Oct 1995 A
5467374 Chennakeshu et al. Nov 1995 A
5479448 Seshadri Dec 1995 A
5481572 Skold et al. Jan 1996 A
5487091 Jasper et al. Jan 1996 A
5499272 Bottomley Mar 1996 A
5524125 Tsujimoto Jun 1996 A
5553102 Jasper et al. Sep 1996 A
5613219 Vogel et al. Mar 1997 A
5619533 Dent Apr 1997 A
5675590 Alamouti Oct 1997 A
5680419 Bottomley Oct 1997 A
5781845 Dybdal et al. Jul 1998 A
5787131 Bottomley Jul 1998 A
5790570 Heegard et al. Aug 1998 A
5790598 Moreland et al. Aug 1998 A
5819168 Golden et al. Oct 1998 A
5822380 Bottomley Oct 1998 A
5838728 Alamouti et al. Nov 1998 A
5838742 AbuDayya Nov 1998 A
5848103 Weerackody Dec 1998 A
5859870 Tsujimoto Jan 1999 A
5859879 Bolgiano et al. Jan 1999 A
5924034 Dupuy Jul 1999 A
5933421 Alamouti et al. Aug 1999 A
5943372 Gans et al. Aug 1999 A
5949833 Weerackody Sep 1999 A
5960039 Martin et al. Sep 1999 A
5991273 Abu-Dayya Nov 1999 A
5991331 Chennakeshu et al. Nov 1999 A
5999826 Whinnett Dec 1999 A
6031474 Kay et al. Feb 2000 A
6034987 Chennakeshu et al. Mar 2000 A
6038263 Kotzin et al. Mar 2000 A
6038272 Golden et al. Mar 2000 A
6044120 Bar-David et al. Mar 2000 A
6067324 Harrison May 2000 A
6081566 Molnar et al. Jun 2000 A
6088408 Calderbank et al. Jul 2000 A
6094465 Stein et al. Jul 2000 A
6097771 Foschini Aug 2000 A
6101399 Raleigh et al. Aug 2000 A
6115427 Calderbank Sep 2000 A
6128355 Backman et al. Oct 2000 A
6137843 Chennakeshu et al. Oct 2000 A
6144711 Raleigh et al. Nov 2000 A
6144771 Li et al. Nov 2000 A
6154485 Harrison Nov 2000 A
6173005 Kotzin et al. Jan 2001 B1
6178196 Naguib et al. Jan 2001 B1
6185258 Alamouti et al. Feb 2001 B1
6185266 Kuchi et al. Feb 2001 B1
6188736 Lo et al. Feb 2001 B1
6192256 Whinnett Feb 2001 B1
6298082 Harrison Oct 2001 B1
6304581 Chen et al. Oct 2001 B1
6317411 Whinnett et al. Nov 2001 B1
6317466 Foschini et al. Nov 2001 B1
6327299 Meszko Dec 2001 B1
6333953 Bottomley et al. Dec 2001 B1
6377631 Raleigh Apr 2002 B1
6377812 Rashid-Farrokhi et al. Apr 2002 B1
6393074 Mandyam et al. May 2002 B1
6411257 Sorelius et al. Jun 2002 B1
6411612 Halford et al. Jun 2002 B1
RE37802 Fattouche et al. Jul 2002 E
6430231 Calderbank Aug 2002 B1
6452981 Raleigh et al. Sep 2002 B1
6470043 Lo et al. Oct 2002 B1
6501803 Alamouti et al. Dec 2002 B1
6542556 Kuchi et al. Apr 2003 B1
6549585 Naguib et al. Apr 2003 B2
6728307 Derryberry et al. Apr 2004 B1
6741635 Lo et al. May 2004 B2
6775329 Alamouti et al. Aug 2004 B2
6807240 Alamouti et al. Oct 2004 B2
6853688 Alamouti et al. Feb 2005 B2
6888899 Raleigh et al. May 2005 B2
7120200 Alamouti et al. Oct 2006 B2
7145971 Raleigh et al. Dec 2006 B2
7203249 Raleigh et al. Apr 2007 B2
7386077 Alamouti et al. Jun 2008 B2
7587007 Alamouti et al. Sep 2009 B2
7643568 Alamouti et al. Jan 2010 B2
7916806 Alamouti et al. Mar 2011 B2
20040157646 Raleigh et al. Aug 2004 A1
20050157810 Raleigh et al. Jul 2005 A1
20100091906 Raleigh et al. Apr 2010 A1
20110170635 Alamouti et al. Jul 2011 A1
Foreign Referenced Citations (35)
Number Date Country
2203903 May 1996 CA
2252664 Nov 1997 CA
2302289 Mar 1998 CA
2276207 Feb 2003 CA
29824760 UI Jun 2002 DE
29824761 UI Jun 2002 DE
29824762 UI Jun 2002 DE
29824763 UI Jun 2002 DE
29824765 Jun 2002 DE
0392723 Oct 1990 EP
0396101 Nov 1990 EP
0631399 Dec 1994 EP
0767546 Apr 1997 EP
1016228 Jul 2000 EP
2237706 May 1991 GB
2280575 (A) Feb 1995 GB
2290010 (A) Dec 1995 GB
2311445 (A) Sep 1997 GB
63286027 Nov 1988 JP
WO 9120142 Dec 1991 WO
WO 9522214 Aug 1995 WO
WO 9724849 Jul 1997 WO
WO 9741670 Nov 1997 WO
WO 9809385 Mar 1998 WO
WO 9914871 Mar 1999 WO
WO 9923766 May 1999 WO
WO 0011806 Mar 2000 WO
WO 0018056 Mar 2000 WO
WO 0049780 Aug 2000 WO
WO 0051265 Aug 2000 WO
WO 0119013 Mar 2001 WO
WO 0154305 Jul 2001 WO
WO 0156218 Aug 2001 WO
WO 0163826 Aug 2001 WO
WO 0169814 Sep 2001 WO
Related Publications (1)
Number Date Country
20100119006 A1 May 2010 US
Provisional Applications (1)
Number Date Country
60063794 Oct 1997 US
Divisions (1)
Number Date Country
Parent 09167422 Oct 1998 US
Child 10005095 US
Continuations (3)
Number Date Country
Parent 11018780 Dec 2004 US
Child 12650007 US
Parent 10334343 Dec 2002 US
Child 11018780 US
Parent 10005095 Dec 2001 US
Child 10334343 US