On the performance and implementation issues of interleaved single parity check turbo product codes

Yanni Chen, Keshab K. Parhi

Research output: Contribution to journalArticle

2 Scopus citations

Abstract

In this paper, both performance and complexity aspects of two-dimensional single parity check turbo product codes (I-SPC-TPC) are investigated. Based on the proposed I-SPC-TPC coding scheme, a parallel decoding structure is developed to increase the decoding throughput with minor performance degradation compared with the serial structure. For both decoding architectures, a new helical interleaver is constructed to further improve the coding gain. In terms of decoding algorithm, the extremely simple Sign-Min decoding is alternatively derived with only three additions needed to compute each bit's extrinsic information. For performance evaluation, (16, 14, 2) 2 single parity check turbo product code with code rate 0.766 over AWGN channel using QPSK modulation is considered. The simulation results using Sign-Min decoding show that it can achieve bit-error-rate of 10 -5 at signal-to-noise ratio of 3.8 dB with 8 iterations. Compared to the same rate and codeword length turbo product code composed of extended Hamming codes, the considered scheme can achieve similar performance with much less complexity. Important implementation issues such as the finite precision analysis, efficient sorting circuit design and interleaver memory management are also presented.

Original languageEnglish (US)
Pages (from-to)35-47
Number of pages13
JournalJournal of VLSI Signal Processing Systems for Signal, Image, and Video Technology
Volume39
Issue number1-2 SPEC.ISS.
DOIs
StatePublished - Jan 1 2005

Keywords

  • Interleaver memory
  • Parallel decoding architecture
  • Sign-min algorithm
  • Single parity check code
  • Turbo product code

Fingerprint Dive into the research topics of 'On the performance and implementation issues of interleaved single parity check turbo product codes'. Together they form a unique fingerprint.

  • Cite this