Multitrack Digital Data Storage: A Reduced Complexity Architecture

We describe a low-complexity noniterative detector for magnetic and optical multitrack high-density data storage. The detector is based on the M-algorithm architecture. It performs limited breadth-first detection on the equivalent one-dimensional (1-D) channel obtained by column-by-column helical unwinding of the two-dimensional (2-D) channel. The detection performance is optimized by the use of a specific 2-D minimum-phase factorization of the channel impulse response by the equalizer. An optimized path selection scheme maintains the complexity close to practical 1-D Viterbi. This scheme is based on an approximate path metric parallel sort network, taking advantage of the metrics´ residual ordering from previous M-algorithm iterations. Such an architecture approaches maximum-likelihood performance on a high areal density uncoded channel for a practical number of retained paths M and bit error rate (BER) below 10^-4. The performance of the system is evaluated when the channel is encoded with multi-parity check (MPC) block inner code and an outer interleaved Reed-Solomon code. The inner code enhances the minimum error distance of the equalized channel and reduces the correct path losses of the M-algorithm path buffer. The decoding is performed noniteratively. Here, we compare the performance of the system to the soft iterative joint decoding of the read channels for data pages encoded with low-density parity check (LDPC) codes with comparable rates and block length. We provide an approximation of the 2-D channel capacity to further assess the performance of the system