By Topic

Searching for New Convolutional Codes using the Cell Broadband Engine Architecture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Daniel Johnsson ; Department of Electrical and Information Technology, Lund University, P.O. Box 188, SE-22100 Lund, Sweden ; Fredrik Bjarkeson ; Martin Hell ; Florian Hug

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.

Published in:

IEEE Communications Letters  (Volume:15 ,  Issue: 5 )