Embodiments of the invention relate generally to digital communication systems and methods, and particularly to digital television receivers.
In 1996, the Advanced Television Systems Committee, Inc. (“ATSC”) adopted an ATSC digital television (“DTV”) terrestrial transmission standard. Several generations of receivers have been developed since adoption of the ATSC DTV standard. Generally, each generation of receivers was developed to improve reception performance over previous generations of receivers. A main impediment to good reception is severe multipath interference. Hence, complicated equalizers were developed for receivers in order to improve receiver performance by mitigating the effects of the multipath interference.
Terrestrial broadcast DTV channel presents quite a difficult multipath environment. Relatively strong duplicates of the transmitted signal may arrive at a receiver via various reflected signal paths as well as via the direct path from transmitter to receiver. In some cases, there is no direct path from transmitter to receiver, and all received signal paths are via reflection. If the path carrying the strongest signal is regarded as the main signal path, reflected signals may arrive at the receiver both prior to or subsequent to the main signal. The arrival time differences among various signal paths, compared to that of the main signal path, can be large. Also, these reflected signals may vary in time, both in terms of amplitude and delay relative to the main signal path.
During a typical transmission, data is transmitted in frames 100 as shown in
The remaining 312 segments of each field 104, 108 are referred to as data segments. An exemplary data segment 300 is shown in
A modulator 428 then implements root raised cosine pulse shaping and modulates the signal for RF transmission as an 8VSB signal at a symbol rate of 10.76 MHz. The 8VSB signal differs from other commonly used linear modulation methods such as quadrature amplitude modulation (“QAM”) in that the 8VSB symbols are real, but have a pulse shape that is complex with only the real part of the pulse having a Nyquist shape.
The multipath RF channel between the transmitter 400 and the receiver 500 can be viewed in its baseband equivalent form. For example, the transmitted signal has a root raised cosine spectrum with a nominal bandwidth of 5.38 MHz and an excess bandwidth of 11.5% centered at one fourth of the symbol rate (i.e., 2.69 MHz). Thus, the transmitted pulse shape or pulse q(t) is complex and given by EQN. (1):
q(t)=ejπF
where Fs is a symbol frequency, and qRRC(t) is a real square root raised cosine pulse with an excess bandwidth of 11.5% of the multipath RF channel. The pulse q(t) is referred to as a “complex root raised cosine pulse.” For an 8VSB system, the transmitted pulse shape q(t) and the received and matched filter pulse shape q*(−t) are identical since q(t) is conjugate-symmetric. Thus, the raised cosine pulse p(t), referred to as the “complex raised cosine pulse,” is given by EQN. (2):
p(t)=q(t)*q*(−t) (2)
where * denotes convolution, and * denotes complex conjugation.
The transmitted baseband signal with a data rate of 1/T symbols/sec can be represented by EQN. (3):
where {IkεA≡{α1, . . . α8}⊂R1} is a transmitted data sequence, which is a discrete 8-ary sequence taking values of the real 8-ary alphabet A. For 8VSB, the alphabet set is {−7, −5, −3, −1, +1, +3, +5, +7}.
A physical channel between the transmitter 400 and the receiver 500 is denoted c(t) and can be described by
where {ck(τ)}⊂C1, and Lha and Lhc are the maximum number of anti-causal and causal multipath delays, respectively. Constant τk is a multipath delay, and variable δ(t) is a Dirac delta function. Hence, the overall channel impulse response is given by EQN. (5):
The matched filter output y(t) in the receiver prior to equalization is given by EQN. (6):
where v(t) is given by EQN. (7):
v(t)=η(t)*q*(−t) (7)
which denotes a complex or colored noise process after the pulse matched filter, with η(t) being a zero-mean white Gaussian noise process with spectral density σn2 per real and imaginary part. Sampling the matched filter output y(t) at the symbol rate produces a discrete time baseband representation of the input to the equalizer 520, as shown in EQN. (8):
As stated above, for each data field of 260,416 symbols, only 728 symbols, which reside in the field sync segment 200, are a priori known and thus available for equalizer training. Furthermore, conditions of the multipath channel are generally not known a priori. As such, the equalizer 520 in the receiver 500 is so configured to adaptively identify and combat various multipath channel conditions.
In the following discussion, n represents a sample time index, regular type represents scalar variables, bold lower case type represents vector variables, bold upper case type represents matrix variables, a * superscript indicates complex conjugation, and the H superscript indicates conjugate transposition (Hermitian).
The equalizer 520 may be implemented as, or employ equalization techniques relating to, linear equalizers (“LEs”), decision feedback equalizers (“DFEs”), and predictive decision feedback equalizers (“pDFEs”). Equalizer tap weight adaptation is often achieved via a least mean square (“LMS”) algorithm or system, which is a low complexity method for adaptively approximating a minimum mean squared error (“MMSE”) tap weight solution, or equivalently a solution to the Weiner Hopf equations, described below.
In the case of an LE, let u[n] be an N long equalizer input vector, y[n] be the equalizer output wH[n]u[n], where wH[n] is an N long equalizer tap weight vector of a linear transversal filter or an adaptive filter,
Ruu[n]=E(u[n]uH[n]) has a size of N×N, and
rdu=E(u[n]d*[n])
Then e[n] d[n]−y[n] where d[n] is the desired symbol.
The mean squared error (“MSE”) is given by J=E(e[n]e*[n]). It can be shown that the MSE as a function of filter taps w, J(w), is given by (n index omitted for clarity) EQN. (9):
J(w)=σd2−wHrdu−rduHw+wHRuuw (9)
A gradient vector of J(w) is given by EQN. (10):
An optimal MMSE tap vector wopt is found by setting ∇J(w)=0, yielding the Weiner Hopf tap weight solution given by EQN. (11):
wopt[n]=Ruu−1[n]rdu[n] (11)
The MSE is generally a measure of the closeness of w to wopt. As a function of the tap weight vector w, the MSE is then given by EQN. (12):
J(w)=Jmin+(w−wopt)HRuu(w−wopt) (12)
where
In practice, for large N, inverting Ruu is prohibitively complicated. So a less complicated iterative solution is desirable. A steepest descent method (“SD”) provides such a solution. It is given by EQN. (13):
w[n+1]=w[n]−μ{∇J(w[n])}=w[n]−μ[Ruu[n]w[n]−rdu[n]] (13)
where μ is a step size parameter. However, estimating and updating Ruu and rdu can also be complicated.
By using instantaneous approximations for Ruu and rdu, EQN. (13) can be greatly simplified for practical applications. For example, as shown in EQN. (14) and EQN. (15),
Ruu[n]≈u[n]uH[n] (14)
and
rdu≈u[n]d*[n], (15)
the gradient can be given by EQN. (16):
A practical LMS algorithm for the equalizer 520, as shown in EQN. (17), can then be determined from EQN. (13):
where μ is a step size parameter.
As shown in
In general, equalizer convergence is achieved when the SINR rises above a prescribed value before approaching a SINR convergence value such that subsequent error correction modules, such as the trellis decoder 528 and the Reed-Solomon decoder 536, can nearly completely correct all data errors. For 8VSB, the prescribed value is about 15 dB, and the SINR convergence value, which will depend on channel conditions, must be larger than that prescribed value. An example is shown in
The following summary sets forth certain exemplary embodiments of the invention. It does not set forth all embodiments of the invention and should in no way be construed as limiting of embodiments of the invention.
In one embodiment, the invention includes a method of determining a step size of an adaptive equalizer for a digital data receiver. The data received by the receiver includes coded symbols and uncoded symbols. The method includes determining a first error estimate based on decoded symbols corresponding to the coded symbols, determining a second error estimate based on the uncoded symbols, adaptively selecting the first error estimate or the second error estimate based on a convergence criterion, and determining a step size based on the selected error estimate.
In another embodiment, the invention includes a method of determining a step size of an adaptive equalizer for a digital data receiver. The data received by the receiver includes coded symbols and uncoded symbols. The method includes, based on a convergence criterion, selecting a first signal estimation process or a second signal estimation process, the first signal estimation process utilizing decoded symbols corresponding to the coded symbols, and the second signal estimation process utilizing the uncoded symbols. The method also includes determining a signal estimate based on the selected signal estimation process, determining an error estimate based on the received data and the signal estimate, and determining a step size based on the error estimate.
In another embodiment, the invention includes an adaptive equalizer for a digital data receiver. The data received by the receiver includes coded symbols and uncoded symbols. The equalizer includes a selection module, an error estimator, and a step size generator. The selection module is configured to select, based on a convergence criterion, decoded symbols or the uncoded symbols, the decoded symbols corresponding to the coded symbols. The error estimator is configured to compare the received data and the selected symbols, and to generate an error estimate based on the comparison. The step size generator is configured to generate a step size based on the error estimate.
In another embodiment, the invention includes a device configured to process digital television signals. The device includes a receiver that includes a demodulator, a decoder, a slicer, and an equalizer. The receiver is configured to receive radio frequency signals modulated with data including coded symbols and uncoded symbols. The demodulator is configured to demodulate the received radio frequency signals to produce the coded symbols and the uncoded symbols. The decoder is configured to decode the coded symbols to produce corresponding decoded symbols, and the slicer is configured to slice the uncoded symbols to produce corresponding sliced symbols. The equalizer includes a selection module, an error estimator, and a step size generator. The selection module is configured to select, based on a convergence criterion, the decoded symbols or the sliced symbols. The error estimator is configured to compare the data and the selected symbols, and to generate an error estimate based on the comparison. The step size generator is configured to generate a step size based on the error estimate.
Other aspects of the invention will become apparent by consideration of the detailed description and accompanying drawings.
Before any embodiments of the invention are explained in detail, it is to be understood that the invention is not limited in its application to the details of construction and the arrangement of components set forth in the following description or illustrated in the following drawings. The invention is capable of other embodiments and of being practiced or of being carried out in various ways. Also, it is to be understood that the phraseology and terminology used herein are for the purpose of description and should not be regarded as limiting. The use of “including,” “comprising,” or “having” and variations thereof herein is meant to encompass the items listed thereafter and equivalents thereof as well as additional items.
As should also be apparent to one of ordinary skill in the art, the systems shown in the figures are models of what actual systems might be like. Many of the modules and logical structures described are capable of being implemented in software executed by a microprocessor or a similar device or of being implemented in hardware using a variety of components including, for example, application specific integrated circuits (“ASICs”). Terms like “equalizer” or “decoder” may include or refer to both hardware and/or software. Furthermore, throughout the specification capitalized terms are used. Such terms are used to conform to common practices and to help correlate the description with the coding examples, equations, and/or drawings. However, no specific meaning is implied or should be inferred simply due to the use of capitalization. Thus, the claims should not be limited to the specific examples or terminology or to any specific hardware or software implementation or combination of software or hardware.
As noted above, the step size μ of EQN. (17) controls a rate at which the LMS adaptive equalizer tap weights w converge to near an optimum wopt. It is desirable to use a larger step size to decrease the amount of time needed until convergence is obtained. However, a larger step size leads to a larger steady state MSE, or lower SINR, at the output of an equalizer after convergence. Hence, after the equalizer is close to convergence, a smaller step size is desirable. Therefore, it is generally advantageous to have a variable step size whose value depends on a “closeness” of w to wopt, thereby enabling a receiver to use a larger step size while the adaptive filter is converging and a smaller step size after convergence.
The ability of an adaptive equalizer to track a nonstationary channel is also a concern in appropriately choosing a step size μ. If the equalizer converges close to the optimal tap weight vector wopt and is running with a small step size, but then the channel conditions change, the equalizer must adequately track and adapt the tap weight vector w. Detection of changes in channel conditions and a switch to a larger step size μ, even though the equalizer has previously converged, is advantageous in this situation.
Embodiments of the invention include methods, systems, and devices for adaptively selecting a step size of an equalizer. In one specific embodiment, an adaptive equalizer selectively uses coded symbols or uncoded symbols to determine a step size by which to update tap weights used by a transversal filter. Selective use of coded symbols or uncoded symbols can enable a more accurate estimation of error throughout various states of the equalizer, which estimation in turn can be employed to determine an appropriate step size. For instance, uncoded symbols may be employed before a predetermined convergence state of the equalizer, and coded symbols may be employed once the predetermined convergence state is reached.
Embodiments herein can achieve improved performance than that achieved in existing digital communication receivers. For instance, embodiments herein can be employed to respond adaptively to changing channel conditions and more effectively select an appropriate step size. In one embodiment, iterative processes are employed to detect when current tap weights are no longer sufficiently close to optimal tap weights, and to modify the step size based on coded symbols or uncoded symbols as appropriate, so as to move closer to the optimal tap weight solution.
Although some embodiments herein focus on processing (e.g., reception) of digital television signals, the invention may be implemented in connection with other kinds of digital signals. Similarly, although some embodiments herein relate to the 8VSB RF modulation format, the invention may be implemented in connection with other modulation formats, such as formats that include coded information and a priori known information.
Additionally, although some embodiments herein relate to linear equalizers (“LEs”), the invention may be implemented in connection with other equalizer architectures, such as, for example, decision feedback equalizers (“DFEs”) and predictive decision feedback equalizers (“pDFEs”).
The receiver module 955 includes a demodulator 960, a decoder 965, and an equalizer 970. In some embodiments, the receiver module 955 includes one or more additional modules, such as, for example, a tuner, a sync and timing recovery module, a matched filter, a phase tracker, a deinterleaver, a second decoder, a slicer, and/or a derandomizer. The equalizer 970 includes a selection module 975, an error estimator 980, and a step size generator 985. Exemplary implementations of the equalizer 970 are described in further detail below.
Variations of the method 991 are within the scope of embodiments of the invention. For instance, in one embodiment, a method selects either decoded symbols or uncoded symbols based on a convergence criterion; determines a signal estimate based on the selected symbols; determines an error estimate based on received data and the signal estimate; and determines a step size based on the error estimate.
As previously noted, 8VSB signals include a combination of 8-level trellis coded symbols and uncoded 2-level symbols. The selection module 908 generates an output d[n], which in turn is subtracted from y[n] to obtain e[n] at a summing node 924. The selection module 908 also feeds the output d[n] to the error estimator 912. The selection module 908 includes a trellis decoder 928 that decodes the coded symbols at the equalizer output y[n] using the Viterbi algorithm. In the embodiment shown, the decoder 928 has a zero delay or a traceback depth of one output. While longer traceback depth decisions are generally more reliable, they incur a longer delay, which can be unacceptable if an instantaneous e[n] is needed for the LMS update.
Most of the uncoded symbols including all segment sync symbols and the first 728 symbols of the field sync segment are a priori known. These are perfectly “decoded” by reading them out of a memory at appropriate times. The 92 unknown 2-level symbols at the end of the field sync segment are decoded by slicing at a midpoint with a slicer 932 since the unknown symbols are 2-level symbols.
Through a control line 940, a synchronizing control signal indicates to the selection module 908 and a switch 936 which type of symbol is being decoded. Exemplary methods for deriving this control signal first require symbol clock recovery, then data field synchronization, both of which occur in the preceding sync and timing recovery block, and then a modulo 260,416 symbol clock rate counter feeding a comparator that activates the control line 940 according to the type of symbol.
The error estimator 912 controls the adjustable step size parameter μ[k] that is being fed to the LMS module 920. In one embodiment, the error estimator 912 includes a high MSE indicator and a low MSE indicator. A high MSE (low SINR) indicates that w is not close to wopt, and thus a need for a larger step size. A low MSE (high SINR) indicates that w is close to wopt, and thus a desirability of a smaller step size. An exemplary method of MSE estimation (or, equivalently, SINR estimation) for the 8VSB signal is discussed below.
In some embodiments, the error estimator 912 periodically estimates an error, such as an MSE, every block of M symbols times from the trellis decoded symbols outputted by the decoder 928 as follows. For example, in the case of an MSE estimate, an instantaneous MSE estimate at block time k is given by EQN. (19).
where k is a block index, symbol index base m=(k−1)M, y is the equalizer output, d is the zero delay output of the trellis decoder 928, and M is a selected block size. Similarly, in the case of an MSE estimate, an averaged MSE estimate is given by EQN. (20).
ξdec,β2[k]=(1−βdec)ξdec2[k]+βdecξdec,β2[k−1],0<βdec<1 (20)
Note that values of βdec are typically close to 1, with a smaller value providing a noisier MSE estimate but faster tracking of a changing MSE.
Alternatively, error values may be estimated using only the a priori known 2-level segment sync symbols. For example, in the case of an MSE estimate, whenever d[p] . . . d[p+3] are segment sync symbols, then an instantaneous MSE estimate at segment j is given by EQN. (21).
where j is a segment index, and p=832(j−1) is a symbol index (note that blocks k and segments j are in general asynchronous). Similarly, in the case of an MSE estimate, whenever d[p] . . . d[p+3] are segment sync symbols, then an averaged MSE estimate is given by EQN. (22).
ξseg,β2[j]=(1−βseg)ξseg2[j]+βsegξseg,β2[j−1],0<βseg<1 (22)
Note that values of βseg are typically close to 1, with a smaller value providing a noisier MSE estimate but faster tracking of a changing MSE.
As shown in
For example, in one embodiment involving EQN. (23) and EQN. (24), if ξdec,β2 is less than a predetermined MSE value (e.g., associated with a convergence state), the step size generator 916 selects ξdec,β2 as the error estimate EstMSE. If ξdec,β2 is greater than or equal to the predetermined MSE value, the step size generator 916 selects ξseg,β2 as the error estimate EstMSE. In some embodiments, the predetermined MSE value is about 0.9. That is,
Once the error estimator 912 has determined an error estimate, the step size generator 916 uses the error estimate EstMSE[k] to select a variable LMS step size depending on a range within which the error estimate EstMSE[k] falls. For example, as shown in expression (25), if the error estimate EstMSE[k] falls within a range r, the step size generator 916 sets the step size parameter μ[k] equal to a predetermined step size μr.
In other embodiments, the step size generator 916 determines the step size differently. For instance, the step size generator 916 may employ a function (e.g., a continuous function) that computes the step size based on information received from the error estimator 912. In some embodiments, the step size is given by EQN. (25′).
μ[k]=γEstMSE[k] (25′)
where γ is a predetermined positive real constant.
The LE system 1600 also includes a plurality of delay blocks 1624, 1628, 1632 that introduce delays during signal processing. In some embodiments, the error estimator 1612 includes an MSE estimator. In such cases, the step size generator 1616 generates the step size parameter μ[k] based on errors estimated by the MSE estimator. However, unlike the LE system 900 of
In the LE system 1600, for the coded symbols, an instantaneous MSE estimate at block time k given by EQN. (26).
where k is a block index, the symbol index base m=(k−1)M, yD is a delayed equalizer output, d is a full traceback output of the trellis decoder 1621 with a delay D, and M is a selected block size. Similarly, in the LE system 1600, for the uncoded symbols, an instantaneous MSE estimate at segment j is given by EQN. (27).
where j is a segment index, and p=832(j−1) is a symbol index. Blocks k and segments j are in general asynchronous.
It should be noted that the numerical values described above and illustrated in the drawings are exemplary values only. Other numerical values can also be used.
Various convergence criteria may be used in connection with embodiments of the invention. In some embodiments, an initial error (e.g., MSE) estimate based on coded symbols is used to determine if coded symbols should continue to be used for further error estimates, or if uncoded symbols should be used for further error estimates. Other exemplary embodiments use convergence criteria based on how often the sign of an error gradient changes.
Various features and advantages of the invention are set forth in the following claims.
This application claims priority to U.S. Provisional Patent Application Ser. No. 60/885,692, filed on Jan. 19, 2007, the entire contents of which are incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
4027258 | Perreault | May 1977 | A |
5530485 | Kim et al. | Jun 1996 | A |
5886748 | Lee | Mar 1999 | A |
5940435 | Hendrickson | Aug 1999 | A |
6144697 | Gelfand et al. | Nov 2000 | A |
6332000 | Lee | Dec 2001 | B1 |
6515713 | Nam | Feb 2003 | B1 |
6526093 | Bao et al. | Feb 2003 | B1 |
6577685 | Bao et al. | Jun 2003 | B1 |
6621863 | Ido | Sep 2003 | B1 |
6647071 | Sommer et al. | Nov 2003 | B2 |
6775335 | Sommer et al. | Aug 2004 | B2 |
6907064 | Tokunaga et al. | Jun 2005 | B1 |
6912258 | Birru | Jun 2005 | B2 |
7038731 | Tsuie | May 2006 | B2 |
7061977 | Martin et al. | Jun 2006 | B2 |
7110449 | Heo et al. | Sep 2006 | B2 |
7123653 | Kim et al. | Oct 2006 | B2 |
7158568 | Park et al. | Jan 2007 | B2 |
7773700 | Kang et al. | Aug 2010 | B2 |
20030215029 | Limberg | Nov 2003 | A1 |
20040190649 | Endres et al. | Sep 2004 | A1 |
20050129143 | Kang et al. | Jun 2005 | A1 |
20050175081 | Zhidkov | Aug 2005 | A1 |
20050243908 | Heo et al. | Nov 2005 | A1 |
20050259767 | Garmany et al. | Nov 2005 | A1 |
20050286622 | Kim et al. | Dec 2005 | A1 |
20060039460 | Fimoff | Feb 2006 | A1 |
20060200511 | Park et al. | Sep 2006 | A1 |
20060239342 | Amizic et al. | Oct 2006 | A1 |
20070019825 | Marumoto et al. | Jan 2007 | A1 |
20070104263 | Chang et al. | May 2007 | A1 |
20070104264 | Park et al. | May 2007 | A1 |
20080260014 | Yang et al. | Oct 2008 | A1 |
Entry |
---|
Office Action from U.S. Patent Office for U.S. Appl. No. 11/776,233, dated Sep. 3, 2008 (18 pages). |
Advanced Television Systems Committee, ATSC Digital Television Standard (A-53) Revision E, with Amendments No. 1 and 2, dated Dec. 27, 2005, Apr. 18, 2006 and Sep. 13, 2006, 38 pages. |
Advanced Television Systems Committee, Recommended Practice: Guide to the Use of the ATSC Digital Television Standard, Doc. A/54A, dated Dec. 4, 2003, 2 pages. |
Advanced Television Systems Committee, (Working Draft) Informational Document: DTV Signal Reception and Processing Considerations, Doc. T3-600r2, dated Jul. 21, 2003, 6 pages. |
William Jay Hillery, Ph.D., Thesis, Purdue University, 2004, Advanced Equalization of Digital Television Signals Using the Conjugate Gradient Algorithm, Section 2, dated May 2004, 12 pages. |
Serdar Ozen, Ph.D., Thesis, Purdue University, 2003, Topics on Channel Estimation and Equalization for Sparse Channels with Applications to Digital TV Systems, dated May 2003, 10 pages. |
S. Haykin, Adaptive Filter Theory, Sections 5.4, 8.2, 9.2, Prentice Hall, 1996, 9 pages. |
J. G. Proakis, Digital Communications, 3rd ed., McGraw-Hill, 1995, section 8-2-2, 3 pages. |
R. H. Kwong, E. E. Johnston, A Variable Step Size LMS Algorithm, IEEE Transactions on Signal Processing, vol. 40, No. 7, Jul. 1992, 10 pages. |
Richard W. Harris, Douglas M. Chabries, F. Avery Bishop, A Variable Step (VS) Adaptive Filter Algorithm, IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. ASSP-34, No. 2, April, 1986, 8 pages. |
B. Farhang-Boroujeny, Adaptive Filters Theory and Applications, Section 6.7 and Chapter 8, Wiley, 1998, 26 pages. |
V. John Mathews, Zhenhua Xie, A Stochastic Gradient Adaptive Filter with Gradient Adaptive Step Size, IEEE Transactions on Signal Processing, vol. 41, No. 6, Jun. 1993, 13 pages. |
Advanced Television Systems Committee, ATSC Recommended Practice: Receiver Performance Guidelines, Doc. A/74, dated Jul. 18, 2004, 10 pages. |
Jae Chon Lee, Chong Dwan Un, A Reduced Structure of the Frequency-Domain Block LMS Adaptive Digital Filter, Proceeding of the IEEE, Vol. 72, No. 12, Dec. 1984, 3 pages. |
Jae Chon Lee, Chong Kwan Un, Performance Analysis of Frequency-Domain Block LMS Adaptive Digital Filters, IEEE Transactions on Circuits and Systems, Vol. 36, No. 2, Feb. 1989, 17 pages. |
David Sparano, What Exactly is 8-VSBB Anyway?, http://www.broadcast.net/˜sbel/8vsb/8vsb.htm, dated Jan. 25, 2007, 12 pages. |
Number | Date | Country | |
---|---|---|---|
20080175308 A1 | Jul 2008 | US |
Number | Date | Country | |
---|---|---|---|
60885692 | Jan 2007 | US |