Iterative Processing Techniques Research Articles

An iterative inter-track interference mitigation method for two-dimensional magnetic recording systems

At high recording density, the readback signal of two-dimensional magnetic recording is inevitably corrupted by the two-dimensional (2D) interference consisting of inter-symbol interference and inter-track interference (ITI), which can significantly degrade the overall system performance. This paper proposes an iterative ITI mitigation method using three modified 2D soft-output Viterbi algorithm (2D-SOVA) detectors in conjunction with an iterative processing technique to combat the 2D interference. The codeword of the outer code is divided and then written on three separate tracks. For every iteration, all 2D-SOVA detectors exchange the soft information to improve the reliability of the a priori information and use it in the branch metric calculation, before feeding the refined soft information to the outer decoder. Simulation results show that the proposed method outperforms the conventional receiver and the existing partial ITI mitigation method.

Structured LDPC Codes to Reduce Pseudo Cycles for Turbo Equalization in Perpendicular Magnetic Recording

Low-density parity-check (LDPC) codes are typically designed to avoid the length-4 cycles to ensure acceptable levels of performance. However, the turbo equalization, which relies on an interaction between an inner code such as an LDPC code and a soft-output Viterbi algorithm (SOVA) detector, exhibits a performance degradation due to the pseudo cycles. In this paper, we propose an interleaved modified array code (IMAC) that can reduce the number of pseudo cycles, hence, improving the gains from the iterative processing technique. The modification is made on the existing array-based LDPC codes named modified array codes (MAC) by introducing an additional interleaving matrix to the parity-check matrix. Simulation results on the perpendicular magnetic recording channels (PMRC) demonstrate that the IMAC outperforms both the MAC and the previously proposed random interleave array (RIA) codes for the partial-response targets under consideration. In addition, a subblock-based encoder design is proposed to reduce the encoding complexity of the IMAC and when compared with the RIA code, the IMAC exhibits a lower encoding complexity, and still maintains a comparable level of the decoding complexity.

Turbo multiuser detection for coded DMT VDSL systems

In recent years, iterative processing techniques with soft-in/soft-out components have received considerable attention. Such techniques, based on the so-called turbo principle, are exemplified through turbo decoding, turbo equalization, and turbo multiuser detection. Turbo multiuser detection is applied to a discrete multitone (DMT) very-high-rate digital subscriber line system to combat crosstalk signals and to obtain substantial coding gain. The proposed iterative DMT receiver is shown to achieve an overall 7.0 dB gain over the uncoded optimum receiver at a bit error rate of 10/sup -7/ for a channel with severe intersymbol interference and additive white Gaussian noise and with one dominant crosstalk signal. Impulse noise is detrimental to the proposed scheme but can be overcome through erasure decoding techniques, as is shown by example.

Symbol-by-symbol MAP demodulation of CPM and PSK signals on Rayleigh flat-fading channels

Demodulation using the symbol-by-symbol maximum a posteriori probability (MAP) algorithm is presented. The algorithm is derived for the case of continuous phase modulation (CPM) signals transmitted over Rayleigh flat-fading channels, and a corresponding receiver structure is specified. It is shown that the MAP algorithm requires computing, for each trellis branch, the sum of the products of the weights of all paths through the trellis which pass through that branch, and that this generic computational problem can be solved efficiently by an approach that uses a forward and backward recursion through the trellis. Simulation results are presented which show both the hard and soft decision performance of the MAP receiver to be robust, even in the presence of fade rates of up to 30% of the symbol rate. The application of the receiver concept to phase-shift keying (PSK) signals is also discussed, and then evaluated via simulation. The concept of joint demodulation and decoding using iterative processing techniques is introduced. It is shown that the MAP receiver is well suited for iterative processing applications due to its use of a priori symbol probabilities and its production of optimal soft decisions. Simulation results for the reception of quaternary PSK (QPSK) show that the bit error rate (BER) performance of the iterative MAP receiver can approach that of a receiver operating with perfect knowledge of the fading process.

Increasing the computational efficiency of discrete Kalman filters

When the additive noise vector in the discrete observation process of a system can be partitioned into uncorrelated subvectors, an iterative processing technique for updating the Kalman-filter covariance matrix can often be used to increase computational efficiency. For standard typical programming algorithms and for a typical computer, the iterative processing technique can theoretically reduce the computational requirements of the covariance updating equation by over 50 percent. In practical situations, computational savings of over 30 percent are realizable, a significant amount particularly for real-time tracking applications in high-target-density environments. Furthermore, independent of the computational advantages, the iterative processing technique is useful for track management, permitting effective utilization of priority and interrupt schemes without disturbing the Kalman-filter operation.