Du är här

Searching for new convolutional codes using the cell broadband engine architecture

Författare:
Publiceringsår: 2011
Språk: Engelska
Sidor: 560-562
Publikation/Tidskrift/Serie: IEEE Communications Letters
Volym: 15
Nummer: 5
Dokumenttyp: Artikel
Förlag: IEEE

Sammanfattning

The Bidirectional Efficient Algorithm for Searching code Trees (BEAST), which is an algorithm to efficiently determine the free distance and spectral components of convolutional encoders, is implemented for the Cell Broadband Engine Architecture, efficiently utilizing the underlying hardware.

Exhaustive and random searches are carried out, presenting new rate R=1/2 convolutional encoding matrices with memory m=26 - 29 and larger free distances and/or fewer spectral components than previously known encoding matrices of same rate and complexity.

The main result of this paper consists in determining the previously unknown optimum free distance convolutional code with memory m=26.

Disputation

Nyckelord

  • Technology and Engineering

Övrigt

Published
Yes
  • Crypto and Security
  • Information Theory
  • ISSN: 1089-7798

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

LERU logo U21 logo