University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Gradient projection decoding of LDPC codes

Kasparis, C and Evans, BG (2007) Gradient projection decoding of LDPC codes IEEE COMMUNICATIONS LETTERS, 11 (3). 279 - 281. ISSN 1089-7798

[img]
Preview
PDF
SRF002493.pdf - Published Version

Download (480Kb)

Abstract

A new practical method for decoding low-density parity check (LDPC) codes is presented. The followed approach involves reformulating the parity check equations using nonlinear functions of a specific form, defined over Rrho, where rho denotes the check node degree. By constraining the inputs to these functions in the closed convex subset [0,1]rho ("box" set) of Rrho, and also by exploiting their form, a multimodal objective function that entails the code constraints is formulated. The gradient projection algorithm is then used for searching for a valid codeword that lies in the vicinity of the channel observation. The computational complexity of the new decoding technique is practically sub-linearly dependent on the code's length, while processing on each variable node can be performed in parallel allowing very low decoding latencies. Simulation results show that convergence is achieved within 10 iterations, although some performance degradations relative to the belief propagation (BP) algorithm are observed

Item Type: Article
Uncontrolled Keywords: Science & Technology, Technology, Telecommunications, LDPC, decoding, non-linear, gradient, projection, PARITY-CHECK CODES, BELIEF PROPAGATION
Related URLs:
Divisions: Faculty of Engineering and Physical Sciences > Electronic Engineering > Centre for Communication Systems Research
Depositing User: Melanie Hughes
Date Deposited: 16 Sep 2010 09:14
Last Modified: 23 Sep 2013 18:36
URI: http://epubs.surrey.ac.uk/id/eprint/2070

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800