Sub Graph Approach In Iterative Sum-Product Algorithm

Conference: TURBO - CODING - 2006 - 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding
04/03/2006 - 04/07/2006 at Munich, Germany

Proceedings: TURBO - CODING - 2006

Pages: 6Language: englishTyp: PDF

Personal VDE Members are entitled to a 10% discount on this title

Bayramoglu, Muhammet Fatih; Yilmaz, Ali Özgür; Baykal, Buyurman (Dept. of Electrical and Electronics Eng. Middle East Technical University, Turkey)

A new scheduling algorithm to the iterative sum-product algorithm, which is called sub-graph scheduling, will be presented in this paper. The propesed algorithm provides a schedule which has a higher convergence rate than the iterative sum-product algorithm while keeping the complexity of one iteration withot degrading the performance. Our method also gives an explanation to the fact that turbo decoders have faster convergence rate than LDPC decoders.