The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Searching for new convolutional codes using the cell broadband engine architecture

På svenska

Author

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

Summary, in English

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.

Publishing year

2011

Language

English

Pages

560-562

Publication/Series

IEEE Communications Letters

Volume

15

Issue

5

Document type

Journal article

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Status

Published

Research group

  • Crypto and Security
  • Information Theory

ISBN/ISSN/Other

  • ISSN: 1089-7798