Sub Graph Approach In Iterative Sum-Product Algorithm
Konferenz: TURBO - CODING - 2006 - 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding
03.04.2006 - 07.04.2006 in Munich, Germany
Tagungsband: TURBO - CODING - 2006
Seiten: 6Sprache: EnglischTyp: PDF
Persönliche VDE-Mitglieder erhalten auf diesen Artikel 10% Rabatt
Autoren:
Bayramoglu, Muhammet Fatih; Yilmaz, Ali Özgür; Baykal, Buyurman (Dept. of Electrical and Electronics Eng. Middle East Technical University, Turkey)
Inhalt:
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.