US 6,853,688 B2Grant
Low complexity maximum likelihood detection of concatenated space codes for wireless applications
Issue Date:2005-02-08
•15 Claims
•2 Drawing Sheets
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.
Metadata
Assignee
- Cingular Wireless II, LLC
Inventors
- Siavash Alamouti
- Patrick Poon
- Vahid Tarokh
Application Information
Application Number:US 10/334,343
Filing Date:2002-12-30
Priority Date:1997-10-31
Art Unit:2637
Patent Drawings (2 sheets)
Description
Reference to Related Applications
[00002] This application is a continuation of U.S. patent application Ser. No. 10/005,095, filed on Dec. 3, 2001, which is a divisional of U.S. patent application Ser. No. 09/167,422, filed on 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.
Background of the Invention
[00003] This invention relates to wireless communication and, more particularly, to techniques for effective wireless communication in the presence of fading and other degradations.
[00004] 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 ×dB fade, it must increase its power by ×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.
[00005] 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).
[00006] 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.
[00007] 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
[00008] 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.
[00009] 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.
[00010] Still another interesting approach is disclosed by Tarokh, Seshadri, Calderbankand 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.
[00011] 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.
[00012] Still another approach is disclosed by the last-mentioned inventors in a U.S. 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
[00013] 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
[00014] FIG. 1 presents a block diagram of an embodiment in conformance with the principles of this invention.
Detail Description
[00015] 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 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.
[00016] 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.
[00017] 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.
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.
[00022] 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.
{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.
[00027] The Viterbi decoder builds the following metric for the hypothesized branch symbol s1 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,si),(s0,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.
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,si),(s0,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.
[00036] 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
Post-issuance certificates present
The text shown below may not reflect later post-issuance changes.
1. A transmitter comprising:
a trellis encoder, wherein the trellis encoder generates a first symbol and a second symbol, and
a 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 complex conjugation, negation, or negative complex conjugation of the first symbol, and a fourth symbol generated using a complex conjugation, negation, or negative complex conjugation of the second symbol.
2. The transmitter of claim 1 further comprising the plurality of antennas.
3. The transmitter of claim 1 wherein the trellis encoder is a multiple trellis code modulation encoder.
4. The transmitter of claim 1 wherein the block encoder is a multi-branch block encoder.
5. The transmitter of claim 1 wherein the block encoder is a space-time block encoder.
6. In a transmitter, a method for linking trellis codes with block codes, the method comprising:
receiving input data;
trellis encoding the received data, including generating complex numbers, each complex number representing a constellation symbol;
receiving the generated complex numbers;
block encoding the received complex numbers, including generating a block of symbols, wherein the block of symbols includes the generated complex numbers and at least one of a complex conjugation, negation, or negative complex conjugation of at least some of the generated complex numbers; and
outputting the blocks of symbols for transmission by two or more transmitting antennas.
7. The method of claim 6 wherein the received data is binary data.
8. The method of claim 6 wherein the block encoding includes taking a first complex number and a second complex number as input and generating a complex conjugate of the first complex number and a negative complex conjugate of the second complex number.
9. The method of claim 6 wherein the block encoding includes ordering the block to provide a first complex number, a second complex number, a negative complex conjuration of the second complex number and a complex conjugation of the first complex number.
10. The method of claim 6, further comprising, transmitting the blocks of symbols over the two or more antennas.
11. In a transmitter, an apparatus for generating encoded symbols for transmission over a wireless link, the apparatus comprising:
means for receiving input data;
means, coupled to the means for receiving input data, for generating a first symbol and a second symbol; and
means, coupled to the means for generating first and second symbols, for generating a block, the block including the first symbol, the second symbol, a third symbol generated using a complex conjugation, negation, or negative complex conjugation of the first symbol, and a fourth symbol generated using a complex conjugation, negation, or negative complex conjugation of the second symbol.
12. The apparatus of claim 11 further comprising:
means for sending, at a first time, the first symbol from a first antenna and the second symbol from a second antenna; and
means for sending, at a second time, the forth symbol from the first antenna and the third symbol from the second antenna.
13. The apparatus of claim 11 further comprising:
means for sending, on a first carrier the first symbol from a first antenna and the second symbol from a second antenna; and
means for sending, on a second carrier, the third symbol from a second antenna and the fourth symbol from a first antenna.
14. The apparatus of claim 11 wherein the block is generated using a two-branch space block encoder.
15. The apparatus of claim 11 wherein the block is generated using a multiple-branch space block encoder.
Patent Citations (68)
| 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 | 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 |
| US5613219(A) | 1997-03-01 | Vogel 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 |
| US5924034(A) | 1999-07-01 | Dupuy | 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. | Applicant |
| US6393074(B1) | 2002-05-01 | Mandyam et al. | Applicant |
| US6470043(B1) | 2002-10-01 | Lo 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 | |
| WO9120142(A1) | 1991-12-01 | Applicant | |
| WO9522214(A1) | 1995-08-01 | Applicant | |
| WO9724849 | 1997-07-01 | Applicant | |
| WO9741670 | 1997-11-01 | Applicant | |
| WO9809385 | 1998-03-01 | Applicant | |
| WO9914871 | 1999-03-01 | Applicant |
Non-Patent Literature (24)
- Seshadri, N. et al., “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.Applicant
- Winters, J.H., “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.Applicant
- Wittneben, A. “A New Bandwidth Efficient Transmit Antenna Modulation Diversity Scheme For Linear Digital Modulation,” Proceeding of the 1993 IEEE International Conference on Communications (IICC '93), pp. 1630-1634, May 1993.Applicant
- Wittneben, A. “Base Station Modulation Diversity for Digital SIMULCAST,” Proceeding of the 1991 IEEE Vehicular Technology Conference (VTC 41st), pp. 848-853, May 1991.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, V., et al.,“Space-Time Codes for High Data Rate Wireless Communication: Performance Criteria and Code Construction,” IEEE Trans on Infor Theory 44(2): 744-765, Mar. 1998.Applicant
- Alamouti, S., “A Simple Transmit Diversity Technique for Wireless Communications,” IEEE Journal on Selected Areas in Communications IEEE 16(8): 1451-1458, Oct. 1998.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
- 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
- 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
- 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
- Pikholtz, R.L. et al., “ Theory of Spread Spectrum Communications—A Tutorial,” IEEE Transactions on Communications, 30(5):855-884, (1992).Applicant
- Sampei, Seiichi et al., “Rayleigh Fading Compensation Method for 16QAM in Digital Land Mobile Radio Channels,” Proceeding of the 1989 IEEE Vehicular Technology Conference, May 1989, pp. 640-646, The Institute of Electrical and Electronics Engineers, Inc., New York, NY.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, 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. 56-57, 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