Title :
Reduced-complexity modified per-survivor iterative timing recovery using M-algorithm for magnetic recording system
Author :
Warisarn, Chanon ; Supnithi, Pomchai ; Kovintavewat, Piya
Author_Institution :
Coll. of Data Storage Innovation, King Mongkut´´s Inst. of Technol. Ladkrabang, Bangkok, Thailand
Abstract :
A modified per-survivor iterative timing recovery (MPS-ITR), which jointly performs timing recovery, equalization, and error-correction decoding, has been proposed in [1] to deal with the problem of timing recovery operating at low signal-to-noise ratio. Practically, this scheme exploits a split-preamble strategy in conjunction with a per-survivor soft-output Viterbi algorithm equalizer to make it more robust against severe timing jitters or cycle slips. Although the MPS-ITR outperforms other iterative timing recovery schemes [1], it still has very high complexity. In this paper, we propose a reduced-complexity MPS-ITR scheme (denoted as MPS-ITR-M) to make it more implementable in real-life applications. This is achieved by applying the M-algorithm [2] to the MPS-ITR. Numerical results indicate that at low-to-moderate complexity, the MPS-ITR-M will perform better than other schemes.
Keywords :
equalisers; error correction codes; iterative methods; magnetic recording; synchronisation; M-algorithm; MPS-ITR scheme; MPS-ITR-M; complexity reduction; cycle slips; error-correction decoding; magnetic recording system; modified per-survivor iterative timing recovery; per-survivor soft-output Viterbi algorithm equalizer; signal-to-noise ratio; split-preamble strategy; timing jitters; Iterative decoding; Receivers; M-algorithm; iterative timing recovery; per-survivor iterative timing recovery; timing acquisition;
Conference_Titel :
Intelligent Signal Processing and Communications Systems (ISPACS), 2011 International Symposium on
Conference_Location :
Chiang Mai
Print_ISBN :
978-1-4577-2165-6
DOI :
10.1109/ISPACS.2011.6146175