Searching for new convolutional codes using the cell broadband engine architecture
(2011) In IEEE Communications Letters 15(5). p.560-562- 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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1890491
- author
- Johnsson, Daniel ; Bjärkeson, Fredrik ; Hell, Martin LU and Hug, Florian LU
- organization
- publishing date
- 2011
- type
- Contribution to journal
- publication status
- published
- subject
- in
- IEEE Communications Letters
- volume
- 15
- issue
- 5
- pages
- 560 - 562
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- external identifiers
-
- wos:000290628300030
- scopus:79956188831
- ISSN
- 1089-7798
- DOI
- 10.1109/LCOMM.2011.040111.101624
- language
- English
- LU publication?
- yes
- id
- d5d8dbda-e184-4969-8aa1-3777eb79b235 (old id 1890491)
- date added to LUP
- 2016-04-01 12:58:36
- date last changed
- 2022-05-19 08:55:15
@article{d5d8dbda-e184-4969-8aa1-3777eb79b235, 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.<br/><br> <br/><br> 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. <br/><br> <br/><br> The main result of this paper consists in determining the previously unknown optimum free distance convolutional code with memory m=26.}}, author = {{Johnsson, Daniel and Bjärkeson, Fredrik and Hell, Martin and Hug, Florian}}, issn = {{1089-7798}}, language = {{eng}}, number = {{5}}, pages = {{560--562}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, series = {{IEEE Communications Letters}}, title = {{Searching for new convolutional codes using the cell broadband engine architecture}}, url = {{https://lup.lub.lu.se/search/files/3081837/1890492.pdf}}, doi = {{10.1109/LCOMM.2011.040111.101624}}, volume = {{15}}, year = {{2011}}, }