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

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

Split LDPC Codes for Hybrid ARQ

  • Joo, Hyeong-Gun (Division of Electronics and Computer Engineering, Hanyang University) ;
  • Hong, Song-Nam (Telecommunication R&D Center, Samsung Electronics Co) ;
  • Shin, Dong-Joon (Division of Electronics and Computer Engineering, Hanyang University)
  • Published : 2007.10.31
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we propose a new rate-control scheme, called splining, to construct low-rate codes from high-rate codes by splitting rows of the parity-check matrices of LDPC codes, which can construct rate-compatible LDPC codes having good initial transmission performance. Good low-rate codes can be constructed by making the number of distinct check node degrees as small as possible after splitting. The proposed scheme achieves good cycle property, low decoding complexity, and fast convergence speed, especially compared to the puncturing. Especially, rate-compatible repeat accumulate-type LDPC (RA-Type LDPC) code is constructed using splitting, which covers the code rates from 1/3 to 4/5. Through simulation it is shown that this code outperforms other rate-compatible RA-Type LDPC codes for all rates and can be decoded conveniently and efficiently.

Keywords

References

  1. T. J. Richardson and R. L. Urbanke, 'Efficient encoding of low-density parity-check codes,' IEEE Trans. Inform. Theory, pp. 638-656, Feb. 2001
  2. H. Jin, A. Khandekar, and R. J. McEliece, 'Irregular repeat-accumulate codes,' in Proc. 2nd Int. Symp. on Turbo Codes and Related Topics, pp. 1-8, Sep. 2000
  3. IEEE 802.16 Broadband Wireless Access Project, 'IEEE C802.16e-05/066r3' Jan. 2005
  4. U. Dammer, E. Naroska, S. Schmermbeck and U. Schwiegelshohn, 'A data puncturing IR-scheme for type-II hybrid ARQ protocols using LDPC codes,' IEEE Global Comm. Conf.(GLOBECOM), Nov. 2004 pp. 3012-3016
  5. S.-N . Hong and D.-S. Park 'Rate-Compatible Puncturing for Finite-Length Low-Density Parity-Check codes with Zigzag Parity Structure,' accepted in IEEE Int. Symp. Personal, Indoor and Mobile Radio Comm. (PIMRC'06), 2006
  6. J. Ha, J. Kim, D. Klinc, and S. W. McLaughlin, 'Rate-compatible punctured low-density parity-check codes with short block lengths,' IEEE Trans. Inform. Theory, pp. 728-738, Feb. 2006
  7. J. Li and K. R. Narayanan, 'Ratecompatible low density parity check codes for capacity-approaching ARQ schemes in packet data communications,' Int. Conf. on Comm., Internet, and Info. Tech. (CIIT), pp.201-206, Nov. 2002
  8. M. R. Yazdani and A. H. Banihashemi, 'On construction of rate-compatible low-density parity-check codes,' IEEE Comm. Lett., pp. 159-161, Mar. 2004
  9. T. J. Richardson, A. Shokrollahi and R. Urbanke, 'Design of capacity-approaching irregular low-density parity-check codes,' IEEE Trans. Inform. Theory, pp. 619-637, Feb. 2001
  10. J. Chen, A. Dholakia, E. Eleftheriou, M. P. C. Fossorier, and X. Y. Hu, 'Reducedcomplexity decoding of LDPC codes,' IEEE Trans. Comm., pp. 1288-1299, Aug. 2005
  11. 'Comparison of structured LDPC Codes and 3GPP Turbo codes,' 3GPP TSGR1#43(05) 1360,Nov. 2005
  12. 3rd Generation Partnership Project (3GPP), 'High speed downlink packet access,' 3GPP TR 25.855, June 2001