US6587515B1 - Differential transmitter diversity technique for wireless communications - Google Patents

Differential transmitter diversity technique for wireless communications Download PDF

Info

Publication number
US6587515B1
US6587515B1 US09/296,514 US29651499A US6587515B1 US 6587515 B1 US6587515 B1 US 6587515B1 US 29651499 A US29651499 A US 29651499A US 6587515 B1 US6587515 B1 US 6587515B1
Authority
US
United States
Prior art keywords
symbols
frame
computed
mapping
bits
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Lifetime
Application number
US09/296,514
Inventor
Hamid Jafarkhani
Vahid Tarokh
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
AT&T Corp
Original Assignee
AT&T Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by AT&T Corp filed Critical AT&T Corp
Priority to US09/296,514 priority Critical patent/US6587515B1/en
Assigned to AT&T CORP. reassignment AT&T CORP. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: JAFARKHANI, HAMID, TAROKH, VAHID
Priority to US09/844,913 priority patent/US6891903B2/en
Application granted granted Critical
Publication of US6587515B1 publication Critical patent/US6587515B1/en
Priority to US11/224,840 priority patent/US7154970B1/en
Priority to US11/653,610 priority patent/US7453965B1/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0613Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission
    • H04B7/0667Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of delayed versions of same signal
    • H04B7/0669Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of delayed versions of same signal using different channel coding between antennas
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0613Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission
    • H04B7/0667Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of delayed versions of same signal
    • H04B7/0671Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of delayed versions of same signal using different delays between antennas

