By constructing an accumulated-crossover relationship in multiple parallel concatenated single parity check （M-PC-SPC） codes, a class of error-correcting codes, termed multiple accumulated-crossover parallel concate...By constructing an accumulated-crossover relationship in multiple parallel concatenated single parity check （M-PC-SPC） codes, a class of error-correcting codes, termed multiple accumulated-crossover parallel concatenated single parity check （M-ACPC-SPC） codes, is proposed. M-ACPC-SPC codes possess linear encoding complexity and can be decoded iteratively with low complexity by the sum-product algorithm （SPA）. Simulation results show that M-ACPC-SPC codes have lower error floors than M-PCSPC codes with the same dimension, and when the dimension is 5, M-ACPC-SPC codes achieve bit error rate （BER） better than （3, 6） regular low density parity check （LDPC） codes.展开更多
基金Supported by the National High-Tech Research & Development Program of China (Grant No. 2007AA01Z288)the National Science Fund for Distinguished Young Scholars (Grant No. 60725105)the Program for Changjiang Scholars and Innovative Research Team in University and the 111 Project (Grant No. B08038)
文摘By constructing an accumulated-crossover relationship in multiple parallel concatenated single parity check （M-PC-SPC） codes, a class of error-correcting codes, termed multiple accumulated-crossover parallel concatenated single parity check （M-ACPC-SPC） codes, is proposed. M-ACPC-SPC codes possess linear encoding complexity and can be decoded iteratively with low complexity by the sum-product algorithm （SPA）. Simulation results show that M-ACPC-SPC codes have lower error floors than M-PCSPC codes with the same dimension, and when the dimension is 5, M-ACPC-SPC codes achieve bit error rate （BER） better than （3, 6） regular low density parity check （LDPC） codes.
