Multihead Multitrack Detection for Next Generation Magnetic Recording, Part II: Complexity Reduction - Algorithms and Performance Analysis

To achieve large storage capacity on magnetic hard disk drives, very high track density is required, causing severe intertrack interference (ITI). Multihead multitrack (MHMT) detection has been proposed to better combat the effects of ITI. Such detection, however, has prohibitive implementation complexity. Reduced-state sequence estimation (RSSE) is a promising technique for significantly reducing the complexity, while retaining good performance. In this paper, several different MHMT models are considered, including symmetric and asymmetric 2H2T systems, and a symmetric 3H3T system. By carefully evaluating the effective distance between two input symbols, we propose optimized set partition trees for each channel model. Different trellis configurations for RSSE are constructed based on the desired performance/complexity tradeoff. Simulation results show that the reduced MHMT detector can achieve near maximum-likelihood (ML) performance with a small fraction of the original number of trellis states. We also use error event analysis to explain the behavior of RSSE. The proposed algorithm could be potentially applied to next generation magnetic recording systems, especially when the ML detector is infeasible due to the high computational complexity.