TY - GEN
T1 - Novel hardware implementation of LLR-based non-binary LDPC decoders
AU - Bhargava, Lava
AU - Bose, Ranjan
AU - Balakrishnan, M.
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84894407587&partnerID=8YFLogxK
U2 - 10.1109/NCC.2013.6487956
DO - 10.1109/NCC.2013.6487956
M3 - Conference contribution
AN - SCOPUS:84894407587
SN - 9781467359528
T3 - 2013 National Conference on Communications, NCC 2013
BT - 2013 National Conference on Communications, NCC 2013
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2013 National Conference on Communications, NCC 2013
Y2 - 15 February 2013 through 17 February 2013
ER -