This talk will provide a tutorial overview of the timing recovery problem, including a brief review of current approaches. We then describe iterative methods that jointly perform the tasks of timing recovery and error-control decoding. We will describe a per-survivor method for iterative timing recovery in which a separate phase-locked loop is implemented for each "survivor" of the forward and backward passes through the trellis of a BCJR soft-output equalizer. Numerical results illustrate the advantage of the proposed technique, including its ability to rapidly and automatically correct for a cycle slip.
Viewgraphs: [pdf]
In this work, we introduce a new framework to analyze and construct such codes. We first construct a single graph that incorporates information on these unconstrained positions directly into the constraint graph without any assumptions of periodicity or restrictions on the sets of unconstrained positions. We show how to compute the maximum possible fraction of unconstrained positions for any constrained system using cycles in this graph and derive explicit values for the RLL (d,k) and MTR (j,k) constraints. We also investigate properties of the trade-off function relating the fraction of unconstrained positions to the maximum code rates and establish their relation to the work of Campello, Marcus, New, and Wilson.
This is a joint presentation with Lei Poo.
Viewgraphs: [pdf]
Viewgraphs: [pdf]
Viewgraphs: [pdf]
Viewgraphs: [ppt]
Viewgraphs: [pdf]
In this work, we introduce a new framework to analyze and construct such codes. We first construct a single graph that incorporates information on these unconstrained positions directly into the constraint graph without any assumptions of periodicity or restrictions on the sets of unconstrained positions. We show how to compute the maximum possible fraction of unconstrained positions for any constrained system using cycles in this graph and derive explicit values for the RLL (d,k) and MTR (j,k) constraints. We also investigate properties of the trade-off function relating the fraction of unconstrained positions to the maximum code rates and establish their relation to the work of Campello, Marcus, New, and Wilson.
Viewgraphs: [pdf]
Viewgraphs: [pdf]
Viewgraphs: [ppt]
Viewgraphs: [pdf]