MAP decoding of linear block codes based on a sectionalized trellis of the dual code

Abstract

Block codes for use in turbo coding schemes provide an alternative to punctured convolutional codes when high rate component codes are needed. Since block codes have large, time-varying trellis diagrams, full maximum a posteriori (MAP) soft-in soft-out decoders are very complex. It is shown how to modify the MAP algorithm to utilize a sectionalized trellis diagram of the dual code for decoding, which minimizes computational complexity for high rate component codes. This paper also gives simulation results for some high rate block turbo codes.