Mueller and Muller Timing Recovery PDF
Mueller and Muller Timing Recovery PDF
Mueller and Muller Timing Recovery PDF
5 , MAY 1976
L. G . Roberts, Multiple computer networks and inter-computer committee of the Washington, DC section of the IEEE. He was chair-
communications,presented at Ass. Comput. Mach.OperatingmanoftheThirdDataCommunicationsSymposiumandhispresent
Systems
Principles,
Gatlinburg,
TN, Oct.
1967. research
interests
are
data
incommunications
and
computer
networks.
J. W. Smith, Determination of path lengths in a distributed net- Dr. Pickholtz is a member of Eta Kappa Nu and Sigma Xi.
work, RAND Corp., memo. RM-3578-PR, Aug. 1964.
E.C.Wolf, An advanced computer communication network,
inProc. AZAA Comput. Network Syst. Confi, 1973. *
*
Abstract-A new class of fast-converging timing recovery methods small loop gains the residual jitter is proportional and convergence time
for synchronous digital data receivers is investigated. Starting with a is inversely proportional to the loop gain. The proposed algorithms are
worst-casetiming offset, convergencewith randombinarydata will simple andeconomic to implement.Theyapply to binary or multi-
typically occur within 10-20 symbols. The input signal is sampled at level PAM signals as well as to partial response signals.
thebaudrate;thesesamplesarethen processed to deriveasuitable
control signal to adjust the timing phase. A general method is outlined
to obtain near-minimum-variance estimates of the timing offset with
respect to a given steady-state sampling criterion. Although we make I. INTRODUCTION
certainindependenceassumptionsbetween successivesamples and
postulate idealdecisions to obtainconvenientanalyticalresults,our
simulations with a decision-directed reference and baud-to-baud adjust-
ments yieldverysimilarresults.Convergence is exponential, and for
S YMBOL synchronization or timing recovery is one of the
most critical receiver functions in synchronous communica-
tion systems. The receiver clock must be continuously adjusted
in its frequency and phase to optimize the sampling instants of
Paper approved by the Associate Editor for Data Communication the received data signal and to compensate for frequency drifts
Systems of theIEEECommunicationsSocietyforpublicationafter betweenthe oscillators used in thetransmitter and receiver
presentationat the 1974 ZurichSeminarforDigital Communication,
Zurich,Switzerland. Manuscriptreceived October9,1975; revised clockcircuits. Forbinaryor multilevel PAM signals, several
December 11, 1975. timing recovery methods areknown [ l ] -[9]. Thetiming
K. H. Mueller is,with Bell Laboratories, Holmdel, NJ 07733. information is usually derived from the data signal itself and
M. Mullerwaswith the SwissFederalInstituteofTechnology,
Zurich,Switzerland. Heis nowwith the Overseas Department,Gen- based on some meaningful optimization criterion which dete-r-
eral Radio Company, Zurich, Switzerland. mines the steady-state location of the timing instants. A crude
MUELLER AND MULLER: TIMING RECOVERY IN DATA RECEIVERS 517
distinction can bemadebetweenthreedifferent kinds of crossing methods (class A) can thus be obtained reliably only
methods. by averaging over a large number of transitions. This is not a
Class A : The threshold crossings of the received baseband serious drawback during steady-state tracking, but it tends to
data signal (at zero if the signal is binary, or halfway between increase the initial training time. Similar considerations apply
the reference levels if the signal is multilevel) are compared for methods based on classes B and C.
with the sampling phase. A correction of the sampling phase The mentioned timing recovery systems are usually imple-
is initiated as a result of this comparison. Themean location of mentedafter several signal processing operations have taken
the crossings is estimated and the optimum sampling instant place: the received signal is filtered,demodulated, filtered
and maximum eye opening are assumed t o be halfway between again, and probably passed through an automatic equalizer.
these crossings. For most of these operations, analog signal processing has been
CZass B: This method uses the signal derivative at the sam- used and still is in use today.The signal that is needed t o
pling instants. Thisderivative, or at least its sign, is usually derive timing information is thus usually acontinuous signal
n
c
Sampler
Analog
I
signal
Input
Timing
recovery
w
Within the brackets, two terms appear in addition to the de-
sired data value a, : The first one1 is caused by intersymbol
interference; it disappears if h ( ~ + iT) = 6 i o , i.e., if the im-
pulse response satisfies the Nyquist criterion. Since all echoes
Fig. 1. Block diagram ofrecovery
timing
Timing recovery
loop for +
baseband
h(7 functions of r, it is clear that the intersymbol
data
iT) are
receiver. (a) Analog signal processing. (b) Digital signal processing.
interference is heavily influencedby the choiceof the sam-
pling phase. The remaining term is due to additive noise which
is assumed t o be a stationary, zero mean random process. The
need ofanyfurther signal information.Our discussion will sampling phase should ideally be chosen in such a way as t o
be limited t o baseband signaling. This is justified because the minimize error probability; but for practical implementation
more important linear modulation methods allow the concept moreconvenientsuboptimalcriteria are preferable,such as
of .an equivalent baseband channel for system modeling [ 151 . sampling at the maximum-eye opening (minimum intersymbol
We realize, however, that in a general data receiver, the adap- interference), or minimizing the mean square error. It is well
tive loops for timing recovery, carrier phase control, and auto- known that, for these two objectives, the peak distortion D
matic equalization do not work independently of each other and the mean square distortion e are appropriate quality mea-
when jointly operated, and interaction must be carefully in- sures [ 151 defined by
vestigated. Such aspects have been studied for analogtiming
loops using signal differentiation [ S I , [ 7 ] . In the present
paper, we will concentrate on timing recovery alone, but joint
operationwithother receiver parameters is under investiga-
tion and will be reported in a future publication.
After a short review of the timing problem we will outline
how timing information can be derived from the samples of
the impulseresponse.Sincethesesamplesare not available
during transmission, a technique will be presented to obtain
estimatesdirectlyfromthe signal samples. We will derive a where we have used the short notation hi= h(r iT) for con-
bound for the minimum variance of these estimates and show venience. A channel is distortion free if a particular phase TO
+
how suboptimum estimates, suitable for simple implementa- exists such that D ( T ~=) ~ ( 7 = ~ 0.
) Whether the channel is
tion, can be obtained, which are close to this minimum. The distortion free or not, the usualobjective is to find a phase
method will be illustratedwith somepractical examples. As T that minimizes one of the performance measures (3) or (4).
anextstep,the convergencebehaviorof a timing control One obvious approach is to compute the partial derivative of
loopthat uses these estimates in astochasticadjustment the performance measure with respect t o r and make propor-
algorithm will bestudied.Finally, wewill present several tional timing updates in the opposite direction. Such steepest
computer simulations that
confirm the fast,
convergence descentgradientalgorithms will stop adjusting oncethede-
properties, even with a decision-directed start-up. sired optimum phase is reached. Note that, instead of the men-
tioned derivative, any other (monotonic) function of r could
11. REVIEW OF THE TIMING RECOVERY PROBLEM be used, provided it has the same root, or at least one that is
close. This fact is used in the threshold crossing schemes dis-
Let us consider a synchronous baseband data transmission cussed earlier. It also points the way for solving our problem
system withan overall impulseresponse h(t); its output can at hand: all that is required is a timing function f(7) that can
then be described as be efficiently computedfrombaud-spaced signal samples
andwhose root is close totheminimumofareasonably,
x(t) = a,h(t - k T ) + n(t) chosen performance measure. This will be done in two steps:
k wewill first derive our timing function from the impulse re-
where n(t) represents some additive Gaussian noise. The ahs sponse, and then, in a second step, show how thistiming func-
are data symbols chosen with equal probability and indepen- tion (or estimates of it) can be derived from the signal samples
dentlyfrom previous symbolsfrom a set of L equidistant
values. Assume now,thatthe signal is sampled atinstants
t = r + m T ; then A prime on a summation indicates deletionof the zeroth term.
MUELLER A N D MULLER: TIMING RECOVERY I N DATA RECEIVERS 519
L
f(7) = u,(h, - h-i) (7) ported by the authors of this paper [16]. Although the above
i; 1 timing functions represent a somewhat subjective choice, they
are nevertheless probably the most basic and simple functions
in order to yield (in the absence of distortion) an odd symme- satisfying all the requirements discussed earlier. Many of the
trydetectorcharacteristic.Note that, in theapproachjust
problems that have to be studied with other timing functions
outlined,timinginformation is derivedfrom thesymmetry will be highlighted in the discussion of the two examples (8)
error of the sampled impulse response.
and (9).
From the large class of possible timing functions we will
The timing function type A is plotted in Fig; 2 for a Ny-
pick out two particular ones for a more detaileddiscussion,
quist pulse with various rolloffs a. Note the excellent linearity
namely
around zero. The slope at zero which defines the phase detector
gain constant is only mildly affected by the bandwidth (it de-
Type A :
creases by a factor of two if a varies from 0 to 0.8). For a =
f ( 7 ) = %1( h l - h _ , ) = ~ [ h ( 7 + ~ - h ( 7 - T ) ] . (8) 0 we have
Type B:
+
is the signal vector at t = T kT containing the last rn input
samples, a h is the corresponding data vector The conditional expected value of x k is a linear function of
the 2m - 1 samples h , - m , ..., h,, ..., hm - of the system
impulseresponse.This can bestatedmore clearly in the
form
and ek = x k - is the associated errorvector.The objective
is toobtain,throughappropriate choice of the weighting Vk = E { X k / a k } =AkTh (19)
vector g k , a good estimate of fl~).Theelements of g k are
where h containsthe samples of theabove-mentionedtrun-
Delay pT at Nyquist frequency. cated impulse response and A h is a (2m - 1)*mmatrix
MUELLER A N D MULLER: TIMING RECOVERY IN DATA RECEIVERS 521
4 D
I
1. -
cx z.1 / .8-
.6 -
.4 -
.2-
0 0
.4 .8 1.2 1.6 2 .4 .8 1.2 1.6 2
40
1. -
fD
.8- a :.4 a 1.8
.6 -
min
.4 -
tzf3
.4 1.6 .8 1.2 2. .4 .8 1.2 1.6 2
Fig. 5. Peak distortion for channels with cosine rolloff 01 and
quadratic delay distortion.
0 0 ...
E k k Tek 1= E { gTkX k 1 - h O E { Tg ka k 1 (22)
ak-l 0 ...
... where the second term yieldsa constantthat can eitherbe
ak ah-1
made zero or used to offset some bias in the first term (e.g.,
dependence on ho).
A blockdiagramof a subsystem using theseprinciples to
... extract timing information is depicted in Fig. 6. Data or error
ak-m+l
samples are entered into an m tap transversal filter-like struc-
ak--m+l
... ture; but itis important to note that theweighting coefficients
0 0 akUm+l ..' are functionsofthedatasymbols andare thus changing at
the symbol rate. Such a function can be linear ornonlinear
and involve one, several, or all data values of a h . The resulting
coefficientscanbedigitalnumbersrequiringrepresentation
- 0 0 0 ... with one or several bits. With the exception of the most sim-
ple examples(e.g.,amemoryofonlytwosymbols),the
generationof g k is most efficientlyaccomplishedwitha
read-only memory (ROM) that contains the appropriate truth
table.
By combining (16), (17), and (19) we obtain so far wehave not discussed the computation of g k . Be-
fore this is done we will determine the variance of z k because
E{zk} =h T E { A k g k } . this will be a measure for the mean square error involved in
the estimate off(7). First we evaluate
The expectation of the product of a signal vector and a data
dependent weightingvector is thus a linear functionofthe E{zk2}=E{gkTXk-ykTgk}=E{gkTEIXkXkT/aklgk}. (13)
samples of h(t), precisely as we have specified for our timing
function ( 5 ) . The meanof (12) is obtained in an equivalent The elements mij of the m X m matrixMk =E(xkxkT/ak} are
way > given by
522 COMMUNICATIONS,
IEEE TRANSACTIONS ON MAY 1976
- - - - - - - - -- - - - - - - - -
- -1 gonal tothedata vector a h ;but we will say more aboutthat in
the next section. Finally, we would like to point out that only
or er minor occur
modifications white
if additive Gaussian noise
with variance u2 is includedin our analysis. Thematrix Q
must then be replaced by Q + p21; the mean of z k remains
"k unchanged.
hf.
V. CHOOSING THE WEIGHTING VECTOR
otherwise
Recall that E2{ z k } is a constant and that g k , M k , and A h are
and thus dependingonly on the m data values contained in a h . The
expected values in (32) are thus sums of individual functions
g(ah), each weighted with the probability of its a h , and the
extremum is found by setting
and the variance of z k becomes If we assume for the moment that M k is nonsingular, the op-
timum g k may be expressed as
S=E{Zk2} -E2{Zk}
The resultsshow thatthe variance of z k depends very The second equation of ( 3 3 ) requires that
strongly on g k . It 'is interesting to note that the matrix does
= 2E-'{AkMk-'AkT)U (37)
not contain the main sample ho ; thus, if the channel is ideal
and if the correct timing phase is used, we conclude that Q = so that finally
0 and v k = h o a k . The variance will then be a function o f the
inner
product g k T a k and will be
zero if g k is chosen ortho- g!, o p t = M k - l A k T ~ - l { A k M k - l A k T } U . (3 8)
MUELLER AND MULLER: TIMING RECOVERY IN DATA RECEIVERS 523
This formal solution can be inserted into (22) and will then element of u must also be zero t o avoid any appearance of ho
, yield aminimum variance in E{Zk} in order t o allow for proper operation of the control
loop as has been mentioned in Section I11 while discussing the
(39) choice of u .
..,
'.it.
In practice, it seems t o be a logical start to select the m
A few comments are in order to the above results. First we '.equations (42) symmetrically around the center of the original
recall that the matrix Q can become very small in the vicinity system, i.e., blocking out an m X m square from the rectangu-
of the optimum timing instant since it does not depend on lar matrix Ah. In addition,we would try to set all components
the main pulse ho. Mk will then be ill-conditioned since it is of d k mequal t o zero in a first approach, thereby avoiding in
mainly determined by the singular matrix v k v k T. Singularity the main term of S all contributions of the usually largest
of hfk can of course always be avoided if a noise term 021is samples in the vicinity of ho. Thus we obtain a tentative solu-
added to Q. Nevertheless, the evaluation of (38) can become tion
quite involved. Furthermore, since g k o p t depends on Mk and
thus on Q, the optimum weighting vector is a function of the
impulse response and is therefore influencedby the channel
characteristics and,mostimportant, by the timing offset whichneeds t o be checked against the remaining equations
of the set (40). If those are not satisfied, we can try again,
itself. For this reason, any fixed weighting vector g k can only
be optimum for one :special situation. We can thus interpret this time allowing nonzero values forat leastsomeof the
(39) as a lower bound. The variance associated with a fixed g knoncenter d k m elements or
probably choosing different
can then be compared with this lower bound for a variety of equations. On theotherhand,a slight deviation fromthe
channel parameters. This will be done later on when we have specified u may be entirely tolerable. Although this method
may sound somewhat heuristic, it nevertheless proved t o be
developed some particularly simple examples for g k . Instead of
evaluating (38)for some specific channels, wewill in the quite efficientandconvenientin practice. Those who may
following propose a simple, suboptimum, channel-independent prefer t o determinetheoptimum weightingvector directly
approach to the probl.em which will lead us t o a number of from (38) must bear in mind that the components of g k are
interestinggk's. rational functions of the elements of u. Such a solution would
Condition (3 1) may be expressed as also depend on the channeland on timingoffsetitself. For
computerevaluation, special formula-manipulation programs
like M A T H L A B , A L P A K , or S Y M B A L may thus be required.
At many computer sites such compilers do not exist.
where the components of dk are zero mean random variables.' Finally we mentionthatthe alternative approach (12)
The choice of the random vector dk will affect the variance of based ontheerror signal will of course always yield alow
zk according t o variance timing estimate since thecomponents of f?k are
given by
akTgk = 0,
must belong to
the reduced system (42). Note
that
the
center
(43) (ai:1 k:
ah-1
)ti1) = rf)
amples. For scheme A, based on (8) and m = 2, (40) reads
(:)+ (46)
524 IEEE TRANSACTIONS ON COMMUNICATIONS, MAY 1976
L J
intersymbolinterference
the
ifchannel is not ideal)
and so2 + vo2 '
and becomes
where we have set for convenience
A m i n = (1 - cs2)2 + c2v12
A m a x = ( l -cS1)' + c2vZ2. (70) with a resulting jitter
convergence time
7.82
TABLE I
PARAMETERS s AND v FOR BINARY NYQUIST SIGNALING
i
This dead zone effect can be avoided as long as v
c4 = . 2
dB!q
0
p =o
SNR=26dB
2 Levels
Q I \ ._ I 2 Level
.1 -
.o - . . . . . . ....... . . .. . . . . . . .. . . . . .....,
10 20 30 40 50 60 70
-
N
0 20 40
(a)
60 80 N
-
Similar simulationsforother estimates have also shown
. . . . . .. . . . ..
good agreement with the theoretically predicted performance.
.o *
-
Instead of discussing theseresultsin detail, we will devote b
0 20 40 60 80 N
some space to related topics that are of more practical signi-
(b)
ficanceto the system designer, and we will modify our sub- Fig. 12. Convergence behavior with estimate (49). (a) No distortion.
sequent simulations accordingly. (b) Quadratic delay distortion, p = 2.
First a few words will be said regarding the data symbols
ah that are required tocomputetheestimates z k . With an
initialoffset ofT/2the first few decisions are practically rapid acquisition. If the channel is noise free, a slight improve-
uncorrelated with the actual data symbols. Intheory, a synch- ment is obtained, particularly in theupperbound,butfor
ronizedreference could beprovided at the receiver, but this SNRs as theyoccurat voice grade channels(25-35dB),
is not an attractive solution since the synchronization process convergence is almost unaffected by noise.
would probably require more time than the timing recovery. Fig. 12(b) demonstratesthe behavior of the same loop
The use of adecision directedreference, even during start- with achannel that exhibits quadratic delay distortion (0 =
up, is a much more appealing scheme; i.e., the data symbols 2). The phase whichminimizes peakdistortionhas been
are estimated by suitable quantization of the signal samples. chosen as the reference, e.g., 7 = 0. The variance of the .con-
Because of the large initial error rate such a loop is hard to vergence characteristicshas somewhat increased. The larger
analyze,butit cart conveniently beinvestigated via simula- jitter,ofcourse, is due to the remaining intersymbolinter-
tion.Second, we will makeadjustmentsat each baud to ference which, in turn causes a high s-. This degradation is
obtain fast convergence in real. time. A somewhat larger value even enhanced bythe timing functionsinabilitytofind
for F will be used initially and then reduced by a factor of exactly the maximum eye opening (see Section I1 and Fig. 5).
fourafter30adjustmentstoobtain a small steady-state In the case understudy,settling occurs at a timing phase
timing jitter.Finally, we will also demonstratethe variabi- whichyieldsapeak distortion of 0.9 whereasa value of
lity of convergence as caused by the training sequence itself, 0.7 could be achieved with a more optimum sampling instant.
i.e., the choice of the starting point. This can most conveni- Decreasing c will thusonlyhelpto a minor degree since a
ently be doneby depicting the envelopes of all 63 curves. steady-state bias will remain. An algorithmwhichforces
As previously, a rolloff a = 0.2, a 26-dB SNR, and a quanti- hl = 0 (scheme B) shouldprovidesuperior steady-state
zation p = 1/256 will be used. behavior, at least for channels with delay distortion similar
Fig. 12(a) shows the performance results of this modified to that used in our example. This is depicted in Fig. 13 where
loop, again with the estimate (49). The solid lines give upper the same simulations have beenrepeated with the weighting
and lower bounds for 8 , while the dotted curve shows the rms vector (56). The average settling timeremains aboutthe
value of the average jitter 4 as in Fig. 11, only that we are now same, theupperbound is increased(particularly in theun-
using a linear scale. Convergence takes 5-15 symbols depend- distortedchannel),butthe bias inthe presence of delay
ing on the sequence start, which demonstratesthat careful distortion is significantly reduced. A similar behavior can be
optimization of the training pattern i s very importantfor expected with estimate (53) and is depicted in Fig. 14. Here
MUELLER AND MULLER: TIMING RECOVERY IN DATA RECEIVERS 5 29
P rn :.2
P ol z.2
0.0 R.0
SNR r26d8 SNR :26dB
2 Level 2 Level
.1
.o ..............................
0 20 40 60 80 N 0 20 40 60 80 N
(a) !a)
0.2
z.2
SNR ~ 2 d8
2 Level
6
.5 TL o(
0:2
2.2
S N R =26dB
2 Level
.1 - ............
. .
.o 7 -,
.................... - D
0 20 40 60 80 N 0 20 40 60 80 N
(b) (b)
Fig. 13. Convergence behavior with weighting vector ( 5 6 ) . (a) No dis- Fig. 14. Convergence behavior with estimate (53). (a) No distortion.
tortion. (b) Quadratic delay distortion,p = 2 . (b) Quadratic delay distortion,p = 3.
ho is learned simultaneously with the timing phasebyusing after a specified time. The behavior of such a system is demon-
the linear recursion strated in Fig. 15(b), and one can conclude that this approach
provides an efficientand highly practicalschemeformulti-
level signaling. Similar results have been obtained in this case
with algorithms based on other estimates.
where we have set E = 118.
Remember that a decision-directed reference has been used IX. CONCLUSIONS AND SUMMARY
inthe precedingsimulations.The use of an idealreference We have presented a new class of timing recovery schemes
was found to yield only a minor improvement in mean con- for synchronous data receivers. All information is derived from
vergence time; even the decreaseof the worst case bound is the Nyquist spaced signal samples alone; no signal derivatives,
not that significant. The reason for this may be that the large zero crossings, squarelaw devices, ornarrow-bandfilters
correctionsoccurringwithinthefirstfewadjustments will are required. Timing corrections are based on estimates which
rapidly shift the phase away from its initial 0 = 0.5 position. are productsofthe sampled signal vector (or errorvector)
It is unimportantin whichdirectionthisshifttakesplace; and a weightingvectorwhose componentsarefunctions of
the reliability ofthe decisions will alwaysimprove,andthe the data symbols. The expected value of this estimate defines
loop will be able to lock in. Our experience indicates that atimingfunction f(~)which is of crucial importancefor
this is not necessarily truewithmultilevel signaling. Such boththetransfercharacteristicofthecontrolloopandthe
signals
have shownconvergenceproblemswith
decision- resultingsteady-statesamplingphase.Examplesforsuitable
directed start-up, even under ideal channel conditions. The use choices off(.) have been presented, and a procedure has been
of an ideal reference is very advantageous in such situations. outlined to obtainanappropriateweightingvectorthat will
As anexample, Fig lS(a)shows thesimulation resultsofa yield a low variance estimate. A bound for the minimum vari-
four-levelsystem using estimate (49). Notethatthe26-dB ancehasbeen given, andit was demonstratedthat results
SNR is now a more seriousdegradation thanwithbinary close to this bound can be practicallyachieved.Due to this
signaling, but even so, thetimingloopsettles very rapidly. smallvarianceveryrapid convergence is obtained when these
The ideal reference is not needed if the system is started up estimates are used in a timing loop with a stochastic adjust-
with a binary signal first; the numberof levels is then increased mentalgorithm. Thetheoreticalresultsregardinglowerand
530 IEEE TRANSACTIONS ON COMMUNICATIONS, MAY 1976
::h
established. To achieve both fast convergence and low jitter,
a gearshifting arrangement fortheloop gain maybeused.
rn :.2 Finally, it shouldbe mentionedthatthetiming recovery
0.0 schemes presentedhere are extremely suitable for receivers
.3
SNR :26dB based on digital processing. The necessary computations are
4 Level very simple; in some estimates a single addition or subtraction
is all that is required.
.2 :
.1 - ACKNOWLEDGMENT
ol s.2
0 . 0
REFERENCES
SNR 226 dB W. R. Bennett and J. R. Davey, Data Transmission. New York:
4 Level
McCraw-Hill, 1965.
J. J. Stiffler, Theory of SynchronousCommunication. Engle-
wood Cliffs, NJ: Prentice-Hall, 1971.
W. C.Lindseyand M. K. Simon, TelecommunicationSystems
Engineering. Englewood Cliffs, NJ: Prentice-Hall, 1973.
.1 - B. R. Saltzberg, Timing recovery for
synchronous
binary
datatransmission, Bell Syst.Tech. J., vol. 46, pp. 593-622,
.o . . . . . . . . . . . .-.. ........... March 1967.
0 20 40 60 00 N R. W. Chang, Joint equalization, carrier acquisition, and timing
(b) recoveryfordatacommunication,in Conf. Rec.,Int.Conf.
Commun., 1970.
Fig. 15. Convergence behavior of four-level signal. (a) Ideal reference. R . D. Gitlinand J. Salz, Timing recoveryin PAM-systems,
(b) Estimated reference withtwo-level start-up. Bell Syst. Tech. J., vol. 50, pp. 1645-1669, May-June 1971.
H. Kobayashi, Simultaneous adaptive estimation and decision
algorithmforcarriermodulateddatatransmissionsystems,
IEEE Trans. Commun., vol. COM-19, pp. 268-280, June 1971.
upper bounds on convergence as well as residual jitter have W. R. Bennett, Statistics of regenerative digital transmission,
been very well confirmed bysimulations. Our analysis was BellSyst. Tech. J., vol. 3 7 , pp. 1501-1542, Nov. 1958.
based on certain independence assumptions and on the availa- Y. Takasaki,Timingextractioninbasebandpulsetransmis-
sion, IEEE Trans. Commun., vol. COM-20, pp.877-884,
bility of an idealreference signal, but these do not seem to Oct. 1972.
be restricting requirements. In fact, a large number of simula- L. E. Franks and J. P. Bubrouski, Statistical properties of tim-
tions using a decision-directedreference andbaud-to-baud ing jitterin a PAM timingrecoverysystem, IEEE Trans.
Commun., vol. COM-22, pp. 913-920, July 1974.
adjustment (where some dependencebetweenadjacent esti- A. L. McBride and A. P. Sage,Optimumestimation of bit
mates exists) have shown very similar results. Formulti- synchronization, IEEE Trans. Aerosp.Electron.Syst., vol.
level systems with decision-directed reference, it is necessary A E S J , pp. 525-536, May 1969.
U. Mengali, Aself .bitsynchronizermatchedtothe signal
to sta.rt up, withtwo levels first,andthen switch tomore shape, IEEE Trans. Aerosp.Electron.Syst., vol.AES-7,pp.
levels after a certainnumberof symbols. For binarydata, 686-693, July 1971.
convergence can be obtained in less than 20 symbols. For A. Lender, Decision directedadaptiveequalizationtechnique
for high speed data transmission, IEEE Trans. Commun.
channels with negligible or small distortion, estimates based Technol., vol. COM-18, pp. 625-632, Oct. 1970.
on the symmetry error of the sampled impulse response seem D. A. Spaulding, A new digital coherent demodulator, IEEE
to be preferable to all others since they yield timing functions Trans. Commun., vol. COM-21, pp. 237-238, Mar. 1973.
R. W. Lucky,J. Salz,and E. J.Weldon, Principles of Data
of oddsymmetry(detector characteristic), and can provide Communication. New York: McCraw-Hill, 1968.
very small variance over a wide range of offsets.However, K. H. Mueller and M. Mueller, Adaptivetimingrecoveryin
if distortion is severe, the symmetric estimates may produce digital synchronousdata receivers, in Conf. Rec., 1974 Int.
Zurich Seminar on Digital Communications, 1974.
more steady-state offset than is acceptable, and other schemes, E. R . Kretzmer,Generalization of a techniqueforbinary
e.g., forcing = 0, can give superiorresults in thisrespect. datacommunication, IEEE Trans. Commun:Technol., vol.
Noise levels as they arelikely to occur on voice grade tele- COM-14, pp. 67-68, Feb. 1966.
C. Schollmeier and N. Schatz, The design of nonlinear phase
phone channels have little influence on the rapid convergence. trackingloopsbysimulation, IEEE Trans. Commun., vol.
Steady-state jitter decreases with decreasing loop gain, but the COM-23, pp. 296-299, Feb. 1975.
loop gain cannot be reduced arbitrarily because of dead zone K. H. Mueller and D. A. Spaulding, unpublished memorandum,
Apr.24, 1973.
effectsdue to finitetimingresolution. A good compromise A. Papoulis, Probability. Random Variables and Stochastic
between these requirementscan, however,be rather easily Processes. New York: McGraw-Hill. 1965.
IEEE TRANSACTIONS
COMMUNICATIONS,
ON VOL.NO.
COM-24, 5 , MAY 1 9 7 6 531
[21] H . Robbinsand S. Monro, A stochastic approximation Institute of Technology. During 1973 he was also a member of the
method,Ann. Math. Statist,, vol. 22, pp. 400-407, Sept. 1951. Executive Body oftheEuropeanInformaticsNetwork. His present
[22] D. J. Sakrison,Stochasticapproximation:A recursive method work at Bell Laboratories is mostlyindigital signal processing for
for solving regression problems,inAdvances in Communica- data transmission systems.
*
tion Theory, vol. 2. New York: Academic, 1966.
*
Kurt H. Mueller received the Diploma in
electrical engineering andthe Ph.D. degree from
the Swiss Federal Institute of Technology,
Zurich, Switzerland, in 1961 and 1967, respec-
tively.
From1962 to 1969 heworked at various
research,teaching,and supervisory positions
atthe Swiss FederalInstitute of Technology,
1 wherehe gave courses in signal theoryand
informationtheory. In 1969hejoined Bell
Laboratories,Holmdel, NJ,
where
he was
involved in a variety of problems in high-speed data communication.
During 1972-1973 he was on leave of absence back at the Swiss Federal