%0 Journal Article
%T A Low Complexity Decoding Algorithm for Accumulated-Crossover Parallel-concatenated SPC Codes<br>累加交叉并行级联单奇偶校验码的低复杂度译码算法
%A Guo Kai
%A Chen Yan-hui
%A Li Jian-dong
%A <br>郭 凯
%A 陈彦辉
%A 李建东
%J 电子与信息学报
%D 2009
%I 
%X Accumulated-Crossover Parallel-concatenated SPC (A-CPSPC) Codes, which have good bit error rate performance and simple encoding structure, is a class of novel error-correcting codes. A Maximum A Posteriori (MAP) algorithm based on the Sum-Product Algorithm (SPA), is proposed to solve the local decoding, and to eliminate the effect of short cycles. Analysis and simulation results show that the conventional Belief Propagation (BP) decoding algorithm is not suitable for A-CPSPC codes, and the proposed local decoding algorithm can achieve the same performance as the one based on the BCJR algorithm, but has much lower complexity.
%K Low-Density Parity-Check (LDPC) codes
%K Parallel concatenation
%K SPC codes
%K Crossover structure
%K Maximum A Posteriori (MAP) decoding<br>低密度奇偶校验码
%K 并行级联
%K 单奇偶校验码
%K 交叉器
%K 最大后验译码
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=9C041B734481C14AE0761E21F81EAD8F&yid=DE12191FBD62783C&vid=4AD960B5AD2D111A&iid=9CF7A0430CBB2DFD&sid=FCB16C6DAE3686F1&eid=423FC0C399AA2C41&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=11