Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.

Patents

  1. Advanced Patent Search
Publication numberUS7379508 B1
Publication typeGrant
Application numberUS 11/488,390
Publication dateMay 27, 2008
Filing dateJul 18, 2006
Priority dateApr 9, 2001
Fee statusPaid
Also published asUS7583748, US20080232505
Publication number11488390, 488390, US 7379508 B1, US 7379508B1, US-B1-7379508, US7379508 B1, US7379508B1
InventorsNaofal Al-Dhahir
Original AssigneeAt&T Corp.
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Frequency-domain method for joint equalization and decoding of space-time block codes
US 7379508 B1
Abstract
Space-time block coding is combined with single-carrier, minimum-mean-square-error, frequency-domain equalization for wireless communication through a medium characterized by multi-paths. The transmitter encodes incoming symbols into two or more streams that are transmitted over a corresponding number of transmitting antennas. The encoding employs modulo arithmetic. Decoding in the receiver proceeds by converting received signals to frequency domain, linearly combining the signals to separate contribution of the signals from the two or more transmitting antennas equalizing the separated signals, converting the equalized signals to time domain, and applying the converted signals to a decision circuit.
Images(3)
Previous page
Next page
Claims(1)
1. A transmitter with two antennas, characterized by:
an encoder responsive to blocks of incoming symbols, each block containing N of said incoming symbols, and encoding said N blocks of incoming symbols into two streams of symbols in pairs of output frames k and k+1, yielding output frame pairs x1 k, x1 k+1, and x2 k, x2 k+1, where each of a the frames includes v prefix symbols, each being applied to a different one of said two antennas, where x1 k+1(n)=− x 2 k((n)N) and x2 k+1(n)= x 1 k((n)N) and (•)N denoted modulo N operation.
Description
RELATED APPLICATIONS

This application is a continuation of application Ser. No. 11/231,451 filed Sep. 21, 2005 now U.S. Pat. No. 7,173,976, which is a continuation of application Ser. No. 10/026,148, filed Dec. 19, 2001 now U.S. Pat. No. 7,092,450. This application is also related to Provisional Application 60/282,634, filed Apr. 9, 2001.

BACKGROUND OF THE INVENTION

This relates to space-time coding, and more particularly, to frequency domain equalization in a receiver that receives signals from a multi-path channel.

M. V. Clark, in “Adaptive Frequency-Domain Equalization and Diversity Combining for Broadband Wireless Communications,” IEEE Journal on Selected Areas in Communications, pp. 1385-1395, October 1998, has shown that single-carrier minimum-mean-square-error frequency-domain (SC MMSE FDE) is an attractive equalization scheme for broadband wireless channels that are characterized by their long impulse response memories. Primarily the advantage of this approach accrues from using the computationally efficient Fast Fourier Transform (FFT), which compares favorably with time-domain equalization, where complexity grows exponentially with channel memory or require very long FIR filters to achieve acceptable performance. Further more, H. Sari et al, in “Transmission Techniques for Digital Terrestrial TV Broadcasting,” IEEE Communications Magazine, pp 100-190, February 1995, have shown that SC MMSE FDE has two main advantages over Orthogonal Frequency Division Multiplexing (OFDM); namely, lower peak-to-average ration, and reduced sensitivity to carrier frequency errors.

Diversity transmission using space-time block coding, for example, like disclosed in U.S. Pat. No. 6,185,258, has been proposed for several wireless standards because of the many attractive features of such coding. The SC MMSE FDE was combined with receive diversity by G. Kadel, in “Diversity and Equalization in Frequency Domain—A Robust and Flexible Receiver Technology for Broadband Mobile Communications Systems,” VTC, pp. 894-898, May 1997. There has also been some recent work on combining the scheme disclosed in the U.S. Pat. No. 6,185,258 patent with OFDM, as reported by Liu et al in “Decoding and Equalization of Unknown Multipath Channels Based on Block Precoding and Transmit-Antenna Diversity,” Asilomar Conf. On Signals, Systems, and Computers, pp. 1557-1561, 1999. However, it has not been realized that various communication advantages result from combining space-time block coding with SC MMSE FDE.

