US 7,580,482 B2Grant

Joint, adaptive control of equalization, synchronization, and gain in a digital communications receiver

Issue Date:2009-08-25

•3 Claims

•14 Drawing Sheets

Abstract

Various aspects and embodiments of the present invention derive statistics of received signal quality and use these statistics to jointly control operation of timing recovery, carrier recovery, automatic gain control, and equalization functions.

Metadata

Inventors

Thomas J. Endres
Christopher D. Long
Wonzoo Chung
Rory Fagan

Application Information

Application Number:US 10/782,316

Filing Date:2004-02-19

Priority Date:2003-02-19

Art Unit:2611

Classifications

IPC:

H04L27/00

Patent Drawings (14 sheets)

Description

[0001] This application claims benefit of U.S. Provisional Application No. 60/448,643, filed Feb. 19, 2003, entitled “Joint, Adaptive Control of Equalization, Synchronization, and Gain in a Digital Communications Receiver,” the entire contents of which are incorporated herein by reference.

FIELD OF THE INVENTION

[0002] The present invention relates to the control of functions in a communications receiver that govern physical layer operations of equalization, synchronization (carrier frequency and phase, and timing recovery), and automatic gain control. These functions are controlled from a central signal processing and logic block to achieve robust, autonomous receiver operation.

BACKGROUND OF INVENTION

[0003] In many digital communication systems, a source generates digital information, such as data, audio, or video, that is to be transmitted to multiple receivers. The digital information bits are divided into blocks that define a discrete alphabet of symbols. These symbols are used to modulate a radio frequency (RF) carrier's frequency, amplitude and/or phase. For example, a quadrature oscillator can be used to modulate the symbols onto the amplitude and phase of the RF carrier, and the signaling is referred to as Quadrature Amplitude Modulation (QAM). The time between adjacent symbols is referred to as the baud (or symbol) period, and inverse as baud (or symbol) rate.

[0004] The data-bearing RF carrier is amplified and transmitted through a propagation medium, for example, a cable, phone line, wireless terrestrial, satellite, underwater link, etc. As consumer appetite for information on demand continues to increase, so do requirements on data rates of present and emerging systems. Higher data rates increase the susceptibility of the data-bearing RF signal to environment-induced distortions such as fades, multipath (causing inter-symbol interference (ISI)), Doppler conditions, and additive noise processes. Communications receivers typically implement multiple stages of signal processing to individually address impairments witnessed by the RF signal en route to the receiver, and also introduced by the receiver and transmitter themselves, for example, due to implementation with finite-length filters and finite-precision arithmetic. Typical functions that govern physical layer operation include equalization, synchronization to carrier phase and frequency, synchronization to baud sampling phase and frequency, and automatic gain control.

[0005] Gain control processing adjusts the received signal to within the proper dynamic range expected by the receiver. Usually, gain control is itself done in stages, for example, at the RF level by the tuner, after RF to IF translation, and digitally within front-end and back-end signal processing. Most commercial UHF/VHF tuners include automatic gain control (AGC) circuits that tradeoff performance between adjacent and co-channel interference using average or peak power levels. AGC at the IF level usually adjusts the signal so that the full dynamic range of analog-to-digital conversion is utilized, without saturation. Sometimes, AGC utilizes pilot or reference tones or signals that are known, stored, or derived in the receiver to adjust IF AGC circuitry. In the digital domain, AGC circuitry may also use pilot or reference aids, or may operate blindly without the use of such overheard. For example, U.S. Ser. No. 60/341,931, entitled “Self-initializing decision feedback equalizer with automatic gain control,” by T. J. Endres et al., filed Dec. 17, 2001, which is incorporated herein by this reference, describes an automatic gain control (AGC) circuit that is nested with a decision feedback equalizer (DFE) structure, which operates on novel error signals that are blind (do not use training, reference, or pilot aids). Similarly, U.S. Ser. No. 10/246,084, entitled, “Adaptive expanded information capacity for communications systems,” by C. Long et al., filed Sep. 8, 2002, which is incorporated herein by reference, describes a similar feedback AGC circuit that is nested with an equalizer and uses decision-directed (DD) error adjustment.

[0006] Timing recovery refers to the process of synchronization to correct baud sampling frequency and phase. Sometimes, the oscillator clock that adjusts the analog-to-digital converter (ADC) at the input to the receiver is adjusted in frequency and phase. Alternatively, the sampled data in the receiver can be interpolated to achieve proper baud sampling. This second approach can reduce complexity by eliminating costly oscillator circuitry needed to control the ADC in the first approach. Timing recovery methods sometimes try to detect zero-crossings of the received signal in the time domain. As such, some methods apply filtering techniques to upper and lower band edges of the data spectrum. For example, see U.S. Pat. No. 5,872,815 by C. Strolle et al, entitled “Apparatus for generating timing signals for a digital receiver” which is incorporated by this reference. Alternatively, another approach uses a decision-directed (DD) technique, usually requiring feedback from a decision device, or slicer, or quantizer. The DD methods described by Mueller and Muller in “Timing recovery in digital synchronous data receivers,” IEEE Transactions on Communications, vol. COM-24, no. 5, May 1976, which is incorporated by this reference, are widely applied. Other blind algorithms, usually applied solely to equalization, have lately been successfully applied to timing recovery, too. For example, Guglielmi et al. in “Joint Clock Recovery and Baseband Combining for the Diversity Radio Channel,” IEEE Transactions on Communications, vol. 44. p. 114-117, January 1996, which is incorporated by this reference, jointly applies a Constant Modulus Algorithm (CMA), originally proposed by D. N. Godard in “Self-recovering equalization in two-dimensional data communication systems,” IEEE Transactions on Communications, vol. 28, no. 11, pp. 1867-1875, October 1980, which is also incorporated by this reference, for equalization, to joint optimization of equalization and timing recovery. This joint optimization is further analyzed by Chung et al. in “Timing Recovery Based on Dispersion Minimization,” Proceedings of the 2001 Conference on Information Sciences and Systems, March 2001 which is incorporated by reference.

[0007] Equalization in a digital communications receiver is analogous to an equalizer on a stereo system: the equalizer filters the distorted, received waveform (from a tape head or RF antenna) and tries to mitigate distortions and restore the signal properties of the original source. In a digital communications receiver, filter mismatches in transmitter and receiver, finite-precision implementation, and propagation channel effects induce inter-symbol interference (ISI), in which the receiver processes a signal that contains multiple, delayed and weighted copies of the transmitted signal. For example, reflections of the RF signal from a large building will induce ISI (or multipath), and reflections from an airplane will induce multipath distortion with a time-varying Doppler component. Since the exact channel characteristics are not known apriori at the receiver, the equalizer is usually implemented with adaptive methods. Adjustment of filter coefficients can be done with trained equalization methods, relying on the embedding of a pre-determined training sequence in the transmitted data. Usually, equalizer coefficient convergence relies on multiple transmissions of the training sequence, and the channel characteristics are also time varying, requiring periodic re-training. The Least Mean Squares (LMS) algorithm, which was proposed by Widrow, McCool, and Ball, in The Proceedings of the IEEE, vol. 63, no. 4, pp. 719-720, April 1975, which is incorporated by reference, minimizes a Mean Squared Error (MSE) cost function and is a stochastic gradient descent update rule utilizing the training sequence. Alternatively, blind methods do not rely on a reference signal, or derive a reference signal from the data itself, and are therefore desirable, since in the absence of a training signal, revenue-generating user data can instead be transmitted. A common blind equalization method replaces the reference signal in the LMS algorithm with the receiver's best guess at the data, and is referred to as Decision Directed LMS (DD-LMS), as proposed in a paper entitled “Techniques for adaptive equalization of digital communication systems,” by R. W. Lucky, in the Bell Systems Technical Journal, vol. 45, no. 2, pp. 255-286, February 1966 which is incorporated by reference. Unfortunately, DD-LMS needs a reasonably low percentage of incorrect decisions to prevent algorithm divergence, and is therefore impractical from a cold-start initialization. Godard's CMA is an attractive alternative that provides robust signal acquisition in harsh environments. These algorithms are sometimes applied to linear, finite-impulse response (FIR) filters, or decision feedback equalizer (DFE) structures, in which an FIR filter is embedded in a feedback loop (so that the overall impulse response is infinite) that processes hard decision samples from a decision device, slicer, or quantizer. U.S. Ser. No. 60/341,931 by T. J. Endres et al. entitled “Self-initializing decision feedback equalizer with automatic gain control,” which is incorporated by reference, uses novel, adaptive combining techniques of soft and hard decision samples in a DFE structure with CMA, LMS, and DD-LMS for robust, blind acquisition and re-acquisition.

[0008] Synchronization to carrier frequency and phase is usually done in stages, including, for example, RF to IF translation, IF to passband (or near baseband), and translation to precise baseband. Since the receiver in a coherent communications system must ultimately make hard decisions for symbol estimates, the data-bearing RF signal must ultimately be brought down to precise baseband. Synchronous or quasi-synchronous detectors can be used for intermediate translations. Translation to precise baseband can be done in a DD fashion, by nesting a phase-locked loop with the slicer and equalizer. For example, the instantaneous phase offset between slicer input and output is detected, filtered, and used to drive an oscillator in “Digital Communication” by E. A. Lee and D. G. Messerschmitt, Kluwer Academic Publishers, 1994, which is incorporated by reference. The PLL can be closed at various points within the equalizer. For example, Strolle et al describe alternative DFE architectures for reception of digital television signals that include a DD carrier loop, deriving its input from slicer input and output, but derotating the received signal to precise baseband at various points within the DFE structure. (See: Feasibility of reliable 8-VSB reception,” C. H. Strolle, S. N. Hulyalkar, T. J. Endres, Proceedings of the NAB Broadcast Engineering Conference, Las Vegas, Nev., pp. 483-488, Apr. 8-13, 2000, which is incorporated by reference.)

[0009] The present invention relates to the joint, adaptive, control of physical layer functions that govern equalization, baseband synchronization to precise carrier phase and frequency, baud sampling phase and frequency, and automatic gain control in the digital domain.

SUMMARY OF INVENTION

[0010] In accordance with certain aspects and embodiments of the present invention, physical layer functions governing equalization, translation to precise baseband, synchronization of sampling phase and frequency, and automatic gain control in the digital domain are jointly controlled and adapted with a central signal processing and logic block.

BRIEF DESCRIPTION OF DRAWINGS

[0011] Other aspects, features, and advantages of various aspects and embodiments of the present invention will become more fully apparent from the following detailed description, the appended claims, and the accompanying drawings in which:

[0012] FIG. 1 shows a typical prior-art communication system that may be employed for transmission of digital signals;

[0013] FIG. 2 shows a block diagram of timing recovery, equalization, carrier recovery, and automatic gain control, jointly controlled by a central signal processing block in accordance with certain aspects and embodiments of the present invention;

[0014] FIG. 3 shows a block diagram of the preferred embodiment of Feedback AGC, showing adaptation of gain value at each symbol instance, and error term selection using control signals in accordance with certain aspects and embodiments of the present invention;

[0015] FIG. 4 shows a block diagram of alternative embodiment of Feedback AGC, showing error term generation, and bandpass filtering using cascaded low-pass and high-pass filter sections, in accordance with certain aspects and embodiments of the present invention;

[0016] FIG. 5 shows a block diagram of Carrier Loop nested with Equalizer and Slicer, used to translate the received signal to precise baseband;

[0017] FIG. 6 shows a block diagram of Decision Feedback Equalizer (DFE) in accordance with certain aspects and embodiments of the present invention;

[0018] FIG. 7 shows a block diagram of Timing Recovery Loop and its control by Signal Processing, Logic, and Control Block in accordance with certain aspects and embodiments of the present invention;

[0019] FIG. 8 shows a Phase Detector for Timing Recovery Loop and its control by the Signal Processing, Logic, and Control Block;

[0020] FIG. 9 shows the: Signal Processing, Logic, and Control Block;

[0021] FIG. 10 shows a conceptual illustration of combining weight calculation;

