Searching for new convolutional codes using the cell broadband engine architecture

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

doi:10.1109/LCOMM.2011.040111.101624

Searching for new convolutional codes using the cell broadband engine architecture

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

Forskningsoutput: Tidskriftsbidrag › Artikel i vetenskaplig tidskrift › Peer review

1 Citering (SciVal)

137 Nedladdningar (Pure)

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.

Originalspråk	engelska
Sidor (från-till)	560-562
Tidskrift	IEEE Communications Letters
Volym	15
Utgåva	5
DOI	https://doi.org/10.1109/LCOMM.2011.040111.101624
Status	Published - 2011

Ämnesklassifikation (UKÄ)

Elektroteknik och elektronik

Tillgång till dokument

10.1109/LCOMM.2011.040111.101624

beastps3

Citera det här

@article{d5d8dbdae18449698aa13777eb79b235,

title = "Searching for new convolutional codes using the cell broadband engine architecture",

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.",

author = "Daniel Johnsson and Fredrik Bj{\"a}rkeson and Martin Hell and Florian Hug",

year = "2011",

doi = "10.1109/LCOMM.2011.040111.101624",

language = "English",

volume = "15",

pages = "560--562",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "IEEE - Institute of Electrical and Electronics Engineers Inc.",

number = "5",

}

TY - JOUR

T1 - Searching for new convolutional codes using the cell broadband engine architecture

AU - Johnsson, Daniel

AU - Bjärkeson, Fredrik

AU - Hell, Martin

AU - Hug, Florian

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

U2 - 10.1109/LCOMM.2011.040111.101624

DO - 10.1109/LCOMM.2011.040111.101624

M3 - Article

VL - 15

SP - 560

EP - 562

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 5

ER -

Searching for new convolutional codes using the cell broadband engine architecture

Sammanfattning

Ämnesklassifikation (UKÄ)

Tillgång till dokument

Fingeravtryck

Citera det här