.png){kind=icon}
.png){kind=icon}
Return
Joint Source Channel Anytime Coding Based on Spatially Coupled Repeat-Accumulate Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2023.3303955.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In our early work, we proposed a class of joint source channel anytime coding (JSCAC) scheme based on spatially coupled repeat-accumulate (SC-RA) codes, in addition to an improved partial joint expanding window decoding (PJEWD) algorithm. In this paper, we extend our preliminary results and make a comprehensive theoretical analysis for this system. First, we propose an improved density evolution (DE) algorithm for the SC-RA based JSCAC with PJEWD scheme. Based on the proposed DE algorithm, we systematically analyze the anytime property, the belief propagation (BP) decoding threshold, and the decoding complexity of this system over binary additive white Gaussian noise channel (BIAWGN), as well as the effects of code parameters on performances of the above three aspects. Moreover, we explore some application scenarios for JSCAC schemes, where it could maximize its advantages over the prior-art JSCC schemes. Both numerical and simulation results demonstrate the potentials of the proposed JSCAC scheme for high reliability and low latency communications. The proposed DE algorithm could also provide a good reference for the analysis of other JSCAC systems.
Keywords:
Codes
Decoding
Encoding
Parity check codes
Reliability
Complexity theory
Delays
Joint source channel coding (JSCC)
anytime transmission
spatially coupled repeat-accumulate codes (SC-RA)
expanding window decoding (EWD)
density evolution (DE)
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
View more organizations