USRE44827E1 - Training-based channel estimation for multiple-antennas - Google Patents
Training-based channel estimation for multiple-antennas Download PDFInfo
- Publication number
- USRE44827E1 USRE44827E1 US13/846,219 US201313846219A USRE44827E US RE44827 E1 USRE44827 E1 US RE44827E1 US 201313846219 A US201313846219 A US 201313846219A US RE44827 E USRE44827 E US RE44827E
- Authority
- US
- United States
- Prior art keywords
- sequence
- training
- transmitter
- sequences
- symbols
- 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 - Fee Related, expires
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/06—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
- H04B7/0613—Diversity 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/0684—Diversity 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 using different training sequences per antenna
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/06—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
- H04B7/0613—Diversity 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/0667—Diversity 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/0669—Diversity 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/08—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station
- H04B7/0837—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station using pre-detection combining
- H04B7/0842—Weighted combining
- H04B7/0848—Joint weighting
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/08—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station
- H04B7/0882—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station using post-detection diversity
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/02—Arrangements for detecting or preventing errors in the information received by diversity reception
- H04L1/06—Arrangements for detecting or preventing errors in the information received by diversity reception using space diversity
- H04L1/0618—Space-time coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
- H04L25/0202—Channel estimation
- H04L25/0204—Channel estimation of multiple channels
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/08—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station
- H04B7/0837—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station using pre-detection combining
- H04B7/0842—Weighted combining
- H04B7/0848—Joint weighting
- H04B7/0851—Joint weighting using training sequences or error signal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/08—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station
- H04B7/0837—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the receiving station using pre-detection combining
- H04B7/0842—Weighted combining
- H04B7/0848—Joint weighting
- H04B7/0854—Joint weighting using error minimizing algorithms, e.g. minimum mean squared error [MMSE], "cross-correlation" or matrix inversion
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
- H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
- H04L25/03006—Arrangements for removing intersymbol interference
Definitions
- This relates to space-time coding, and more particularly, to channel estimation in space-time coding arrangements.
- STC Space-Time coding
- a key feature of STC is that channel knowledge is not required at the transmitter. While several non-coherent STC schemes have been invented that also do not require channel information at the receiver, they suffer performance penalties relative to coherent techniques. Such non-coherent techniques are therefore more suitable for rapidly fading channels that experience significant variation with the transmission block. However, for quasi static or slowly varying fading channels, training-based channel estimation at the receiver is commonly employed, because it offers better performance.
- Such sequences are the Perfect Roots-of-Unity Sequences (PRUS) that have been proposed in the literature, for example, by W. H. Mow, “Sequence Design for Spread Spectrum,” The Chinese University Press, Chinese University of Hong Kong, 1995.
- the training sequence length, N t determines the smallest possible alphabet size.
- a PRUS of a predetermined length might employ a constellation that is other than a “standard” constellation, where a “standard” constellation is one that has a power of 2 number of symbols.
- Binary phase shift keying (BPSK), quadrature phase shift keying (QPSK), and 8-point phase shift keying (8-PSK) are examples of a standard constellation.
- BPSK Binary phase shift keying
- QPSK quadrature phase shift keying
- 8-PSK 8-point phase shift keying
- a training sequence is needed for each antenna, and ideally, the sequences should be uncorrelated.
- One known way to arrive at such sequences is through an exhaustive search in the sequences space.
- This space can be quite large. For example, when employing two antennas, and a training sequence of 26 symbols for each antenna, this space contains 8 2 ⁇ 26 sequences. For current computational technology, this is a prohibitively large space for exhaustive searching. Reducing the constellation of the training sequence to BPSK (from 8-PSK) reduces the search to 2 2 ⁇ 26 sequences, but that is still quite prohibitively large; and the reduction to a BPSK sequence would increase the achievable mean squared error.
- transmitter 10 that includes information encoder 13 that feeds constellation mapper 14 that drives antennas 11 and 12 via switches 15 and 16 .
- transmitter 10 includes sequence generator 5 followed by constellation mapper 6 that feeds antenna 11 via switch 15 , and sequence generator 7 followed by constellation mapper 8 that feeds antenna 12 via switch 16 .
- a sequence having an impulse-like autocorrelation function is restricted advantageously to a standard constellation (that is used in transmitting information symbols) so a common constellation mapper is used for both the information signals and the training sequence.
- a training sequence is selected so that it is encoded with the same encoder that is used for encoding information symbols. Both block and trellis coding is possible in embodiments that employ this approach.
- FIG. 1 shows a prior art arrangement of a two-antenna transmitter and a one antenna receiver, where training sequences are independently generated for the two transmitting antennas;
- FIG. 2 shows an arrangement where the training sequences employ the same constellation mapper that is employed in mapping space-time encoded information symbols
- FIG. 3 presents a block diagram of an arrangement where a single encoder generates the training sequences for the two transmitter antennas
- FIG. 4 shows one encoding realization for encoder 9 of FIG. 3 ;
- FIG. 5 shows another encoding realization for encoder 9 of FIG. 3 ;
- FIG. 6 presents a block diagram of an arrangement where a single encoder generates both the training sequences and the information symbols for the two transmitter antennas;
- FIG. 7 shows one encoding realization for encoder 9 of FIG. 6 ;
- FIG. 8 shows another encoding realization for encoder 9 of FIG. 6 ;
- FIG. 9 shows yet another encoding realization for encoder 9 of FIG. 6 .
- FIG. 10 shows the constellation of an 8-PSK encoder realization for encoder 9 .
- FIG. 2 shows an arrangement a transmitter with two transmit antennas 11 and 12 that transmits signals s 1 and s 2 , respectively, and a receiver with receive antenna 21 , and channels h 1 (from antenna 11 to antenna 21 ) and h 2 (from antenna 12 to antenna 21 ) therebetween.
- Channels h 1 and h 2 can be expressed as a finite impulse response (FIR) filter with L taps.
- FIR finite impulse response
- z(k) is noise, which is assumed to be AWGN (additive white Gaussian noise).
- the inputs sequences s 1 and s 2 belong to a finite signals constellation and can be assumed, without loss of generality, that they are transmitted in data blocks that consist of N i information symbols and N t training symbols. If N t training symbols are employed to estimate the L taps of a channel in the case of a single antenna, then for a two antenna case such as shown in FIG. 1 , one needs to employ 2N t training symbols to estimate the 2L unknown coefficients (of h 1 and h 2 ).
- y and z are vectors with (N t ⁇ L+1) elements
- S 1 (L,N t ) and S 2 (L,N t ) are convolution matrices of dimension (N t ⁇ L+1) ⁇ L
- h 1 (L) and h 2 (L) are of dimension L ⁇ 1; that is,
- the S matrix is termed the “training matrix” and, as indicated above, it is a convolution matrix that relates to signals received from solely in response to training sequence symbols; i.e., not corrupted by signals sent prior to the sending of the training sequence.
- the minimum MSE, MMSE is equal to
- Equation (8) effectively states that the optimal sequences have an impulse-like autocorrelation function (e.g. S 1 H S corresponds to the identity matrix, I, multiplied by a scalar) and zero cross-correlations.
- N t ′ N t +(n ⁇ 2)L, where n is the number of antennas.
- the task is to create the subsequences s 1 and s 2 from the found sequence s.
- the subsequences s 1 and s 2 can be algorithmically generated from sequence s.
- FIG. 4 presents one approach for generating optimal subsequences s 1 and s 2 that meet the requirements of equation (8) and that can be generated from a single sequence.
- generator 5 develops a sequence s of length N t /2
- s and s 2 s
- antenna 11 transmits the sequence ⁇ s during the first N t /2 time periods, and the sequence s during the last N t /2 time periods.
- Antenna 12 transmits the sequence s during both the first and last N t /2 time periods.
- receiving antenna 21 develops the signal vector y (where the elements of the vector y are the signals received from antennas 11 and 12 ).
- the received signal during the first N t /2 time periods as y 1
- the last N t /2 time periods as y 2
- employing only the useful portion of the signal that is, the portions not corrupted by signals that are not part of the training sequence
- FIG. 4 presents a method for developing sequences s 1 and s 2 of length N t from a sequence s that is N t /2 symbols long
- s 1 d 1
- ⁇ tilde over (d) ⁇ 2 * and s 2 d 2
- the sequence ⁇ tilde over (d) ⁇ 1 corresponds to the sequence d 1 with its elements in reverse order.
- the symbol ⁇ tilde over (d) ⁇ 1 * operation corresponds to the sequence d 1 with its elements in reverse order and converted to their respective complex conjugates.
- FIG. 5 encoding is very similar to the encoding scheme disclosed by Alamouti in U.S. Pat. No. 6,185,258, issued Feb. 6, 2001, except that (a) the Alamouti scheme is symbols-centric whereas the FIG. 5 encoding is sequence-centric, and (b) the Alamouti scheme does not have the concept of a reverse order of a sequence (e.g., ⁇ tilde over (d) ⁇ 1 *). See also E. Lindskog and A. Paulraj titled “A Transmit Diversity Scheme for Channels With Intersymbol Interference,” ICC, 1:307-311, 2000.
- An encoder 9 that is created for developing training sequences s 1 and s 2 in accordance with FIG.
- control terminal 5 can be constructed with a control terminal that is set to 1 during transmission of information and set to another value (e.g., 0, or to N t to indicate the length of the generated block) during transmission of the training sequence, leading to the simplified transmitter realization shown in FIG. 6 . More importantly, such an arrangement leads to a simplified receiver because essentially the same decoder is used for both the information signals and the training signals.
- the signal captured at antenna 21 of receiver 20 is
- the receiver can incorporate the space-time trellis code structure in the channel model to create an equivalent single-input, single output channel, h eq , of length m+L.
- the trellis in such a case, involves C (m+L ⁇ 1) states.
- the approach disclosed herein uses a single training sequence at the input of the space-time trellis encoder to directly estimate h eq used by the joint space-time equalizer/decoder.
- the channel h eq that incorporates the space-time code structure typically has a longer memory than the channel h 1 and h 2 (in a system where there are two transmitting antennas and one receiving antenna).
- s 1 (k) s(k)
- the received signal at time k can be expressed as
- h eq odd [ h 1 ⁇ ( 0 ) , h 1 ⁇ ( 1 ) - h 2 ⁇ ( 0 ) , ⁇ h 1 ⁇ ( 2 ) - h 2 ⁇ ( 1 ) , ... ⁇ ⁇ h 1 ⁇ ( L - 1 ) - h 2 ⁇ ( L - 2 ) , h 2 ⁇ ( L - 1 ) ] .
- channel estimator 22 within receiver 20 can determine the h eq even coefficients from the segment that transmitted only the even constellation symbols, and can determine the h eq odd coefficients from the segment that transmitted only the even constellation symbols. Once both h eq even and h eq even and h eq odd are known, estimator 22 can obtain the coefficients of h 1 from
- sequences s 1 and s 2 of length N t are derived from the sequence s by means of the 8-PSK space-time trellis encoder.
- the search for sequence s is reduced from a search in the of 8 N t to a search for s even in the space 4 (N t /2) such that, when concatenated with s odd that is computed from s even as specified in equation (32), yields a sequence s that has an autocorrelation function that is, or is close to being, impulse-like.
- a root-of-unity sequence with alphabet size N has complex roots of unity elements of the form
- a sequence s of length N t is called L-perfect if the corresponding training matrix S of dimension (N t ⁇ L+1) ⁇ L satisfies equation (8).
- an L-perfect sequence of length N t is optimal for a channel with L taps. It can be shown that the length N t of an L-perfect sequence from a 2 p -alphabet can only be equal to
- N PRUS N PRUS
- N t kN PRUS +L ⁇ 1 and k ⁇ 1.
- an L-perfect sequence of length kN PRUS +L ⁇ 1 can be constructed by selecting an N PRUS sequence, repeating it k times, and circularly extending it by L ⁇ 1 symbols. Restated and amplified somewhat, for a selected PRUS of a given N PRUS , i.e.,
- s p ⁇ ( N PRUS ) [ s p ⁇ ( 0 ) ⁇ s p ⁇ ( 1 ) ⁇ ⁇ ... ⁇ ⁇ s p ⁇ ( N PRUS - 1 ) ] , ( 35 ) the L-perfect sequence of length kN PRUS +L ⁇ 1 is created from a concatenation of k s p (N PRUS ) sequences followed by the first L ⁇ 1 symbols of s p (N PRUS) , or from a concatenation of the last L ⁇ 1 symbols of s p (N PRUS) followed by k s p (N PRUS ) sequences.
- N PRUS N PRUS
- N t kN PRUS +L ⁇ 1+M, where M>0 (37)
- select a value of N PRUS ⁇ L that minimizes M create a sequence of length kN PRUS +L ⁇ 1 as disclosed above, and then extend that sequence by adding M symbols.
- the M added symbols can be found by selecting, through an exhaustive search, the symbols that lead to the lowest estimation MSE.
- N t kN PRUS +L ⁇ 1 ⁇ M′, where M′>0 (38) create a sequence of length kN PRUS +L ⁇ 1 as disclosed above, and then drop the last (or first) M′ symbols.
- the receiver shown in FIG. 2 includes the channel estimator 22 , which takes the received signal and multiplies it S H as appropriate; see equation (12), above.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Power Engineering (AREA)
- Radio Transmission System (AREA)
Abstract
The burden of designing multiple training sequences for systems having multiple transmit antennas, is drastically reduced by employing a single sequence from which the necessary multiple sequences are developed. The single sequence is selected to create sequences that have an impulse-like autocorrelation function and zero cross correlations. A sequence of any desired length Nt can be realized for an arbitrary number of channel taps, L. The created sequences can be restricted to a standard constellation (that is used in transmitting information symbols) so that a common constellation mapper is used for both the information signals and the training sequence. In some applications a a training sequence may be selected so that it is encoded with the same encoder that is used for encoding information symbols. Both block and trellis coding is possible in embodiments that employ this approach.
Description
This application is a reissue of U.S. Pat. No. 7,746,945, which patent was filed Jul. 27, 2005 as application Ser. No. 11/190,403, which is a continuation of U.S. patent application Ser. No. 09/956,648, filed Sep. 20, 2001, now U.S. Pat. No. 6,959,047. This invention also claims priority from, which claims benefit under 35 U.S.C. §119(e) of provisional application No. 60/282,647, filed Apr. 9, 2001.
This relates to space-time coding, and more particularly, to channel estimation in space-time coding arrangements.
Space-Time coding (STC) is a powerful wireless transmission technology that enables joint optimized designs of modulation, coding, and transmit diversity modules on wireless links. A key feature of STC is that channel knowledge is not required at the transmitter. While several non-coherent STC schemes have been invented that also do not require channel information at the receiver, they suffer performance penalties relative to coherent techniques. Such non-coherent techniques are therefore more suitable for rapidly fading channels that experience significant variation with the transmission block. However, for quasi static or slowly varying fading channels, training-based channel estimation at the receiver is commonly employed, because it offers better performance.
For single transmit antenna situations, it is known that a training sequence can be constructed that achieves a channel estimation with minimum mean squared error (optimal sequences) by selecting symbols from an Nth root-of-unit alphabet of symbols ei2πk/N, k=0, 1, 2, . . . (N−1), when the alphabet size N is not constrained. Such sequences are the Perfect Roots-of-Unity Sequences (PRUS) that have been proposed in the literature, for example, by W. H. Mow, “Sequence Design for Spread Spectrum,” The Chinese University Press, Chinese University of Hong Kong, 1995. The training sequence length, Nt, determines the smallest possible alphabet size. Indeed, it has been shown that for any given length Nt, there exists a PRUS with alphabet size N=2 Nt, and that for some values of Nt smaller alphabet sizes are possible. It follows that a PRUS of a predetermined length might employ a constellation that is other than a “standard” constellation, where a “standard” constellation is one that has a power of 2 number of symbols. Binary phase shift keying (BPSK), quadrature phase shift keying (QPSK), and 8-point phase shift keying (8-PSK) are examples of a standard constellation. Most, if not all, STC systems employ standard constellations for the transmission of information.
Another known approach for creating training sequences constrains the training sequence symbols to a specific (standard) constellation, typically, BPSK, QPSK, or 8-PSK in order that the transmitter and receiver implementations would be simpler (a single mapper in the transmitter and an inverse mapper in the receiver—rather than two). In such a case, however, optimal sequences do not exist for all training lengths Nt. Instead, exhaustive searches must be carried out to identify sub-optimal sequences according to some performance criteria. Alas, such searches may be computationally prohibitive. For example, in the third generation TDMA proposal that is considered by the industry, 8-PSK constellation symbols are transmitted in a block that includes 116 information symbols, and 26 training symbols (Nt=26). No optimal training sequence exists for this value of Nt and constellation size and number of channel taps to estimate, L.
When, for example, two transmit antennas are employed, a training sequence is needed for each antenna, and ideally, the sequences should be uncorrelated. One known way to arrive at such sequences is through an exhaustive search in the sequences space. This space can be quite large. For example, when employing two antennas, and a training sequence of 26 symbols for each antenna, this space contains 82×26 sequences. For current computational technology, this is a prohibitively large space for exhaustive searching. Reducing the constellation of the training sequence to BPSK (from 8-PSK) reduces the search to 22×26 sequences, but that is still quite prohibitively large; and the reduction to a BPSK sequence would increase the achievable mean squared error. Moreover, once the two uncorrelated sequences are found, a generator is necessary for each of the sequences, resulting in an arrangement (for a two antenna case) as shown in FIG. 1 , which includes transmitter 10 that includes information encoder 13 that feeds constellation mapper 14 that drives antennas 11 and 12 via switches 15 and 16. To provide training sequences, transmitter 10 includes sequence generator 5 followed by constellation mapper 6 that feeds antenna 11 via switch 15, and sequence generator 7 followed by constellation mapper 8 that feeds antenna 12 via switch 16.
As advance in the art is achieved with an approach that drastically reduces the problem of designing multiple training sequences for systems having multiple transmit antennas, by employing a single sequence from which the necessary multiple sequences are developed. The single sequence is selected to develop the multiple sequences that have impulse-like autocorrelation functions and zero cross correlations. A sequence of any desired length Nt can be realized for an arbitrary number of channel taps, L.
In one approach, a sequence having an impulse-like autocorrelation function is restricted advantageously to a standard constellation (that is used in transmitting information symbols) so a common constellation mapper is used for both the information signals and the training sequence.
In another approach, a training sequence is selected so that it is encoded with the same encoder that is used for encoding information symbols. Both block and trellis coding is possible in embodiments that employ this approach.
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.
where z(k) is noise, which is assumed to be AWGN (additive white Gaussian noise).
The inputs sequences s1 and s2 belong to a finite signals constellation and can be assumed, without loss of generality, that they are transmitted in data blocks that consist of Ni information symbols and Nt training symbols. If Nt training symbols are employed to estimate the L taps of a channel in the case of a single antenna, then for a two antenna case such as shown in FIG. 1 , one needs to employ 2Nt training symbols to estimate the 2L unknown coefficients (of h1 and h2).
When a training sequence of length Nt is transmitted, the first L received signals are corrupted by the preceding symbols. Therefore, the useful portion of the transmitted Nt sequence is from L to Nt. Expressing equation (2) in matrix notation over the useful portion of a transmitted training sequence yields
where y and z are vectors with (Nt−L+1) elements, S1(L,Nt) and S2(L,Nt) are convolution matrices of dimension (Nt−L+1)×L, and h1(L) and h2(L) are of dimension L×1; that is,
If the convolution matrix is to have at least L rows, Nt must be at least 2L−1. In the context of this disclosure, the S matrix is termed the “training matrix” and, as indicated above, it is a convolution matrix that relates to signals received from solely in response to training sequence symbols; i.e., not corrupted by signals sent prior to the sending of the training sequence.
The linear least squared channel estimates, ĥ, assuming S has full column rank, is
where the (●)H and (●)−1 designate the complex-conjugate transpose (Hermitian) and the inverse, respectively. For zero mean noise, the channel estimation mean squared error is defined by
where tr(.) denotes a trace of a matrix. The minimum MSE, MMSE, is equal to
which is achieved if and only if
where I2L is the 2L×2L identity matrix. The sequences s1 and s2 that satisfy equation (8) are optimal sequences. Equation (8) effectively states that the optimal sequences have an impulse-like autocorrelation function (e.g. S1 HS corresponds to the identity matrix, I, multiplied by a scalar) and zero cross-correlations.
A straightforward approach for designing two training sequences of length Nt each is to estimates two L-taps channels (i.e., two channels having L unknowns each, or a total of 2L unknowns) is to design a single training sequence s of length Nt′ (Nt′=Nt+L) that estimates a single channel with L′=2L taps (i.e., a single channel having 2L unknowns). Generalizing, Nt′=Nt+(n−2)L, where n is the number of antennas. One can thus view the received signal as
y=S(L′,Nt′)h(L′)+z (9)
where S is a convolution matrix of dimension (Nt′−L′+1)×L′. Again, for optimality, the imposed requirement is that
y=S(L′,Nt′)h(L′)+z (9)
where S is a convolution matrix of dimension (Nt′−L′+1)×L′. Again, for optimality, the imposed requirement is that
and once the sequence s is found, the task is to create the subsequences s1 and s2 from the found sequence s. Preferably, the subsequences s1 and s2 can be algorithmically generated from sequence s. Conversely, one may find subsequences s1 and s2 that satisfy the requirements of equation (8) and be such that sequence s can be algorithmically generated. This permits the use of a single training signal generator that, through a predetermined algorithm (i.e., coding) develops the subsequences s1 and s2. Both approaches lead to embodiment depicted in
Actually, once we realized that the complexity of the training sequence determination problem can be reduced by focusing on the creation of a single sequence from which a plurality of sequences that meet the requirements of equation (8) can be generated, it became apparent that there is no requirement for s to be longer than s1 and s2.
In response to the training sequences transmitted by antennas 11 and 12, receiving antenna 21 develops the signal vector y (where the elements of the vector y are the signals received from antennas 11 and 12). Considering the received signal during the first Nt/2 time periods as y1 and during the last Nt/2 time periods as y2, and employing only the useful portion of the signal (that is, the portions not corrupted by signals that are not part of the training sequence) one gets
where S is a convolution matrix of dimension (Nt−L+1)×L. In accordance with the principles disclosed herein, the
If the sequence s is such that SHS=(Nt−L+1)IL, then
If the noise is white, then the linear processing at the receiver does not color it, and the channel transfer functions correspond to
with a minimum squared error, MSE, that achieves the lower bound expressed in equation (7); to wit,
The above result can be generalized to allow any matrix U to be used to encode the training sequence, s, so that
as long as UHU=2I for a two antennas case, and UHU=KI for an K antenna case.
Whereas FIG. 4 presents a method for developing sequences s1 and s2 of length Nt from a sequence s that is Nt/2 symbols long, FIG. 5 presents a method for developing sequences s1 and s2 of length Nt from a sequence s that is 2Nt symbols long, which consists of a sequence d1=[s(0) s(1) . . . s(Nt−1)] followed by a sequence d2=[s(0) s(1) . . . s(Nt−1)]. In accordance with this approach, s1=d1|−{tilde over (d)}2* and s2=d2|{tilde over (d)}1*. The sequence {tilde over (d)}1 corresponds to the sequence d1 with its elements in reverse order. The symbol {tilde over (d)}1* operation corresponds to the sequence d1 with its elements in reverse order and converted to their respective complex conjugates.
The FIG. 5 encoding is very similar to the encoding scheme disclosed by Alamouti in U.S. Pat. No. 6,185,258, issued Feb. 6, 2001, except that (a) the Alamouti scheme is symbols-centric whereas the FIG. 5 encoding is sequence-centric, and (b) the Alamouti scheme does not have the concept of a reverse order of a sequence (e.g., {tilde over (d)}1*). See also E. Lindskog and A. Paulraj titled “A Transmit Diversity Scheme for Channels With Intersymbol Interference,” ICC, 1:307-311, 2000. An encoder 9 that is created for developing training sequences s1 and s2 in accordance with FIG. 5 , can be constructed with a control terminal that is set to 1 during transmission of information and set to another value (e.g., 0, or to Nt to indicate the length of the generated block) during transmission of the training sequence, leading to the simplified transmitter realization shown in FIG. 6 . More importantly, such an arrangement leads to a simplified receiver because essentially the same decoder is used for both the information signals and the training signals.
With a signal arrangement as shown in FIG. 5 , the signal captured at antenna 21 of receiver 20 is
where the matrices Di and {tilde over (D)}i (for i=1, 2) are convolution matrices for d1 and {tilde over (d)}1, respectively, of dimension (Nt−L+1)×L. Recalling from equation (8) that MMSE is achieved if and only if DHD has zeros off the diagonal; i.e.,
and identity matrices on the diagonal; i.e.,
Various arrangements that interrelate sequences d1 and d2 can be found that meet the above requirement. By way of example (and not by way of limitation), a number of simple choices satisfy these conditions follow.
(1) (D1*)TD1=(Nt−L+1)IL, {tilde over (D)}1=D1, and D2=D1. To show that equation (21) holds, one may note that {tilde over (D)}2 T{tilde over (D)}2* (the first term in the equation) becomes D1 TD1*, but if (D1*)TD1 is a diagonal matrix then so is {tilde over (D)}2 T{tilde over (D)}2*. Thus, according to this training sequence embodiment, one needs to only identify a sequence d1 that is symmetric about its center, with an impulse-like autocorrelation function, and set d2 equal to d1. This is shown in FIG. 7.
(2) (D1*)TD1=(Nt−L+1)IL, and {tilde over (D)}2=D1. To show that equation (21) holds, one may note that the {tilde over (D)}2 T{tilde over (D)}2* first term in the equation also becomes D1 TD1*. Thus, according to this training sequence embodiment, one needs to only identify a sequence d1 with an impulse-like autocorrelation function, and set d2 equal to {tilde over (d)}1. This is shown in FIG. 8.
(3) (D1*)TD1=(Nt−L+1)IL, and {tilde over (D)}2*=D1. To show that equation (21) holds, one may note that the {tilde over (D)}2 T{tilde over (D)}2* first term in the equation becomes (D1*)TD1. Thus, according to this training sequence embodiment, one needs to only identify a sequence d1 with an impulse-like autocorrelation function, and set d2 equal to {tilde over (d)}1*. This is shown in FIG. 9.
Training Sequences Employing Trellis Coding
(2) (D1*)TD1=(Nt−L+1)IL, and {tilde over (D)}2=D1. To show that equation (21) holds, one may note that the {tilde over (D)}2 T{tilde over (D)}2* first term in the equation also becomes D1 TD1*. Thus, according to this training sequence embodiment, one needs to only identify a sequence d1 with an impulse-like autocorrelation function, and set d2 equal to {tilde over (d)}1. This is shown in FIG. 8.
(3) (D1*)TD1=(Nt−L+1)IL, and {tilde over (D)}2*=D1. To show that equation (21) holds, one may note that the {tilde over (D)}2 T{tilde over (D)}2* first term in the equation becomes (D1*)TD1. Thus, according to this training sequence embodiment, one needs to only identify a sequence d1 with an impulse-like autocorrelation function, and set d2 equal to {tilde over (d)}1*. This is shown in FIG. 9.
Training Sequences Employing Trellis Coding
Consider a trellis code with m memory elements and outputs from a constellation of size C, over a single channel with memory 2 mC(L−1)−1. To perform joint equalization and decoding one needs a product trellis with 2 mC(L−1) states. For a space-time trellis code with m memory elements, n transmit antennas and one receive antenna, over a channel with memory (L−1), one needs a product trellis with 2 mCn(L−1).
The receiver can incorporate the space-time trellis code structure in the channel model to create an equivalent single-input, single output channel, heq, of length m+L. The trellis, in such a case, involves C(m+L−1) states. The approach disclosed herein uses a single training sequence at the input of the space-time trellis encoder to directly estimate heq used by the joint space-time equalizer/decoder. The channel heq that incorporates the space-time code structure typically has a longer memory than the channel h1 and h2 (in a system where there are two transmitting antennas and one receiving antenna).
To illustrate, assume an encoder 30 as depicted in FIG. 10 that employs an 8-PSK constellation of symbols to encode data from a training sequence generator into a sequence s of symbols taken from the set ei2πp k /8, pk=0,1, 2, . . . , 7, where the training sequences s1 and s2 are algorithmically derived within encoder 30 from sequence s. Specifically, assume that s1(k)=s(k), and that s2(k)=(−1)p k−1 s(k−1), which means that s2(k)=s(k−1) when s(k−1) is an even member of the constellation (ei0, eiπ/2, eiπ, and ei3π/2), and s2(k)=−s(k−1) when s(k−1) is an odd member of the constellation.
With such an arrangement, the received signal at time k can be expressed as
A block of received signals (corresponding to the useful portion of the training sequence block) can be expressed in matrix form by
y=Sheq+z (25)
where
and following the principles disclosed above, it can be realized that when the training sequence is properly selected so that SHS is a diagonal matrix, i.e., SHS=(Nt−L)IL+1, an estimate of heq that is, ĥeq, is obtained from
If the training sequence were to comprise only the even constellation symbols, ei2πk/8, k=0, 2, 4, 6, per equation (24), the elements of {tilde over (h)}eq would correspond to
If the training sequence were to comprise only the odd constellation symbols, ei2πk/8, k=1, 3, 5, 7, the elements of {tilde over (h)}eq would correspond to
If the training sequence were to comprise a segment of only even constellation symbols followed by only odd constellation symbols (or vice versa), then
and the coefficients of h2 from
What remains, then, is to create a single training sequence s of length Nt where one half of it (the seven portion) consists of only even constellation symbols (even sub-constellation), and another half of it (the sodd portion) consists of only odd constellation symbols (odd sub-constellation). The sequences s1 and s2 of length Nt are derived from the sequence s by means of the 8-PSK space-time trellis encoder. The sequences s1 and s2 must also meet the requirements of equation (8). Once seven is found, sodd can simply be
sodd=αseven, where α=eiπk/4 for any k=1,3,5, 7. (32)
Therefore, the search for sequence s is reduced from a search in the of 8N
For a training sequence of length Nt=26, with an 8-PSK space-time trellis encoder, we have identified the 12 training sequences specified in Table 1 below.
TABLE 1 | ||
sequence # | α | Se |
1 | exp(i5π/4) | −1 1 1 1 1 −1 −i −1 1 1 −1 1 1 |
2 | exp(i3π/4) | 1 1 −1 1 i i 1 −i i −1 −1 −1 1 |
3 | exp(iπ/4) | 1 −1 −1 −i i −i 1 1 1 −i −1 1 1 |
4 | exp(iπ/4) | 1 −1 −1 −i 1 −1 1 −i −i −i −1 1 1 |
5 | exp(iπ/4) | 1 i 1 1 i −1 −1 i 1 −1 1 i 1 |
6 | exp(i3π/4) | 1 i 1 i −1 −1 1 −1 −1 i 1 i 1 |
7 | exp(i7π/4) | 1 −i 1 1 −i −1 −1 −i 1 −1 1 −i 1 |
8 | exp(i5π/4) | 1 −i 1 −1 i 1 −1 −i 1 1 1 −i 1 |
9 | exp(i3π/4) | −1 1 1 1 −1 −1 −i −1 −1 1 −1 1 1 |
10 | exp(i7π/4) | −1 i −1 −i 1 −i i i 1 i 1−i 1 |
11 | exp(iπ/4) | −1 −i −1 i 1 i −i −i 1−i 1 i 1 |
12 | exp(i3π/4) | −1 −i −1 i −1 i −i −i −1 −i 1 i 1 |
Construction of Training Sequence
While the above-disclosed materials provide a very significant improvement over the prior art, there is still the requirement of selecting a sequence s1 with an impulse-like autocorrelation function. The following discloses one approach for identifying such a sequence without having to perform an exhaustive search.
A root-of-unity sequence with alphabet size N has complex roots of unity elements of the form
As indicated above, the prior art has shown that perfect roots-of-unity sequences (PRUS) can be found for any training sequence of length Nt, as long as no constraint is imposed on the value of N. As also indicated above, however, it is considered disadvantageous to not limit N to a power of 2. Table 2 presents the number of PRUSs that were found to exist (through exhaustive search) for different sequence lengths when the N is restricted to 2 (BPSK), 4 (QPSK), or 8 (8-PSK). Cell entries in Table 2 with “-” indicate that sequence does not exist, and blank cells indicate that an exhaustive search for a sequence was not performed.
TABLE 2 | |
Nt = |
2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | |
BPSK | — | — | 8 | — | — | — | — | — | — | — | — | — | — | — | — | — | — |
|
8 | — | 32 | — | — | — | 128 | — | — | — | — | — | — | — | 6144 | — | — |
8- |
16 | — | 128 | — | — | — | 512 | — | — | — | — | — | |||||
A sequence s of length Nt is called L-perfect if the corresponding training matrix S of dimension (Nt−L+1)×L satisfies equation (8). Thus, an L-perfect sequence of length Nt is optimal for a channel with L taps. It can be shown that the length Nt of an L-perfect sequence from a 2p-alphabet can only be equal to
which is a necessary, but not sufficient, condition for L-perfect sequences of length Nt. Table 3 shows the minimum necessary Nt for L=2, 3, . . . 10, the size of the corresponding matrix S, and the results of an exhaustive search for L-perfect sequences (indicating the number of such sequences that were found). Cell entries marked “x” indicate that sequences exist, but number of such sequences it is not known.
TABLE 3 | |
|
2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | |
Nt | 3 | 6 | 7 | 10 | 11 | 14 | 15 | 18 | 19 |
|
2 × 2 | 4 × 3 | 4 × 4 | 6 × 5 | 6 × 6 | 8 × 7 | 8 × 8 | 10 × 9 | 10 × 10 |
BPSK | 4 | 8 | 8 | — | — | — | — | — | — |
|
16 | 64 | 64 | — | — | 128 | x | ||
8-PSK | 64 | 512 | 512 | x | x | ||||
It is known that with a PRUS of a given length, NPRUS, one can estimate up to L=NPRUS unknowns. It can be shown that a training sequence of length Nt is also an L-perfect training sequence if
Nt=kNPRUS+L−1 and k≧1. (34)
Accordingly, an L-perfect sequence of length kNPRUS+L−1 can be constructed by selecting an NPRUSsequence, repeating it k times, and circularly extending it by L−1 symbols. Restated and amplified somewhat, for a selected PRUS of a given NPRUS, i.e.,
Nt=kNPRUS+L−1 and k≧1. (34)
Accordingly, an L-perfect sequence of length kNPRUS+L−1 can be constructed by selecting an NPRUSsequence, repeating it k times, and circularly extending it by L−1 symbols. Restated and amplified somewhat, for a selected PRUS of a given NPRUS, i.e.,
the L-perfect sequence of length kNPRUS+L−1 is created from a concatenation of k sp(NPRUS) sequences followed by the first L−1 symbols of sp(NPRUS), or from a concatenation of the last L−1 symbols of sp(NPRUS) followed by k sp(NPRUS) sequences.
To illustrate, assume that the number of channel “taps” that need to be estimated, L, is 5, and that a QPSK alphabet is desired to be used. From the above it is known that NPRUS must be equal to or greater than 5, and from Table 2 it is known that the smallest NPRUS that can be found for QSPK that is larger than 5 is NPRUS=8. Employing equation (34) yields
While an L-perfect training sequence cannot be constructed from PRUS sequences for values of Nt other than values derived by operation of equation (34), it is known that, nevertheless, L-perfect sequences may exist. The only problem is that it may be prohibitively difficult to find them. However, in accordance with the approach disclosed below, sub-optimal solutions are possible to create quite easily.
If it is given that the training sequence is Nt long, one can express this length by
Nt=kNPRUS+L−1+M, where M>0 (37)
In accord with our approach, select a value of NPRUS≧L that minimizes M, create a sequence of length kNPRUS+L−1 as disclosed above, and then extend that sequence by adding M symbols. The M added symbols can be found by selecting, through an exhaustive search, the symbols that lead to the lowest estimation MSE. Alternatively, select a value of NPRUS≧L that minimizes M′ in the equation,
Nt=kNPRUS+L−1−M′, where M′>0 (38)
create a sequence of length kNPRUS+L−1 as disclosed above, and then drop the last (or first) M′ symbols.
Nt=kNPRUS+L−1+M, where M>0 (37)
In accord with our approach, select a value of NPRUS≧L that minimizes M, create a sequence of length kNPRUS+L−1 as disclosed above, and then extend that sequence by adding M symbols. The M added symbols can be found by selecting, through an exhaustive search, the symbols that lead to the lowest estimation MSE. Alternatively, select a value of NPRUS≧L that minimizes M′ in the equation,
Nt=kNPRUS+L−1−M′, where M′>0 (38)
create a sequence of length kNPRUS+L−1 as disclosed above, and then drop the last (or first) M′ symbols.
The receiver shown in FIG. 2 includes the channel estimator 22, which takes the received signal and multiplies it SH as appropriate; see equation (12), above.
Claims (18)
1. A space-time diversity transmitter that includes (a) n transmitting antennas, where n is greater than one, (b) first encoder responsive to an applied information bit stream, said encoder developing n symbol streams, and (c) a constellation mapper responsive to said n symbol streams, for mapping symbols of each of said n symbol streams into a standard signal constellation to create a corresponding mapped stream, said constellation mapper applying each of the created n mapped streams to a different one of said n antennas in blocks of Nt mapped symbols that are synchronized in time to each other, the improvement comprising:
a training generator for generating either n sequences of signals or a sequence of signals that contains n subsequences of signal;
a second encoder for creating n training symbol sequences from said signals created by said training generator, each containing Nt symbols, where Nt represents a training sequence length; and
said constellation mapper is configured to map said n training symbol sequences onto a standard constellation to develop n mapped training sequences, and to apply the n mapped training sequences to said n antennas at times when said constellation mapper stops applying said n mapped stream to said n antennas;
where said n training symbol sequences have an impulse-like autocorrelation function and zero cross correlation.
2. The transmitter of claim 1 where said n training symbol sequences are selected to enable a receiver that receives said n training symbol sequences to determine characteristics of a medium through which said n antennas communicate to said receiver.
3. The transmitter of claim 2 where said n training sequences have a common length Nt that is related to transmitted symbols memory, L−1, of said medium, Nt being at least equal to 2L−1.
4. The transmitter of claim 1 where said constellation mapper employs a constellation taken from a set that includes binary phase shift keying (BPSK), quadrature phase shift keying (QPSK), and 8-point phase shift keying (8-PSK).
5. The transmitter of claim 1 where n=2, said generator creates a sequence s composed of sequence d1 followed by sequence d2, and said second encoder creates a first training sequence that is −d1 concatenated with {tilde over (d)}2*, and a second sequence that is d2 concatenated with d1* where {tilde over (d)}2* corresponds to the sequence d2 with its elements in reverse order and converted to their respective complex conjugates, and the sequence d1* corresponds to the sequence d1 with its elements converted to their complex conjugate values.
6. The transmitter of claim 5 where said sequence d1 and said sequence d2 contain Nt/2 Nt symbols each, where Nt is related to number of channel parameters, L, that a receiver which seeks to receive signals from an antenna of said transmitter estimates.
7. The transmitter of claim 1 where n=2, said generator creates a sequence d, and said second encoder creates a first training sequence that is −d concatenated with {tilde over (d)}*, and a second sequence that is d concatenated with d*, where the sequence d* corresponds to the sequence d with its elements converted to their complex conjugate values and the sequence {tilde over (d)}* corresponds to the sequence d with its elements in reverse order and converted to their respective complex conjugate values.
8. The transmitter of claim 1 where n2 n=2, said generator creates a sequence d, and said second encoder creates a first training sequence that is −d concatenated with {tilde over (d)}*, and a second sequence that is {tilde over (d)} concatenated with d*, where the sequence d* corresponds to the sequence d with its elements converted to their complex conjugate values and the sequence {tilde over (d)}* corresponds to the sequence d with its elements in reverse order and converted to their respective complex conjugate values.
9. The transmitter of claim 1 where n=2, said generator creates a sequence d, and said second encoder creates a first training sequence that is −d concatenated with d, and a second sequence that is {tilde over (d)}* concatenated with d*, where the sequence d* corresponds to the sequence d with its elements converted to their complex conjugate values and the sequence {tilde over (d)}* corresponds to the sequence d with its elements in reverse order and converted to their respective complex conjugate values.
10. The transmitter of claim 1 where said first encoder and said second encoder embodied in a single module that creates either said n symbol streams or said n training symbol sequences.
11. The transmitter of claim 1 where said second encoder is a trellis encoder.
12. The transmitter of claim 11 where
(a) said n training sequences are selected to enable a receiver that receives said n training sequences to determine characteristics of a transmission medium between said transmitter and said receiver, and
(b) said generator develops said symbols sequence to comprise Nt+(n−2)L+m symbols long, where L is the number of channel parameters that describe a channel within said transmission medium from one of said n transmitter antennas to a receiving antenna of said receiver, m is number of symbols stored in a memory of said trellis encoder, and Nt is not less than 2L−1.
13. The transmitter of claim 11 where said training sequence mapper employs symbols from a set composed of elements ei2πp k /8, pk=0,1,2, . . . , 7.
14. The transmitter of claim 13 where said generator develops a symbols sequence s(k), and said second encoder develops a first sequence s1 (k)=s(k), and a second sequence s2(k)=(−1)p k−1 s(k−1).
15. The transmitter of claim 14 where said sequence s(k) is composed of a first segment, seven, that comprises symbols from a set composed of ei2πp k /8, pk=0, 2, 4, 6, and a second segment, sodd, where sodd=αseven, and α=eiπk/4 for any k=1, 3, 5, 7.
16. The transmitter of claim 15 where said seven, and a corresponding α are any one of the following:
17. A space-time diversity transmitter that includes (a) n transmitting antennas, where n is greater than one, (b) first encoder responsive to an applied information bit stream, said encoder developing n symbol streams, and (c) a constellation mapper responsive to said n symbol streams, for mapping symbols of each of said n symbol streams into a standard signal constellation to create a corresponding mapped stream, said constellation mapper applying each of the created n mapped streams to a different one of said n antennas in blocks of Nt mapped symbols that are synchronized in time to each other, the improvement comprising:
a training generator for generating either n sequences of signals or a sequence of signals that contains n subsequences of signal;
a second encoder for creating n training symbol sequences from said signals created by said training generator, each containing Nt symbols, where Nt represents a training sequence length; and
said constellation mapper is configured to map said n training sequences onto a standard constellation to develop n mapped training sequences, and to apply the n mapped training sequences to said n antennas at times when said constellation mapper stops applying said n mapped stream to said n antennas;
where said n training sequences have an impulse-like autocorrelation function and zero cross correlation, and where n2 n=2, said generator creates a sequence s, and said second encoder creates a first training sequence that is equal to −s concatenated with s, and a second training sequence that is equal to s concatenated with s.
18. The transmitter of claim 17 where said sequence s contains Nt/2 symbols, where Nt is related to number of channel parameters, L, that a receiver which seeks to receive signals from an antenna of said transmitter estimates.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US13/846,219 USRE44827E1 (en) | 2001-04-09 | 2013-03-18 | Training-based channel estimation for multiple-antennas |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US28264701P | 2001-04-09 | 2001-04-09 | |
US09/956,648 US6959047B1 (en) | 2001-04-09 | 2001-09-20 | Training-based channel estimation for multiple-antennas |
US11/190,403 US7746945B2 (en) | 2001-04-09 | 2005-07-27 | Training-based channel estimation for multiple-antennas |
US13/846,219 USRE44827E1 (en) | 2001-04-09 | 2013-03-18 | Training-based channel estimation for multiple-antennas |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/190,403 Reissue US7746945B2 (en) | 2001-04-09 | 2005-07-27 | Training-based channel estimation for multiple-antennas |
Publications (1)
Publication Number | Publication Date |
---|---|
USRE44827E1 true USRE44827E1 (en) | 2014-04-08 |
Family
ID=42667072
Family Applications (5)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/956,648 Expired - Lifetime US6959047B1 (en) | 2001-04-09 | 2001-09-20 | Training-based channel estimation for multiple-antennas |
US11/190,403 Ceased US7746945B2 (en) | 2001-04-09 | 2005-07-27 | Training-based channel estimation for multiple-antennas |
US12/777,421 Expired - Fee Related US8942335B2 (en) | 2001-04-09 | 2010-05-11 | Training-based channel estimation for multiple-antennas |
US13/846,219 Expired - Fee Related USRE44827E1 (en) | 2001-04-09 | 2013-03-18 | Training-based channel estimation for multiple-antennas |
US14/575,859 Expired - Fee Related US9264122B2 (en) | 2001-04-09 | 2014-12-18 | Training-based channel estimation for multiple-antennas |
Family Applications Before (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/956,648 Expired - Lifetime US6959047B1 (en) | 2001-04-09 | 2001-09-20 | Training-based channel estimation for multiple-antennas |
US11/190,403 Ceased US7746945B2 (en) | 2001-04-09 | 2005-07-27 | Training-based channel estimation for multiple-antennas |
US12/777,421 Expired - Fee Related US8942335B2 (en) | 2001-04-09 | 2010-05-11 | Training-based channel estimation for multiple-antennas |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US14/575,859 Expired - Fee Related US9264122B2 (en) | 2001-04-09 | 2014-12-18 | Training-based channel estimation for multiple-antennas |
Country Status (1)
Country | Link |
---|---|
US (5) | US6959047B1 (en) |
Families Citing this family (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7342875B2 (en) * | 2000-11-06 | 2008-03-11 | The Directv Group, Inc. | Space-time coded OFDM system for MMDS applications |
US7471734B2 (en) * | 2001-04-26 | 2008-12-30 | Motorola, Inc. | Space-time transmit diversity scheme for time-dispersive propagation media |
US7593357B2 (en) * | 2002-03-28 | 2009-09-22 | Interdigital Technology Corporation | Transmit processing using receiver functions |
CN1170374C (en) * | 2002-06-20 | 2004-10-06 | 大唐移动通信设备有限公司 | Space-time compilation code method suitable for frequency selective fading channels |
US7272108B2 (en) * | 2002-08-01 | 2007-09-18 | Mediatek, Inc. | Channel estimation in orthogonal frequency-division multiplexing (OFDM) systems |
US20060083332A1 (en) * | 2002-12-30 | 2006-04-20 | Koninklijke Philips Electronics, N.V. | Apparatus enabled for optimizing spectral efficiency of a wireless link |
US7688902B1 (en) * | 2003-04-16 | 2010-03-30 | Marvell International Ltd. | Joint space-time block decoding and viterbi decoding |
US7039369B2 (en) * | 2003-10-31 | 2006-05-02 | Mitsubishi Electric Research Laboratories, Inc. | Transmit diversity gain for wireless communications networks |
US8045599B2 (en) | 2005-02-17 | 2011-10-25 | Sony Corporation | Selection of training sequences for multiple-in multiple-out transmissions |
US8249513B2 (en) * | 2007-08-13 | 2012-08-21 | Samsung Electronics Co., Ltd. | System and method for training different types of directional antennas that adapts the training sequence length to the number of antennas |
GB2458323B (en) * | 2008-03-14 | 2010-11-17 | Toshiba Res Europ Ltd | Wireless communications apparatus |
US8417191B2 (en) | 2008-03-17 | 2013-04-09 | Samsung Electronics Co., Ltd. | Method and system for beamforming communication in high throughput wireless communication systems |
US8478204B2 (en) | 2008-07-14 | 2013-07-02 | Samsung Electronics Co., Ltd. | System and method for antenna training of beamforming vectors having reuse of directional information |
DE102008033553B4 (en) * | 2008-07-17 | 2012-03-08 | Rohde & Schwarz Gmbh & Co. Kg | Decode Alamouti-encoded WiMax signals |
US9215001B2 (en) * | 2012-09-24 | 2015-12-15 | Telefonaktiebolaget L M Ericsson (Publ) | Prefiltering in MIMO receiver |
US10033513B2 (en) * | 2015-02-09 | 2018-07-24 | Huawei Technologies Co., Ltd. | Channel impulse response estimation for full-duplex communication networks |
US10211893B2 (en) * | 2015-04-17 | 2019-02-19 | Qualcomm Incorporated | Efficient channel estimation using Golay sequences |
CN107404346A (en) * | 2016-05-18 | 2017-11-28 | 北京信威通信技术股份有限公司 | A kind of reception signal detection method and system |
Citations (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5914982A (en) * | 1997-06-13 | 1999-06-22 | Rockwell Semiconductor Systems, Inc. | Method and apparatus for training linear equalizers in a PCM modem |
US20020067309A1 (en) | 2000-12-02 | 2002-06-06 | Koninklijke Philips Electronics N.V. | Radio communication system |
US6424679B1 (en) | 1998-10-07 | 2002-07-23 | Texas Instruments Incorporated | Space time block coded transmit antenna diversity for WCDMA |
US20040013211A1 (en) * | 2000-04-14 | 2004-01-22 | Lindskog Erik D. | Time-reversal block transmit diversity system for channels with intersymbol interference and method |
US6788661B1 (en) | 1999-11-12 | 2004-09-07 | Nikia Networks Oy | Adaptive beam-time coding method and apparatus |
US6865237B1 (en) * | 2000-02-22 | 2005-03-08 | Nokia Mobile Phones Limited | Method and system for digital signal transmission |
US6891897B1 (en) * | 1999-07-23 | 2005-05-10 | Nortel Networks Limited | Space-time coding and channel estimation scheme, arrangement and method |
US20050157684A1 (en) | 2000-06-02 | 2005-07-21 | Nokia Networks Oy | Closed loop feedback system for improved down link performance |
US20050185734A1 (en) * | 2000-02-22 | 2005-08-25 | Ari Hottinen | Method and radio system for digital signal transmission using complex space-time codes |
US7006579B2 (en) | 2000-09-29 | 2006-02-28 | Nokia Corporation | ISI-robust slot formats for non-orthogonal-based space-time block codes |
US7701916B2 (en) | 1999-02-25 | 2010-04-20 | Texas Instruments Incorporated | Space time transmit diversity for TDD with cyclic prefix midamble |
Family Cites Families (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5642379A (en) * | 1993-06-14 | 1997-06-24 | Paradyne Corporation | Technique for modulating orthogonal signals with one or more analog or digital signals |
US5666378A (en) * | 1994-03-18 | 1997-09-09 | Glenayre Electronics, Inc. | High performance modem using pilot symbols for equalization and frame synchronization |
AU4238697A (en) * | 1996-08-29 | 1998-03-19 | Cisco Technology, Inc. | Spatio-temporal processing for communication |
US6741643B1 (en) * | 1998-04-15 | 2004-05-25 | Telecommunications Research Laboratories | Asymmetric equalization system for data transmission |
US6205127B1 (en) * | 1998-04-21 | 2001-03-20 | Lucent Technologies, Inc. | Wireless telecommunications system that mitigates the effect of multipath fading |
DE69909589T2 (en) * | 1999-04-12 | 2004-06-03 | Sony International (Europe) Gmbh | Communication device and method for distinguishing between different data brushes in a digital telecommunications system |
US6922447B1 (en) * | 2000-05-17 | 2005-07-26 | Nokia Corporation | Apparatus, and associated method, for forming a signal exhibiting space-time redundancy |
US6369758B1 (en) * | 2000-11-01 | 2002-04-09 | Unique Broadband Systems, Inc. | Adaptive antenna array for mobile communication |
US20020111142A1 (en) * | 2000-12-18 | 2002-08-15 | Klimovitch Gleb V. | System, apparatus, and method of estimating multiple-input multiple-output wireless channel with compensation for phase noise and frequency offset |
-
2001
- 2001-09-20 US US09/956,648 patent/US6959047B1/en not_active Expired - Lifetime
-
2005
- 2005-07-27 US US11/190,403 patent/US7746945B2/en not_active Ceased
-
2010
- 2010-05-11 US US12/777,421 patent/US8942335B2/en not_active Expired - Fee Related
-
2013
- 2013-03-18 US US13/846,219 patent/USRE44827E1/en not_active Expired - Fee Related
-
2014
- 2014-12-18 US US14/575,859 patent/US9264122B2/en not_active Expired - Fee Related
Patent Citations (21)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5949819A (en) * | 1997-06-13 | 1999-09-07 | Conexant Systems, Inc. | Method and apparatus for training linear equalizers in a PCM modem |
USRE39165E1 (en) * | 1997-06-13 | 2006-07-11 | Pctel, Inc. | Method and apparatus for training linear equalizers in a PCM modem |
US5914982A (en) * | 1997-06-13 | 1999-06-22 | Rockwell Semiconductor Systems, Inc. | Method and apparatus for training linear equalizers in a PCM modem |
US7366266B2 (en) | 1998-10-07 | 2008-04-29 | Texas Instruments Incorporated | Space time block coded transmit antenna diversity for WCDMA |
US6424679B1 (en) | 1998-10-07 | 2002-07-23 | Texas Instruments Incorporated | Space time block coded transmit antenna diversity for WCDMA |
US6449314B1 (en) | 1998-10-07 | 2002-09-10 | Texas Instruments Incorporated | Space time block coded transmit antenna diversity for WCDMA |
US6643338B1 (en) | 1998-10-07 | 2003-11-04 | Texas Instruments Incorporated | Space time block coded transmit antenna diversity for WCDMA |
US7200182B2 (en) | 1998-10-07 | 2007-04-03 | Texas Instruments Incorporated | Space time block coded transmit antenna diversity for WCDMA |
US7613259B2 (en) | 1998-10-07 | 2009-11-03 | Texas Instruments Incorporated | Mobile receiver phase correction circuit |
US7701916B2 (en) | 1999-02-25 | 2010-04-20 | Texas Instruments Incorporated | Space time transmit diversity for TDD with cyclic prefix midamble |
US6891897B1 (en) * | 1999-07-23 | 2005-05-10 | Nortel Networks Limited | Space-time coding and channel estimation scheme, arrangement and method |
US6788661B1 (en) | 1999-11-12 | 2004-09-07 | Nikia Networks Oy | Adaptive beam-time coding method and apparatus |
US6865237B1 (en) * | 2000-02-22 | 2005-03-08 | Nokia Mobile Phones Limited | Method and system for digital signal transmission |
US20050185734A1 (en) * | 2000-02-22 | 2005-08-25 | Ari Hottinen | Method and radio system for digital signal transmission using complex space-time codes |
US20040013211A1 (en) * | 2000-04-14 | 2004-01-22 | Lindskog Erik D. | Time-reversal block transmit diversity system for channels with intersymbol interference and method |
US7272192B2 (en) | 2000-04-14 | 2007-09-18 | Board Of Trustees Of The Leland Stanford Junior University | Time-reversal block transmit diversity system for channels with intersymbol interference and method |
US20050157684A1 (en) | 2000-06-02 | 2005-07-21 | Nokia Networks Oy | Closed loop feedback system for improved down link performance |
US7139324B1 (en) | 2000-06-02 | 2006-11-21 | Nokia Networks Oy | Closed loop feedback system for improved down link performance |
US20050157683A1 (en) | 2000-06-02 | 2005-07-21 | Nokia Networks Oy | Closed loop feedback system for improved down link performance |
US7006579B2 (en) | 2000-09-29 | 2006-02-28 | Nokia Corporation | ISI-robust slot formats for non-orthogonal-based space-time block codes |
US20020067309A1 (en) | 2000-12-02 | 2002-06-06 | Koninklijke Philips Electronics N.V. | Radio communication system |
Non-Patent Citations (3)
Title |
---|
E Lindskog et al, A Transmit Diversity Scheme for Channels With Intersymbol Interferecne, ICC, 1:307-311, 2000. |
Geng, J. et al., "Optimal Space-Time Block Codes for CDMA Systems," Proceedings of 21st Century Military Communications Conference, vol. 1, Oct. 22-25, 2000, pp. 387-391. |
Naguib, A.F., et al., "A Space-Time Coding Modem for High-Data-Rate Wireless Communications," IEEE Journal on Selected Areas in Communications, vol. 16, issue 8, Oct. 1998, pp. 1459-1478. |
Also Published As
Publication number | Publication date |
---|---|
US7746945B2 (en) | 2010-06-29 |
US20050265478A1 (en) | 2005-12-01 |
US9264122B2 (en) | 2016-02-16 |
US20100220803A1 (en) | 2010-09-02 |
US6959047B1 (en) | 2005-10-25 |
US8942335B2 (en) | 2015-01-27 |
US20150103940A1 (en) | 2015-04-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
USRE44827E1 (en) | Training-based channel estimation for multiple-antennas | |
US7668255B1 (en) | Creating training sequences for space-time diversity arrangements | |
JP4845738B2 (en) | Multi-antenna transmission method of linear precoded signal, corresponding device, signal, and reception method | |
US7672389B2 (en) | Method for transmitting symbols through at least a communication channel | |
US20070014377A1 (en) | Data communication with embedded pilot information for timely channel estimation | |
KR100706634B1 (en) | Multi-input multi-output system having enhanced performance | |
US7469018B2 (en) | Apparatus, and associated method, for forming a signal exhibiting space-time redundancy | |
JP5414967B2 (en) | Overlay training for communication using multiple antennas | |
US7839810B2 (en) | Transmitter, communication system and communication method | |
KR100671231B1 (en) | APPARATUS AND METHOD OF SPACE TIME BLOCK CODE FOR even TX ANTENNAS WITH FULL RATE AND FULL DIVERSITY | |
US7173976B1 (en) | Frequency-domain method for joint equalization and decoding of space-time block codes | |
US6741658B1 (en) | Apparatus, and associated method, for forming a signal for communication upon a fading channel | |
US6587515B1 (en) | Differential transmitter diversity technique for wireless communications | |
Badic et al. | Adaptive Channel‐Matched Extended Alamouti Space‐Time Code Exploiting Partial Feedback | |
US8094757B2 (en) | Apparatus, and associated method, for detecting values of a space-time block code using selective decision-feedback detection | |
US8699554B2 (en) | Scaling to reduce wireless signal detection complexity | |
US7379508B1 (en) | Frequency-domain method for joint equalization and decoding of space-time block codes | |
US7164729B2 (en) | Differential transmitter diversity technique for wireless communications | |
US6603809B1 (en) | Apparatus, and associated method, for forming a signal for communication upon a fading channel | |
WO2001050671A1 (en) | Space-time code design for fading channels | |
EP1330879A2 (en) | Apparatus, and associated method, for forming a signal exhibiting space-time redundancy | |
Wavegedara et al. | Space-time coded uplink transmission with decision feedback sequence estimation. | |
Chen | Space-time coding for frequency-selective fading channels | |
KR20090030941A (en) | Apparatus and method for transmitting/receiving data in a communication system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
FEPP | Fee payment procedure |
Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 8TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1552) Year of fee payment: 8 |
|
FEPP | Fee payment procedure |
Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
LAPS | Lapse for failure to pay maintenance fees |
Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |