LDPC (512,480) genetic design as alternative to CRC in implementation of AODV routing protocol stack

摘要

This paper presents a design of LDPC (Low Density Parity Check) code. Algorithm deals with code optimization based on Tanner graph mutations. The LDPC code was designed to replace CRC (Cyclic Redundancy Check) code in the application of a tiny AODV routing protocol stack. Own AODV routing protocol stack was previously designed especially for wireless sensor networks with constrained resources and it is intended for usage in wireless mesh network formed by Intelligent firemen suits. Link layer of target platform uses 64B long packet with 4B for LDPC parity. The code was designed to provide the most optimal detection and correction capability with the lowest possible parity bites.