Parallel decoding scheme for a multiple stack algorithm

To improve the error performance particularly in a very noisy block that requires excessive tree searches, a parallel decoding scheme for a multiple stack algorithm (MSA) is proposed. In this scheme, apart from the main decoder working on the main stack, a scalable set of multiple decoders working in parallel on their multiple stacks is incorporated. All the decoders are working almost independently with the help of the control processor, where the decoding process and the termination rules are outlined. Two cases, a four-processor MSA and a 16- processor MSA, are employed as examples to investigate the performance of the proposed scheme. Compared with the conventional MSA, extensive computer simulations show that the bit error probabilities are significantly improved.