A new sequential decoding algorithm based on branch metric

ÇAVDAR T., GANGAL A.

WIRELESS PERSONAL COMMUNICATIONS, cilt.43, sa.4, ss.1093-1100, 2007 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 43 Sayı: 4
  • Basım Tarihi: 2007
  • Doi Numarası: 10.1007/s11277-007-9285-0
  • Dergi Adı: WIRELESS PERSONAL COMMUNICATIONS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1093-1100
  • Karadeniz Teknik Üniversitesi Adresli: Evet

Özet

A new sequential decoding algorithm with an adjustable threshold and a new method of moving through the decoding tree is proposed. Instead of the path metric of the conventional sequential decoding algorithms, the proposed algorithm uses a branch metric based on maximum-likelihood criterion. Two new parameters, the jumping-back distance and going-back distance, are also introduced. The performance of the algorithm for long constraint length convolutional codes is compared to those of the other sequential decoding algorithms and the Viterbi algorithm. The results show that the proposed algorithm is a good candidate for decoding of convolutional codes due to its fast decoding capability and good bit error rate (BER) performance.