PROJECT TITLE :
Performance Comparison of LDPC Block and Spatially Coupled Codes Over GF $(q)$
In this paper, we have a tendency to compare the finite-length performance of protograph-based mostly spatially coupled low-density parity-check (SC-LDPC) codes and LDPC block codes (LDPC-BCs) over GF . To reduce computational complexity and latency, a sliding window decoder with a stopping rule based on a soft belief propagation (BP) estimate is used for the -ary SC-LDPC codes. 2 regimes are thought of: one when the constraint length of -ary SC-LDPC codes is equal to the block length of -ary LDPC-BCs and the other when the 2 decoding latencies are equal. Simulation results ensure that, in both regimes, (three,vi)-, (three,nine)-, and (three,twelve) -regular non-binary SC-LDPC codes can considerably outperform both binary and non-binary LDPC-BCs and binary SC-LDPC codes. Finally, we have a tendency to present a computational complexity comparison of -ary SC-LDPC codes and -ary LDPC-BCs below equal decoding latency and equal decoding performance assumptions.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here