AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (409.4 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

Low Complexity LDPC Decoder with Modified Sum-Product Algorithm

Tsinghua National Laboratory for Information Science and Technology, Department of Electronic Engineering, Tsinghua University, Beijing 100084, China
Show Author Information

Abstract

This paper describes an efficient implementation of the Sum-Product Algorithm (SPA) within a Low Density Parity Check (LDPC) code decoder, where a horizontal process correction term is used to improve the decoding performance of the Min-Sum algorithms. The correction term is implemented as a look-up table. The algorithm uses the correction term redundancy by means of a coordinate transformation to reduce the hardware complexity. Simulations and hardware tests indicate that the decoding performance is very good with the appropriate look-up table.

References

【1】
【1】
 
 
Tsinghua Science and Technology
Pages 57-61

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Qian C, Lei W, Wang Z. Low Complexity LDPC Decoder with Modified Sum-Product Algorithm. Tsinghua Science and Technology, 2013, 18(1): 57-61. https://doi.org/10.1109/TST.2013.6449408

1243

Views

109

Downloads

8

Crossref

N/A

Web of Science

11

Scopus

0

CSCD

Received: 17 February 2012
Accepted: 10 December 2012
Published: 07 February 2013
© The author(s) 2013