[0022] FIG. 11 shows a circuit used to calculate combining weight λ(n) in accordance with certain aspects and embodiments of the present invention;

[0023] FIG. 12 shows a conceptual drawing illustrating two possible templates used to discern a control signal in accordance with certain aspects and embodiments of the present invention; and

[0024] FIG. 13 shows a flow diagram illustrating the update of array index l in accordance with certain aspects and embodiments of the present invention.

DETAILED DESCRIPTION

[0025] FIG. 1 depicts a typical prior art digital communication system. Transmitter station 100 is coupled to receiver 150 by propagation medium 147. The propagation medium could be a cable, telephone twisted-pair wire, satellite link, terrestrial link, or fiber optic connection, for example. Transmitter station 100 includes an information source 110, that contains the content such as data, audio, or video, which is to be communicated to the receiver 150. The information source 110 is coupled to encoder 120, which formats the information in a manner suitable for digital communication, typically in accordance with a given standard or protocol. The encoder 120 is coupled to modulator 140, which is also coupled to a quadrature oscillator 130. The modulator 140 uses the signal from the quadrature oscillator 130 to modulate the encoded information provided by encoder 120 onto a suitable Radio Frequency (RF) carrier frequency in amplitude and phase. The modulated signal from modulator 140 is coupled to transmit antenna 145 for transmission into propagation medium 147.

[0026] The receiver 150 receives the RF signal from propagation medium 147 via receiver antenna 149. Receiver antenna 149 is coupled to tuner 160. Tuner 160 is set to receive the RF signal in the desired frequency range, while rejecting signals in nearby or adjacent frequency ranges. Tuner 160 may provide automatic gain control at the RF frequency and also downconvert the received signal to an intermediate frequency (IF) before passing the signal to the analog IF Processing block, 162. Analog IF processing prepares the signal for analog-to-digital conversion, applying filtering and gain control, before passing the signal to the Front End Processing block 165. Front End Processing block 165 samples the signal with an analog-to-digital converter and may contain further automatic gain control and filtering, digital downconversion in frequency, and quadrature demodulation to split the signal into in-phase (I) and quadrature-phase (Q) samples. Front End Processing block 165 is coupled to Timing Recovery module 170 that determines a correct sampling phase. Timing Recovery module 170 may adjust the sampling phase by interpolating the data samples, or adjusting the phase and sampling frequency of the analog-to-digital converter in Front End Processing block 165. Timing Recovery module 170 is coupled to Equalizer 175, which is used to mitigate the distortions, such as inter-symbol interference and noise, that are introduced by the propagation medium 147, transmitter 100, Tuner 160, IF Processing block 162, receiver Front End Processing block 165, and receiver Timing Recovery module 170. Equalizer 175 is coupled to Carrier Recovery module 180, which detects residual offset in frequency and phase. The detected carrier offset in Carrier Recovery module 180 may be supplied back to the Equalizer 175 for translation of equalized samples to precise baseband, or used to adjust the downconversion process in Front End Processing block 165, or both. Also coupled to Equalizer 175 is Feedback AGC module 177, which works in conjunction with Equalizer 175 to detect and correct rapid amplitude variations in the received signal. The output of Equalizer 175 is coupled to Error Correction module 185, which detects and corrects bit errors in the recovered bit stream. The Error Correction module 185 is coupled to Decoder 190, which decodes the bit stream in accordance with the standard or protocol used in the Encoder 120 of Transmitter 100. The decoded bits from Decoder 190 represent the recovered information source, consisting of data, audio, or video, and are supplied to a user interface 195. Certain aspects and embodiments of the present invention are manifested in the joint, adaptive, blind control of Equalizer 175, Carrier Recovery module 180, Timing Recovery module 170, and Feedback AGC module 177.

[0027] FIG. 2 shows a block diagram of aspects of one embodiment of the present invention, including a Timing Recovery module 210, Feedback AGC 240, Carrier Recovery Loop 250, two Adaptive Equalizer filters 220 and 230, and a Signal Processing, Logic and Control Block 260. The Slicer 270 is a nearest-element decision device that outputs the point in the QAM source constellation that has closest Euclidean distance to the Slicer's input sample. Alternatively, a partial trellis decoder can be used that exploits channel coding and does not necessarily make nearest-element decisions. Next, we will describe the different operating modes for each of the Timing Recovery, Carrier Recovery, Feedback AGC, and Equalization functions that will be controlled by the Signal Processing, Logic and Control Block 260.

Feedback AGC

[0028] A primary goal of the Feedback AGC is to provide quick, robust gain compensation of the signal that is input into the Slicer. This gain compensation may be required as the result of dynamic multipath conditions or flat fades. Though the equalizer itself provides gain compensation of the signal by adjusting the scale of the adaptive filters' coefficients, such compensation can be slow, since a plurality of equalizer coefficients (sometimes hundreds) must move to scale the data appropriately. Therefore, the Feedback AGC provides a single, strictly positive gain value, and is designed to provide gain compensation more quickly than the equalizer is able to do. Two different Feedback AGC architectures are disclosed.

[0029] Feedback AGC Preferred Embodiment

[0030] The preferred embodiment of the Feedback AGC in the present invention utilizes techniques described in U.S. PTO application No. 60,341,931, entitled “Self-initializing decision feedback equalizer with automatic gain control,” by T. J. Endres et al., filed Dec. 17, 2001. These techniques rely on minimization of a specified cost function over the choice of gain value, and are implemented in an adaptive way with a stochastic gradient descent update rule.

[0031] The automatic gain control signal α(n) is a real, strictly positive scalar, that is calculated at each baud instance by

[0032]

α (n) = ρ_{α} α (n - 1) - μ_{α} \frac{\partial J}{\partial α (n - 1)}

[0033] where ρ_α is a leakage factor used in practice to mitigate divergence due to finite-precision effects or quantization noise, and is chosen less than or equal to unity, but close to unity, J is the cost function to be minimized by choice of α(n), and μ_α is a real-valued, positive stepsize, chosen less than unity, and governs algorithm convergence rate, tracking capabilities, and stochastic jitter.

[0034] Different cost functions can be used, and these different cost functions will define different modes of operation that will be controlled by the Signal Processing, Logic and Control Block 260 in FIG. 2.

Operational Mode 1: MSE-Like Cost Function

[0035] The first operational mode of the Feedback AGC uses a Mean Squared Error (MSE)-like cost function, expressed as
J=E{(|α(n−1)·{tilde over (w)}(n−1)·e^−θ(n)|^q−|ŵ(n−1)|^q)²}
where q is a positive integer and is set to one for the preferred embodiment. This cost function penalizes the squared difference in magnitudes between the slicer input and output, and is analogous to a mean squared error (MSE) cost function. The partial derivative calculation, denoted as {tilde over (ζ)}(n−1)≡∂J/∂α(n−1), assuming correct decisions and neglecting the expectation, for q=1, results in
{tilde over (ζ)}(n−1)=[α(n−1)·|{tilde over (w)}(n−1)|−|ŵ(n−1)|]·|{tilde over (w)}(n−1)|
where we have absorbed a factor of two into the stepsize μ_α, and used the fact that sign(α(n−1)) is always one since the automatic gain control signal is strictly positive by definition.

[0036] Since the automatic gain control signal, α(n), is applied to multiplier 225 in FIG. 2 at the current sample instance n, but also requires the use of the output of the multiplier 225 in its calculation, a delay of one sample has been inserted in the calculation of {tilde over (ζ)}(n−1) and the cost function to keep the system causal.

[0037] An alternative embodiment of the present invention uses arbitrary positive integer q in the MSE-like cost function. See U.S. PTO application No. 60,341,931 for a description of the update term for this case.

Operational Mode 2: MSE-Like Cost Function

[0038] The second operational mode of the Feedback AGC uses a Constant Modulus (CM)-like cost function, expressed as
J=E{(|α(n−1)·{tilde over (w)}(n−1)·e^−jθ(n)|^q−γ)²}

[0039] This cost function has the advantage that it does not rely on hard decisions from the output of the Slicer. Letting q=2, taking the partial derivative and neglecting the expectation (as in the previous case for the MSE-like cost function) results in an error term for this cost function expressed as
{tilde over (ζ)}(n−1)=α(n−1)·|{tilde over (w)}(n−1)|²·(|α(n−1)·{tilde over (w)}(n−1)|²−γ)

[0040] The constant γ is calculated as γ=E{|s|⁴}/E{|s|²}, i.e., analogously to the Godard radius used in adaptation of the equalizer coefficients.

[0041] An alternative CM-like cost function uses q=1. The error term from the partial derivative is found as
{tilde over (ζ)}(n−1)=|{tilde over (w)}(n−1)|·(|α(n−1)·{tilde over (w)}(n−1)|−γ)

[0042] In this case with q=1, the Godard radius is calculated as γ=E{|s|²}/E{|s|}.

Operational Mode 3: Combining of MSE and CM Cost Functions

[0043] The third operational mode of the Feedback AGC uses a linear combination of MSE-like and CM-like cost functions. In this case, the error term derived from a MSE-like cost function is weighted by 1−λ(n), while the error term derived from a CM-like cost function is weighted by λ(n), and the results are summed to produce an error term used to update the Feedback AGC gain in the stochastic gradient descent rule. This combining is expressed as
{tilde over (ζ)}(n−1)=(1−λ(n))·{tilde over (ζ)}_MSE(n−1)+λ(n)·{tilde over (ζ)}_CM(n−1)

[0044] The combining weight λ(n) is time-varying and can be chosen among a variety of methods. For example, the combining weight can be set based on the signal-to-noise ratio, error rate, cluster variance, or number of symbols processed. In the preferred embodiment of the present invention, the combining weight is calculated in an adaptive method at each baud instance by the techniques discussed in U.S. PTO application No. 60,341,931, by T. J. Endres et al., entitled “Self-initializing decision feedback equalizer with automatic gain control”. Alternatively, the combining weight can be determined from a look-up-table, which is addressed by the array index that is described in the future sections of the present document.

Operational Mode 4: No Update

[0045] The fourth operational mode of the Feedback AGC halts adaptation of the Feedback AGC gain value. In this case, the error term is set to zero, {tilde over (ζ)}(n−1)=0, and leakage is set to one, ρ_α=1. Hence, the new gain value is equal to the old gain value.

Enhancements: Averaging and Penalty Term

[0046] The instantaneous error term {tilde over (ζ)}(n−1), calculated in accordance with one of the four operational modes previously described, can be averaged before being applied to the stochastic gradient descent update rule to calculate the automatic gain control signal α(n), to induce memory in and reduce the variance of the error signal. For example, the error term used in the stochastic gradient update can be calculated as
ζ(n−1)=(1−ρ_agc)·ζ(n−2)+ρ_agc·{tilde over (ζ)}(n−1)
with automatic gain control signal updated by
α(n)=ρ_αα(n−1)−μ_αζ(n−1)
where ρ_ageis chosen greater than or equal to zero, but less than or equal to one, and is a leakage factor. Selecting ρ_age=1 represents no leakage and induces no memory in the error term. In this case, the error term relies purely on the unity-delayed samples and ζ(n−1)={tilde over (ζ)}(n−1).

[0047] To reduce undesired interaction between the Equalizer and Feedback AGC, a penalty term can be added to the cost function. This extra term penalizes gain values that are different from a target value, Γ. For example, the cost function including the penalty term is expressed as
J+β·(α(n−1)−Γ)²
where β is a small, non-negative weighting factor for the additional penalty term. The automatic gain control value is then updated according to
α(n)=ρ_αα(n−1)−μ_αζ(n−1)−μ_α·β·(α(n−1)−Γ)

[0048] The product μ_α·β can be collapsed into a single value, to ease implementation.

