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

Reduced Complexity Iterative Decoding for Concatenated Coding Schemes

Dhammika Bokolamulla (Institutionen för datorteknik) ; Tor Aulin (Institutionen för datorteknik)
IEEE International Conference on Communications (ICC), Anchorage, 11-15 May, 2003 p. 3135-3139. (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 2013-02-20.
CPL Pubid: 173919

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)


Institutioner (Chalmers)

Institutionen för datorteknik (2002-2004)

Ämnesområden

Datorteknik

Chalmers infrastruktur