BaseLine Wander Compensation by Per-Survivor-Processing

Baseline wander (BLW) is one of major sources of bit errors in perpendicular recording. In this paper, we present a method to compensate for BLW by per-survivor processing (PSP), i.e., along each surviving path in the Viterbi algorithm (VA). We apply the PSP method in VA in timing recovery loop and SOVA for iterative decoding. Simulation results show that the cycle slip rate and bit error rate are lowered and approach ideal case where there is no BLW