[0049] FIG. 3 shows a block diagram of the preferred embodiment of the Feedback AGC in accordance with certain aspects and embodiments of the present invention. Signals w(n) and ŵ(n), the input to the Slicer after derotation and gain scaling, and the Slicer output, respectively, are input to the Error Term Generator 310, as well as the current agc gain value, α(n). Error Term Generator 310 calculates an instantaneous error term, {tilde over (ζ)}(n−1), responsive to the control bits from the Signal Processing, Logic, and Control Block (260 in FIG. 2). The Signal Processing, Logic, and Control Block judges the demodulator's performance and assigns an error term to be used by the Feedback AGC. (We will later see how the adaptation strategy is made completely flexible and programmable by LUT swap in the Signal Processing, Logic, and Control Block.) The four operational modes of the Feedback AGC can be associated with the relative performance of the demodulator, according to, for example,

[0050]


Operational Mode
(name/number)	Stage of Demodulator Operation

CM-like/2	Initial acquisition or strong dynamic environment
Combined CM-like	Secondary acquisition stage or moderate dynamic
and MSE-like/3	environment
MSE-like/1	Tracking stage or mild dynamic environment
No update/4	Tracking stage or static environment

[0051] The instantaneous error term {tilde over (ζ)}(n−1) is applied to a leaky integrator, comprised of multiplier 315, multiplier 325, and delay element 330, to induce averaging. The stepsize μ_α is applied in multiplier 335 to the averaged error term ζ(n−1). Adder 340 sums the update error term, penalty term, and previous AGC gain value to produce an updated AGC gain value, α(n). Leakage to avoid finite precision effects can be applied in multiplier 345 with leakage factor ρ_α to the previous AGC gain value, α(n−1), supplied by delay element 360. The previous AGC gain value, α(n−1), is also applied to summer 350 where a difference is formed with target threshold Γ. This result is multiplied by the weighting factor −μ_α·β in multiplier 355. The updated AGC gain value from adder 340, α(n), is also fed back to the Error Term Generator 310 to form the next instantaneous error term.

Feedback AGC Alternative Embodiment

[0052] An alternative embodiment of the Feedback AGC uses a bandpass control loop to adjust the AGC gain value. The bandpass characteristic is designed so that the rise (or attack) time of the Feedback AGC is very fast (about a few symbol periods) compared to the decay time of the Feedback AGC (hundreds or thousands of symbol periods). The gain value of the Feedback AGC decays to a prescribed threshold, nominally unity, as time goes to infinity. Hence, in a dynamic environment the overall gain of the received signal is quickly adjusted by the Feedback AGC and seamlessly transferred to the Equalizer.

[0053] FIG. 4 shows a block diagram of this alternative embodiment of the Feedback AGC in accordance with certain aspects and embodiments of the present invention. The loop is configured as a second order control loop with zero response at DC. The loop is sampled at the symbol rate.

[0054] The control loop derives the gain value from an error penalizing the difference of the ratio of the magnitudes of soft to hard decisions from a target value, for example, unity. The complex magnitude (square root of sum of real and imaginary components squared) of the equalizer output sample, w(n), is calculated in the CABS block 405. Look-up-table 410 stores inverse magnitudes of constellation points, and is addressed using the hard decision samples, ŵ(n), or indices associated with these hard decision samples, coming from the Slicer. Multiplier 415 forms the ratio of magnitudes of soft to hard decision samples, and this is termed the magnitude error and denoted as

[0055]

ɛ_{s} (n) = \frac{\langle w (n) \rangle}{\langle \hat{w} (n) \rangle}

[0056] Adder 420 takes the difference of the magnitude error from a target threshold, Γ, nominally unity, and forms the loop error, denoted as
E_sym(n)=(Γ−ε_s(n))

[0057] The loop error, E_sym(n), is first filtered by a low pass section that has transfer function

[0058]

H (z) = \frac{β_{L}}{(1 - α_{L} z^{- 1})} .

[0059] Adder 425 sums the loop error E_sym(n) with a delayed and scaled version of the low pass output. Delay element 435 delays the low pass signal ƒ_L. Control signal reset is used to clear the contents of delay element 435 and output a zero-value from mux 440 instead of the output of delay 435. The output of mux 440 is multiplied with low pass scale α_Lin multiplier 430. Low pass scale α_Lis used to set the breakpoint of the low pass filter section. The output of multiplier 430 is summed with the input to the low pass section in adder 425. The low pass signal ƒ_Lis scaled by low pass gain, β_L, in multiplier 445, producing the output of the low pass section, ƒ_Lβ, also used as the input to the high pass section.

[0060] The high pass section has transfer function

[0061]

H (z) = \frac{β_{H} \cdot (1 - z^{- 1})}{(1 - α_{H} z^{- 1})} .

[0062] Signal ƒ_Lβ is summed with a delayed and scaled version of signal ƒ_{h int}in adder 450, producing signal ƒ_{h int}. Signal ƒ_{h int}is delayed in delay element 460. Control signal reset is used to clear the contents of delay element 460 and output a zero-value from mux 465 instead of the output of delay element 460. The output of mux 465 is multiplied with high pass scale α_Hin multiplier 455. High pass scale α_His used to set the breakpoint of the high pass filter section. The output of mux 465 is also subtracted from signal ƒ_hintin adder 470, producing high pass signal ƒ_h. High pass signal ƒ_his scaled by high pass gain, β_H, in multiplier 475, producing the high pass output signal, ƒ_Hβ.

[0063] The high pass output ƒ_Hβ is added back to the target threshold, Γ, in adder 480, producing the calculated Feedback AGC gain value. Upon reset, however, mux 485 selects a unity-valued gain signal instead of the calculated AGC gain value. Using control signal FbagcFixedScaleEn, mux 490 sets the AGC gain value to programmable gain value FbagcFixedScale instead of the calculated gain value.

[0064] For a baud rate of approximately 613 KHz, nominal gain and scale values can be set to:

[0065]


α_L	α_H	β_H	β_L

0.999	0.999	0.03	1.0

[0066] The Signal Processing, Logic and Control Block 260 in FIG. 2 controls this alternative embodiment of the Feedback AGC in accordance with certain aspects and embodiments of the present invention by selecting between one of the following operational modes at each baud instance.

Operational Mode 1: Decision Directed

[0067] When the Feedback AGC is operated in a decision directed (DD) mode, the magnitude error is found as

[0068]

ɛ_{s} (n) = \frac{\langle w (n) \rangle}{\langle \hat{w} (n) \rangle}

and the filtering is as described above for FIG. 4.

Operational Mode 2: Freeze

[0069] When the Feedback AGC is operated in a Freeze mode, the system clocking of the circuit in FIG. 4 is disabled, so that all memory contents, including the output AGC gain value, remain unchanged. Effectively, this circuit is bypassed, and there is no change to the internal state.

Operational Mode 3: Fixed Scale

[0070] When the Feedback AGC is in Fixed Scale mode, all internal calculations are performed. However, mux 490 in FIG. 4 replaces the calculated gain value with the value of the programmable register FbagcFixedScale.

Operational Mode 4: Reset

[0071] When the Feedback AGC is in Reset mode, the accumulators 435 and 460 are set to zero, mux's 440 and 465 output a zero-valued sample, and mux 485 outputs a unity-valued sample for the AGC gain value.

Carrier Loop

[0072] The goal of the final stage of carrier recovery is to translate the received signal to precise baseband in the synchronous demodulator. A precise baseband signal is needed to form hard decision samples, or symbol estimates, in the Slicer. A Carrier Recovery loop is used to track out any residual carrier frequency or phase offset, and phase noise introduced in the demodulation process. In FIG. 2, the conjugated output e^−j·θ(n)of the Carrier Loop 250 is used to de-rotate the passband Equalizer output to precise baseband in multiplier 225, while the output e^+j·θ(n)of the Carrier Loop 250 is used to re-rotate the baseband Slicer output to passband in multiplier 235.

[0073] The Carrier Loop 250 is described in more detail in FIG. 5. This carrier loop uses a decision-directed (DD) phase error in a second order, (digital) phase locked loop with a numerically-controlled oscillator (NCO) to produce the sin and cosine terms needed to perform the de-rotation and re-rotation of Equalizer and Slicer outputs, respectively.

[0074] Decision-directed phase and frequency recovery is discussed in the textbook by Lee and Messerchmitt, entitled Digital Communication, Appendix 17-B, Kluwer Academic Publishers, Norwell, Mass., Second Edition, 1994, which is incorporated by this reference.

[0075] In FIG. 5, the baseband equalizer output, w=w_I+j·w_Qis supplied as input to Slicer 270, and also to Coarse Tune Hard Decision Block 505. This block is not discussed in Lee and Messerschmitt, and is used in certain aspects and embodiments of the present invention. Coarse Tune Hard Decision Block 505 provides an alternative hard decision sample than the one supplied by the Slicer, a nearest-element decision device. The alternative hard decision samples can be used in more of an acquisition state, while the hard decision samples from the Slicer are generally more reserved for tracking or steady-state demodulator operation. Coarse Tune Hard Decision Block 505 can be configured in various operating modes to produce alternative hard decision samples.

[0076] Coarse Tune Hard Decision Operating Mode 1, Linear Combination of Soft and Hard:

[0077] In this preferred embodiment of the Coarse Tune Hard Decision Block 505, the alternative hard decision sample, ŵ_A, is formed by taking linear combinations of soft decision samples from the equalizer and hard decision samples from the Slicer,
ŵ_A=(1−λ)·w+λ·ŵ
where the real-valued combing weight λ is greater than or equal to zero but less than or equal to unity, and is selected adaptively. Methods to determine the combining weight are described in U.S. Ser. No. 60/341,931, entitled “Self-initializing decision feedback equalizer with automatic gain control,” by T. J. Endres et al., filed Dec. 17, 2001, which is incorporated by reference, and will also be described in the sequel.

[0078] Coarse Tune Hard Decision Operating Mode 2, Quadrant Mapping:

[0079] An alternative embodiment of the present invention uses Quadrant Mapping of the soft decision sample. The basic goal of generating an alternative hard decision sample using Quadrant Mapping is to estimate the quadrant in I/Q space in which the soft decision sample belongs, and scale the sample depending on the modulation format. This simple operation is expressed by selecting the alternative hard decision sample, ŵ_A, according to
ŵ_A=Δ·(sign(w_l)+j·sign(w_Q))
where Δ is a real-valued, positive scalar that can be selected according to the modulation format.

[0080] Coarse Tune Hard Decision Operating Mode 3, Reduced Constellation:

[0081] Certain alternative embodiments of the present invention quantize the soft decision sample not to the nearest element of the source alphabet (as the Slicer does), but to the nearest element of a subset of the source alphabet. This is referred to as a reduced constellation since only part of the source constellation is used to generate the alternative hard decision sample.

[0082] Coarse Tune Hard Decision Operating Mode 4, Reduced Precision:

[0083] Suppose that the baseband soft decision sample, w, is represented by M bits, while the Slicer's hard decision sample needs only N bits to be exactly represented, with M>N. An alternative hard decision sample is found by rounding and saturating the end points of the soft decision sample, to a bit-width P, where M>P>N. For example, suppose the soft decision sample is represented by M=16 bits, but only N=7 bits are needed to precisely represent the Slicer hard decision sample on the constellation grid. Then an alternative hard decision sample can be found by formatting the soft decision down to P=9 or P=10 bits.

[0084] Coarse Tune Hard Decision Operating Mode 5, Arbitrary Nonlinearity:

[0085] The Coarse Tune Hard Decision Block 505 can also generate alternative hard decision samples according to an arbitrary nonlinear curve, without memory. For example, a hyperbolic tangent curve can be approximated.

[0086] These operating modes are selected using input signal “control 3” to Coarse Tune Hard Decision Block 505. Input signal “control 3” is supplied from the Signal Processing, Logic, and Control Block (260 in FIG. 2) at each baud instance in accordance with certain aspects and embodiments of the present invention.

[0087] The alternative hard decision sample that is output from The Coarse Tune Hard Decision Block 505 in FIG. 5 is supplied to mux 510. Mux 510 selects which hard decision sample is supplied to the Phase Detector 515, from among the hard decision sample from the Slicer and the alternative hard decision sample from the Coarse Tune Hard Decision Block 505. Mux 510 is controlled by input signal “control 1” that is supplied from the Signal Processing, Logic, and Control Block (260 in FIG. 2) at each baud instance in accordance with certain aspects and embodiments of the present invention.

[0088] The Phase Detector 515 derives an instantaneous estimate of the phase error between soft and hard decisions, and is described in Lee and Messerchmitt, Digital Communication, Appendix 17-B, Kluwer Academic Publishers, Norwell, M A, Second Edition, 1994, which is incorporated by reference. Using a small angle approximation, the phase error estimate is calculated according to

[0089]

ϕ = \frac{{\hat{w}}_{I} \cdot w_{Q} - w_{I} \cdot {\hat{w}}_{Q}}{{\hat{w}}_{I}^{2} + {\hat{w}}_{Q}^{2}}

where w=w_I+j·w_Qis the baseband soft decision sample, and ŵ=ŵ_I+j·ŵ_Qis the hard decision sample supplied from mux 510. In practice, the denominator is sometimes omitted.

[0090] For the preferred embodiment of the Coarse Tune Hard Decision Block 505, using Operating Mode 1, the hard decision sample used in the phase error calculation is the weighted sum of soft decision samples from the Equalizer and hard decision samples from the Slicer, using adaptive combining weight λ. When λ=0, signal quality is very good, and the instantaneous phase estimate is calculated with a hard decision sample that is equal to the Slicer hard decision sample, as intended in Lee and Messerchmitt, Digital Communication, Appendix 17-B, Kluwer Academic Publishers, Norwell, Mass., Second Edition, 1994. However, when λ=1 and signal quality is poor, the instantaneous phase estimate, φ, collapses to zero, which corresponds to no update to the phase and frequency produced by the PLL. In an acquisition state of the demodulator, when signal quality is poor, and hard decision samples are more unreliable, it is desirable to halt adjustment of frequency and phase that could slow or event prevent convergence of the loop. Hence, adaptively combining soft decisions from the Equalizer and hard decisions from the Slicer, the PLL is automatically transitioned among acquisition and tracking states, and halted (or slowed) when signal quality worsens and its inputs become unreliable.

[0091] The output of Phase Detector 515 is supplied to mux 520. Mux 520 selects from among Phase Detector 515 output or a zero-value. Mux 520 is controlled by signal “control 2”, that is supplied from the Signal Processing, Logic, and Control Block (260 in FIG. 2) at each baud instance in accordance with certain aspects and embodiments of the present invention.

[0092] The output of Mux 520 is supplied to Loop Filter 599. Multiplier 530 applies proportional control by multiplication with τ₁, a programmable real-valued scalar, while multiplier 525 applies integral control by multiplication with τ₂, a programmable real-valued scalar. The output of multiplier 525 is then integrated in adder 535 and delay element 540. The output of adder 535 is the integral control, and is summed in adder 545 with the proportional control from multiplier 530. Adder 545 supplies the Loop Filter 599 output to the NCO 598.

[0093] Numerically-controlled oscillator (NCO) 598 integrates the signal from adder 545 (Loop Filter 599 output) in adder 550 and delay element 555. The output of adder 550, representing instantaneous phase of the desired sinusoid, is supplied to a Sin/Cos Generator 560. Sin/Cos Generator 560 uses prior art techniques, such as LUT storage of sinusoid, in whole or part, or direct calculation of approximation by Taylor (or other) series, for example, to provide sine and cosine terms. These sine and cosine terms are used to de-rotate the Equalizer soft decision sample by e^−j·θ(n)and also to re-rotate the Slicer hard decision sample by e^+j·θ(n).

Equalization

[0094] One preferred embodiment of the Equalizer portion of the present invention is extracted from FIG. 2 and drawn in FIG. 6. This equalizer architecture is a Decision Feedback Equalizer (DFE) with both forward and feedback filters operating in the passband, that uses prior art techniques described in U.S. Ser. No. 60/341,931, entitled “Self-initializing decision feedback equalizer with automatic gain control,” by T. J. Endres et al., filed Dec. 17, 2001 which is incorporated by reference.

[0095] In FIG. 6, the received signal, r(n), is a passband sample that is supplied from Timing Recovery Block 210 in FIG. 2. Forward filter 220 may operate at the baud rate or faster, in which case the equalizer is said to be fractionally-spaced, and exploits temporal diversity. Also, the forward filter 220 may receive multiple inputs, as from multiple antennas, to exploit spatial diversity. Temporal or spatial diversity use a multi-channel forward filter. For simplicity, however, a single forward filter 220 is shown, and extension to a multi-channel model is understood by one skilled in the art.

[0096] Forward filter 220 is a finite impulse response (FIR) filter, computing its output according to the convolution sum
x(n)=ƒ₀(n)·r(n)+ƒ₁(n)·r(n−1)+ƒ₂(n)·r(n−2)+ . . . +ƒ_L_ƒ₋₁(n)·r(n−L^ƒ+1)
where r(n) is the sample sequence input to forward filter 220, x(n) is the output sample sequence of forward filter 220, ƒ_iare the forward filter coefficients (or parameters,) and L_ƒ is the number of forward filter coefficients. Note that the forward filter coefficients are also shown with time index n to indicate that the forward filter 220 is adaptive.

[0097] The feedback filter 230 is not multi-channel, and is a FIR filter that calculates its output according to the convolution sum
y(n)=g₀(n)·v(n)+g₁(n)·v(n−1)+v(n)·v(n−2)+ . . . +g_L_g₋₁(n)·v(n−L_g+1)
where v(n) is the sample sequence input to feedback filter 230, y(n) is the output sample sequence of feedback filter 230, g_iare the feedback filter coefficients (or parameters,) and L_gis the number of feedback filter coefficients. Note that the feedback filter coefficients are also shown with time index n to indicate that the feedback filter 230 is adaptive. Though the feedback filter 230 is a FIR filter, it is embedded in a feedback loop, so that the equalizer has an overall impulse response that is infinite.

[0098] Adaptation of the forward filter 220 coefficients and feedback filter 230 coefficients uses a stochastic gradient descent update rule:
ƒ_i(n+1)=ƒ_i(n)−μ_ƒ·χ*(n)·e(n)
g_i(n+1)=g_i(n)−μ_g·φ*(n)·e(n)
where (·)* represents complex conjugation, and μ_ƒ and μ_gare small, positive stepsizes governing algorithm convergence rate, tracking capabilities and stochastic jitter. Using simplified updates, the data used in the adaptation equations are set to χ(n)=r(n) and φ(n)=v(n). The error term, e(n), depends on the operating mode of the Equalizer and is controlled by the Signal Processing, Logic and Control Block 260 (in FIG. 2). The various operating modes will be discussed later in this section. Setting χ(n)=r(n) and φ(n)=v(n) in these equations used to adapt forward filter 220 and feedback filter 230 coefficients is referred to as “simplified updates,” since the step known as regressor filtering is omitted. True cost function minimization requires an extra stage of filtering for the regressor data of the forward filter 220 and the feedback filter 230 in the adaptation process, using the current equalizer coefficients. Such regressor filtering is often omitted in practice to ease implementation. Regressor filtering is described in Chapter 5 of “Theory and design of adaptive filters” by J. R. Treichler, C. R. Johnson, Jr., and M. G. Larimore, Prentice Hall, 2001 which is incorporated by reference. One skilled in the art would recognize how to modify the regressor data used in the adaptation equations above to incorporate the extra stage of regressor filtering.

[0099] Adder 215 combines the outputs of forward filter 220 and feedback filter 230, x(n) and y(n), respectively, to form sample sequence {tilde over (w)}(n). Sample sequence {tilde over (w)}(n) is referred to as passband soft decision samples. Multiplier 225 applies de-rotation from the Carrier Loop 250 by e^−j·θ(n)and gain scaling from the Feedback AGC 240 by α(n). The output of multiplier 225 is denoted w(n) and referred to as baseband soft decision samples. These baseband soft decision samples are input to Slicer 270. Slicer 270 is a nearest-element decision device that outputs a hard decision, ŵ(n), corresponding to the source alphabet member with closest Euclidean distance to its input sample. The hard decisions, ŵ(n), from slicer 270 are re-rotated to the passband by application of Carrier Loop 250 signal e^+j·θ(n), and re-scaled by Feedback AGC 240 signal α⁻¹(n) in multiplier 235.

[0100] The output of multiplier 235 is weighted by 1−λ(n) in multiplier 245, and the signal {tilde over (w)}(n) is weighted by λ(n) in multiplier 265. Signals 1−λ(n) and λ(n) are real-valued, adaptive combining weights provided by Signal Processing, Logic, and Control Block 260 (in FIG. 2) and are greater than or equal to zero, but less than or equal to unity. The weighted signals from multipliers 245 and 265 are summed in adder 255 to form feedback sample v(n), used as input data to feedback filter 230.

[0101] The operational mode of the Equalizer is determined by error term, e(n), whose selection is governed by the Signal Processing, Logic, and Control Block 260 (in FIG. 2). These operational modes are next described.

Operational Mode 1: LMS

[0102] The Least Mean Squares (LMS) algorithm minimizes a Mean Squared Error (MSE) cost function that penalizes the squared difference between source sequence s(n) (in FIG. 1) from the transmitter, and Equalizer output w(n). In practice, the Receiver 150 in FIG. 1 stores or derives a replica of a training sequence, and the trained LMS algorithm uses error term
e_lms(n)=(w(n)−s(n))·e^+j·θ(n)
so that e(n) is set to e_lms(n). The baseband error term is re-rotated back to passband by multiplying the baseband error term with the sine and cosine terms from Carrier Loop 250. The training sequence is usually periodically resent, wasting valuable bandwidth.

[0103] In the absence of a training sequence, the output of Slicer 270 is used instead. Replacing s(n) with ŵ(n) in the LMS error term is called Decision Directed (DD) LMS and uses the error term
e_lms(n)=(w(n)−ŵ(n))·e^+j·θ(n)
so that e(n) is set to e_lms(n).

[0104] When this operational mode is selected, training sequence data is used in the LMS calculation; else, hard decision samples are used in the LMS calculation. It is understood that modifications to these LMS error terms, using MSE techniques, to suit the specific application, are obvious to one skilled in the art.

Operational Mode 2: CMA

[0105] The Constant Modulus Algorithm (CMA) minimizes the Constant Modulus (CM) cost function and calculates an error term without the use of a training sequence. Hence, it is classified as a blind algorithm. The CM criterion penalizes the dispersion of the magnitude squared of the equalizer output sample from a predetermined scalar. The preferred embodiment of the present invention calculates the CMA error term according to
e_cma(n)={tilde over (w)}(n)·(|{tilde over (w)}(n)|²−γ)
where γ is a predetermined, real-valued scalar referred to as the Godard radius, or dispersion constant, and is usually determined from the source alphabet as γ=E{|s(n)|⁴}/E{|s(n)|²}. Notice that the passband soft decision sample {tilde over (w)}(n) is used in the CMA error term calculation, so that there is no multiplication required with sine and cosine terms. This sample is prior to Feedback AGC gain scaling in multiplier 225 (FIG. 6). The inventors have determined that the use of soft decision sample prior to gain scaling in the CMA error term calculation reduces undesirable interaction between Equalizer 220 and Feedback AGC 240, compared to using the soft decision sample after gain scaling. In this case, e(n) is set to e_cma(n).

[0106] An alternative embodiment of the present invention calculates the CMA error tern according to
e_cma(n)=w(n)·(|w(n)|²−γ)·e^+j·θ(n)

[0107] In this case, e(n) is set to e_cma(n).

[0108] These CMA error terms described are of order 2, as described by Godard. It is understood that modifications to these CMA error terms, using constant modulus techniques, to suit the specific application, are obvious to one skilled in the art. Furthermore, related Bussgang techniques, as summarized in chapter 2 of “Blind Deconvolution,” Prentice Hall, written by S. Bellini, edited by S. Haykin, 1994, which work is incorporated by this reference, are generalizations of constant modulus techniques, and can be substituted for the described CMA error terms by one skilled in the art.

