Searching for new convolutional codes using the cell broadband engine architecture
Författare
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.
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.
Avdelning/ar
Publiceringsår
2011
Språk
Engelska
Sidor
560-562
Publikation/Tidskrift/Serie
IEEE Communications Letters
Volym
15
Issue
5
Fulltext
- Available as PDF - 271 kB
- Download statistics
Länkar
Dokumenttyp
Artikel i tidskrift
Förlag
IEEE - Institute of Electrical and Electronics Engineers Inc.
Ämne
- Electrical Engineering, Electronic Engineering, Information Engineering
Status
Published
Forskningsgrupp
- Crypto and Security
- Information Theory
ISBN/ISSN/Övrigt
- ISSN: 1089-7798