US 6,741,635 B2Grant

Near-optimal low-complexity decoding of space-time codes for fixed wireless applications

Issue Date:2004-05-25

•11 Claims

•2 Drawing Sheets

Abstract

An improved multi-antenna receiver is realized for detecting signals transmitted by a multi-antenna transmitter by summing signals received at the plurality of receiver antennas after multiplying each by a respective constant. The summed signal is applied to a maximum likelihood detector. The respective constants, λ_j, where j is an index designating a particular receiver antenna, are determined by evaluating the largest eigenvector of the matrix A, where Λ is a vector containing the values λ_j, and A is a matrix containing elements α_ij, which is the transfer function between the i^thtransmitter antenna to the j^threceiver antenna. The α_ijterms are determined in the receiver in conventional ways.

Metadata

Assignee

AT&T Wireless Services, Inc.

Inventors

Titus Lo
Vahid Tarokh

Application Information

Application Number:US 10/234,407

Filing Date:2002-09-03

Priority Date:1997-12-23

Art Unit:7

Classifications

IPC:

H04B 1707H04B 702

Field of Search:

375144375148375147375267375299375346375347

Patent Drawings (2 sheets)

Description

[0002] This application is a continuation of U.S. patent application Ser. No. 09/690,542, filed Oct. 17, 2000 (now U.S. Pat. No. 6,470,043), which is a continuation of U.S. patent application Ser. No. 09/063,675, filed Apr. 21, 1998 (now U.S. Pat. No. 6,188,736), which claims the benefit of U.S. Provisional Application No. 60/068,613, filed Dec. 23, 1999.

Background of the Invention

[0003] This invention relates to wireless systems and, more particularly, to systems having more than one antenna at the receiver and at the transmitter.

[0004] Physical constraints as well as narrow bandwidth, co-channel interference, adjacent channel interference, propagation loss and multi-path fading limit the capacity of cellular systems. These are severe impairments, which liken the wireless channel to a narrow pipe that impedes the flow of data. Nevertheless, interest in providing high speed wireless data services is rapidly increasing. Current cellular standards such as IS-136 can only provide data rates up to 9.6 kbps, using 30 kHz narrowband channels. In order to provide wideband services, such as multimedia, video conferencing, simultaneous voice and data, etc., it is desirable to have data rates in the range of 64-144 kbps.

[0005] Transmission schemes for multiple antenna systems may be part of a solution to the problem of the currently available low data rates. Such schemes were first proposed in papers by Wittneben, and by Seshadri and Winters, where the problem was addressed in the context of signal processing.

[0006] One prior art arrangement having a single transmitter antenna and multiple receiver antennas is shown in FIG. 1. Each of the receiver antennas receives the transmitted signal via a slightly different channel, where each channel i is characterized by transfer function α_i. Using an approach known as “Maximum Ratio Combining”, the prior art approach to detection contemplates multiplying each received signal that had been influenced by α_iby the complex conjugate signal, α_i*, summed, and then processed.

[0007] In a co-pending application titled “Method and Apparatus for Data Transmission Using Space-Time Codes and Multiple Transmit Antennas”, filed on May 6, 1997, bearing the Serial No. 08/847,635, and assigned to the assignee of this invention, a coding perspective was adopted to propose space-time coding using multiple transmit and receive antennas. Space-time coding integrates channel coding, modulation, and multiple transmit antennas to achieve higher data rates, while simultaneously providing diversity that combats fading. It may be demonstrated that adding channel coding provides significant gains over the schemes of Wittneben and Seshadri and Winters. In said co-pending application, space-time codes were designed for transmission using 2-4 transmit antennas. These codes perform extremely well in slowly varying fading environments (such as indoor transmission media). The codes have user bandwidth efficiencies of up to 4 bits/sec/Hz which are about 3-4 times the efficiency of current systems. Indeed, it can be shown that the designed codes are optimal in terms of the trade-off between diversity advantage, transmission rate, decoding complexity and constellation size.

[0008] It can also be shown that as the number of antennas is increased, the gain increases in a manner that is not unlike a multi-element antenna that is tuned to, say, a particular direction. Unfortunately, however, when maximum likelihood detection is employed at the receiver, the decoding complexity increases when the number of transmit and receive antennas is increased. It would be obviously advantageous to allow a slightly sub-optimal detection approach that substantially reduces the receiver's computation burden.