Operational Mode 3: Combined LMS and CMA

[0109] Using the adaptive combing weights 1−λ(n) and λ(n) provided by Signal Processing, Logic, and Control Block 260 (in FIG. 2), a combined error term is calculated according to
e(n)=λ(n)·e_lms(n)+(1−λ(n))·e_lms(n).

Operational Mode 4: Halt Adaptation

[0110] In this operational mode, the equalizer coefficients remain unchanged, so that the error term is
e(n)=0.

[0111] The error terms described above are for the Equalizer in FIG. 6 that has adaptive filters which operate in the passband. It is understood that modifications to these error terms for equalizer architectures with adaptive filters in the baseband, or for equalizer architectures with some adaptive filters operating in passband and others in baseband, are obvious to one skilled in the art.

Timing Recovery

[0112] The purpose of the Timing Recovery Loop (170 in FIG. 1) is to adjust the sampling phase and frequency of the received data. When the sampling epochs are adjusted to correspond to top-dead-center of the pulse shape, no ISI is introduced from neighboring symbols, since the pulse shape (for example, a square root raised cosine filter) is usually designed to be zero-valued at integer multiples of the baud rate.

[0113] To adjust the sampling epoch, most systems either adjust the sampling phase and frequency of the analog-to-digital converter (ADC), or interpolate the sampled data somewhere in the signal processing chain. FIG. 7 captures both of these approaches in a block diagram of Timing Recovery Loop 170 interfaced with Signal Processing, Logic, and Control Block 260 in accordance with certain aspects and embodiments of the present invention.

[0114] In FIG. 7, the received analog data r_a(t) is sampled in Sample Generator 710, producing sampled data sequence r(n)=r_a(nT+τ), where T is the sampling period and τ is the sampling phase. Sample Generator 710 may include an ADC with sampling period and phase that are adjusted by a clock provided by Reference Generator 740. Alternatively, Sample Generator 710 may include an ADC that samples data with a free-running clock, followed by a digital interpolator that is controlled by Reference Generator 740, for example, using a Numerically Controlled Oscillator (NCO).

[0115] Phase Detector 720 receives the sampled data r(n), and computes a phase error responsive to signals from the Signal Processing, Logic and Control Block 260 in accordance with certain aspects and embodiments of the present invention. Loop Filter 730 uses proportional and integral control to filter high-frequency signal components and integrate the phase error for sampling frequency adjustment. The Reference Generator 740 uses the loop error signal from Loop Filter 730 to provide control signals for sampling frequency and phase adjustment in Sample Generator 710.

[0116] In accordance with certain aspects and embodiments of the present invention, the operating mode of the Timing Recovery Loop 170 is determined from the signals provided by the Signal Processing, Logic, and Control Block 260 by selecting the criterion by which the phase error signal is calculated in the Phase Detector 720. FIG. 8 shows a block diagram of the logic in Phase Detector 720 using the control signals provided by the Signal Processing, Logic, and Control Block 260 to calculate a phase error signal ψ(n). The details of this block diagram will be apparent as the operating modes of Timing Recovery Loop 170 are discussed.

Operating Mode 1: Band Edge

[0117] Band edge timing recovery methods are prior art techniques basically based on the maximization of Signal to Noise Ratio (SNR) of sampler output. Band edge timing recovery schemes such as in U.S. Pat. No. 5,872,815 by C. Strolle et al, entitled “Apparatus for generating timing signals for a digital receiver,” which is incorporated by this reference, are implemented in pass band by exploiting the band edges of the data spectrum in order to obtain the timing phase maximizing the sampler output energy.

[0118] Phase Detector 720 computes the base band equivalent band edge timing phase error signal by differentiating the following base band output energy cost function

[0119]

\frac{\partial J_{OEM} (r, τ)}{\partial τ} = e_{TL} (n) \frac{\partial r (τ)}{\partial τ}

where e_TL(n) is an error term (in this case derived from r(n)) and

[0120]

\frac{\partial r}{\partial τ}

[0121] With the cost function defined as

[0122]

J_{OEM} (r, τ) = \frac{1}{2} {\langle r (τ) \rangle}^{2}

the band-edge phase error is
e_TL(n)=r(n).

[0123] This operating mode is selected by the Signal Processing, Logic, and Control Block 260 through the four control bits D_TL^0-3. Bit D_TL⁰instructs Phase Detector 720 to calculate a phase error signal with its own internal data, rather than using data provided from Equalizer 175. The remaining control bits, D_TL^1-3, instruct Phase Detector 720 to calculate the specific error term selected by Signal Processing, Logic and Control Block 260.

[0124] Band edge timing recovery techniques work well for blind acquisition, provided there is sufficient signal power in the band edges. However, a single echo multipath ray can attenuate the signal power in the band edges, and prevent phase lock.

Operating Mode 2: Calculate CMA

[0125] An alternative blind approach to timing recovery minimizes a CM cost function, J_CM(r, τ), of the sampled data r(n) with respect to timing phase τ, as proposed by Guglielmi et al. in “Joint Clock Recovery and Baseband Combining for the Diversity Radio Channel,” IEEE Transactions on Communications, vol. 44. pp 114-117, January 1996, which is incorporated by reference, and further described by Chung et al. in “Timing Recovery Based on Dispersion Minimization,” Proceedings of the 2001 Conference on Information Sciences and Systems, March 2001, which is incorporated by this reference.

[0126] The phase error is found by differentiating the cost function with respect to timing phase, τ. Using calculus, this differentiation is usually decomposed into

[0127]

\frac{\partial J_{CM} (r, τ)}{\partial τ} = e_{TL} (n) \cdot \frac{\partial r}{\partial τ}

where e_TL(n) is an error term (in this case derived from r(n)) and

[0128]

\frac{\partial r}{\partial τ}

is approximated in a variety or prior art methods, for example, using FIR filters in Lee and Messerchmitt, Digital Communication, Appendix 17-B, Kluwer Academic Publishers, Norwell, Mass., Second Edition, 1994 which is incorporated by reference. (This same decomposition is used for each of the phase error signals that we will describe and are derived by minimizing a cost function.) The CMA error term is calculated as
e_TL(n)=r(n)·(|r(n)|²−γ)

[0129] The CMA error term calculated by Phase Detector 720 is selected by Signal Processing, Logic, and Control Block 260 using control bits D_TL^0-3. Bit D_TL⁰instructs Phase Detector 720 to supply a phase error signal that is calculated with an error term using its own internal data, rather than using the error term provided by the equalizer. In FIG. 8, bit D_TL⁰controls mux 835 for this selection. Control bits, D_TL^1-3address mux 830 and are set according to the mux control table to select CMA. The derivative calculation in Derivative Calculator 810 uses sampled data r(n). The error term provided by mux 830 is multiplied in multiplier 825 by the derivative provided by Derivative Calculator 810, creating the phase error signal.

Operating Mode 3: Calculate LMS

[0130] A Mean Squared Error (MSE) style cost function J_MSE(r,τ) is minimized over the sampled data r(n) with respect to timing phase τ by Chung in “Blind Parameter Estimation for Data Acquisition in Digital Communications Systems”. Ph.D. Dissertation, Cornell University, Ithaca, N.Y., August 2002 which is incorporated by reference.

[0131] The phase error is found by differentiating the cost function with respect to timing phase, τ, and is of the form
e_TL(n)=|{circumflex over (r)}(n)−r(n)|
where {circumflex over (r)}(n) is a locally generated or stored hard decision estimate of the current received sample, for example, from a training sequence, a local (to Timing Recovery Loop 170) slicer, a reduced constellation mapping, or other method.

[0132] The LMS error term calculated by Phase Detector 720 is selected by Signal Processing, Logic, and Control Block 260 using control bits D_TL^0-3. Bit D_TL⁰instructs Phase Detector 720 to supply a phase error signal that is calculated with an error term using its own internal data, rather than using the error term provided by the equalizer. In FIG. 8, bit D_TL⁰controls mux 835 for this selection. Control bits, D_TL^1-3address mux 830 and are set according to the mux control table to select LMS.

Operating Mode 4: Calculate Combo Error Term

[0133] Using the adaptive combining weight, λ(n), provided by the Signal Processing, Logic, and Control Block 260, a combination error term, comprised of CMA and LMS error terms calculated in Operating Modes 2 and 3, is calculated by Phase Detector 720 according to
e_TL(n)=(1−λ(n))·e_CMA(n)+λ(n)·e_LMS(n)

[0134] In FIG. 8, the adaptive combining weight, λ(n), is supplied to Error Term Calculator 820, and control bits D_TL^1-3supplied by Signal Processing, Logic, and Control Block 260 are set to select the combination error term in mux 830. Control bit D_TL⁰selects a phase error in mux 835 that is supplied by multiplier 825.

Operating Mode 5: No Update

[0135] In this operating mode, the phase error is set to zero. Control bit D_TL⁰selects a phase error in mux 835 that is supplied by multiplier 825, while control bits D_TL^1-3select a zero-valued error term in mux 830.

Operating Mode 6: Use Error Term from Equalizer

[0136] In this operating mode, the error term calculated in Equalizer 175 is used in the phase error calculation. In FIG. 8, Derivative Calculator calculates a derivative using the equalizer output w(n) instead of the received data r(n). Control bit D_TL⁰selects a phase error in mux 835 that is supplied by multiplier 815, which multiplies the derivative from Derivative Calculator 810 with the equalizer error term e(n).

Joint, Adaptive Control of Equalization, Synchronization, and AGC

[0137] A block diagram of the Signal Processing, Logic, and Control Block 260 in accordance with certain aspects and embodiments of the present invention is shown in FIG. 9. Error Term and Combining Weight Calculator 905 has two functions: (i) to provide candidate error terms (like CMA, LMS, and their combination) that are calculated from equalizer samples, and (ii) to provide combining weight λ(n).

[0138] To calculate candidate error terms, baseband and passband Equalizer 175 (FIG. 1) output samples, w(n) and {tilde over (w)}(n), respectively, Slicer 270 (FIG. 2) hard decision output, ŵ(n), and sine and cosine terms from Carrier Loop 180 are supplied to Error Term and Combining Weight Calculator 905. The combining weight λ(n) can be calculated by methods in accordance with U.S. Ser. No. 60/341,931, entitled “Self-initializing decision feedback equalizer with automatic gain control,” by T. J. Endres et al., filed Dec. 17, 2001, which are repeated here.

[0139] The combining weight is chosen at each baud instance by comparing the distance of the baseband soft decision, w(n), to its nearest element in the source constellation, and normalizing by the size of the decision region. This idea is illustrated in FIG. 10, using a 16-QAM alphabet.

[0140] The left-hand-side of FIG. 10 shows a 16-QAM constellation 1010, and the right-hand-side is an exploded view of a single decision region 1020 for the constellation point 1025. The width of the decision region is 2Δ, and the distance of the scaled soft decision 350 to the constellation point 1025 is therefore |w(n)−ŵ(n)|. Excluding outermost constellation points that have open decision regions, the ratio {tilde over (λ)}(n)=|w(n)−ŵ(n)|/√{square root over (2)}Δ does not exceed unity. For those outermost constellation points, if {tilde over (λ)}(n) exceeds unity, it is set to unity. Hence, on an instantaneous basis, {tilde over (λ)}(n) is bounded between zero and one, and provides an instantaneous measure of signal integrity: when the scaled soft decision 1050 is far from the hard decision (constellation point) 1025, {tilde over (λ)}(n) is close to unity; when the scaled soft decision 1050 is close to the constellation point 1025, {tilde over (λ)}(n) is close to zero.

[0141] To add memory or induce averaging to the instantaneous combining weight {tilde over (λ)}(n), a leaky integrator is used, and the value of combining weight {tilde over (λ)}(n) is calculated as
λ(n)=(1−ρ_λ)·λ(n−1)+ρ_λ·{tilde over (λ)}(n)
where ρ_λ is the leakage term and is chosen less than or equal to one and greater than or equal to zero. Also, the combining weight λ(n) may be compared to two thresholds, T_Uand T_L. If λ(n)>T_U, then λ(n) is set to a register value, for example, unity; if λ(n)<T_L, then λ(n) is set to another register value, for example, zero.

