Meny

Du är här

A memory-efficient optimal APP symbol-elecoding algorithm for linear block codes

Författare:
Publiceringsår: 2004
Språk: Engelska
Sidor: 1429-1434
Publikation/Tidskrift/Serie: IEEE Transactions on Communications
Volym: 52
Nummer: 9
Dokumenttyp: Artikel
Förlag: IEEE

Sammanfattning

We propose a simple modification of the famous Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm for linear block codes. The modified algorithm requires one forward and two backward recursions in the code trellis, but eliminates the need to store the whole trellis. Compared with the BCJR algorithm, the computational complexity is slightly increased, but the storage requirement is reduced.

Disputation

Nyckelord

  • Technology and Engineering
  • A posteriori probability (APP) decoding
  • linear block codes
  • trellis

Övriga

Published
Yes
  • ISSN: 0090-6778

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen