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

Low-Complexity Iterative Detection Based on Bi-Directional Trellis Search

Dhammika Bokolamulla (Institutionen för datorteknik, Telekommunikationsteori) ; A. Hansson ; Tor Aulin (Institutionen för datorteknik, Telekommunikationsteori)
Proccedings. IEEE International Symposium on Information Theory, Yokohama, 29 June-4 July 2003 p. 396. (2003)
[Konferensbidrag, refereegranskat]

A new algorithm to reduce the computational complexity of iterative decoding is proposed. The algorithm carries out a bi-directional trellis search in a relatively smaller trellis (compared with the full-complexity trellis structure) to find two sets of sequences: the forward sequence set and the backward sequence set. The soft information is generated by considering a window of W trellis sections and the forward and the backward sequences entering it. To assess the performance, numerical results for serially concatenated convolutional codes, transmitted over an intersymbol interference channel, disturbed by additive white gaussian noise are presented. The simulation results show that for the considered system, the algorithm can obtain bit error rate performances close to that of full-complexity iterative decoding with much lower complexity.

Denna post skapades 2006-09-12. Senast ändrad 2013-02-20.
CPL Pubid: 12571


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