SUMMARY OF THE INVENTION

An advance in the art is achieved by combining space-time block coding in a transmitter, for example, of a mobile unit, with SC MMSE FDE in a responsive receiver, for example in a base station. Illustratively, in a two transmitting antenna arrangement, the transmitter handles two blocks of N incoming symbols xa(n) and xb(n) at a time, encodes the block of N symbols into two streams, and transmits the two streams over two separate antennas in two consecutive frames, k, and k+1. In frame k, one antenna transmits symbols x1 k(n), while the other antenna transmits symbols x2 k(n). Symbols x1 k(n) can, for example, equal symbols xa(n), while symbols x2 k(n) can equal xb(n). In frame k+1, the one antenna transmits symbols x1 k+1(n), while the other antenna transmits symbols x2 k+2(n). The relationships adopted for x1 k+1(n) and x2 k+2(n) are x1 k+1(n)=− x 2 k((−n)N) and x2 k+1(n)= x 1 k((−n)N) where x 2 k is the complex conjugate of x 2 k. At the receiver, the received signal is transformed into the frequency domain, processed, equalized, transformed to time domain, and applied to a slicer to recover the transmitted sequences x1 k(n) and x2 k(n).

More specifically, the processing within the receiver multiplies Y, (which is the received signal that is transformed into the frequency domain) by Λ*. The matrix Λ* is the complex conjugate of Λ, where

Λ = [ Λ 1 Λ 2 Λ 2 * - Λ 1 * ] ,
Λ1 is a diagonal matrix with elements (q,q) that are equal to the qth DFT coefficient of the transfer function between the one transmitting antenna and the receiver, and Λ2 is a diagonal matrix with elements (q,q) that are equal to the qth DFT coefficient of the transfer function between the other transmitting antenna and the receiver. Signal Y comprises signal Yk for frame k, and signal Yk+1 for frame k+1. The frequency domain equalization is effected through multiplication of the signals forming vectors Yk and Yk+1 by a diagonal matrix whose elements are related to the DFT coefficients between the one transmitting antenna and the receiver, and the other transmitting antenna and the receiver.

Extension of the principles disclosed herein to arrangements where several transmitting unit concurrently operate on the same carrier frequency is also disclosed.

BRIEF DESCRIPTION OF THE DRAWING

FIG. 1 shows a an illustrative arrangement of a two-antenna transmitter that is implemented in accordance with this disclosure, and a one antenna receiver that employs minimum-mean-square-error frequency-domain equalization (MMSE-FDE) equalization in accordance with this disclosure, with an interposed transmission channel having a memory of v symbol periods;

FIG. 2 shows the symbol stream that is generated by encoder 15 of FIG. 1; and

FIG. 3 presents an illustrative embodiment adapted for interference cancellation in an arrangement where several users employ the same carrier frequency to communicate with a receiver.

DETAILED DESCRIPTION

The following mathematical development focuses on a system having two transmit antennas and one receive antenna. It should be understood, however, that a skilled artisan could easily extend this mathematical development to more than two transmit antennas, and to more than one receive antenna.

FIG. 1 shows an arrangement that includes a transmitter with two transmit antennas 11 and 12, a receiver 20 with antenna 21, and a transmission channel therebetween that has a memory of v symbols periods. The transmission channel between antennas 11 and 21 can be represented as a finite impulse response filter with v+1 taps having values h1(0), h1(1), . . . h1(v), forming vector h1. Similarly the channel between antennas 12 and 21 can be represented by h2. Within transmitter 10, encoder 15 outputs symbol blocks k=1, 2, 3, . . . , of two length N sequences; with one sequence, x1 k(n), n=0, 1, 2, . . . N−1, being transmitted by antenna 11, and the other sequence, x2 k(n), n=0, 1, 2, . . . N−1, being transmitted by antenna 12. In vector notation, the sequences can be expressed by x1 k and x2 k, respectively. Because the transmission channel between transmitter 10 and receiver 20 has memory of v symbols, absent any protection, a receiver will comingle receptions from adjacent blocks. To avoid this, transmitter 10 includes a control signal that causes encoder 15 to precede each block with a string of v prefix symbols. In accordance with the principles disclosed herein, the symbols are selected to create a circulant transfer matrix between transmitter (for example, of a mobile unit) 10 and receiver to (for example, of a base station), as shown below.

