The present invention relates to a transmitter identification system, and in particular to a digital television (DTV) transmitter identification system for identifying the origin of a received DTV signal, which can be used for tuning a distributed-transmission (single-frequency) DTV network, geographic locating, estimating the channel impulse response for a particular transmitter with a very long delay spread capacity, and transmitting robust low bit rate control information to mobile and stationary terminals.
Digital television (DTV) networks are comprised of a plurality of transmitters, each broadcasting the same signal using multiple frequencies or a single frequency (single frequency network). As the number of transmitters grows, there is an increased desire to be able to identify the transmitter of origin for each signal received. Transmitter identification will enable broadcasting authorities to identify illegal or improperly operating transmitters. Moreover, transmitter identification can also be used to tune various transmitters in a single frequency network to minimize the effects of multi-path interference. Multi-path interference is caused by the destructive interference of several different transmissions originating from different transmitters and/or caused by the reflection of transmissions.
U.S. Pat. No. 6,075,823 issued Jun. 13, 2000 to Hideaki Sonoda; U.S. Pat. No. 6,122,015 issued Sep. 19, 2000 to Al-Dhahir et al; U.S. Pat. No. 6,128,337 issued Oct. 3, 2000 to Schipper et al; U.S. Pat. No. 6,304,299 issued Oct. 16, 2001 to Frey et al; U.S. Pat. No. 6,437,832 issued Aug. 20, 2002 to Grabb et al; and U.S. Pat. No. 6,501,804 issued Dec. 31, 2000 issued to Rudolph et al disclose various solutions to overcoming the problem of multi-path interference. In general, the systems disclosed in the aforementioned references compare a transmitted test signal including noise with a reference signal, and construct a filter in accordance with the results of the comparison to remove noise from transmitted digital television signals. Unfortunately, none of the prior art references provide an identification signal for each transmitter, nor do they provide a system for tuning the entire network. Each of the aforementioned systems requires a complicated filtering circuit to be installed in every receiver in the system, which greatly increase the cost to the operator, and therefore the consumer.
An object of the present invention is to overcome the shortcomings of the prior art by providing a transmitter identification system that can be used to identify the transmissions, direct or redirected, from various transmitters.
Another object of the present invention is to provide timing information relating to the transmissions from known transmitters, which can be used to tune the transmitters in a network to minimize the effects of multi-path interference.
Accordingly, the present invention relates to a method of identifying a transmitter in a distributed digital television transmission network, including a plurality of transmitters and a plurality of receivers, comprising the steps of:
a) providing a signal to be transmitted to each transmitter;
b) embedding an identification sequence into the signal, indicative of the transmitter of origin, forming a combined transmission; and
c) transmitting the combined transmission from each transmitter.
The invention will be described in greater detail with reference to the accompanying drawings which represent preferred embodiments thereof, wherein:
a illustrates a cross-correlation function over a single segment;
b illustrates a cross-correlation function averaged over 60 segments;
In accordance with the present invention, the transmitter identification system embeds an identification sequence in the form of a pseudo-random sequence xi(n), selected from a set of orthogonal sequences, in band into each DTV signal di(n) creating a combined transmission di′(n). In practice, the sequences will be truncated and, therefore, not be perfectly orthogonal; however, for the purposes of the invention they will only need to have negligible cross correlation. Accordingly, orthogonal, substantially-orthogonal and having negligible cross correlation will be used interchangeably so as not to limit the scope of protection to perfectly orthogonal.
The process is represented by the equation:
di′(n)=di(n)+ρxi(n) (1)
wherein ρ represents a gain coefficient controlling the embedding level of the identification sequence, which varies from transmitter to transmitter depending on the modulation and channel coding schemes of the individual transmitters. After passing through a transmission channel hi, a transmitted signal ri from the ith transmitter can be formulated as:
ri(n)=di′(n)⊕hi+ni(n) (2)
where ni(n) is the noise for the i-th transmitter.
The overall transmitted signal r(n) can be formulated as:
Identification of a particular transmitter is impossible without additional identification processes. According to the present invention, details of the existence of a specific transmitter and the strength of each transmitted signal ri(n) at the reception site can be determined by calculating correlating functions. For example, the correlation between r(n) and a locally generated identification signal xj(n) can provide identifying information, i.e. existence and strength of the signal, about the j-th transmitter. If a signal from the j-th transmitter is present, i.e. the transmitted signal r(n) contains the identification sequence xi(n) matching the locally generated sequence xj(n), an impulse will appear in the cross correlation function (see
For a single frequency network, in which each transmitter transmits at the same frequency, the signal from each transmitter can be independently tuned, e.g. for power level and relative time delay between transmitters, so that the effects of multi-path interference are minimized in overlap areas, see area 9 in
The cross correlation between r(n) and xj(n) is defined by
With the orthogonal property of the selected sequence, the autocorrelation function Rx
Rrx
where A is a constant determined by Rx
With reference to
Different injection levels of the embedded identification sequence xi are determined for ATSC, DVB-T and ISDB systems, respectively. For ATSC systems, Kasami sequences are buried between 10 dB to 30 dB below the DTV system noise threshold, which causes negligible impact to DTV signal reception.
Preferably, 16-bit Kasami sequences are used as identification sequences for a North American ATSC DTV system. However, Gold sequences and any other suitable substantially-orthogonal pseudo-random sequences may be used. The use of 16-bit Kasami sequence is a compromise of the sequence length, spreading gain and the number of the sequences, which are available for DTV transmitter identification.
The transmitter identification process can be further reduced, if the initial values for the sequence generators only differ in the last few bits for the neighboring transmitters. By assigning different Kasami sequences this way, a blind search approach can be avoided during the transmitter identification process.
Since the 16-bit Kasami sequence is very long and takes a long time to synchronize, it would be advantageous if a smaller portion of the DTV signal could be identified as a starting point, thereby facilitating synchronization. In North America the ATSC DTV field sync. PN-511 sequence, which has high signal strength, can be used as a “short code” for quick detection and synchronization of the Kasami sequence. For DVB-T and ISDB-T systems, in Europe and Japan, the cyclic prefix of the OFDM symbol can be used. Furthermore, rather than correlate the entire Kasami sequence with the received signal, the correlation function can be calculated only between the PN-511 sequence (or the cyclic prefix of the DVB-T and ISDB-T signals) and the received signal.
To reduce the computation complexity during the transmitter identification process, only a desired portion of the correlation functions between the transmitted signal r(n) and the local identification sequence x(n) is computed. For the complete computation of the cross-correlation between the transmitted signal r(n) and the local identification sequence x(n), the following equation can be used:
Rather than conducting the correlation computation continuously in real time, a segment of the transmitted DVB-T, ISDB-T or ATSC DTV signal r(n) can be separated therefrom, each of which contains one complete embedded sequence, for correlation computation.
Upon synchronization of the embedded and locally generated identification sequences, using a PN511 sequence for ATSC signals or a cyclic prefix for DVB-T and ISDB-T signals, the received DTV signal can be divided into segments, each with a length of a DTV field plus two times the delay spread of the channel impulse response. Each segment begins at the starting point of each DTV field minus one delay spread and ends at the stopping point of the DTV field plus one delay spread. A sliding window technique can then be used to select portions of the transmitted signal for calculating the correlation function. The length of the sliding window is identical to one DTV field. As the window slides over the signal segment, the local identification sequence xj(n) is correlated to the received signal portion, which falls into the sliding window.
Time-domain a averaging is a technique used to reduce the in-band ATSC DTV signal interference. Post processing using ensample averaging over several cross-correlation functions can improve the dynamic range of the cross-correlation function, as in
With reference to
R′=Ah+noise (7)
Where h is the ideal impulse response to be estimated and R′ is the correlation function with a truncated length L′.
R′=[R(1), R(2), . . . R(L′)]T (8)
Where A is determined from the side lobe matrix
when noise is Gaussian noise, h can be resolved using:
h=(AHA)−1AHR′ (9)
By inverting the amplitude of the embedded Kasami sequence, one-bit information can be transmitted per Kasami sequence or several Kasami sequences can be used to represent one bit, depending on the injection level of the Kasami sequence. At the receiver, a positive correlation would indicate a ‘1’ and a negative correlation would indicate a ‘0’. This technique can be used to transmit low speed data over the entire DTV coverage area to provide data service or for cue and control.
DVB-T and ISDB-T DTV system transmitters can also can be identified using a 12-bit Kasami sequence. The Kasami sequence should be locked to the FFT block for fast synchronization.
In a distributed transmission environment, if a receiving site can identify more than three transmitters, and the transmitter geographical locations as well as their DTV transmission time delays are known, the receiving location can be calculated from the differences in arrival time of the Kasami sequences. Assuming the receiver already knows the relative position of the various transmitters, as the receiver identifies the transmitter of origin of a given signal, the receiver software will be able to calculate the relative time delay between the various received signals, i.e. direct combined transmissions di′(n). From this information the receiver processor can calculate the position of the receiver relative to the transmitters.
The present application claims priority from U.S. Patent Application No. 60/443,550 filed Jan. 30, 2003.
Number | Name | Date | Kind |
---|---|---|---|
5949796 | Kumar | Sep 1999 | A |
5956373 | Goldston et al. | Sep 1999 | A |
5960048 | Haartsen | Sep 1999 | A |
6075823 | Sonoda | Jun 2000 | A |
6122015 | Al-Dhahir et al. | Sep 2000 | A |
6128337 | Schipper et al. | Oct 2000 | A |
6304299 | Frey et al. | Oct 2001 | B1 |
6393294 | Perez-Breva et al. | May 2002 | B1 |
6417805 | Hershey et al. | Jul 2002 | B1 |
6437832 | Grabb et al. | Aug 2002 | B1 |
6501804 | Rudolph et al. | Dec 2002 | B1 |
6501955 | Durrant et al. | Dec 2002 | B1 |
6727847 | Rabinowitz et al. | Apr 2004 | B2 |
6952182 | Spilker et al. | Oct 2005 | B2 |
7042949 | Omura et al. | May 2006 | B1 |
20030021414 | Nash-Putnam | Jan 2003 | A1 |
20040080454 | Camp | Apr 2004 | A1 |
Number | Date | Country | |
---|---|---|---|
20040187162 A1 | Sep 2004 | US |
Number | Date | Country | |
---|---|---|---|
60443550 | Jan 2003 | US |