Toggle Main Menu Toggle Search

Open Access padlockePrints

Low complexity coded cooperative scheme using non binary LDPC codes

Lookup NU author(s): Vajira Ganepola, Emeritus Professor Rolando Carrasco



In this paper we present a coded cooperation scheme using nonbinary LDPC codes and show how it can be used in a multi-user environment to achieve full transmit diversity. It is well known that non-binary LDPC codes over GF(q) outperform binary LDPC codes, but at a cost of increased decoding complexity. To ensure that this scheme can be practically implemented, we demonstrate how the Belief Propagation (BP) algorithm can be simplified, with a complexity dependent only on the row weight of the parity check matrix and independent of the finite field size. We show that this decoding algorithm has only a small degradation in performance compared with BP decoding on quasi-static fading channels and present the performance of a coded cooperation scheme using non-binary LDPC codes defined in GF(4) and GF(16).

Publication metadata

Author(s): Ganepola V, Carrasco RA, Wassell IJ

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 1st IEEE International Conference on Wireless Communications, Vehicular Technology, Information Theory and Aerospace & Electronic Systems Technology (WIRELESS VITAE)

Year of Conference: 2009

Pages: 742-746

Date deposited: 24/05/2010

Publisher: IEEE


DOI: 10.1109/WIRELESSVITAE.2009.5172541

Library holdings: Search Newcastle University Library for this item

ISBN: 9781424440672