Next Article in Journal
Contact-Free Detection of Obstructive Sleep Apnea Based on Wavelet Information Entropy Spectrum Using Bio-Radar
Previous Article in Journal
Entropy as a Metric Generator of Dissipation in Complete Metriplectic Systems
Article Menu

Export Article

Open AccessArticle
Entropy 2016, 18(8), 305; doi:10.3390/e18080305

An Efficient Method to Construct Parity-Check Matrices for Recursively Encoding Spatially Coupled LDPC Codes †

Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications (BUPT), No. 10 Xitucheng Road, Haidian District, Beijing 100876, China
This paper is an extended version of our paper published in the 2015 IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, Hong Kong, China, 30 August–2 September 2015.
*
Author to whom correspondence should be addressed.
Academic Editor: Raúl Alcaraz Martínez
Received: 15 June 2016 / Revised: 23 July 2016 / Accepted: 15 August 2016 / Published: 17 August 2016
(This article belongs to the Section Information Theory)
View Full-Text   |   Download PDF [439 KB, uploaded 17 August 2016]   |  

Abstract

Spatially coupled low-density parity-check (LDPC) codes have attracted considerable attention due to their promising performance. Recursive encoding of the codes with low delay and low complexity has been proposed in the literature but with constraints or restrictions. In this manuscript we propose an efficient method to construct parity-check matrices for recursively encoding spatially coupled LDPC codes with arbitrarily chosen node degrees. A general principle is proposed, which provides feasible and practical guidance for the construction of parity-check matrices. According to the specific structure of the matrix, each parity bit at a coupling position is jointly determined by the information bits at the current position and the encoded bits at former positions. Performance analysis in terms of design rate and density evolution has been presented. It can be observed that, in addition to the feature of recursive encoding, selected code structures constructed by the newly proposed method may lead to better belief-propagation thresholds than the conventional structures. Finite-length simulation results are provided as well, which verify the theoretical analysis. View Full-Text
Keywords: channel coding; spatially coupled LDPC codes; protograph codes; recursive encoding; density evolution channel coding; spatially coupled LDPC codes; protograph codes; recursive encoding; density evolution
Figures

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Si, Z.; Wang, S.; Ma, J. An Efficient Method to Construct Parity-Check Matrices for Recursively Encoding Spatially Coupled LDPC Codes †. Entropy 2016, 18, 305.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top