By Topic

Coding with low density block angular generator matrix

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)
Bruno Jesus ; Departamento de Electronica, Telecomunicacoes e Informatica, Universidade de Aveiro, Portugal ; Jose Vieira ; Paulo Ferreira ; Huiyuan Wang

In this work we show that coding with a binary block angular matrix with some extra coupling rows can achieve similar results to codes that use other random binary matrices. Moreover, we also show that it is possible to use sparse block diagonal matrices and get the same results obtained with a dense equiprobable binary random matrix. The block diagonal form of the matrix grants an inherent parallelism for the decoding process. This characteristics can be used to speedup the decoding process with multicore architectures while reducing the communication between the cores. On storage applications it would be possible to perform the reconstruction of local data while minimizing the communication.

Published in:

Intelligent Control and Automation (WCICA), 2010 8th World Congress on

Date of Conference:

7-9 July 2010