Summary

[0009] Such an approach is achieved with a receiver arrangement where signals received at a plurality of antennas are each multiplied by a respective constant and then summed prior to being applied to a maximum likelihood detector. The respective constants, λ_j, where j is an index designating a particular receiver antenna, are derived from a processor that determines the largest eigenvector of the matrix A, where Λ is a vector containing the values λ_j, and A is a matrix containing elements α_ij, which is the transfer function between the i^thtransmitter antenna to the j^threceiver antenna. The α_ijterms are determined in the receiver in conventional ways.

Brief Description of the Drawing

[0010] FIG. 1 presents a block diagram of Maximal Ratio Combining detection; and

[0011] FIG. 2 presents a block diagram of an embodiment including a transmitter having a plurality of antennas, and a receiver having a plurality of antennas coupled to an efficient detection structure.

Detailed Description

[0012] FIG. 2 presents a block diagram of a receiver in accord with an embodiment of the invention. It includes a transmitter 10 that has an n plurality of transmitting antenna 1, 2, 3, 4, and a receiver 20 that has an m plurality of receiver antennas 21, 22, 23, 24. The signals received by the receiver's antennas are multiplied in elements 25, 26, 27, and 28 and summed in adder 30. More specifically, the received signal of antenna j is multiplied by a value, λ_j, and summed. The collection of factors λ_jcan be viewed as a vector Λ. The outputs of the receiver antennas are also applied to processor 40 which, employing conventional techniques, determines the transfer functions α_ijfor i =1,2,3, . . . , n and j=1, 2,3, . . . , m. These transfer functions can be evaluated, for example, through the use of training sequences that are sent by the different transmitter antennas, one antenna at a time.

[0013] The evaluated α_ijsignals of processor 40 are applied to processor 45 in FIG. 2 where the multiplier signals λ_j, j=1,2,3, . . . , m are computed. Processor 45 also evaluates a set of combined transfer function values Y_i, j=1,2,3 , . . . , n (which are described in more detail below). Signals _iof processor 45 and the output signal of adder 30 are applied to detector 50 which detects the transmitted symbols in accordance with calculations disclosed below.

[0014] It is assumed that the symbols transmitted by the antennas of transmitter 10 have been encoded in blocks of L time frames, and that fading is constant within a frame. A codeword comprises all of the symbols transmitted within a frame, and it corresponds, therefore, to

[0015] c₁¹c₁²c₁³. . . c₁⁴c₂¹c₂²c₂³. . . c₂⁴c₃¹c₃²c₃³. . . c₃⁴. . . c_m¹c_m²c_m³. . . c_m⁴, (1)

[0016] where the superscript designates the transmitter's antennas and the subscript designates the time of transmission (or position within a frame).

[0017] From the standpoint of a single antenna, e.g., antenna 1, the signal that is received at antenna 1 in response to a transmitted symbol c₁¹at time interval t is:

\begin{matrix} \begin{matrix} R_{t} = c_{t}^{1} (α_{11} λ_{1} + α_{12} λ_{2} + α_{13} λ_{3} + \dots + α_{1 m} λ_{m}) \\ = c_{t}^{1} \sum_{j = 1}^{m} λ_{j} α_{1 j} \\ = c_{t}^{1} γ_{1} \end{matrix} & (2) \end{matrix}

[0018] (when noise is ignored). If each λ_jvalue is set to α*_ij, (where α*_ijis the complex conjugate of α_ij) then the received signal would simply be

\begin{matrix} R_{t} = c_{t}^{1} \sum_{j = 1}^{m} | α_{1 j} |^{2} & (3) \end{matrix}

[0019] yielding a constructive addition.

[0020] Of course, the value of λ_jcannot be set to match α*_ijand concurrently to match the value of α_ijwhere i≠1 ; and therein lies the difficulty

[0021] When all n of the transmitting antennas are considered, then the received signal is

\begin{matrix} \begin{matrix} R_{t} = \sum_{i = 1}^{n} (c_{t}^{i} \sum_{j = 1}^{m} λ_{j} α_{ij}) \\ = \sum_{i = 1}^{n} c_{t}^{i} γ_{i} \end{matrix} & (4) \end{matrix}

