2019/10/19 by Mohit Kumar, M. Sravan Kumar, Kumar, Mohit
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Algorithm #Channel (broadcasting) #Computer science #Cooperative Communication and Network Coding #Decoding methods #Error Correcting Code Techniques #FOS: Electrical engineering #Fading #Low-density parity-check code #Markov chain #Signal Processing (eess.SP) #Telecommunications #Theoretical computer science #eess.SP #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.1912.09463
published in arXiv (Cornell University) (Cornell University)
arxiv created 2019/10/19 · openalex publication_date 2019/10/19 · arxiv updated 2019/12/20 · openalex created_date 2019/12/26 · openalex updated_date 2026/07/28
Here we have proposed two decoding strategies of low-density parity-check (LDPC) codes over Markov noise channels with bit flipping noise. The sum-product algorithm used for decoding LDPC codes over memoryless channels is extended to include channel estimation and how much gain we obtain by doing so is simulated and verified. LDPC codes have been studied for years over memoryless channels and are known to have excellent performance. However, these codes over channels with memory is the topic of current research. Here, channels with memory are characterized by Markov modeling which is a useful busty channel model. With sufficient no. of states, they are able to model sufficient noise characteristics. We have gone for a two-state system as it shows a good compromise between complexity and performance.