Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Modified Forced Convergence Decoding of LDPC Codes with Optimized Decoder Parameters

In English

Författare

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.

Publiceringsår

2015

Språk

Engelska

Publikation/Tidskrift/Serie

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

Dokumenttyp

Konferensbidrag

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • 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

Projekt

  • EIT_DARE Digitally-Assisted Radio Evolution

Forskningsgrupp

  • Digital ASIC
  • Radio Systems

ISBN/ISSN/Övrigt

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