[0142] A circuit used to calculate the combining weight λ(n) in accordance with certain aspects of the present invention is shown in FIG. 11. The baseband LMS error term is calculated and supplied to norm calculations 1105 and 1110, which calculate norms l₂=√{square root over (e₁²+e_Q²)} and l₁=|e₁|+|e_Q|, respectively, where e₁is the real part and e_Qis the imaginary part of the baseband LMS error term. Mux 1115 selects the desired norm calculation, and multiplier 1120 normalizes the result so that the maximum value of the product (neglecting constellation points with open-ended decision regions) is unity, according to the norm selected. Block 1125 clips the result to unity, accounting for those constellation points with open-ended decision regions.

[0143] Multiplier 1130, adder 1135, delay 1140, and multiplier 1145 comprise a leaky integrator, or averaging circuit. Multiplier 1130 scales the clipped value from block 1125 by the leakage amount ρ_λ. This product is summed with the output of multiplier 1145 in adder 1135. The result is delayed in delay element 1140, scaled by the leakage amount 1−ρ_λ in multiplier 1145 and then supplied to adder 1135.

[0144] The output of adder 1135 is first compared to upper threshold T_Uin comparator 1155. If this first comparison is satisfied, the combining weight is set to programmable upper value T_U-value in assignment block 1165. If this first comparison is not satisfied, the output of adder 1135 is next compared to lower threshold T_L. If this second comparison is satisfied, the combining weight is set to programmable lower value T_L-value in assignment block 1170. If this second comparison is not satisfied, the output of adder 1135 remains unchanged in assignment block 1175.

[0145] An alternative embodiment of the present invention calculates a combining weight λ(n) by indexing a programmable array of stored combining weight values, indexed by array index l provided by Array Index Update block 975.

[0146] Referring again to FIG. 9, the Error Term and Combining Weight Calculator 905 supplies candidate error terms to mux 910, and the baseband LMS error term is split into in-phase (I) and quadrature-phase (Q) components and supplied to absolute value blocks 930 and 925, respectively. The absolute values of I and Q components are compared to threshold T_ein comparison blocks 935 and 940, respectively. Comparison blocks 935 and 940 output a single bit each, designating true or false comparisons. Furthermore, the threshold T_eused in comparison blocks 935 and 940 is adjusted over time and supplied by Array Block 980. The output bits of comparison blocks 935 and 940 are logically compared in AND gate 945, generating control signal in_box. This control signal is therefore an instantaneous indicator of the proximity of the soft decision sample to the hard decision sample, conditioned upon the current value of threshold T_e.

[0147] A second control signal used in the Signal Processing, Logic, and Control Block 260 is generated based on the position of the hard decision sample in the source constellation, conditioned upon a prescribed template. For example, Slicer 270 supplies the symbol number (0 . . . M for M-ary QAM) prescribed to the hard decision sample in the constellation bit-to-symbol mapping (usually a type of grey code) to Region LUT 920. Region LUT 920 stores the desired template that is used to discern the second control signal. For example, FIG. 12 shows two such templates, and associate a bit with each constellation point. The left-hand plot encompasses an approximate annulus, while the right-hand plot encompasses the 16 most inner constellation points. Each template is stored in a single column of Region LUT 920, with row index determined by the symbol number 0 . . . M. One preferred embodiment of the present invention uses 16 such templates, so that the size of Region LUT is M×16, and the array index l ranges from 0 . . . 15. The symbol number of the bit-to-symbol mapping provided by Slicer 270 addresses the Region LUT 920 and selects a single row of the LUT contents, providing a 16-bit result. This 16-bit result is addressed by the array index l in mux 985, producing a second control signal referred to as in_region.

[0148] A third control signal used in the Signal Processing, Logic, and Control Block 260 is a training sequence indicator and is denoted by TR. This control signal is valid when the current sample is part of a training sequence sent by the transmitter, instead of bearing user data. It is apparent to one skilled in the art how to derive a training sequence indicator, for example using correlation techniques.

[0149] Control signals in_box and TR are logically compared in AND gate 950, and the result is supplied to an accumulator 970 that increments when the result is true. The accumulator 970 operates until a clear signal is provided by Array Index Update block 975, at which time accumulator 970 supplies its accumulated count, designated as J_T, to Array Index Update block 975, and resets its accumulator value to zero.

[0150] Control signals in_box and in_region are logically compared in AND gate 955, and the result is supplied to AND gate 960, which logically compares this result with the complement of control signal TR. The result of AND gate 960 is supplied to accumulator 965 that increments when the result is true. The accumulator 965 operates until a clear signal is provided by Array Index Update block 975, at which time accumulator 965 supplies its accumulated count, designated as J_D, to Array Index Update block 975, and resets its accumulator value to zero.

[0151] Array Index Update block 975 calculates array index l ranging from 0 . . . 15 in the preferred embodiment of the present invention, according to the flow diagram in FIG. 13. This circuit is executed at an integer multiple of the baud period, depending on the desired window length. For example, for systems operating in dynamic multipath conditions that are fast relative to the baud rate, this circuit may be executed every 64 or 128 baud iterations; but for systems operating in slowly changing signaling conditions relative to the baud rate, this circuit may be executed only every 2¹⁴or 2¹⁶baud iterations. Furthermore, the execution rate may be changed over the course of demodulator operation, for example, smaller at the start of demodulator operation to achieve rapid convergence, then increased once the array index has crossed a prescribed threshold.

[0152] The circuit in FIG. 13 uses two arrays of length P (16 in a preferred embodiment of the present invention), denoted by A₁and A_D, and one threshold, denoted by H. The values J_Dand J_Tfrom accumulators 965 and 970, respectively, and the current value of array index l (usually initialized to zero at demodulator power up) are also used in this circuit. The left hand side of the circuit is used to increment array index l, while the right hand side is used to decrement array index l. Decision block 1305 checks to see that the current value of array index l does not exceed the maximum value, P−1. If the current value of array index l is less than P−1, then decision block 1310 is entered; else, the array index l cannot be incremented and decision block 1320 is entered. Decision block 1310 compares J_Tfrom accumulator 970 to a predetermined threshold H. If J_T>H then decision block 1315 is entered; else, decision block 1320 is entered. Decision block 1315 compares J_Dfrom accumulator 965 to the value of increment array A, that is indexed by the current value of array index l, denoted by A₁(l). If J_D>A₁(l) then array index l is incremented in increment block 1330 and output block 1340 is entered; else, decision block 1320 is entered.

[0153] Decision block 1320 checks to see that the current value of array index l does not exceed the minimum value, 0. If l>0 is satisfied, then decision block 1325 is entered; else, output block 1340 is entered. Decision block 1325 compares J_Dfrom accumulator 970 to the value of decrement array A_Dthat is indexed by the current value of array index l, denoted by A_D(l). If J_D<A_D(l) then array index l is decremented in decrement block 1335 and output block 1340 is entered; else, output block 1340 is entered directly.

[0154] Output block 1340 sends “clear” signals to accumulators 965 and 970, resetting the count to zero in each, and loads another value of array index l, which has either been incremented, decremented, or is unchanged.

[0155] Referring again to the Signal Processing, Logic, and Control Block 260 in FIG. 9, the array index l from Array Index Update block 975 is provided to Array Block 980. Array

[0156] Block 980 stores a length-P (16 in a preferred embodiment of the present invention) array of threshold values T_e. The array index l indexes this array and selects a new threshold T_e, which is provided to comparison blocks 935 and 940. Similarly, Array Block 980 stores a length-P array of stepsize values for the preferred embodiment of Feedback AGC 240, which is indexed by array index l. A new value of stepsize μ_α is selected by array index l and provided to Feedback AGC 240.

[0157] For the alternative embodiment of Feedback AGC 240, Array Block 980 stores a length-P array of freeze bits. The freeze bit selected by array index l is provided to logical OR gate 990.

[0158] Moreover, Array Block 980 stores a length-P array of godard radius values, γ, one of which is used for CMA error term calculation. The elements stored in the array of godard radius values can be pre-calculated in accordance with the templates that are stored in Region LUT 920 corresponding to the current value of array index l. For example, since arbitrary templates of constellation points can be designed for inclusion in Region LUT 920, the CMA error term should be calculated based on the effective source constellation it sees (a subset of the full QAM source constellation), which could be the values stored in the present template of Region LUT 920, or their complement. This choice depends on the design of the Adaptation Select LUT 915. The godard radius selected by array index l is provided to Error Term and Combining Weight Calculator 905, and used in the CMA error term calculation.

[0159] Array Block 980 can also store arrays for other demodulator parameters, like stepsizes for adaptive filters 220 and 230. Each array is indexed by array index l, and a new parameter is provided by Array Block 980 for demodulator operation.

[0160] The three control signals, in_box, in_region, and TR are used also as address bits to Adaptation Select LUT 915. Adaptation Select LUT 915 stores a programmable LUT that contains various control bits for demodulator operation, whose selected values are contingent upon the current values of control signals in_box, in_region, and TR. For example, Adaptation Select LUT 915 outputs two control bits that govern mux 910, which selects the error term used in update of Equalizer 175 coefficients, choosing from among LMS, CMA, combined LMS and CMA (using combining weight λ(n)), and zero, at each baud instance. An example adaptation strategy may be to use an LMS error term, derived from training data, when TR is true; CMA when in_region is true and in_box is not; a combination error term when both in_region and in_box are true, and a zero-valued error term otherwise. The Adaptation Select LUT 915 can be programmed to accommodate a variety of adaptation strategies, not limited to this example. Furthermore, the Adaptation Select LUT 915 can be reloaded over the course of demodulator operation, for example, contingent on the value of array index l, an estimate of demodulated SNR, or after a prescribed amount of time, so that the adaptation strategy is itself changed over the course of demodulator operation.

[0161] The Adaptation Select LUT 915 contains control bits for other demodulator operations, too. For example, referring again to FIG. 5, three control signals are shown that govern Carrier Loop 250 operation. Control signal 1 governs mux 510 that selects a hard decision sample from Slicer 270 or Coarse Tune Hard Decision Block 505. One strategy selects the hard decision sample from Slicer 270 when all of TR, in_region, and in_box are true, or when only in_region and in_box are true, and selects a hard decision sample from coarse tune Hard Decision Block 505 otherwise. Control signal 2 is used to govern mux 520, and may select a zero-valued phase error when TR, in_region, and in_box are false, indicating low quality of demodulator performance, instead of selecting the phase error generated by Phase Detector 515. Control Signal 3 is used to select the style of hard decision generated from Coarse Tune Hard Decision Block 505, selecting from among the five operating modes of Carrier Loop 250 previously described.

[0162] Adaptation Select LUT 915 also contains control bits for Feedback AGC 177 operation. For the preferred embodiment of Feedback AGC 177, four operating modes have been identified, and can be selected on a symbol-by-symbol basis using the control bits for from Adaptation Select LUT 915. The association of operating mode to control signals in_box, in_region, and TR depends upon the templates stored in Region LUT 920. For example, if Region LUT 920 stores an annulus (as described in the left subplot of FIG. 12), then a CM-like cost function may be chosen when in_region is true; however, if Region LUT 920 stores inner constellation points (as described in the right subplot of FIG. 12), then an LMS-like cost function may be chosen when in_region is true.

[0163] If the alternative embodiment of Feedback AGC 177, illustrated in FIG. 4, is used, then control bits from Adaptation Select LUT 915 determine the operating modes previously described for FIG. 4. One of the control bits from Adaptation Select LUT 915 is provided to logical OR gate 990, together with a control bit from Array Block 980. The result from logical OR gate 990 is used to select the operating mode that determines AGC freeze.

