Random-permutation-matrix-based cyclically-coupled LDPC codes

Chung Ming Lau, Fanlu Mo, Wai M. Tarn, Chiu Wing Sham

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

2 Citations (Scopus)

Abstract

Cyclically-coupled quasi-cyclic low-density parity-check (CC-QC-LDPC) codes are a new class of QC-LDPC codes which can achieve excellent error performance and relatively low hardware requirement. In this paper, we modify the CC-QC-LDPC code construction by using random permutation matrices instead of circulant permutation matrices, forming the 'random-permutation-matrix-based CC-LDPC (RP-CC-LDPC) code'. The objective is to achieve a better error performance under the same code length. We simulate the bit error rate using FPGA simulations. We also compare the BER results and decoder complexity of the above codes with those of regular and irregular QC-LDPC codes under the same code length and code rate.
Original languageEnglish
Title of host publication19th International Conference on Advanced Communications Technology
Subtitle of host publicationOpening Era of Smart Society, ICACT 2017 - Proceeding
PublisherIEEE
Pages497-500
Number of pages4
ISBN (Electronic)9788996865094
DOIs
Publication statusPublished - 29 Mar 2017
Event19th International Conference on Advanced Communications Technology, ICACT 2017 - Phoenix Park, Pyeongchang, Korea, Republic of
Duration: 19 Feb 201722 Feb 2017

Conference

Conference19th International Conference on Advanced Communications Technology, ICACT 2017
Country/TerritoryKorea, Republic of
CityPyeongchang
Period19/02/1722/02/17

Keywords

  • Cyclically-coupled quasi-cyclic low-density parity-check
  • FPGA simulations
  • QC-LDPC
  • Random-permutation-matrix-based CC-LDPC
  • RC-CC-QCLDPC

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Random-permutation-matrix-based cyclically-coupled LDPC codes'. Together they form a unique fingerprint.

Cite this