Abstract

This paper presents a novel linear error detection and correction approach for single and multiple bit error codes called low complexity parity check (LCPC) code. The LCPC code detects and corrects consecutive and non-consecutive bit errors. It can be used as a forward error correction scheme in the data transmission system of green wireless networks and the green Internet of Things. The proposed code improves network performance in terms of throughput, end-to-end delay, and bit error rate (BER). LCPC codes also have less complexity and lower memory requirements than Reed Solomon (RS) and low-density parity check (LDPC) codes because they have less non-zero elements in the generator matrix and the parity check matrix. Unlike LDPC codes, LCPC codes do not require reiteration in the decoding process. Various code rates of the LCPC code are proposed to reduce the complexity of the encoding and decoding process, which in turn decreases energy consumption. Simulation results show that the proposed LCPC (9, 4) code outperforms the popular LDPC codes. Compared with the LDPC (8, 4) with the decode bit flip algorithm, LCPC (9, 4) offers a coding gain of nearly 3 dB at a BER equal to 10−5.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call