It was discovered that advantageous results accrue from encoder 15 generating sequences such that the blocks of generated sequences are generated in pairs, k and k+1, where
x 1 k+1(n)=− x 2 k((−n)N) and x 2 k+1(n)= x 1 k((−n)N)  (1)
for n=0, 1, . . . N−1 and k=0, 2, 4, . . . , where x a denotes complex conjugation of xa, (subscript a being either 1 or 2), and (.)N denoted modulo-N operation. In other words, when encoder 15 generates the information sequence
{x(0),x(1),x(2), . . . x(N−2)x(N−1)},
for antenna 11 for frame k, it concurrently generates the information sequence
{ x(0), x(N−1), x(N−2), . . . x(2), x(1),}
for antenna 12 for or frame k+1. From equation (1) and the fact that Xa k=Qxa k, where Q is the orthogonal Discrete Fourier Transform (DFT) matrix whose (p,q) element is given by

Q ( p , q ) = 1 N - j 2 π N pq ,
and 0≦p, q≦N−1, is it follows that
X 1 k+1(m)=− X 2 k(m) and X 2 k+1(m)= X 1 k(m).  (2)

As will become clear from the disclosure below, the relationship of equation (2) allows for frequency domain decoupling in a receiver the contributions of sequences x1 k(n) and x2 k(n). Accordingly, for purposes of this disclosure, such encoding—the encoding of equation (1) being one example thereof, is termed “frequency domain decouplable contributions” (FD-DC) encoding. It is encompassed by a class of orthogonal designs, as disclosed, for example, in U.S. Pat. No. 6,088,408, issued Jul. 11, 2000

FIG. 2 presents the image of a sequence that encoder 15 delivers to antenna 11, with the prefix string consisting symbols x1(−v) through x1(−1), followed by symbols x1(0) through x1(N−1). Ignoring the subscript, the signals received at antenna 21 in response to signals transmitted by antenna 11, starting with signal y(0), which corresponds to the received signal at the time the encoded signal x(0) is transmitted by antenna 11, can be expressed by the following matrix equation:

[ y ( 0 ) y ( 1 ) y ( v ) y ( v + 1 ) y ( N - 1 ) ] = [ h ( v ) h ( v - 1 ) h ( 1 ) h ( 0 ) 0 0 0 h ( v ) h ( 2 ) h ( 1 ) h ( 0 ) 0 0 0 0 h ( v ) h ( v - 1 ) 0 0 0 0 0 h ( v ) 0 0 0 0 0 0 h ( 0 ) ] [ x ( - v ) x ( - v + 1 ) x ( - 1 ) x ( 0 ) x ( 1 ) x ( N - 1 ) ] ( 3 )
If the prefix sequence is chosen so that x(−i)=x(N−i) for i=1, 2, . . . v, then equation (3) can be replaced by

[ y ( 0 ) y ( 1 ) y ( v ) y ( v + 1 ) y ( N - 1 ) ] = [ h ( 0 ) 0 0 h ( 2 ) h ( 1 ) h ( 1 ) h ( 0 ) 0 h ( 3 ) h ( 2 ) h ( v - 1 ) h ( v - 2 ) h ( v - 3 ) 0 h ( v ) h ( v ) h ( v - 1 ) h ( v - 2 ) 0 0 0 0 0 h ( 1 ) h ( 0 ) ] [ x ( 0 ) x ( 1 ) x ( 2 ) x ( N - 2 ) x ( N - 1 ) ] . ( 4 )
Returning to the use of subscripts to indicate the transmitting antenna, and superscripts to indicate symbol blocks, and recognizing that antenna 21 receives signals transmitted by antenna 12 as well as by antenna 11, we get
y k =H 1 x 1 k +H 2 x 2 k +n k  (5)
where

