Searching for new convolutional codes using the cell broadband engine architecture

Daniel Johnsson, Fredrik Bjärkeson, Martin Hell, Florian Hug

Research output: Contribution to journalArticlepeer-review

1 Citation (SciVal)
131 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages (from-to)560-562
JournalIEEE Communications Letters
Volume15
Issue number5
DOIs
Publication statusPublished - 2011

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Fingerprint

Dive into the research topics of 'Searching for new convolutional codes using the cell broadband engine architecture'. Together they form a unique fingerprint.

Cite this