[0164] Adaptation Select LUT 915 also contains control bits for Timing Recovery Loop 170, that determine the operating mode from among the six operating modes previously discussed in FIG. 7. Moreover, control bits are provided to Loop Filter 730 from Adaptation Select LUT 915 that govern loop constants for proportional and integral control. For example, one of these control bits if true selects loop constants from registered values set by the user or application software, or if false according to a predetermined table. One such table is below:

[0165]


Control Bits	Proportional	Integral
to Loop Filter	Loop Constant	Loop Constant

0 0	Registered value	Registered value
0 1	Registered value/8	Registered value/8
1 0	Registered value/8	Registered value/16
1 1	0	0

[0166] The methods described in FIG. 9 for the Signal Processing, Logic, and Control Block 260 facilitate extremely flexible demodulator operation, since LUTs are programmable, and can be selected for a desired operational environment of the demodulator. For example, the templates stored in Region LUT 920 can be designed so that outer-most signal points are handled differently, to account for nonlinear effects caused by high power amplifiers in the transmitter. Adaptation strategies for physical layer functions can be completely modified by simple LUT change, and if re-loaded while the demodulator is operating, adaptation strategies can be changed “on-the-fly”. Furthermore, the counters and telemetry points in the Signal Processing, Logic and Control Block 260 (FIG. 9) can be useful indicators of demodulator health, and provide signal quality assessment to the user, aiding in antenna placement or other tasks needing receiver feedback.

[0167] One skilled in the art would understand that the equations described herein may include scaling, change of sign, or similar constant modifications that are not shown for simplicity. One skilled in the art would realize that such modifications can be readily determined or derived for the particular implementation. Thus, the described equations may be subject to such modifications, and are not limited to the exact forms presented herein.

[0168] Certain aspects and embodiments of the present invention have been described using Quadrature Amplitude Modulation (QAM) signals with complex signal processing, unless specifically noted. However, one skilled in the art would realize that the techniques described herein may be applied to a receiver processing Phase-Shift Keyed (PSK), Pulse Amplitude Modulation (PAM), or other signals.

[0169] As would be apparent to one skilled in the art, the various functions of equalization, signal combining, automatic gain control, carrier recovery, and timing recovery may be implemented with circuit elements or may also be implemented in the digital domain as processing steps in a software program. Such software may be employed in, for example, a digital signal processor, micro-controller, or general-purpose computer.

[0170] The present invention can be embodied in the form of methods and apparatuses for practicing those methods. The present invention can also be embodied in the form of program code embodied in tangible media, such as floppy diskettes, CD-ROMs, hard drives, or any other machine-readable storage medium, wherein, when the program code is loaded into and executed by a machine, such as a computer, the machine becomes an apparatus for practicing the invention. The present invention can also be embodied in the form of program code, for example, whether stored in a storage medium, loaded into and/or executed by a machine, or transmitted over some transmission medium, such as over electrical wiring or cabling, through fiber optics, or via electromagnetic radiation, wherein, when the program code is loaded into and executed by a machine, such as a computer, the machine becomes an apparatus for practicing the invention. When implemented on a general-purpose processor, the program code segments combine with the processor to provide a unique device that operates analogously to specific logic circuits.

[0171] It will be further understood that various changes in the details, materials, and arrangements of the parts which have been described and illustrated in order to explain the nature of this invention may be made by those skilled in the art without departing from the principle and scope of the invention as expressed in the following claim.

Claims

Post-issuance certificates present

The text shown below may not reflect later post-issuance changes.

What is claimed is:

1. In a wireless communications receiver having a timing recovery module, carrier recovery module, automatic gain control module, and equalization module, said communications receiver responsive to a received signal to form soft decision samples corresponding to said received signal and hard decision samples corresponding to said received signal, a method for jointly operating said timing recovery module, said carrier recovery module, said automatic gain control module, and said equalization module, said method comprising:

deriving control signals from said soft and hard decision samples, wherein the control signals comprise a candidate error term and a combining weight, wherein said combining weight is based on a normalized difference between said soft and hard decision samples; and

using said control signals to jointly determine operation of said timing recovery module, said carrier recovery module, said automatic gain control module, and said equalization module.

2. The method of claim 1, wherein the received signal comprises data, the method further comprising:

adjusting a sampling phase and frequency of the data.

3. The method of claim 1, further comprising:

determining the combining weight by comparing the soft decision sample to a nearest element in a source constellation.

Patent Citations (192)

Patent	Date	Inventor	Cited By
US2138330(A)	1938-11-01	Thompson	Applicant
US2977551(A)	1961-03-01	Gibson et al.	Applicant
US3386033(A)	1968-05-01	Copeland et al.	Applicant
US3703685(A)	1972-11-01	Simopoulos et al.	Applicant
US3714659(A)	1973-01-01	Firman	Applicant
US3774218(A)	1973-11-01	Fowler	Applicant
US3838444(A)	1974-09-01	Loughlin et al.	Applicant
US3873771(A)	1975-03-01	Kleinerman et al.	Applicant
US3924060(A)	1975-12-01	Bedford	Applicant
US3974449(A)	1976-08-01	Falconer	Applicant
US3984624(A)	1976-10-01	Waggener	Applicant
US3999005(A)	1976-12-01	Dickinson	Applicant
US4081497(A)	1978-03-01	Tokumitsu et al.	Applicant
US4115778(A)	1978-09-01	Snow	Applicant
US4128880(A)	1978-12-01	Cray et al.	Applicant
US4302626(A)	1981-11-01	Streeter	Applicant
US4310920(A)	1982-01-01	Hayes	Applicant
US4316215(A)	1982-02-01	Yasumoto et al.	Applicant
US4322842(A)	1982-03-01	Martinez	Applicant
US4337479(A)	1982-06-01	Tomimoto et al.	Applicant
US4379947(A)	1983-04-01	Warner	Applicant
US4459595(A)	1984-07-01	Kramer et al.	Applicant
US4459681(A)	1984-07-01	Ohtsuka	Applicant
US4469437(A)	1984-09-01	Yuasa et al.	Applicant
US4476484(A)	1984-10-01	Haskell	Applicant
US4513415(A)	1985-04-01	Martinez	Applicant
US4523225(A)	1985-06-01	Masuda et al.	Applicant
US4535352(A)	1985-08-01	Haskell	Applicant
US4551011(A)	1985-11-01	Yuasa et al.	Applicant
US4575225(A)	1986-03-01	Yuasa et al.	Applicant
US4576470(A)	1986-03-01	Yuasa et al.	Applicant
US4587495(A)	1986-05-01	Osawa et al.	Applicant
US4589011(A)	1986-05-01	Rzeszewski	Applicant
US4602260(A)	1986-07-01	Lindenmeier	Applicant
US4607230(A)	1986-08-01	Kaku et al.	Applicant
US4704025(A)	1987-11-01	Yuasa et al.	Applicant
US4750036(A)	1988-06-01	Martinez	Applicant
US4754233(A)	1988-06-01	Pickett	Applicant
US4821097(A)	1989-04-01	Robbins	Applicant
US4870489(A)	1989-09-01	Ducret	Applicant
US4879606(A)	1989-11-01	Walter et al.	Applicant
US4882614(A)	1989-11-01	Kageyama et al.	Applicant
US4882725(A)	1989-11-01	Noda et al.	Applicant
US4907218(A)	1990-03-01	Inoue et al.	Applicant
US4926244(A)	1990-05-01	Imnardi	Applicant
US4928177(A)	1990-05-01	Martinez	Applicant
US4944032(A)	1990-07-01	Kageyama et al.	Applicant
US4958230(A)	1990-09-01	Jonnalagadda et al.	Applicant
US4985769(A)	1991-01-01	Yasumoto et al.	Applicant
US5006926(A)	1991-04-01	Tsinberg	Applicant
US5019830(A)	1991-05-01	Harada	Applicant
US5036386(A)	1991-07-01	Yasumoto et al.	Applicant
US5038402(A)	1991-08-01	Robbins	Applicant
US5087975(A)	1992-02-01	Citta et al.	Applicant
US5093718(A)	1992-03-01	Hoarty et al.	Applicant
US5103295(A)	1992-04-01	Uwabata et al.	Applicant
US5103310(A)	1992-04-01	Gibson et al.	Applicant
US5126998(A)	1992-06-01	Stem, Jr.	Applicant
US5132988(A)	1992-07-01	Fisher et al.	Applicant
US5134464(A)	1992-07-01	Basile et al.	Applicant
US5142353(A)	1992-08-01	Kageyama et al.	Applicant
US5151783(A)	1992-09-01	Faroudja	Applicant
US5172126(A)	1992-12-01	Naito	Applicant
US5177604(A)	1993-01-01	Martinez	Applicant
US5214501(A)	1993-05-01	Cavellerano et al.	Applicant
US5220420(A)	1993-06-01	Hoarty et al.	Applicant
US5235619(A)	1993-08-01	Beyers, II et al.	Applicant
US5243423(A)	1993-09-01	DeJean et al.	Applicant
US5247351(A)	1993-09-01	Cho	Applicant
US5270817(A)	1993-12-01	Hayashi et al.	Applicant
US5276507(A)	1994-01-01	Uwabata et al.	Applicant
US5287180(A)	1994-02-01	White	Applicant
US5291289(A)	1994-03-01	Hulyalkar et al.	Applicant
US5293633(A)	1994-03-01	Robbins	Applicant
US5321514(A)	1994-06-01	Martinez	Applicant
US5327460(A)	1994-07-01	Batruni	Applicant
US5357284(A)	1994-10-01	Todd	Applicant
US5379324(A)	1995-01-01	Mueller et al.	Applicant
US5386239(A)	1995-01-01	Wang et al.	Applicant
US5412720(A)	1995-05-01	Hoarty	Applicant
US5430661(A)	1995-07-01	Fisher et al.	Applicant
US5442403(A)	1995-08-01	Yasumoto et al.	Applicant
US5448299(A)	1995-09-01	Yang et al.	Applicant
US5461426(A)	1995-10-01	Limberg et al.	Applicant
US5534933(A)	1996-07-01	Yang	Applicant
US5550578(A)	1996-08-01	Hoarty et al.	Applicant
US5550579(A)	1996-08-01	Martinez	Applicant
US5557316(A)	1996-09-01	Hoarty et al.	Applicant
US5559559(A)	1996-09-01	Jungo et al.	Applicant
US5563664(A)	1996-10-01	Yang et al.	Applicant
US5579055(A)	1996-11-01	Hamilton et al.	Applicant
US5585975(A)	1996-12-01	Bliss	Applicant
US5586121(A)	1996-12-01	Moura et al.	Applicant
US5587743(A)	1996-12-01	Montgomery et al.	Applicant
US5589872(A)	1996-12-01	Martinez	Applicant
US5596361(A)	1997-01-01	Martinez	Applicant
US5600573(A)	1997-02-01	Hendricks et al.	Applicant
US5617148(A)	1997-04-01	Montgomery	Applicant
US5666168(A)	1997-09-01	Montgomery et al.	Applicant
US5673293(A)	1997-09-01	Scarpa et al.	Examiner
US5694424(A)	1997-12-01	Ariyavisitakul	Applicant
US5714965(A)	1998-02-01	Taguchi	Applicant
US5734853(A)	1998-03-01	Hendricks et al.	Applicant
USRE35774(E)	1998-04-01	Moura et al.	Applicant
US5742902(A)	1998-04-01	Shore	Applicant
US5809086(A)	1998-09-01	Ariyavisitakul	Applicant
US5812184(A)	1998-09-01	Martinez	Applicant
US5818441(A)	1998-10-01	Throckmorton et al.	Applicant
US5818845(A)	1998-10-01	Moura et al.	Applicant
US5828655(A)	1998-10-01	Moura et al.	Applicant
US5859852(A)	1999-01-01	Moura et al.	Applicant
US5881302(A)	1999-03-01	Omata	Applicant
US5909253(A)	1999-06-01	Jonnalagadda et al.	Applicant
US5946047(A)	1999-08-01	Levan	Applicant
US5946048(A)	1999-08-01	Levan	Applicant
US5946322(A)	1999-08-01	Moura et al.	Applicant
US5946351(A)	1999-08-01	Ariyavisitakul et al.	Applicant
US5956346(A)	1999-09-01	Levan	Applicant
US5959660(A)	1999-09-01	Levan	Applicant
US5959997(A)	1999-09-01	Moura et al.	Applicant
US5961603(A)	1999-10-01	Kunkel et al.	Applicant
US5994891(A)	1999-11-01	Hubbell	Applicant
US5995168(A)	1999-11-01	Yagi	Examiner
US5995563(A)	1999-11-01	Ben-Efraim et al.	Examiner
US6005850(A)	1999-12-01	Moura et al.	Applicant
US6012161(A)	2000-01-01	Ariyavisitakul et al.	Applicant
US6016316(A)	2000-01-01	Moura et al.	Applicant
US6018526(A)	2000-01-01	Liu et al.	Applicant
US6018764(A)	2000-01-01	Field et al.	Applicant
US6034678(A)	2000-03-01	Hoarty et al.	Applicant
US6047159(A)	2000-04-01	Powell et al.	Applicant
US6066993(A)	2000-05-01	Yamamoto et al.	Applicant
US6073030(A)	2000-06-01	Nair et al.	Applicant
US6100883(A)	2000-08-01	Hoarty	Applicant
US6104727(A)	2000-08-01	Moura et al.	Applicant
US6192384(B1)	2001-02-01	Dally et al.	Applicant
US6201536(B1)	2001-03-01	Hendricks et al.	Applicant
US6226323(B1)	2001-05-01	Tan et al.	Applicant
US6240133(B1)	2001-05-01	Sommer et al.	Examiner
US6249180(B1)	2001-06-01	Maalej et al.	Examiner
US6268774(B1)	2001-07-01	Soumyanath	Applicant
US6305020(B1)	2001-10-01	Hoarty et al.	Applicant
US6310548(B1)	2001-10-01	Stephens, Jr. et al.	Applicant
US6314134(B1)	2001-11-01	Werner et al.	Applicant
US6341360(B1)	2002-01-01	Abdelilah et al.	Applicant
US6356586(B1)	2002-03-01	Krishnamoorthy et al.	Applicant
US6366613(B2)	2002-04-01	Sommer et al.	Applicant
US6370160(B1)	2002-04-01	Knutson et al.	Examiner
US6370571(B1)	2002-04-01	Medin, Jr.	Applicant
US6377529(B1)	2002-04-01	Lee et al.	Applicant
US6385237(B1)	2002-05-01	Tsui et al.	Examiner
US6426973(B1)	2002-07-01	Madhow et al.	Applicant
US6433835(B1)	2002-08-01	Hartson et al.	Applicant
US6501310(B2)	2002-12-01	Takami	Examiner
US6510553(B1)	2003-01-01	Hazra	Applicant
US6563862(B1)	2003-05-01	Knutson et al.	Examiner
US6665790(B1)	2003-12-01	Glossner et al.	Applicant
US6680971(B1)	2004-01-01	Tazebay et al.	Applicant
US6754277(B1)	2004-06-01	Heinzelman et al.	Applicant
US6754293(B1)	2004-06-01	Henriksson et al.	Examiner
US6754715(B1)	2004-06-01	Cannon et al.	Applicant
US6791995(B1)	2004-09-01	Azenkot et al.	Examiner
US6816548(B1)	2004-11-01	Shiue et al.	Examiner
US6829298(B1)	2004-12-01	Abe et al.	Applicant
US6834039(B1)	2004-12-01	Kelly et al.	Applicant
US6904098(B1)	2005-06-01	Isaksen et al.	Examiner
US6980602(B1)	2005-12-01	Kleinerman et al.	Examiner
US6985549(B1)	2006-01-01	Biracree et al.	Examiner
US7027500(B1)	2006-04-01	Casas et al.	Examiner
US7027528(B2)	2006-04-01	Liu et al.	Examiner
US7031405(B1)	2006-04-01	Touzni et al.	Examiner
US7158567(B2)	2007-01-01	Wang et al.	Examiner
US2001/0022813(A1)	2001-09-01	Tan et al.	Applicant
US2002/0056140(A1)	2002-05-01	Oishi et al.	Applicant
US2002/0059597(A1)	2002-05-01	Kikinis et al.	Applicant
US2002/0104083(A1)	2002-08-01	Hendricks et al.	Applicant
US2002/0186764(A1)	2002-12-01	Amin et al.	Applicant
US2003/0035468(A1)	2003-02-01	Corbaton et al.	Examiner
US2003/0095590(A1)	2003-05-01	Fuller et al.	Applicant
US2003/0156603(A1)	2003-08-01	Rakib et al.	Applicant
US2004/0042566(A1)	2004-03-01	Eidson et al.	Examiner
US2006/0181797(A1)	2006-08-01	Sugawara et al.	Examiner
EP308241	1989-03-01		Applicant
EP577351	1994-01-01		Applicant
EP1156634	2001-11-01		Applicant
WO92/22983	1992-12-01		Applicant
WO94/23470	1994-10-01		Applicant
WO95/01676	1995-01-01		Applicant
WO99/55087	1999-10-01		Applicant
WO/72446	2000-11-01		Applicant
WO2/07425	2002-01-01		Applicant
WO2/84965	2002-10-01		Applicant

Non-Patent Literature (40)

Lucky, R.W.: “Techniques for adaptive equalization of digital communication systems” Bell Systems Technical Journal, vol. 45, No. 2, pp. 255-286, Feb. 1966.Applicant
Godard, D. N.: “Self-recovering equalization and carrier tracking in two-dimensional data communication systems,” IEEE Transactions on Communications, vol. 28, No. 11, pp. 1867-1875, Oct. 1980.Applicant
Treichler, J. R., and Agee, B.G.: “A new approach to multipath correction of constant modulus signals,” IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. ASSP-31, No. 2, pp. 459-472, Apr. 1983.Applicant
Casas R. A., et al.: “Current approaches to blind decision feedback equalization,” in the textbook, “Signal processing advances in wireless and mobile communications: trends in channel estimation and equalization,” edited by G. Giannakis, et al., Prentice Hall, Upper Saddle River, NJ, 2000.Applicant
Daneshard, B. et al. “Finite Wordlength Requirements for Adaptive Signal Processing Elements in Digital QAM ADSL Systems.” Communications, 1994. Supercomm/ICC '94, Conference Record, ‘Serving Humanity Through Communications.’ May 1, 1994. ISBN: 0780318250.Applicant
Naito, T. et al. Adaptive Equalization Based on Internal Model Principle for Time-Varying Fading Channels. IEEE, Oct. 1, 2001, p. 363-368, XP010521667.Applicant
Ciciora, Dukes, Hartson, Hoarty, Embedding high-speed data in analog signals CED Magazine, Dec. 2001, p. 92-100.Applicant
Modern Cable Television Technology: Video, Voice, and Data Communications, 1999 Walter Ciciora, James Farmer, David Large, Morgan Kaufman ISBN 1-55860-416-2.Applicant
Ormiston, et al “Compact Low Noise Receiving Antenna” IEE Electronics Letters, Jul. 9, 1998, vol. 34, No. 14, pp. 1367-1368.Applicant
Tooley et al.; “Active Receiving Antenna”, Practical Wireless, Mar. 1981, vol. 57, No. 3, pp. 52-55.Applicant
Chen, Brian. The Key to Unlocking Network Assets: Increasing Capacity by Embedding Content in Current Video Transmissions. CED Magazine, Dec. 2001. http://www.cedmagazine.com/ced/2001/1201/12f.htm.Applicant
Press Release of WavePhore, Inc. entitled “WavePhore and the Canadian Broadcasting Corporation Enter an Agreement to Deliver Data Broadcasting Nationwide in Canada,” dated Mar. 29, 1995.Applicant
Advertisement in Investor's Business Daily, “Technology Offers TV Broadcasters An Avenue Into Interactive Services”, Monday, Apr. 19, 1993.Applicant
News Release of WavePhore, entitled “WavePhore and Belcom Sign Agreement to Co-Develop Russian Data Broadcasting System” (two pages, believed to have been released Apr. 10, 1995).Applicant
Press Release of WavePhore entitled FCC Proposed to Allow Digital Data Transmission Within the Video Portion of TV Broadcasts, in Response to WavePhore's Request, (two pages, believed to have been released Apr. 25, 1995).Applicant
Advertisement in The Indianapolis News, WavePhore Stock Is On Roll, dated May 23, 1995.Applicant
Advertisement in Investor's Business Daily, Intel, WavePhore Set Technology Alliance, dated Monday, May 8, 1995.Applicant
Press Release, entitled Intel and WavePhore Sign Technology And Investment Agreement, (two pages, believed to have been released May 5, 1995).Applicant
Advertisement, The Arizona Republic Business, “Tempe firm, Intel Team Up to Send Data via TV”, dated Saturday, May 6, 1995.Applicant
Advertisement, Arizona Business Gazette, entitled “Skyway System Rides TV Signals to Distribute Data—Speed Key to WavePhore Technology”, dated Jul. 13, 1995.Applicant
Advertisement, Arizona Business Gazette, entitled “Motivated CEO Leads WavePhore”, dated Jul. 13, 1995.Applicant
Press Release of WavePhore, entitled WavePhore Develops Data Casting System for Television Azteca In Mexico (two pages, believed to have been released Aug. 8, 1995).Applicant
Press Release of WavePhore, entitled WavePhore and Arizona State University Launch Distance Learning Service, (two pages, believed to have been released Aug. 17, 1995).Applicant
G.M. Glasford, Fundamentals of Television Engineering, McGraw-Hill 1955.Applicant
D.G. Fink, Television Engineering, 2nd Edition, McGraw-Hill 1952.Applicant
C.G. Eilers, “TV Multichannel Sound—The BTSC System,” IEEE Transactions on Consumer electronics, Aug. 1984.Applicant
Taylor, “The Vestigal Sideband and Other Tribulations,” p. 203 of the 1988 National Cable Television Association Technical Papers.Applicant
“HGTV & Vestigal Sidebank Syndrome” in the IEEE Transactions on Broadcasting, Mar. 1990, p. 8.Applicant
Wave Generation & Shaping, Leonard Strauss, McGraw-Hill 1970, Chapters 1 and 2.Applicant
W. Ciciora et al., “A Tutorial on Ghost Canceling in Television Systems,” IEEE Transactions on Consumer Electronics, vol. CE-25, No. 1, Feb. 1979, pp. 9-44.Applicant
Hill, et al.—Introduction to Switching Theory & Logical Design, John Wiley & Sons 1968, SBN 471 39880 K.Applicant
Tanenbaum, A. “Computer Networks,” Prentice Hall 1996, ISBN 0-1-349945-6.Applicant
Spohn, D.L., “Data Network Design,” McGraw Hill, 1993 ISBN 0-07-06-360-X.Applicant
Kaufman, C., “Network Security,” Prentice Hall, 1995 ISBN 0-13-061466-1.Applicant
Ariyavisitakul et al. “Joint Coding and Decision Feedback Equalization for Broadband Wireless Channels” IEEE; Dec. 1998; pp. 1670-1678: vol. 19; No. 9.Applicant
NetMedia, Connecting the NetMedia TriplePlay™ Modulator, MM73 Installation Modulators, 201 2000-2003.Applicant
NetMedia, Programming the NetMedia TriplePlay™ Modulator, MM73 Installation Modulators, © 2000-2003.Applicant
NetMedia, Troubleshooting Tips, Troubleshooting Modulators, pp. 1-2, © 2000, 2001.Applicant
FCC 96-274 Report and Order, Digital Data Transmission Within the Video Portion of Television Broadcast Station Transmissions, Adopted: Jun. 21, 1996, Released Jun. 28, 1996, pp. 1-10, Appendix A, Appendix B.Applicant
Rhyne, V.T., Basic Concepts, Chapter 1, pp. 1-27, Fundamentals of Digital Systems Design, Prentice-Hall, Inc., 1973.Applicant