H a = [ h a ( 0 ) 0 0 0 h a ( v ) h a ( 1 ) h a ( 1 ) h a ( 0 ) 0 0 0 h a ( 2 ) h a ( v ) h a ( v - 1 ) h a ( 0 ) 0 0 0 0 h a ( v ) h a ( 1 ) h a ( 0 ) 0 0 0 0 h a ( 2 ) h a ( 1 ) h a ( 0 ) 0 0 0 0 h a ( v ) h a ( v - 1 ) h a ( 0 ) ] ( 6 )
and the number of rows and columns in Ha is N.

A matrix with the structure of Ha is known as a circulant matrix, and it can be shown to have the eigen-decomposition
Ha=Q−1ΛaQ  (7)
where (.)* denotes complex-conjugate transpose, Q−1 is the inverse DFT matrix, and Λa is a diagonal matrix whose (q,q) element is equal to the qth DFT coefficient of ha. It may be noted that Q−1=Q* which, of course simplifies processing since it is not necessary to compute the inverse of the matrix, and it is assumed that the characteristics of the transmission medium between transmitter 10 and receiver 20 are knows by means of any one of knows processes. See, for example, U.S. patent application Ser. No. 09/956,648 filed Sep. 20, 2001 by the inventor of this application. Accordingly, it is presumed that the DFT coefficients of ha are known and, therefore, Λa is known.

It may be noted also that the above assumes that the transmission channel between transmitter 10 and receiver 20 does not change during the course of computations that are relevant to this disclosure, which is the time of two consecutive blocks.

Applying the output signals of circuit 22 to FFT circuit 23 to transform the signals of equations (5) into the frequency domain yields

Y k Qy k = Q ( Q - 1 Λ 1 Q ) x 1 k + Q ( Q - 1 Λ 2 Q ) x 2 k + Qn k = Λ 1 Qx 1 k + Λ 2 Qx 2 k + Qn k = Λ 1 X 1 k + Λ 2 X 2 k + N k . ( 8 )
and
Y k+11 X 1 k+12 X 2 k+1 +N k.  (9)

By taking advantage of the particular encoding by encoder 15, as expressed in equation (2), one can note that equation (9) can be rewritten and expressed together with equation (8) by

Y [ Y k Y _ k + 1 ] = [ Λ 1 Λ 2 Λ 2 * - Λ 1 * ] [ X 1 k X 2 k ] + [ N k N _ k ] ( 10 )
Y=ΛX+N.

Noting that Λ is an orthogonal matrix, the two signals X1 k and X2 k can be decoupled by simply multiplying both sides of equation (10) by Λ*, resulting in

Y ~ [ Y ~ k Y ~ k + 1 ] = Λ * Y = [ Λ 1 Λ 1 * + Λ 2 Λ 2 * 0 0 Λ 1 Λ 1 * + Λ 2 Λ 2 * ] [ X 1 k X 2 k ] + [ N ~ k N ~ k + 1 ] . ( 11 )
Expressed more succinctly,

Y ~ [ Y ~ k Y ~ k + 1 ] = [ Λ ~ 0 0 Λ ~ ] [ X 1 k X 2 k ] + [ N ~ k N ~ k + 1 ] , ( 12 )
from which we get
{tilde over (Y)} k ={tilde over (Λ)}X 1 k k
{tilde over (Y)} k+1 ={tilde over (Λ)}X 2 k k+1  (13)
where {tilde over (Λ)}=(Λ1Λ1*+Λ2Λ2*) in an N×N diagonal matrix.

Signals {tilde over (Y)}k+1 and {tilde over (Y)}k are computed in circuit 24 from

[ Y ~ k Y ~ k + 1 ] = Λ * Y = [ Λ 1 * Λ 2 Λ 2 * - Λ 1 ] [ Y k Y _ k + 1 ] , ( 14 )
which corresponds to
{tilde over (Y)} k+12 *Y k2 Y k+1  (15)
and
{tilde over (Y)} k+12 *Y k−Λ1 Y k+1  (16)
where signal Yk is the output of FFT circuit 23 at block k, and signal Y k+1 is the complex conjugate of the output of FFT circuit 23 at block k+1.

In accord with the principles disclosed herein, for the type transmitter structure disclosed above, a single-carrier minimum-mean-square-error frequency-domain equalization (SC-MMSE-FDE) is obtained with an N×N diagonal matrix applied to the signals of equations (15) and (16), where the elements of this matrix are given by

