US 6,470,043 B1Grant
Near-optimal low-complexity decoding of space-time codes for fixed wireless applications
Issue Date:2002-10-22
•4 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 ithtransmitter antenna to the jthreceiver 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 09/690,542
Filing Date:2000-10-17
Priority Date:1997-12-23
Art Unit:7
Classifications
IPC:
H04B 1707
Field of Search:
375144375148375267375299375347375147
Patent Drawings (2 sheets)
Description
Reference to Related Applications
[0002] This application claims the benefit and is a continuation of U.S. patent application Ser. No. 09/063,765, 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, 1997.
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 Ser. 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 ithtransmitter antenna to the jthreceiver antenna. The αijterms are determined in the receiver in conventional ways.
Brief Description of the Drawing
[0010] FIG. 1 presents a block diagram of prior 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 γi, i=1,2,3, . . . , n (which are described in more detail below). Signals γjof 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] c11c12c13. . . c14c21c22c23. . . c24c31c32c33. . . c34. . . cm1cm2cm3. . . cm4, (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 transmitting antenna, e.g., antenna 1, the signal that is received from antenna 1 in response to a transmitted symbol ct1at time interval t is:
[0018] (when noise is ignored). If each λjvalue is set to α*1j, (where α*1jis the complex conjugate of α1j) then the received signal would simply be
[0019] yielding a constructive addition.
[0020] Of course, the values of λjcannot be set to match α*1jand concurrently to match the values of α*ijwhere i≠1; and therein lies the difficulty.
[0021] When all n of the transmitting antennas are considered, then the received signal is
[0022] In accordance with the present disclosure, the objective is to maximize
[0023] because by doing so, signal Rtcontains as much information about ct1, i=1,2,3, . . . n as is possible. However, it can be easily shown that if a matrix A is constructed such that
[0024] where Ωi=(αi1,αi2,αi3. . . αim), then
[0025] The receiver, thus, has to maximize ΛA(Λ*)T, subject to the constraint ∥Λ∥2=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,
[0026] and applies them to detector 50. Finally, detector 50 minimizes the metric
[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 receiver comprising:
a plurality of receiver antennas;
circuitry that obtains signals transmitted from a plurality of transmitter antennas; and
a processor that
develops a sum signal corresponding to the addition of said obtained signals that are each pre-multiplied by λj, where j is an index integer specifying that λjmultiplies the signal received from antenna j of said plurality of receiver antennas,
develops values for transfer functions αij, where i is associated with said transmitter antennas, and j is associated with said receiver antennas,
develops said λjfactors from said transfer functions, where said λjfactors are components of a vector Λ, where Λ is an eigenvector of a matrix containing said elements αij, and
detects symbols transmitted by said transmitter antennas embedded in said sum signal.
2. The receiver of claim 1 wherein said processor further compares said sum signal to a signal corresponding to symbols ciincluded in a set of symbols transmitted by transmitting antenna i of said plurality of transmitter antennas multiplied by corresponding factors γi.
3. The receiver of claim 2 where said corresponding factor γiis related to said factors λj, for j=1,2, 3, . . . , m, and to αij.
4. The receiver of claim 2 wherein said processor further minimizes a metric
where Rtis said sum signal at time interval t within a frame having L time intervals, and ctiis a symbol included in a set of transmitted symbols.
Patent Citations (19)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3633107(A) | 1972-01-01 | Brady | Applicant |
| US4577332(A) | 1986-03-01 | Brenig | Applicant |
| US4675880(A) | 1987-06-01 | Davarian | Applicant |
| US4733402(A) | 1988-03-01 | Monsen | Applicant |
| US4953183(A) | 1990-08-01 | Bargmans et al. | Applicant |
| US5202903(A) | 1993-04-01 | Okanoue | Examiner |
| US5481572(A) | 1996-01-01 | Skold et al. | Applicant |
| US5553102(A) | 1996-09-01 | Jasper et al. | Examiner |
| US5943372(A) | 1999-08-01 | Gans et al. | Examiner |
| US5949833(A) | 1999-09-01 | Weerackody | Examiner |
| US5960039(A) | 1999-09-01 | Martin et al. | Examiner |
| US5991331(A) | 1999-11-01 | Chennankeshu et al. | Applicant |
| US6034987(A) | 2000-03-01 | Chennankechu et al. | Applicant |
| US6115427(A) | 2000-09-01 | Calderbank et al. | Applicant |
| US6188736(B1) | 2001-02-01 | Lo et al. | Examiner |
| GB2280575 | 1995-02-01 | Applicant | |
| GB2290010 | 1995-12-01 | Applicant | |
| GB2311445 | 1997-09-01 | Applicant | |
| WO95/22214 | 1995-08-01 | Applicant |
Non-Patent Literature (13)
- 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 Commmunications 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