pdf

Low-complexity decoding algorithm for single parity check codes with cumulative cross-parallel concatenation

  • 2013-09-22
  • 292.3KB
  • Points it Requires : 2

           Accumulated Cross Parallel Cascaded Single Parity Check (A-CPSPC) code is a new error correction code with a simple coding structure and good bit error rate performance. This paper proposes a low-complexity maximum a posteriori (MAP) local decoding algorithm for the local coding structure of A-CPSPC code. This method uses the sum-product algorithm (SPA) based on the bidirectional message passing principle for local decoding, eliminating the impact of short loops on local decoding performance. Analysis and simulation show that the traditional belief propagation algorithm is not suitable for A-CPSPC code. The local decoding algorithm proposed in this paper has the same performance as the local decoding algorithm based on the BCJR algorithm, and has lower complexity.

unfold

You Might Like

Uploader
hellopinkgirls
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×