W ( i , i ) = 1 Λ ~ ( i , i ) + 1 SNR . ( 17 )
where

SNR σ x 2 σ n 2 ,
under the assumption that both the noise and the signal are “white.” It is noted that the noise vector n and its DFT N have the same variance, since the are related through the orthonormal transformation, Q.

Applying the output signals obtained by combiner 24 to SC-MMSE-FDE circuit 25, wherein the matrix of equation (17) pre-multiplies the signals of equations (15) and (16), results in

Z k = W Y ~ k = W Λ ~ X 1 k + W N ~ k ( 18 )
where W{tilde over (Λ)} is a diagonal N×N matrix with elements

Λ ~ ( i , i ) Λ ~ ( i , i ) + 1 SNR ,
and
Z k+1 =W{tilde over (Λ)}X 1 k+1 +WÑ k+1  (19)
Applying equation (18) and equation (19) signals of circuit 25 to inverse FFT transform circuit 26 yields

z k = Q - 1 Z k = Q * Z k = Q * W Λ ~ X 1 k + Q * W N k ~ = Q * W Λ ~ Qx 1 k + Q * WQ n ~ k = H ~ x 1 k + n ~ ( 20 )
and
z k+1 ={tilde over (H)}x 2 k +ñ,  (21)
where {tilde over (H)}=Q*W{tilde over (Λ)}Q has the same form as H in equation (7). Note that since the noise statistics are the same in frames k and k+1, equations (20) and (21) replace both Q*WQñk and Q*WQñk+1 with ii. Also note the {tilde over (H)} approaches the identity matrix as the value of SNR increases. For this reason,

Thus, the signals developed by circuit 26 correspond to the signals x1 k and x2 k that are filtered and equalized by matrix {tilde over (H)}, and augmented by noise. It is noted that the matrix {tilde over (H)} approaches the identity matrix as the value of SNR increases. For this reason a simple “slicer” detector can be used to detect the signals x1 k and x2 k.

Accordingly, the signals developed by circuit 26 are applied to detector 27, which is a conventional slicer, yielding the signals x1 k and x2 k, from which the sequence of transmitted symbols is obtained.

Expanding on the principles disclosed herein, FIG. 3 depicts an arrangement where M units (two shown) employ the same channel (i.e., the same carrier frequency) to communicate with receiver 20, which has M antennas (two shown). Corresponding to such an arrangement, equation (10) is rewritten as

[ Y 21 Y 22 ] = [ Λ 10 - 21 Λ 30 - 21 Λ 10 - 22 Λ 30 - 22 ] [ X 10 X 30 ] + [ N 21 N 22 ] , ( 22 )
where Y21 represents the signals received at antenna 21, X10 represents signals transmitted by unit 10, Λ10−21 represents the channel between unit 10 and antenna 21, X30 represents signals transmitted by unit 30, Λ30−21 represents the channel between unit 30 and antenna 21, and N21 is the noise received at antenna 21. Similarly, Y22 represents the signals received at antenna 22, Λ30−22 represents the channel between unit 30 and antenna 22, Λ10−22 represents the channel between unit 10 and antenna 22, and N22 is the noise received at antenna 22.

The signals of the two units can be decoupled in each frame by applying the following linear, zero-forcing interference cancellation:

[ Y 10 k Y 30 k ] = [ I - Λ 30 - 21 Λ 10 - 22 - 1 - Λ 30 - 22 Λ 10 - 21 - 1 I ] [ Y 21 k Y 22 k ] = [ I - Λ 30 - 21 Λ 30 - 22 - 1 - Λ 10 - 22 Λ 10 - 21 - 1 I ] [ Λ 10 - 21 Λ 30 - 21 Λ 10 - 22 Λ 30 - 22 ] [ X 10 k X 30 k ] + [ N ~ 21 k N ~ 22 k ] = [ Λ ~ 10 - 21 0 0 Λ ~ 10 - 22 ] [ X 10 k X 30 k ] + [ N ~ 21 k N ~ 22 k ] ( 23 )
where {tilde over (Λ)}10−2110−21−Λ30−21Λ30−22 −1Λ10−22 and {tilde over (Λ)}10−2230−22−Λ10−22Λ10−21 −1Λ30−21. The critical observation to make here is that both {tilde over (Λ)}10−21 and {tilde over (Λ)}10−22 are orthogonal matrices like matrix Λ in equation (10) and, therefore, decoding proceeds as described above for the single unit case, and the full diversity gain is guaranteed for both users. That is, combiner 28 in FIG. 3, which is a modified version of combiner 24 in FIG. 1, first performs the processing called for by equation 23, and then proceeds as described above.

