Algorithms for Parallel Decoding
W.E. Stark, Amer A. Hassan · 2005
In this paper we address the parallel decoding problem in a general formulation. The structure of the receiver consists of a bank of z demodulators each followed by an errors and erasures correcting decoders. Each demodulator has a threshold /spl theta/ that determines an erasure region; we then assign a cost f(/spl theta/) to the interference for causing an erasure and a (larger) cost f(/spl theta/) for causing an error. The goal in designing the receiver is to choose the thresholds to maximize the interference cost necessary to cause a decoding error. We demonstrate that the above formulation is solvable for many channels of interest.