Novel hardware implementation of LLR-based non-binary LDPC decoders

Lava Bhargava, Ranjan Bose, M. Balakrishnan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

Binary Low Density Parity Check (LDPC) codes are known to have performance approaching capacity utilization for large block lengths. For short and medium term block lengths, the codes have lower capacity utilization and poorer BER performance due to cycles in the codes. The non-binary LDPC codes have started attracting attention for short and medium length code implementations, which is a requirement for standards like Wi-Fi applications. Current implementations of non-binary LDPC codes focus on serial or partly parallel implementation due to hardware complexity and chip size. We propose a fully parallel implementation for two algorithms. The algorithms are the SPA algorithm with max* function and a sub-optimal form of this called as max implementation. The max implementation has a lower hardware cost and a low performance penalty. The area of sub-optimal max implementation is almost 32% less than that of max implementation. The clock for max is faster by 33%, as a result it has low latency and high throughput as compared to max* algorithm.

Original languageEnglish
Title of host publication2013 National Conference on Communications, NCC 2013
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Print)9781467359528
DOIs
StatePublished - 2013
Externally publishedYes
Event2013 National Conference on Communications, NCC 2013 - New Delhi, India
Duration: Feb 15 2013Feb 17 2013

Publication series

Name2013 National Conference on Communications, NCC 2013
ISSN (Print)1550-3607

Conference

Conference2013 National Conference on Communications, NCC 2013
Country/TerritoryIndia
CityNew Delhi
Period02/15/1302/17/13

Fingerprint

Dive into the research topics of 'Novel hardware implementation of LLR-based non-binary LDPC decoders'. Together they form a unique fingerprint.

Cite this