Patent Citations
Cited PatentFiling datePublication dateApplicantTitle
US6519291 *Feb 3, 1998Feb 11, 2003Lucent Technologies Inc.Reduction of interference in discrete multi-tone (DMT) based communications systems
US6560295 *Jul 11, 2000May 6, 2003Hughes Electronics CorporationMethod of generating space-time codes for generalized layered space-time architectures
US6594473 *May 24, 2000Jul 15, 2003Texas Instruments IncorporatedWireless system with transmitter having multiple transmit antennas and combining open loop and closed loop transmit diversities
US6614861 *Dec 29, 1999Sep 2, 2003Nokia Networks OyMethod and apparatus for higher dimensional modulation
US6700926 *Nov 13, 2000Mar 2, 2004Nokia CorporationMethod and apparatus providing bit-to-symbol mapping for space-time codes
US6771706 *Mar 23, 2001Aug 3, 2004Qualcomm IncorporatedMethod and apparatus for utilizing channel state information in a wireless communication system
US6853688 *Dec 30, 2002Feb 8, 2005Cingular Wireless Ii, LlcLow complexity maximum likelihood detection of concatenated space codes for wireless applications
US6882619 *Jan 31, 2002Apr 19, 2005At&T Corp.Interference suppressing OFDM method for wireless communications
US20010040920 *Dec 23, 1997Nov 15, 2001Mohammed NafieTime domain equalizer for adsl
US20020037058 *Apr 23, 2001Mar 28, 2002Koninklijke Philips Electronics N.V.Frequency-domain equalizer for terrestrial digital TV reception
US20020086707 *Apr 20, 2001Jul 4, 2002Struhsaker Paul F.Wireless communication system using block filtering and fast equalization-demodulation and method of operation
US20020136283 *Mar 21, 2001Sep 26, 2002International Business Machines CorporationSystem and method for controlling line driver power in a shared digital subscriber line modem
US20020154705 *Mar 22, 2000Oct 24, 2002Walton Jay R.High efficiency high performance communications system employing multi-carrier modulation
US20040146014 *Jan 13, 2004Jul 29, 2004Hughes Electronics CorporationMethod and constructions for space-time codes for PSK constellations for spatial diversity in multiple-element antenna systems
Non-Patent Citations
Reference
1Kadel, Diversity and Equalization in Frequency Domain-A Robust and Flexible Receiver Technology for Broadband Mobile Communication Systems, VTC, pp. 894-899, May 1997.
2Lindskog et al, A Transmit Diversity Scheme for Delay Spread Channels, ICC, pp. 307-311, Jun. 2000.
3Naguib et al, Application of Space-Time Block Codes and Interference Suppression for High Capacity and High Data Rate Wireless Systems, 32<SUP>nd </SUP>Asllomar Conf. On Signals, System, and Computers, 1803-1810, 1998.
4Z. Liu et al, Decoding and Equalization of Unknown Multipath Channels Based on Block Precoding and Transmit-Antenna Diversity, Asllomar Conf. On Signals, System, and Computers, pp. 1557-1561, 1999.
Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US7583748 *May 27, 2008Sep 1, 2009Naofal Al-DhahirFrequency-domain method for joint equalization and decoding of space-time block codes
Classifications
U.S. Classification375/267, 375/260
International ClassificationH04B7/02
Cooperative ClassificationH04B7/0854, H04B7/0669
European ClassificationH04B7/08C4J2, H04B7/06C2C
Legal Events
DateCodeEventDescription
Sep 23, 2011FPAYFee payment
Year of fee payment: 4