The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

High-Performance and Low-Complexity Decoding of High-Weight LDPC Codes

높은 무게 LDPC 부호의 저복잡도 고성능 복호 알고리즘

  • 조준호 (서울대학교 전기컴퓨터공학부 멀티미디어시스템연구실) ;
  • 성원용 (서울대학교 전기컴퓨터공학부 멀티미디어시스템연구실)
  • Published : 2009.05.31
Download PDF
⟨ Previous Next ⟩

Abstract

A high-performance low-complexity decoding algorithm for LDPC codes is proposed in this paper, which has the advantages of both bit-flipping (BF) algorithm and sum-product algorithm (SPA). The proposed soft bit-flipping algorithm requires only simple comparison and addition operations for computing the messages between bit and check nodes, and the amount of those operations is also small. By increasing the utilization ratio of the computed messages and by adopting nonuniform quantization, the signal-to-noise ratio (SNR) gap to the SPA is reduced to 0.4dB at the frame error rate of 10-4 with only 5-bit assignment for quantization. LDPC codes with high column or row weights, which are not suitable for the SPA decoding due to the complexity, can be practically implemented without much worsening the error performance.

Low-density parity-check (LDPC) 부호의 복호에는 성능이 좋은 합곱 알고리즘(sum-product algorithm; SPA)과 하드웨어가 간단한 비트 반전(bit-flipping; BF) 알고리즘이 많이 쓰이고 있다. 본 논문은 이들 두 가지 방법의 장점을 가지는 저복잡도 고성능 복호 알고리즘을 제안한다. 본 제안된 유연 비트 반전(soft bit-flipping) 알고리즘은 비트와 체크 노드 사이에 전달되는 메시지를 계산하는 데 단순한 비교와 덧셈 연산만을 필요로 하며 연산량이 적다는 장점이 있다. 또한 연산이 완료된 메시지의 활용률을 높이고 비균등 양자화(non-uniform quantization)를 채용하여 1000 내외의 부호 길이에서 SPA 에 0.4dB 근접하는 신호대 잡음비(signal-to-noise ratio)를 달성하였다. 본 논문에서 제안된 알고리즘을 이용하면, 행 무게(row weight)와 열 무게(column weight)가 높아서 종래의 SPA로 구현하기 어려웠던 부호를 비교적 좋은 오율 성능을 유지하면서 실용적으로 구현할 수 있다.

Keywords

References

  1. R. G. Gallager, 'Low-density parity-check codes,' IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962.7 https://doi.org/10.1109/TIT.1962.1057683
  2. D. J. MacKay, 'Good error-correcting codes based on very sparse matrices,' IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-432, Mar. 1999 https://doi.org/10.1109/18.748992
  3. Y. Kou, S. Lin, and M. P. C. Fossorier, 'Low-density parity-check codes based on finite geometries: A rediscovery and new results,' IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001 https://doi.org/10.1109/18.959255
  4. J. Zhang and M. P. C. Fossorier, 'A modified weighted bit-flipping decoding of low-density parity-check codes,' IEEE Commun. Lett., vol. 8, no. 3, pp. 165-167, Mar. 2004 https://doi.org/10.1109/LCOMM.2004.825737
  5. M. Jiang, C. Zhao, Z. Shi, and Y. Chen, 'An improvement on the modified weighted bit flipping decoding algorithm for LDPC codes,' IEEE Commun. Lett., vol. 9, no. 9, pp. 814-816, Sep. 2005 https://doi.org/10.1109/LCOMM.2005.1506712
  6. M. P. C. Fossorier, M. Mihaljevic, and H. Imai, 'Reduced complexity iterative decoding of low-density parity check codes based on belief propagation,' IEEE Trans. Commun., vol. 47, no. 5, pp. 673-680, May 1999 https://doi.org/10.1109/26.768759
  7. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, 'Factor graphs and the sum-product algorithm,' IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001 https://doi.org/10.1109/18.910572
  8. A. Darabiha, A. C. Carusone, F. R. Kschischang, 'Block-interlaced LDPC decoders with reduced interconnect complexity,' IEEE Trans. Circuits and Systems II, vol. 55, no. 1, pp. 74-78, Jan. 2008 https://doi.org/10.1109/TCSII.2007.905328
  9. J. Chen, A. Dholakia, E. Eleftheriou, M. P. C. Fossorier, and X-Y. Hu, 'Reduced-complexity decoding of LDPC codes,' IEEE Trans. Commun, vol. 53, no. 8, pp. 1288-1299, Aug. 2005 https://doi.org/10.1109/TCOMM.2005.852852