Definitions

  • This invention relates to wireless communication and, more particularly, to techniques for effective wireless communication in the presence of fading and other degradations.
  • 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.
  • MSE maximum likelihood sequence estimator
  • MMSE minimum mean squared error
  • a space time encoding at the transmitter can be constructed where the symbols transmitted over a plurality of antennas in the time slots of a frame are orthogonal to each other.
  • the inputs signals of each frame are mapped onto a coordinate system dictated by the symbols of the previous frame, and symbols from a constellation are selected based on the results of such mapping.
  • Received signals are detected by preprocessing the signals detected at each antenna with signals detected by the antenna at the immediately previous frame, and then applied to a maximum likelihood detector circuit, followed by an inverse mapping circuit.
  • FIG. 1 is a block diagram of a transmitting unit and a receiving unit in conformance with the principles disclosed herein.
  • FIG. 1 depicts an arrangement where a transmitting unit 10 has two transmitting antennas, 11 - 1 and 11 - 2 , and a receiving unit 20 has m receiving antenna, 21 - 1 , 21 - 2 , . . . , 21 -m.
  • the coefficient ⁇ i,j is the path gain from transmit antenna i to receive antenna j.
  • the path gains are modeled as samples of independent complex Gaussian random variables with variance 0.5 per real dimension.
  • the wireless channel is assumed to be quasi-static, so that the path gains are constant over a frame of length l and vary, if at all, from one frame to another.
  • noise samples ⁇ t j are independent samples of a zero-mean complex Gaussian random variable with variance 1/(2SNR) per complex dimension.
  • the average energy of the symbols transmitted from each antenna is normalized to be 1/2, so that the average power of the received signal at each receive antenna is 1 and the signal to noise ratio is SNR.
  • ⁇ 1 [r 1 j ⁇ * 1,j s* 1 +( r 1 j )* ⁇ 1,j s 1 +r 2 j ⁇ * 2,j s* 1 +( r 2 j )* ⁇ 2,j s 1 ] (7)
  • ⁇ 2 [r 1 j ⁇ * 2,j s* 2 +( r 1 j )* ⁇ 2,j s 2 ⁇ r 2 j ⁇ * 1,j s* 2 ⁇ ( r 2 j )* ⁇ 1,j s 2 ].
  • equation (9) is only a function of s 1
  • equation (10) is only a function of s 2 .
  • a x is the dot product of (x 3 ,x 4 ) and (x 1 ,x 2 ), and B x is the dot product of (x 3 ,x 4 ) and ( ⁇ x* 2 ,x* 1 ).
  • V As the set of all vectors P x from signal pairs belonging to constellation A, it can be shown that, if the constellation A is restricted to phase shift keying (where the constellation points lie along the (power) unit circle), V has the following properties:
  • V The minimum distance between any two distinct elements of V is equal to the minimum distance of the 2 b -PSK constellation.
  • a ( B ) a 3 a* 1 +a 4 a* 2 , (18)
  • the block B is then constructed by inverse mapping of a 3 and a 4 .
  • transmitting unit 10 of FIG. 1 includes element 12 that receives the input signals and maps the input signal blocks with mapping operator M.
  • Operator M corresponds to the mapping from bits of the input signal block directly to the complex vectors A(B), and B(B).
  • the mapped signals are applied to symbol computation element 13 , which with assistance with transmitted symbols from the previous two time intervals, computes symbols from constellation ⁇ corresponding to the mapped input signal block, and transmits them over antennas 11 - 1 and 11 - 2 . Those symbols are then fed back to delay element 14 in preparation for the mapping of the next input signal block.
  • the transmitter begins the transmission with the sending of arbitrary symbols s 1 and s 2 at time slot 1 and symbols ⁇ s* 2 and s* 1 at time slot 2 .
  • These transmissions do not convey any information, but they are fed back to element 12 , where they are used in the mapping of the next set of inputs, in an inductive manner, as effectively described above.
  • symbols s 2q+1 and s 2q+2 are transmitted from antennas 11 - 1 and 11 - 2 , respectively at time slot 1
  • symbols ⁇ s* 2q+2 and s* 2q+1 are transmitted from antennas 11 - 1 and 11 - 2 , respectively, at time slot 2 of frame q+1.
  • These signals are also sent to element 14 in preparation of the encoding of frame q+2. This process is inductively repeated until the end of the frame (or end of transmission).
  • the decoding of signals received by unit 20 is performed in detector elements 22 -j, which are coupled to antennas j.
  • element 22 -j there is a delay element 221 -j and dot product generators 222 -j and 223 -j.
  • Dot product generator 222 -j develops the dot product of (r 2q+1 ,r* 2q+2 ).(r 2q ⁇ 1 ,r* 2q ) for the signals received at antenna j
  • dot product generator 223 -j develops the dot product of (r 2q+1 ,r* 2q+2 ).(r 2q , ⁇ r* 2q ⁇ 1 ) for the signals received at antenna j.
  • N 2q ⁇ 1 ( ⁇ 2q ⁇ 1 , ⁇ * 2q ).
  • R 1 (
  • N 1 ( s 2q+1 ,s 2q+2 ) ⁇ ( ⁇ 1 , ⁇ 2 ) N* 2q ⁇ 1 +N 2q+1 ⁇ * ( ⁇ 1 , ⁇ 2 )( s 2q ⁇ 1 ,s 2q )*+ N 2q ⁇ 0 N 2q ⁇ 1 .
  • R 2 (
  • the vector pair (R 1 ,R 2 ) at the output of detector 22 - 1 can then be expressed by

Abstract

Input signals of each frame are encoded by mapping the signals onto a coordinate system dictated by the symbols of the previous frame, and symbols from a constellation are selected based on the results of such mapping. Received signals are detected by preprocessing the signals detected at each antenna with signals detected by the antenna at the immediately previous frame, and then applied to a maximum likelihood detector circuit, followed by an inverse mapping circuit.

Description

REFERENCE TO RELATED APPLICATIONS
This application claims priority from U.S. Provisional Application No. 60/119,396 File Feb. 10, 1999.
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.
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/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, and applies each code of a group of codes to a different antenna.
When knowledge of the channel is available neither at the transmitter nor at the receiver, the above schemes require the transmission of pilot symbols. For one transmit antenna, differential detection schemes exist that neither require the knowledge of the channel nor employ pilot symbol transmission. These differential decoding schemes are used, for instance, in the IEEE IS-54 standard. This motivates the generalization of differential detection schemes for the case of multiple transmit antennas.
A partial solution to this problem was proposed in U.S. patent application Ser. No. 09/074,224 filed on May 7, 1998, where the detected sequence is used to estimate the channel at the receiver, and those estimates are fed back and used to detect the next transmitted set of symbols. Therefore, the '224 patent application disclosure can be thought of as a joint channel and data estimation.
SUMMARY OF THE INVENTION
Improvement in the art is realized by utilizing the fact that a space time encoding at the transmitter can be constructed where the symbols transmitted over a plurality of antennas in the time slots of a frame are orthogonal to each other. With this realization, in accordance with the principles of this disclosure, the inputs signals of each frame are mapped onto a coordinate system dictated by the symbols of the previous frame, and symbols from a constellation are selected based on the results of such mapping. Received signals are detected by preprocessing the signals detected at each antenna with signals detected by the antenna at the immediately previous frame, and then applied to a maximum likelihood detector circuit, followed by an inverse mapping circuit.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram of a transmitting unit and a receiving unit in conformance with the principles disclosed herein.
DETAILED DESCRIPTION
FIG. 1 depicts an arrangement where a transmitting unit 10 has two transmitting antennas, 11-1 and 11-2, and a receiving unit 20 has m receiving antenna, 21-1, 21-2, . . . , 21-m. At each time slot t, signals ct i, i=1,2 are transmitted simultaneously from the two transmit antennas. The coefficient αi,j, is the path gain from transmit antenna i to receive antenna j. The path gains are modeled as samples of independent complex Gaussian random variables with variance 0.5 per real dimension. The wireless channel is assumed to be quasi-static, so that the path gains are constant over a frame of length l and vary, if at all, from one frame to another.
At time t the signal rt j that is received at antenna j is given by r t j = i = 1 2 α i , j c t i + η t j ( 1 )
Figure US06587515-20030701-M00001
where the noise samples ηt j are independent samples of a zero-mean complex Gaussian random variable with variance 1/(2SNR) per complex dimension. The average energy of the symbols transmitted from each antenna is normalized to be 1/2, so that the average power of the received signal at each receive antenna is 1 and the signal to noise ratio is SNR.
Assuming coherent detection, the receiver computes the decision metric t = 1 2 j = 1 m r t j - i = 1 2 α i , j c t i 2 ( 2 )
Figure US06587515-20030701-M00002
over all codewords
c 1 1 c 1 2 c 2 1 c 2 2 . . . c 1 1 c 1 2,  (3)
and decides in favor of the codeword that minimizes the sum of equation (2).
In the FIG. 1 arrangement, the encoding matrix of transmitting unit 10 is δ = ( x 1 x 2 - x 2 * x 1 * ) , ( 4 )
Figure US06587515-20030701-M00003
which means that as 2b bits arrive at the encoder at each frame, constellation signals s1, and s2 are selected, and setting xi=si, the first column of the matrix is transmitted in time slot t=1 and the second column of the matrix is transmitted in time slot 2.
Maximum likelihood detection amounts to minimizing the decision statistic j = 1 m ( r 1 j - α 1 , j s 1 - α 2 , j s 2 2 + r 2 j + α 1 , j s 2 * - α 2 , j s 1 * 2 ) ( 5 )
Figure US06587515-20030701-M00004
over all possible values of s1 and s2. The minimizing values in equation (5) are the receiver estimates of s1 and s2, respectively. Expanding the above metric and deleting the terms that are independent of the codewords, it can be observed that the above minimization is equivalent to minimizing - j = 1 m ( Ψ 1 + Ψ 2 ) + ( s 1 2 + s 2 2 ) j = 1 m i = 1 2 α i , j 2 , ( 6 )
Figure US06587515-20030701-M00005
where
Ψ1 =[r 1 jα* 1,j s* 1+(r 1 j)*α1,j s 1 +r 2 jα*2,j s* 1+(r 2 j)*α2,j s 1]  (7)
and
Ψ2 =[r 1 jα*2,j s* 2+(r 1 j)*α2,j s 2 −r 2 jα*1,j s* 2−(r 2 j)*α1,j s 2].  (8)
The above metric decomposes into the two parts - j = 1 m Ψ 1 + s 1 2 j = 1 m i = 1 2 α i , j 2 ( 9 ) and - j = 1 m Ψ 2 + s 2 2 j = 1 m i = 1 2 α i , j 2 , ( 10 )
Figure US06587515-20030701-M00006
where equation (9) is only a function of s1, and equation (10) is only a function of s2. Thus, the minimization of equation (5), which is derived from equation (2), is achieved by minimizing equations (9) and (10) separately. This, in turn, is equivalent to minimizing the decision statistic j = 1 m ( r 1 j α 1 , j * + ( r 2 j ) * α 2 , j ) - s 1 2 + ( - 1 + j = 1 m i = 1 2 α i , j 2 ) s 1 2 ( 11 )
Figure US06587515-20030701-M00007
for detecting s1, and the decision statistic j = 1 m ( r 1 j α 2 , j * + ( r 2 j ) * α 1 , j ) - s 2 2 + ( - 1 + j = 1 m i = 1 2 α i , j 2 ) s 2 2 ( 12 )
Figure US06587515-20030701-M00008
for decoding s2.
From a careful look at the complex vectors that make up the matrix of equation (4) it can be observed that the pair of constellation symbols (x1,x2) and (−x*2,x*1) are orthogonal to each other (i.e., (x1,x2)(−x*2,x*1)H=0), where the superscript H denotes transpose conjugate (Hermetian), and, therefore, they can constitute the two orthogonal coordinates of a coordinate system. Viewed in this manner, any pair of complex vectors, such as constellation symbols pair X=(x3,x4), can be mapped onto the coordinate system defined by (x1,x2) and (−x*2,x*1), and expressed in this coordinate system as a vector
P x=(A x ,B x).  (13)
That is,
(x 3 ,x 4)=A x(x 1 ,x 2)+B x(−x* 2 ,x* 1),  (14)
where Ax is the dot product of (x3,x4) and (x1,x2), and Bx is the dot product of (x3,x4) and (−x*2,x*1). This yields
A x =x 3 x* 1 +x 4 x* 2,  (15)
and
B x =−x 3 x 2 +x 4 x 1.  (16)
Defining V as the set of all vectors Px from signal pairs belonging to constellation A, it can be shown that, if the constellation A is restricted to phase shift keying (where the constellation points lie along the (power) unit circle), V has the following properties:
It has 22b elements corresponding to the pairs (x3,x4) of constellation symbols.
All elements of V have unit length.
For any two distinct elements X and Y of V,
P x −P y ∥−∥X−Y∥.  (17)
The minimum distance between any two distinct elements of V is equal to the minimum distance of the 2b-PSK constellation.
Now, given a block B of 2b bits, the first b bits are mapped into a constellation symbol a3 and the second two bits are mapped into a constellation symbol a4. Employing an arbitrary, fixed, starting pair of (a1,a2) that belongs to constellation α (for example a 1 = a 2 = 1 2
Figure US06587515-20030701-M00009
the complex vector pair (a3,a4) is mapped to the coordinate system defined by the orthogonal vectors (a1,a2) and (−a*2,a1), to yield the vector Px=(Ax,Bx) for X=(a3,a4), or P(B)=(A(B),B(B)), where
A(B)=a 3 a* 1 +a 4 a* 2,  (18)
and
B(B)=−a 3 a 2 +a 4 a 1.  (19)
Conversely, given A(B), and B(B), the pair (a3,a4) is recovered in a receiver that knows the pair of (a1,a2) by
(a 3 ,a 4)=A(B)(a 1 ,a 2)+B(B)(−a* 2 ,a* 1).  (20)
The block B is then constructed by inverse mapping of a3 and a4. Thus, there is a direct mapping from constellation symbol a3 and a4 to A(B), and B(B).
In accordance with the principles disclosed above transmitting unit 10 of FIG. 1 includes element 12 that receives the input signals and maps the input signal blocks with mapping operator M. Operator M corresponds to the mapping from bits of the input signal block directly to the complex vectors A(B), and B(B). The mapped signals are applied to symbol computation element 13, which with assistance with transmitted symbols from the previous two time intervals, computes symbols from constellation α corresponding to the mapped input signal block, and transmits them over antennas 11-1 and 11-2. Those symbols are then fed back to delay element 14 in preparation for the mapping of the next input signal block. Thus, based solely on a1 and a2, the transmitter begins the transmission with the sending of arbitrary symbols s1 and s2 at time slot 1 and symbols −s*2 and s*1 at time slot 2. These transmissions do not convey any information, but they are fed back to element 12, where they are used in the mapping of the next set of inputs, in an inductive manner, as effectively described above.
To illustrate, suppose that during a frame q (frames having 2 time slots each), symbols s2q−1 and s2q are transmitted. More specifically, suppose symbols s2q−1 and s2q are respectively transmitted from antenna 11-1 and 11-2, and at time slot 1, and the symbols −s*2q and s2q−1 are respectively transmitted from antenna 11-1 and 11-2 at time slot 2 of frame q. Suppose further that at frame q+1, a block of 2b bits Bq+1 arrives at element 12. According to the above, element 12 uses the mapping of the form expressed in equations (18) and (19) to obtain A(Bq+1) and B(Bq+1), and element 12 computes the constellation points
(s 2(q+1)−1 ,s 2(q+1))=(s 2q+1 ,s 2q+2)=A(B q+1)(s 2q−1 ,s 2q)+B(B q−1)(−s* 2q ,s* 2q−1).  (21)
Then, symbols s2q+1 and s2q+2 are transmitted from antennas 11-1 and 11-2, respectively at time slot 1, and symbols −s*2q+2 and s*2q+1 are transmitted from antennas 11-1 and 11-2, respectively, at time slot 2 of frame q+1. These signals are also sent to element 14 in preparation of the encoding of frame q+2. This process is inductively repeated until the end of the frame (or end of transmission).
The decoding of signals received by unit 20 is performed in detector elements 22-j, which are coupled to antennas j. Within element 22-j there is a delay element 221-j and dot product generators 222-j and 223-j. Dot product generator 222-j develops the dot product of (r2q+1,r*2q+2).(r2q−1,r*2q) for the signals received at antenna j, and dot product generator 223-j develops the dot product of (r2q+1,r*2q+2).(r2q,−r*2q−1) for the signals received at antenna j.
Considering the outputs of element 21-1, and simplifying the notation by employing rt for rt 1, ηt, α1 for ηt 1, α1 for α1,1, and α2 for α2,1, it can be observed that the signal pairs (r2q+1,r*2q+2), (r2q−1,r*2q), and (r2q,−r* 2q−1) can be expressed by
(r 2q+1 ,r* 2q+2)=(s 2q+1 ,s 2q+2)Λ(α12)+N 2q+1,  (22)
(r 2q−1 ,r* 2q)=(s 2q−1 ,s 2q)Λ(α12)+N 2q−1,  (23)
and
(r 2q ,−r* 2q−1)=(−s* 2q ,s* 2q−1)Λ(α12)+N 2q,  (24)
where r2q−1, r2q, r2q+1, and r2q+2 are the received signals, Λ ( α 1 , α 2 ) = ( α 1 α 2 * α 2 - α 1 * ) , ( 25 )
Figure US06587515-20030701-M00010
and
N 2q−1=(η2q−1,η*2q).  (26)
Hence, taking the dot product of equations (23) and (22) within element 222-1 results in
(r 2q+1 ,r* 2q+2).(r 2q−1 ,r* 2q)=(s 2q+1 ,s 2q+2)Λ(α12)Λ*
12)(s* 2q−1 ,s* 2q)+(s 2q+1 ,s 2q+2)Λ(α1α2)N* 2q−1+
N 2q+1,Λ*(α12)(s 2q−1 ,s 2q)*+N 2q+1 N* 2q−1.  (27)
Expanding equation (27) results in an output for element 221-1 that is
r 2q+1 r* 2q−1 +r* 2q+2 r 2q=
(|α1|2+|α2|2)(s 2q+
1 s* 2q−1 +s* 2q+2 s 2q)+(s 2q+1 ,s 2q+2
12)N* 2q−1 +N 2q+1Λ*(α12)(s 2q−1 ,s 2q)*+N 2q+1 N* 2q−1,  (28)
which reduces to
R 1=(|α1|2+|α2|2)A(B q−1)+N 1,  (29)
where
N 1=(s 2q+1 ,s 2q+2)Λ(α12)N* 2q−1 +N 2q+1Λ* (α12)(s 2q−1 ,s 2q)*+N 2q−0 N 2q−1.  (30)
Similarly, carrying out the mathematics of equations (27)-(30) for the dot product of (r2q+1,r*2q+2).(r2q,−r2q−1) within element 223-1 reveals that the output of element 223-1 corresponds to R2, where
R 2=(|α1|2+|α2|2)B(B q−1)+N 2.  (31)
The vector pair (R1,R2) at the output of detector 22-1 can then be expressed by
(R 1 ,R 2)=(|α1|2+|α2|2)(A(B q−1),B(B q−1))+(N 1 ,N 2).  (32)
The procedure disclosed above for antenna 12-1 is used for each of the j receive antennas, as depicted in FIG. 1, yielding a set of vectors R1 j and R2 j, j=1,2, . . . , m that is applied to element 25, wherein the closest vector of V to ( j = 1 m R 1 j , j = 1 m R 2 j )
Figure US06587515-20030701-M00011
is computed, following the approach disclosed above in connection with equations (5)-(12). Subsequently, the transmitted bits are computed by applying the inverse mapping M−1 in element 26.
The above discloses the principles of this invention by way of analysis for a transmitter having two transmit antennas. It should be realized that various modifications are possible to be incorporated without departing from the spirit and scope of this invention and, in particular, it should be understood that extension to arrangements where there are more than two antennas is straight forward using, for example, the codes taught in U.S. patent application Ser. No. 09/186,908, titled “Generalized Orthogonal Designs for Space-Time Codes for Wireless Communication,” which has the effective filing date of Nov. 11, 1997.

Claims (14)

We claim:
1. A method for encoding incoming signal stream comprising the steps of:
receiving, at frame q, n×b bits from an incoming bit stream, where a frame has n time slots, b and n are preselected integers, and q is an integer index;
mapping said n×b bits into n complex vectors Ai(Bq), i=1, 2, . . . , n, where Bq represents said n×b bits at frame q;
computing n symbols for frame q from said n complex vectors and from n symbols computed for frame q−1.
2. The method of claim 1 further comprising the step of transmitting n temporal sets of symbols in each frame, where each temporal set includes m symbols from a set of l computed symbols, where m≦l, with each of the m symbols optionally modified relative to said computed l symbols by negation and/or conjugation such that said temporal sets are orthogonal to each other.
3. The method of claim 1 where said step of computing carries out a calculation in accordance with ( s ( n + 1 ) q + 1 , s ( n + 1 ) q + 2 , s ( n + 1 ) q + 1 ) = i = 1 n A i ( B q ) S q - 1 l ( s nq + 1 , s nq + 2 , s nq + 1 )
Figure US06587515-20030701-M00012
where (s(n+1)q+1,s(n+1)q+2, . . . s(n+1)q+1) is an (n+1)st set of l computed symbols, and Sj q−1(snq+2, ssq+2, . . . snq+1) is the ith temporal set of symbols and is a function of its arguments, snq+1, snq+2, . . . snq+1, which are l computed symbols at frame q to form an orthogonal set.
4. The method of claim 3 where said function comprises modifying at least some of said l computed symbols by negation and/or conjugation such that said temporal sets are orthogonal to each other.
5. The method of claim 3 where said m symbols all have equal power.
6. The method of claim 3 where said m symbols are from a PSK constellation.
7. The method of claim 3 where said Sq−1(snq+1, snq+2, . . . snq+1, . . . snq+1) is orthogonal to Sj q−1 (snq+1, snq+2, . . . snq+1) for all i≠j.
8. The method of claim 1 where said step of computing carries out a calculation in accordance with
(s (n+1)q+1 , s (n+1)q+2)=A(B q)(s nq−1 , s nq)+B(B q)(−s* nq , s* nq−1)
where s(n+1)q+1 is a first symbol computed in frame q, it being also an (n+1)q+1)th computed symbol, and s(n+1)q+2 is a second symbol computed in frame q, it being also an (n+1)q+2)th computed symbol.
9. The method of claim 1 where said step of mapping is carried out through access of a look-up table.
10. The method of claim 1 where said step of mapping is carried out though computations.
11. The method of claim 10 where said step of mapping by way of computation is carried out with the aid of a preselected, fixed, set of symbols.
12. An encoder comprising:
a mapper responsive to applied bits for developing complex vectors,
a processor for responsive to said complex vectors and to delayed transmitted symbols for developing a space-time set of symbols to be transmitted over at least two transmitting points, and
a delay block responsive to said space-time set of symbols to be transmitted for developing said delayed transmitted symbols.
13. The encoder of claim 12 further comprising a transmitting antenna coupled to said transmitting points.
14. The encoder of claim 12 where said mapper develops complex vectors A(Bq+1) and B(Bq+1) in response to a block a Bq+1 of 2b bits, where b is a preselected integer and q is a frame index beginning at 0, applied to said encoder in frame q+1, and said processor develops signals (s2(q+1)−1, s2(q+1)) in accordance with
(s 2(q+1)−1 , s 2(q+1))=(s 2q+1 , s 2q+2)=A(B q+1)(s 2q−1 , s 2q)+B(B q+1)(−s* 2q , s* 2q−1)
where s−1 and s0 are preselected signals, and s*−1 and s*0 are complex conjugates of s−1 and s0, respectively.
US09/296,514 1999-02-10 1999-04-22 Differential transmitter diversity technique for wireless communications Expired - Lifetime US6587515B1 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
US09/296,514 US6587515B1 (en) 1999-02-10 1999-04-22 Differential transmitter diversity technique for wireless communications
US09/844,913 US6891903B2 (en) 1999-04-22 2001-04-27 Multiple transmit antenna differential detection from generalized orthogonal designs
US11/224,840 US7154970B1 (en) 1999-02-10 2005-09-13 Differential transmitter diversity technique for wireless communications
US11/653,610 US7453965B1 (en) 1999-02-10 2007-01-16 Differential transmitter diversity technique for wireless communications

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US11939699P 1999-02-10 1999-02-10
US09/296,514 US6587515B1 (en) 1999-02-10 1999-04-22 Differential transmitter diversity technique for wireless communications

