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

A New Stopping Criterion for Iterative Decoding

Dhammika Bokolamulla (Institutionen för datorteknik, Telekommunikationsteori) ; Tor Aulin (Institutionen för datorteknik, Telekommunikationsteori)
IEEE International Conference on Communications, Paris, FRANCE. JUN 20-24, 2004 (2004)
[Konferensbidrag, refereegranskat]

In this paper we propose a new stopping criterion for iterative decoding. The new stopping rule observes the a priori of different symbols and stops the iterations, whenever the average number of symbols in a trellis section below a certain a priori value, is above a pre-defined threshold. According to the numerical examples for some practical transmission systems, the proposed criterion saves more decoding iterations than the existing stopping rules. Moreover it performs very close to the maximum possible limit of any stopping rule, while keeping minimum degradation in bit error rate (BER) performance.

Denna post skapades 2006-09-12. Senast ändrad 2013-06-18.
CPL Pubid: 12565


Läs direkt!

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

Institutioner (Chalmers)

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


Övrig elektroteknik, elektronik och fotonik

Chalmers infrastruktur