Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Acta Electronica Sinica》 2017-08
Add to Favorite Get Latest Update

Decoding Algorithm for Non-Binary LDPC Codes Based on Node-Subset and k-Order Message Truncation

SUN You-ming;CHEN Hai-qiang;LI Xiang-cheng;WAN Hai-bin;QIN Tuan-fa;School of Electronics and Information Engineering,South China University of Technology;School of Physical Science and Technology,Guangxi University;Guangxi Key Laboratory of Multimedia Communication and Network Technology,Guangxi University Cultivating Base;School of Computer,Electronics and Information,Guangxi University;  
This paper presents a lowcomplexity non-binary LDPC decoding algorithm,whose complexity can be reduced in the following two ways. First,a newtruncation scheme is presented to define the processing/non-processing check node subsets. The check nodes with relatively high reliability are not required to be processed,which can reduce the complexity. Second,for the check nodes in the processing subset,we further present a k-order message truncation for the states and branches of the check node Trellis. In the decoding iterations,only those"live"states/branches are involved in the message updating process,which can further reduce the computational loads at check nodes. Simulation results showthat the presented algorithm performs very closely to several existing improved EMS decoding algorithms,but it has the lowest complexity when decoding the non-binary LDPC codes constructed both in low/high order fields.
【Fund】: 国家自然科学基金(No.61261023 No.61362010 No.61661005);; 广西自然科学基金(No.2014GXNSFBA118276)
【CateGory Index】: TN911.22
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved