Modified Forced Convergence Decoding of LDPC Codes with Optimized Decoder Parameters

Muris Sarajlic, Liang Liu, Ove Edfors

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

222 Downloads (Pure)

Abstract

Reducing the complexity of decoding algorithms for LDPC codes is an important prerequisite for their practical implementation. In this work we propose a reduction of computational complexity targeting the highly reliable codeword bits and show that this approach can be seamlessly merged with the forced convergence scheme. We also show how the minimum achievable complexity of the resulting scheme for given performance constraints can be found by solving a constrained optimization problem, and successfully apply a gradient-descent based stochastic approximation (SA) method for solving this problem. The proposed methods are tested on LDPC codes from the IEEE 802.11n standard. Computational complexity reduction of 55% and a 75% reduction of memory access have been observed.
Original languageEnglish
Title of host publication2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)
PublisherIEEE - Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)978-1-4673-6782-0
DOIs
Publication statusPublished - 2015
EventIEEE Annual International Symposium on Personal, Indoor and Mobile Radio Communications, 2015 - Hong Kong, P. R. China, Hong Kong, PRC, China
Duration: 2015 Aug 302015 Sept 2
Conference number: 26th

Conference

ConferenceIEEE Annual International Symposium on Personal, Indoor and Mobile Radio Communications, 2015
Abbreviated titlePIMRC
Country/TerritoryChina
CityHong Kong, PRC
Period2015/08/302015/09/02

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Fingerprint

Dive into the research topics of 'Modified Forced Convergence Decoding of LDPC Codes with Optimized Decoder Parameters'. Together they form a unique fingerprint.

Cite this