Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.

Pre-sorted Forward-Backward NB-LDPC Check Node Architecture

Abstract

International audienceThis paper deals with reduced-complexity NB-LDPC check node implementation based on the Extended Min-Sum algorithm. We propose to apply a recently introduced pre-sorting technique to the forward-backward architecture. The pre-sorting of the check node inputs allows for significant complexity reduction. Simulation and synthesis results showed that this approach does not introduce any performance loss and can lead to significant area reduction in FPGA implementations (up to 54% for high check node degrees)

Similar works

Full text

thumbnail-image

HAL-Université de Bretagne Occidentale

redirect
Last time updated on 12/11/2016

This paper was published in HAL-Université de Bretagne Occidentale.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.