The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Modified Forced Convergence Decoding of LDPC Codes with Optimized Decoder Parameters

På svenska

Author

Summary, in English

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.

Publishing year

2015

Language

English

Publication/Series

2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Conference name

IEEE Annual International Symposium on Personal, Indoor and Mobile Radio Communications, 2015

Conference date

2015-08-30 - 2015-09-02

Conference place

Hong Kong, PRC, China

Status

Published

Project

  • EIT_DARE Digitally-Assisted Radio Evolution

Research group

  • Digital ASIC
  • Radio Systems

ISBN/ISSN/Other

  • ISBN: 978-1-4673-6782-0