[0022] In accordance with the present disclosure, the objective is to maximize

\sum_{i = 1}^{n} | γ_{i} |^{2}

[0023] because by doing so, signal R₁contains as much information about c₁ⁱ, i=1, 2, 3, . . . n as is possible. However, it can be easily shown that if a matrix A is constructed such that

\begin{matrix} A = \sum_{i = 1}^{n} {(Ω_{i}^{*})}^{T} Ω_{i}, & (5) \end{matrix}

[0024] where Ω₁=(α_i1, α_i2, α_i3. . . α_im), then

\begin{matrix} \sum_{i = 1}^{n} | γ_{i} |^{2} = Λ {A (Λ^{*})}^{T} . & (6) \end{matrix}

[0025] The receiver, thus, has to maximize ΛA(Λ*)^T, subject to the constraint ∥Λ∥²=1. The solution to this problem is to choose Λ to be the eigenvector of A which corresponds to the maximum eigenvalue of A. Accordingly, processor 45 develops the matrix A from the values of α_ij, finds the eigenvalues of A in a conventional manner, selects the maximum eigenvalue of A, and creates the vector Λ. Once Λ is known, processor 45 develops signals γ_ifor 1=1,2,3, . . . , n, (where

(where γ_{i} = \sum_{j = 1}^{m} λ_{j} a_{ij}),

[0026] and applies them to detector 50. Finally, detector 50 minimizes the metric

\sum_{t = 1}^{L} | R_{t} - \sum_{i = 1}^{n} γ_{i} c_{t}^{i} |^{2}

[0027] from amongst all possible codewords in a conventional manner. As can be seen, this approach reduces the complexity of decoding by almost a factor of m.

[0028] FIG. 2 depicts separate multipliers to multiply received signals by multiplication factors λ_i, and it depicts separate blocks for elements 30,40,45, and 50. It should be understood, however, that different embodiments are also possible. For example, it is quite conventional to incorporate all of the above-mentioned elements in a single special purpose processor, or in a single stored program controlled processor (or a small number of processors). Other modifications and improvements may also be incorporated, without departing from the spirit and scope of the invention, which is defined in the following claims.

Claims

We claim:

1. A data signal for use in a wireless receiver, wherein the wireless receiver forms part of a wireless system having a wireless transmitter, the data signal comprising:

a sum signal corresponding to an addition of received signals,

wherein each received signal is received by one of multiple receiver antennas associated with the wireless receiver,

wherein each received signal is pre-multiplied by a selected value associated with a selected one of the multiple receiver antennas,

wherein the received signals are transmitted by multiple transmitter antennas associated with the wireless transmitter, and

wherein each selected pre-multiplying value is developed from one transfer function value associated with one of the multiple transmitter antennas and one of the multiple receiver antennas.

2. The signal of claim 1, wherein the transfer function values comprise:

a matrix of eigenvectors associated with the transfer function values.

3. The system of claim 1, wherein the multiple transmitting antennas transmit encoded symbols in blocks of multiple time frames, and wherein a codeword comprises all encoded symbols transmitted within a time frame.

4. A method for processing wireless data, the method comprising:

receiving at an m number of receiving antennas a wireless signal, wherein the wireless signal represents multiple codewords; and

processing the wireless signal by way of maximum likelihood detection to determine the codewords, under a less than optimal computational process, wherein a number of computations is reduced by approximately a factor of m, at an increase in less than a factor of m in frame error probability from the optimal computational process, and wherein the optimal computational process computes all codewords for the maximum likelihood detection.

5. The system of claim 4, wherein the wireless signal is transmitted by multiple transmitting antennas, and the wireless signal is encoded under a space-time modulation scheme.

6. The system of claim 4, wherein the processing includes computing eigenvectors based on the m number of receiving antennas.

7. A method for wireless communication, comprising:

transmitting encoded symbols from multiple transmitting antennas;

each one of multiple receiving antennas receiving transmitted encoded symbols from all of the multiple transmitting antennas, wherein a particular transfer function is associated with each transmitting antenna-receiving antenna pair;

generating multiple transfer functions using the received encoded symbols, wherein each transfer function is associated with a transmitting-receiving antenna pair associated with the received encoded symbols;

generating multiple multiplier signals, each associated with a transfer function;

generating multiple combined transfer function values generated from combining the transfer functions such that a number of decoding computations is reduced;

multiplying the received encoded signals with a respective multiplier signal;

adding the multiplied signals; and

decoding the received encoded symbols, including computing a subset of a set of all possible values of the received encoded symbols, using the added signals and the combined transfer function values.

8. The method of claim 7, wherein generating the multiple combined transfer function values comprises:

developing a matrix from the transfer function values;

finding aigenvalue of the matrix;

creating a maximum eigenvector of the matrix; and

generating the subset of the set of all possible values of the received encoded symbols from the maximum eigenvector.

9. The method of claim 7, wherein the multiple transmitting antennas transmit the encoded symbols in blocks of multiple time frames, and wherein a codeword comprises all encoded symbols transmitted within a time frame.

10. The method of claim 9, wherein a codeword comprises

c₁¹c₁²c₁³. . . c₁⁴c₂¹c₂³c₂³. . . c₂⁴c₃¹c₃²c₃³. . . c₃⁴. . . c_m¹c_m²c_m³. . . c_m⁴.

11. The method of claim 10, wherein the combined transfer function values are designated

γ_{i} = \sum_{j = 1}^{m} λ_{j} α_{ij},

and wherein computing a subset of a set of all possible values of the received encoded symbol comprises minimizing

\sum_{t = 1}^{L} {| R_{t} - \sum_{i = 1}^{n} γ_{i} c_{t}^{i} |}^{2}

from among all possible codewords.

Patent Citations (67)

Patent	Date	Inventor	Cited By
US3633107(A)	1972-01-01	Brady	Applicant
US3978408(A)	1976-08-01	Gupta et al.	Applicant
US4001692(A)	1977-01-01	Fenwick et al.	Applicant
US4099121(A)	1978-07-01	Fang	Applicant
US4369516(A)	1983-01-01	Byrns	Applicant
US4567464(A)	1986-01-01	Siegel et al.	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	Okanoue	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	Skold 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 et al.	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.	Examiner
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.	Applicant
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-04-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(A)	1999-03-01		Applicant

Non-Patent Literature (24)

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., “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,” IEEE International Conference on Communications, Montreal, 1:299-303, Jun. 1997.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
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
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
M.A. Blanco & K. Zdunek; “On the Optimization of Simple Switched Diversity Receivers,” 1978 IEEE Conference on Communications and Power, Montreal, Canada, pp. 114-117, (1978).Applicant
M.A. Blanco & K. Zdunek, “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
G.J. Foschini, “Layered Space-Time Architecture for Wireless Communication in a Fading Environment when Using Multi-Element Antennae”, Bell Technical Labs Journal, pp. 41-59, (1996).Applicant
G.J. Foschini and M.J. Gans, “On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas,” Wireless Personal Communications 6:311-335, (1998).Applicant
J. Hinderling, et al., “CDMA Mobile Station Modem ASIC,” IEEE 1992 Custom Integrated Circuits Conference pp. 10.2.1-10.2.5, (1992).Applicant
R. Kerr, 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
R.L. Pikhotz, et al., “Theory of Spread Spectrum Communications—A Tutorial,” IEEE Transactions on Communications, 30 (5):857-884, (1992).Applicant
N. Seshadri and J.H. Winters, “Two Signaling Schemes for improving the Error Performance of Frequency Division Duplex Transmission Using Transmitter Antenna Diversity,” International Journal of Wireless Information Networks, 1(1):49-60, (1994).Applicant
V. Tarokh, et al., “Space-Time Codes for High Data Rate Wireless Communication: Performance Criteria and Code Construction”, IEEE Trans Info Theory vol. 44, (Mar. 1998).Applicant
V. Tarokh, 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
J. Winters, “The Diversity Gain of Transmit Diversity in Wireless System with Rayleigh Fading”, AT&T Bell Laboratories New Orleans Supercomm ICC pp. 1121-1125, (May 1994).Applicant
A. Wittneben, “A New Bandwidth Efficient Transmit Antenna Modulation Diversity Scheme for Linear Digital Modulation,” Proc. IEEE ICC pp. 1630-1634, (1993).Applicant
A. Wittneben, “BaseStation Modulation Diversity for Digital Simulcast,” Proc. IEEE VTC, pp. 848-853, (May 1991).Applicant