A Factor-Graph Schedule for Stream-Oriented Turbo Codes

The paper considers the application of a factorgraph approach to decoding stream-oriented turbo codes. The decoding schedule proposed can be interpreted as only two decoder modules replacing the pipelined structure originally used in stream-oriented decoding. Simulation results corroborate the efficiency of the schedule and also show potential improvements that can be obtained by using MAP instead of Max-Log-MAP calculations.