Lancaster EPrints

Low-complexity decoding of LDPC codes

Pandya, Nishit and Honary, Bahram (2007) Low-complexity decoding of LDPC codes. Electronics Letters, 43 (18). pp. 990-991. ISSN 0013-5194

Full text not available from this repository.

Abstract

The offset BP-based algorithm is a reduced-complexity derivative of the belief-propagation algorithm for decoding of low-density parity- check codes. It uses a constant offset term to simplify decoding, but at the cost of performance. A method to obtain a 'variable' offset parameter is presented here, to improve the performance of the algorithm.

Item Type: Article
Journal or Publication Title: Electronics Letters
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments: Faculty of Science and Technology > School of Computing & Communications
ID Code: 60634
Deposited By: ep_importer_pure
Deposited On: 03 Jan 2013 09:47
Refereed?: Yes
Published?: Published
Last Modified: 23 Oct 2017 03:16
Identification Number:
URI: http://eprints.lancs.ac.uk/id/eprint/60634

Actions (login required)

View Item