# US 2015/0103940 A1 · Training-Based Channel Estimation for Multiple-Antennas

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2015/0103940 A1
- Document ID: US20150103940A1
- Status: Published application
- Kind: A1
- Application number: 14/575,859
- Filed: 2014-12-18
- Published: 2015-04-16
- Earliest claimed: 2001-04-09
- Assignees: AT&T Intellectual Property II, L.P.
- Applicants: AT&T Intellectual Property II, L.P.
- Inventors: Naofal Al-Dhahir; Chrintine Fragouli; William Turin
- Web page: https://patentgrep.com/patent/US20150103940A1

## CPC

- H04B 7/0684: {using different training sequences per antenna}
- H04B 7/0669: {using different channel coding between antennas (space-time coding H04L1/0618)}
- H04B 7/0848: {Joint weighting}
- H04B 7/0882: {using post-detection diversity}
- H04L 1/0618: {Space-time coding}
- H04L 25/0204: {of multiple channels}
- H04B 7/0851: {using training sequences or error signal (minimizing error signal H04B7/0854)}
- H04B 7/0854: {using error minimizing algorithms, e.g. minimum mean squared error [MMSE], "cross-correlation" or matrix inversion}
- H04L 25/03006: {Arrangements for removing intersymbol interference}
- H04B: TRANSMISSION
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## 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 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.

## Claims

### Claim 1

A method comprising:
developing a plurality of symbol streams from an information stream;
mapping symbols of said symbol streams onto a standard constellation to create a plurality of mapped streams;
applying respective ones of the mapped streams to a different one of a plurality of antennas during a first time period;
generating n training sequences from a training sequence, where n is an integer greater than one;
mapping said n training sequences onto the standard constellation to create n mapped training sequences, where said n training sequences have a common length; and
applying respective ones of the n mapped training sequences to a different one of said antennas during a second time period.

### Claim 2 (depends on 1)

The method as recited in claim 1 where said n training symbol sequences have an impulse-like autocorrelation function and zero cross correlation.

### Claim 3 (depends on 1)

The method as recited in claim 1 wherein said training sequence is a sequence s, and generating said n training sequences includes creating a first training sequence that equals −s concatenated with s, and creating a second training sequence that is equal to s concatenated with s.

### Claim 4 (depends on 1)

The method as recited in claim 1 where said training sequence contains Nt/2 symbols, where Nt is related to number of channel parameters, L, that a receiver which seeks to receive signals from one of said antennas of a transmitter estimates.

### Claim 5 (depends on 1)

The method as recited in claim 1 wherein the training sequence is a root sequence composed of Nth roots of unity, where N is a power of 2 integer that is not smaller than L, where L is an integer and corresponds to a number of channel taps of a channel represented by a filter with L channel taps from each of said two antennas to a receiver antenna.

### Claim 6 (depends on 5)

The method as recited in claim 5 wherein said root sequence consists of subsequence d2 that has at least L symbols concatenated to subsequence d1 that has at least L symbols, a first training sequence of said n training sequences is sequence −{tilde over (d)}2* concatenated to sequence d1, where sequence {tilde over (d)}2* corresponds to sequence d2 with its elements in reverse order and each element converted to its complex conjugate; and a second training sequence of said n training sequences is sequence −d1 concatenated to sequence d2.

### Claim 7 (depends on 5)

The method as recited in claim 5 wherein generating said n training sequences includes,
generating a first training sequence as a sequence {tilde over (d)}* concatenated to sequence −d, where sequence d is the root sequence, and sequence {tilde over (d)}* corresponds to sequence d with its elements in reverse order and each element in sequence {tilde over (d)}* is the complex conjugate of its corresponding element in sequence d; and
generating a second training sequence as a sequence d* concatenated to sequence d, where each element in sequence d* is the complex conjugate of its corresponding element in sequence d.

### Claim 8 (depends on 1)

The method of claim 1 where
a first training sequence of said n training sequences is sequence d* concatenated to sequence −d, where sequence d is the root sequence and each element in sequence d* is the complex conjugate of its corresponding element in sequence d; and
a second training sequence of said n training sequences is sequence d* concatenated to sequence {tilde over (d)}, and where sequence {tilde over (d)} corresponds to sequence d with its elements in reverse order.

### Claim 9

A transmitter comprising:
a plurality of transmitting antennas;
a first encoder responsive to an applied information stream, said first encoder developing a plurality of symbol streams;
a constellation mapper responsive to said symbol streams, to map symbols of each of said symbol streams onto a standard signal constellation to create a plurality of mapped streams, said constellation mapper coupled to supply respective ones of the mapped streams to the transmitting antennas;
a training generator to supply to a second encoder a training sequence of symbols;
said second encoder configured to develop n training sequences of symbols using said training sequence, said n training sequences being different; and
said constellation mapper is configured to map said symbols of said n training sequences onto a constellation and is coupled to supply said transmitting antennas respective n mapped training sequences.

### Claim 10 (depends on 9)

The transmitter as recited in claim 9 where said n training sequences have an impulse-like autocorrelation function and zero cross correlation.

### Claim 11 (depends on 9)

The transmitter as recited in claim 9 wherein said training generator creates a sequence s, and said second encoder creates the first training sequence that equals −s concatenated with s, and a second training sequence that is equal to s concatenated with s.

### Claim 12 (depends on 9)

The transmitter as recited in claim 9 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.

### Claim 13 (depends on 9)

The transmitter as recited in claim 9 wherein the training sequence is a root sequence composed of Nth roots of unity, where N is a power of 2 integer that is not smaller than L, where L is an integer and corresponds to a number of channel taps of a channel represented by a filter with L channel taps from each of said two antennas to a receiver antenna.

### Claim 14 (depends on 13)

The transmitter as recited in claim 13 wherein said root sequence consists of subsequence d2 that has at least L symbols concatenated to subsequence d1 that has at least L symbols, a first training sequence of said n training sequences, is sequence −{tilde over (d)}2* concatenated to sequence d1, where sequence {tilde over (d)}2* corresponds to sequence d2 with its elements in reverse order and each element converted to its complex conjugate; and a second training sequence of said n training sequences is sequence −d1 concatenated to sequence d2.

### Claim 15 (depends on 13)

The transmitter as recited in claim 13 wherein,
said training sequence is a root sequence;
a first training sequence of said n training sequences is sequence {tilde over (d)}* concatenated to sequence −d, where sequence d is the root sequence, and sequence {tilde over (d)}* corresponds to sequence d with its elements in reverse order and each element in sequence {tilde over (d)}* is the complex conjugate of its corresponding element in sequence d; and
a second training sequence of said n training sequences is sequence d* concatenated to sequence d, where each element in sequence d* is the complex conjugate of its corresponding element in sequence d.

### Claim 16 (depends on 9)

The transmitter as recited in claim 9 wherein,
said training sequence is a root sequence;
a first training sequence of said n training sequences is sequence d* concatenated to sequence −d, where sequence d is the root sequence and each element in sequence d* is the complex conjugate of its corresponding element in sequence d; and
a second training sequence of said n training is sequence d* concatenated to sequence {tilde over (d)}, and where sequence a corresponds to sequence {tilde over (d)} with its elements in reverse order.
