Reduced Complexity Iterative Decoding for Concatenated Coding Schemes
Paper i proceeding, 2003

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.

Författare

Dhammika Bokolamulla

Chalmers, Institutionen för datorteknik

Tor Aulin

Chalmers, Institutionen för datorteknik

IEEE International Conference on Communications (ICC), Anchorage, 11-15 May, 2003

3135-3139

Ämneskategorier

Datorteknik

DOI

10.1109/ICC.2003.1204000

ISBN

0-7803-7802-4

Mer information

Skapat

2017-10-06