Turbo decoding of quantized data Academic Article uri icon


  • Much of the work on turbo decoding assumes that the decoder has access to infinitely soft (unquantized) channel data. In practice, however, a quantizer is used at the receiver and the turbo decoder must operate on finite precision, quantized data. Hence, the maximum a posteriori (MAP) component decoder which was designed assuming infinitely soft data is not necessarily optimum when operating on quantized data. In this paper, we modify the well-known normalized MAP algorithm taking into account the presence of the quantizer. This algorithm is optimum given any quantizer and is no more complex than quantized implementations of the MAP algorithm derived based on unquantized data. Simulation results on an additive white Gaussian noise channel show that, even with four bits of quantization, the new algorithm based on quantized data achieves a performance practically equal to the MAP algorithm operating on infinite precision data.

published proceedings


author list (cited authors)

  • Dasgupta, U., & Georghiades, C. N.

citation count

  • 10

complete list of authors

  • Dasgupta, U||Georghiades, CN

publication date

  • January 2002