Low Complexity Parity Check Code for Futuristic Wireless Networks Applications
Open Access
- 4 April 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 18398-18407
Abstract
The Internet of Things refers to the aptitude of remotely connecting and monitoring anything, anytime, and anywhere via futuristic wireless networks. Due to the unreliable wireless links, broadcast nature of wireless transmissions, interference and noisy transmission channels, frequent topology changes, and the various quality of wireless channel, there are challenges in providing high data rate service, high throughput, high packet delivery ratio, low end-to-end delay, and reliable services. In wireless network and real time application systems, low complexity and shorter codeword length in channel coding scheme are preferred. Consequently, in order to address these challenges, we propose a novel error detection and correction codes called the low-complexity parity-check (LCPC) codes with short codeword lengths for futuristic wireless networks applications. The proposed codes have less complexity and lower memory requirement in comparison to turbo and low-density parity-check (LDPC) codes. Simulation results demonstrated that the proposed LCPC codes outperform the Hamming and Reed-Solomon codes, in addition to the renowned LDPC codes. It offers up to 3-dB coding gain.Keywords
This publication has 29 references indexed in Scilit:
- CRC Error Correction in IoT ApplicationsIEEE Transactions on Industrial Informatics, 2016
- Design of Short Quasi-Cyclic LDPC Codes for Next Generation Broadcast Wireless Systems2016
- A Hybrid Decoding Scheme for Short Non-Binary LDPC CodesIEEE Communications Letters, 2014
- Short-blocklength non-binary LDPC codes with feedback-dependent incremental transmissions2014
- Influence of trellis termination methods on turbo code performances2013
- High Hardware Utilization and Low Memory Block Requirement Decoding of QC-LDPC CodesChinese Journal of Aeronautics, 2012
- Decoding Algorithms for Nonbinary LDPC Codes Over GF$(q)$IEEE Transactions on Communications, 2007
- Regular {4, 8} LDPC Codes and Their Lowerror Floors2006
- Improved Bit-Flipping Decoding of Low-Density Parity-Check CodesIEEE Transactions on Information Theory, 2005
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001