CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Reduced Complexity Iterative Decoding for Concatenated Coding

Dhammika Bokolamulla (Institutionen för datorteknik, Telekommunikationsteori) ; Tor Aulin (Institutionen för datorteknik, Telekommunikationsteori)
IEEE International Conference on Communication (2003)
[Konferensbidrag, refereegranskat]

A new algorithm to reduce the computational complexity of iterative decoding is presented. The algorithm reduces the complexity by removing certain branches from the corresponding trellis diagram. A threshold on a priori values is used as the elimination criterion. To assess the performance, numerical results for serially concatenated convolutional codes transmitted over an additive white gaussian noise channel is presented. The results show that for the system considered, the algorithm can reduce the complexity by one third with a negligible degradation in error performance.

Denna post skapades 2006-09-12.
CPL Pubid: 12569


Institutioner (Chalmers)

Institutionen för datorteknik, Telekommunikationsteori (2002-2004)


Övrig elektroteknik, elektronik och fotonik

Chalmers infrastruktur