Structured set partitions and multilevel concatenated coding for partial response channels

We present a systematic way to construct multilevel concatenated codes for partial response (PR) channels using: 1) a structured set partition (SSP) of multiple channel output sets and 2) a set of conventional block codes with different error correcting capabilities. A Lower bound on the minimum squared Euclidean distance of the constructed codes is given. This bound is based on the interset minimal Euclidean distances of the SSP and the minimum Hamming distances of the used block codes. An example of SSP for the extended class 4 partial response channel (EPR4) is presented. Iterative suboptimal decoding, which combines Viterbi detection on the trellis of the PR channel with algebraic error detection/correction, can be applied to the constructed concatenated codes. Truncated versions of the iterative decoding scheme are simulated and compared with each other.