Abstract
In this letter, an adaptive decoding algorithm with a variable sliding window for joint source-channel coding (JSCC) scheme based on double spatially coupled low-density parity-check (DSC-LDPC) codes is investigated. For the traditional sliding window decoding (SWD) algorithm, one or more errors occurring in a decoding window may affect the decoding of the next window, which will trigger error propagation. To mitigate the effects, a window extension algorithm based on average log-likelihood ratios (LLRs) will be proposed, but the implement of extension implies higher decoding complexity. In order to trade-off the error rate performance and complexity, the source and channel threshold that determines the window extension are analyzed. In the simulation, the proposed SWD algorithm with acceptable complexity has better error rate performance in the water fall region and the error floor region.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.