Related Child Applications (2)

Application Number Title Priority Date Filing Date
US09/844,913 Continuation-In-Part US6891903B2 (en) 1999-04-22 2001-04-27 Multiple transmit antenna differential detection from generalized orthogonal designs
US10/425,103 Division US7864902B1 (en) 1999-02-10 2003-04-28 Differential transmitter diversity technique for wireless communications

Publications (1)

Publication Number Publication Date
US6587515B1 true US6587515B1 (en) 2003-07-01

Family

ID=26817301

Family Applications (1)

Application Number Title Priority Date Filing Date
US09/296,514 Expired - Lifetime US6587515B1 (en) 1999-02-10 1999-04-22 Differential transmitter diversity technique for wireless communications

Country Status (1)

Country Link
US (1) US6587515B1 (en)

Cited By (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20010031018A1 (en) * 1998-12-31 2001-10-18 Mohammed Nafie Block level space time transmit diversity in wireless communications
US20020186779A1 (en) * 2001-06-04 2002-12-12 Sridhar Gollamudi Method for multiple antenna transmission
US20020193146A1 (en) * 2001-06-06 2002-12-19 Mark Wallace Method and apparatus for antenna diversity in a wireless communication system
US20030035490A1 (en) * 2001-05-09 2003-02-20 Sridhar Gollamudi Method for multiple antenna transmission using partial channel knowledge
US20030194022A1 (en) * 1999-09-15 2003-10-16 Hughes Electronics Corporation Method of generating space-time codes for generalized layered space-time architectures
US20050063483A1 (en) * 2000-12-20 2005-03-24 Nortel Networks Limited Differential space-time block coding
US20050078761A1 (en) * 2002-01-04 2005-04-14 Nokia Corporation High rate transmit diversity transmission and reception
GB2409384A (en) * 2003-12-18 2005-06-22 Toshiba Res Europ Ltd Maximum Likelihood Sequence Estimation Equaliser for Space Time Coded Data in Multiple Antenna Receivers
US7065156B1 (en) * 2000-08-31 2006-06-20 Nokia Mobile Phones Ltd. Hopped delay diversity for multiple antenna transmission
US20080064335A1 (en) * 1999-02-16 2008-03-13 Mitsubishi Denki Kabushiki Kaisha Radio Communication System, a Transmitter and a Receiver
US20080101304A1 (en) * 2006-10-31 2008-05-01 Alfred Joseph A Method and apparatus for providing broadband signals to a portable user device
US20110110456A1 (en) * 2007-12-19 2011-05-12 Falcon Nano, Inc. Common Wave and Sideband Mitigation Communication Systems And Methods For Increasing Communication Speeds, Spectral Efficiency and Enabling Other Benefits
US9264118B1 (en) 2015-03-02 2016-02-16 Mitsubishi Electric Research Laboratories, Inc. System and method for communicating data symbols via wireless doubly-selective channels
CN107168893A (en) * 2016-03-07 2017-09-15 西部数据科技股份有限公司 Efficient and dynamic size back mapping for handling variable-size data

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5542107A (en) * 1993-04-17 1996-07-30 Hughes Aircraft Company Cellular system employing base station transit diversity according to transmission quality level
US5574989A (en) * 1993-04-26 1996-11-12 Hughes Electronics Time division multiple access cellular communication system and method employing base station diversity transmission
US6115427A (en) * 1996-04-26 2000-09-05 At&T Corp. Method and apparatus for data transmission using multiple transmit antennas
US6185258B1 (en) * 1997-09-16 2001-02-06 At&T Wireless Services Inc. Transmitter diversity technique for wireless communications

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5542107A (en) * 1993-04-17 1996-07-30 Hughes Aircraft Company Cellular system employing base station transit diversity according to transmission quality level
US5574989A (en) * 1993-04-26 1996-11-12 Hughes Electronics Time division multiple access cellular communication system and method employing base station diversity transmission
US6115427A (en) * 1996-04-26 2000-09-05 At&T Corp. Method and apparatus for data transmission using multiple transmit antennas
US6185258B1 (en) * 1997-09-16 2001-02-06 At&T Wireless Services Inc. Transmitter diversity technique for wireless communications

Cited By (34)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050058216A9 (en) * 1998-12-31 2005-03-17 Mohammed Nafie Block level space time transmit diversity in wireless communications
US7088785B2 (en) * 1998-12-31 2006-08-08 Texas Instruments Incorporated Block level space time transmit diversity in wireless communications
US20010031018A1 (en) * 1998-12-31 2001-10-18 Mohammed Nafie Block level space time transmit diversity in wireless communications
US20080064428A1 (en) * 1999-02-16 2008-03-13 Mitsubishi Denki Kabushiki Kaisha Radio Communication System, a Transmitter and a Receiver
US20080064335A1 (en) * 1999-02-16 2008-03-13 Mitsubishi Denki Kabushiki Kaisha Radio Communication System, a Transmitter and a Receiver
US8027649B2 (en) 1999-02-16 2011-09-27 Mitsubishi Denki Kabushiki Kaisha Radio communication system, a transmitter and a receiver
US7346316B1 (en) * 1999-02-16 2008-03-18 Mitsubishi Denki Kabushiki Kaisha Radio communication system, a transmitter and a receiver
US7929922B2 (en) 1999-02-16 2011-04-19 Mitsubishi Denki Kabushiki Kaisha Radio communication system, a transmitter and a receiver
US7012967B2 (en) * 1999-09-15 2006-03-14 Hammons Jr A Roger Method of generating space-time codes for generalized layered space-time architectures
US20030194022A1 (en) * 1999-09-15 2003-10-16 Hughes Electronics Corporation Method of generating space-time codes for generalized layered space-time architectures
US7065156B1 (en) * 2000-08-31 2006-06-20 Nokia Mobile Phones Ltd. Hopped delay diversity for multiple antenna transmission
US20050063483A1 (en) * 2000-12-20 2005-03-24 Nortel Networks Limited Differential space-time block coding
US20030035490A1 (en) * 2001-05-09 2003-02-20 Sridhar Gollamudi Method for multiple antenna transmission using partial channel knowledge
US8675772B2 (en) * 2001-05-09 2014-03-18 Alcatel Lucent Method for multiple antenna transmission using partial channel knowledge
US20020186779A1 (en) * 2001-06-04 2002-12-12 Sridhar Gollamudi Method for multiple antenna transmission
US7499499B2 (en) * 2001-06-04 2009-03-03 Alcatel-Lucent Usa Inc. Method for multiple antenna transmission
US20020193146A1 (en) * 2001-06-06 2002-12-19 Mark Wallace Method and apparatus for antenna diversity in a wireless communication system
US20070165739A1 (en) * 2002-01-04 2007-07-19 Nokia Corporation High rate transmission diversity transmission and reception
US20050078761A1 (en) * 2002-01-04 2005-04-14 Nokia Corporation High rate transmit diversity transmission and reception
US7436896B2 (en) * 2002-01-04 2008-10-14 Nokia Corporation High rate transmit diversity transmission and reception
US7502421B2 (en) * 2002-01-04 2009-03-10 Nokia Corporation High rate transmission diversity transmission and reception
GB2409384A (en) * 2003-12-18 2005-06-22 Toshiba Res Europ Ltd Maximum Likelihood Sequence Estimation Equaliser for Space Time Coded Data in Multiple Antenna Receivers
GB2409384B (en) * 2003-12-18 2005-11-30 Toshiba Res Europ Ltd Maximum likelihood sequence estimation equaliser
US20080101304A1 (en) * 2006-10-31 2008-05-01 Alfred Joseph A Method and apparatus for providing broadband signals to a portable user device
US8155583B2 (en) 2006-10-31 2012-04-10 At&T Intellectual Property Ii, L.P. Method and apparatus for providing broadband signals to a portable user device
US8811889B2 (en) 2006-10-31 2014-08-19 At&T Intellectual Property Ii, L.P. Method and apparatus for providing broadband signals to a portable user device
US20110110456A1 (en) * 2007-12-19 2011-05-12 Falcon Nano, Inc. Common Wave and Sideband Mitigation Communication Systems And Methods For Increasing Communication Speeds, Spectral Efficiency and Enabling Other Benefits
US8437414B2 (en) 2007-12-19 2013-05-07 Falcon Nano, Inc. Common wave and sideband mitigation communication systems and methods for increasing communication speeds, spectral efficiency and enabling other benefits
US8861625B2 (en) 2007-12-19 2014-10-14 Falcon Nano, Inc. Sideband mitigation communication systems and methods for increasing communication speeds, spectral efficiency and enabling other benefits
US9118525B2 (en) 2007-12-19 2015-08-25 Falcon Nano, Inc. Receiver for sideband mitigation communication systems and methods for increasing communication speeds, spectral efficiency and enabling other benefits
US9614696B2 (en) 2007-12-19 2017-04-04 Falcon Nano, Inc. Alternating phase filter for increasing communication speeds, spectral efficiency and enabling other benefits
US10243769B2 (en) 2007-12-19 2019-03-26 Falcon Nano, Inc. Communication apparatus for increasing communication speeds, spectral efficiency and enabling other benefits
US9264118B1 (en) 2015-03-02 2016-02-16 Mitsubishi Electric Research Laboratories, Inc. System and method for communicating data symbols via wireless doubly-selective channels
CN107168893A (en) * 2016-03-07 2017-09-15 西部数据科技股份有限公司 Efficient and dynamic size back mapping for handling variable-size data

Similar Documents

Publication Publication Date Title
EP0960487B1 (en) Maximum likelihood detection of concatenated space-time codes for wireless applications with transmitter diversity
US6775329B2 (en) Transmitter diversity technique for wireless communications
US6643338B1 (en) Space time block coded transmit antenna diversity for WCDMA
US6587515B1 (en) Differential transmitter diversity technique for wireless communications
US20050281351A1 (en) Apparatus and method for full-diversity, full-rate space-time block coding for even number of transmit antennas
US6501803B1 (en) Low complexity maximum likelihood detecting of concatenated space codes for wireless applications
US20010031019A1 (en) Multiple transmit antenna differential detection from generalized orthogonal designs
US7164729B2 (en) Differential transmitter diversity technique for wireless communications
US7453965B1 (en) Differential transmitter diversity technique for wireless communications
EP1372271A2 (en) Transmitter diversity technique for wireless communications
CA2411286C (en) Low complexity maximum likelihood detection of concatenated space codes for wireless applications
CA2405875C (en) Transmitter diversity technique for wireless communications
US20030031276A1 (en) Decoder, and an associated method, for decoding space-time encoded data
MXPA00002573A (en) Transmitter diversity technique for wireless communications

Legal Events

Date Code Title Description
AS Assignment

Owner name: AT&T CORP., NEW JERSEY

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:TAROKH, VAHID;JAFARKHANI, HAMID;REEL/FRAME:009918/0715;SIGNING DATES FROM 19990419 TO 19990420

STCF Information on status: patent grant

Free format text: PATENTED CASE

FPAY Fee payment

Year of fee payment: 4

FPAY Fee payment

Year of fee payment: 8

FPAY Fee payment

Year of fee payment: 12