Journal of Communications and Networks

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

DOI QR Code

Construction of Structured q-ary LDPC Codes over Small Fields Using Sliding-Window Method

  • Chen, Haiqiang (School of Computer, Electronics and Information, Guangxi University, China and Guangxi Key Laboratory of Multimedia Communications and Network Technologies, Guangxi University) ;
  • Liu, Yunyi (School of Computer, Electronics and Information, Guangxi University, China and Guangxi Key Laboratory of Multimedia Communications and Network Technologies, Guangxi University) ;
  • Qin, Tuanfa (School of Computer, Electronics and Information, Guangxi University, China and Guangxi Key Laboratory of Multimedia Communications and Network Technologies, Guangxi University) ;
  • Yao, Haitao (School of Computer, Electronics and Information, Guangxi University, China and Guangxi Key Laboratory of Multimedia Communications and Network Technologies, Guangxi University) ;
  • Tang, Qiuling (School of Computer, Electronics and Information, Guangxi University, China and Guangxi Key Laboratory of Multimedia Communications and Network Technologies, Guangxi University)
  • Received : 2013.06.24
  • Accepted : 2014.04.16
  • Published : 2014.10.31
⟨ Previous Next ⟩

Abstract

In this paper, we consider the construction of cyclic and quasi-cyclic structured q-ary low-density parity-check (LDPC) codes over a designated small field. The construction is performed with a pre-defined sliding-window, which actually executes the regular mapping from original field to the targeted field under certain parameters. Compared to the original codes, the new constructed codes can provide better flexibility in choice of code rate, code length and size of field. The constructed codes over small fields with code length from tenths to hundreds perform well with q-ary sum-product decoding algorithm (QSPA) over the additive white Gaussian noise channel and are comparable to the improved spherepacking bound. These codes may found applications in wireless sensor networks (WSN), where the delay and energy are extremely constrained.

Keywords

Acknowledgement

Supported by : NSF

References

  1. M. C. Davey and D. J. C. MacKay, "Low-density parity-check codes over GF(q)," IEEE Commun. Lett., vol. 6, no. 2, pp. 165-167, June 1998.
  2. X.-Y. Hu, E. Eleftheriou, and D. Arnold, "Regular and irregular progressive edge-growth tanner graphs," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386-398, Apr. 2005.
  3. L. Liu, W. Zhou, and S. Zhou, "Nonbinary multiple rate QC-LDPC codes with fixed information or block bit length," J. Commun. Netw., vol. 14, no. 4, pp. 429-433, Aug. 2012.
  4. X. Jiang and M. H. Lee, "Design of non-binary quasi-cyclic LDPC codes based on multiplicative groups and Euclidean geometries," J. Commun. Netw., vol. 12, no. 5, pp. 406-410, June 2010.
  5. D. Cao and Y. Song, "A Class of check matrices constructed from Euclidean geometry and their application to quantum LDPC codes," J. Commun. Netw., vol. 15, no. 1, pp. 71-76, Feb. 2013.
  6. Z.W. Li et al., "Efficient encoding of qusa-cyclic low-density parity-check codes," IEEE Trans. Commun., vol. 54, no. 1, pp. 71-78, Jan. 2006.
  7. D. Zhao et al., "A low complexity decoding algorithm for majority-logic decodable nonbinary LDPC codes," Commun. Lett., vol. 14, no. 11, pp. 1062-1064, Nov. 2010.
  8. X. Wang, B. Bai, and X. Ma, "A low-complexity joint detection-decoding algorithm for nonbinary LDPC-coded modulation systems," in Proc. IEEE ISIT, Austin, Texas, June 2010, pp.794-798.
  9. X. Ma et al., "Low complexity X-EMS algorithms for nonbinary LDPC codes," IEEE Trans. Commun., vol. 60, no. 1, pp. 9-13, Jan. 2012.
  10. S. Zhao et al., "A Variant of the EMS algorithm for nonbinary LDPC codes," IEEE Commun. Lett., vol. 17, no. 8, pp. 1640-1643, Aug. 2013.
  11. S. Zhao et al., "Joint detection-decoding of majority-logic decodable nonbinary LDPC coded modulation systems: an iterative noise reduction algorithm," in Proc. IEEE ChinaSIP, Beijing, China, July 2013, pp. 412-416.
  12. L.-Q. Zeng et al., "Constructions of nonbinary quasi-cyclic LDPC codes: A finite field approach," IEEE Trans. Commun., vol. 56, no. 4, pp. 545- 554, Apr. 2008.
  13. L.-Q. Zeng et al., "Constructions of nonbinary cyclic, quasi-cyclic and regular LDPC codes: A finite geometry approach," IEEE Trans. Commun., vol. 56, no. 3, pp. 378-387, Mar. 2008.
  14. S. Zhao, X. Ma, and B. Bai, "A Class of nonbinary LDPC codes with fast encoding and decoding algorithms," IEEE Trans. Commun., vol. 61, no. 1, pp.1-6. Jan. 2013.
  15. B. Rong et al., "Combine LDPC codes over GF(q) with q-ary modulations for bandwidth efficient transmission," IEEE Trans. Broadcast., vol. 54, no. 1, pp. 78-84, Mar. 2008.
  16. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. 27, pp. 533-547, Sept. 1981.
  17. Y. Kou, S. Lin, and M. P. C. Fossorier, "Low-density parity-check codes based on finite geometries: A discovery and new results," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
  18. C. Poulliat, M. Fossorier, and D. Declercq, "Using binary images of nonbinary LDPC codes to improve overall performance," in Proc. IEEE Int. Turbo Code Symp., Munich, Germany, Apr. 2006, pp. 1-6.
  19. A. Valembois and M. P. C. Fossorier, "Sphere-packing bounds revisited for moderate block lengths," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 2998-3014, Dec. 2004.
  20. X.-Y. Hu and E. Eleftheriou, "Binary representation of cycle tanner-graph GF(2b) codes," in Proc. IEEE Int. Conf. Commun., Paris, France, June 2004, pp. 528-532.
  21. X.-Y. Hu, E. Eleftheriou, and D.-M. Arnold, "Irregular progressive edge growth tanner graphs," in Proc. 4th Int. ITG Conf. Source and Channel Coding, Berlin, Jan. 2002, pp. 61-68.