Distributed joint source-channel coding for relay systems exploiting source-relay correlation and source memory

Abstract

In this article, we propose a distributed joint source-channel coding (DJSCC) technique that well exploits source-relay correlation as well as source memory structure simultaneously for transmitting binary Markov sources in a one-way relay system. The relay only extracts and forwards the source message to the destination, which implies imperfect decoding at the relay. The probability of errors occurring in the source-relay link can be regarded as source-relay correlation. The source-relay correlation can be estimated at the destination node and utilized in the iterative processing. In addition, the memory structure of the Markov source is also utilized at the destination. A modified version of the Bahl, Cocke, Jelinek, and Raviv (BCJR) algorithm is derived to exploit the memory structure of the Markov source. Extrinsic information transfer (EXIT) chart analysis is then performed to investigate convergence property of the proposed technique. Results of simulations conducted to evaluate the bit-error-rate (BER) performance and the EXIT chart analysis show that, by exploiting the source-relay correlation and source memory simultaneously, our proposed technique achieves significant performance gain, compared with the case where the correlation knowledge is not fully used.

Improved Iterative Decoding of Network-Channel Codes for Multiple-Access Relay Channel

“…In cooperative communication transmitting users use one another's antenna to realize the benefit of multiple antenna transmission. There are many cooperative strategies to achieve efficient node cooperation, such as amplify and forward [2–4], decode and forward [5], and coded cooperation [6, 7]. In amplify and forward protocol, relay nodes retransmit amplified versions of the signal received from source.…”

Accumulator Aided Decoding of Low Complexity SISO Arithmetic Codes with Image Transmission Application

“…Authors in [18] use doped accumulator on the top of a bit interleaved coded modulation with iterative detection (BICM-ID) structure such that the EXIT curve matches more closely with outer decoder. In [19] authors use doped accumulator for achieving turbo-cliff. We have used this property of accumulator to obtain iteration gain in cascade of stages comprising of SISO arithmetic decoder.…”

Joint Decoding and Estimation of Spatio-Temporally Correlated Binary Sources

“…Online estimation of the correlation parameters is one of the promising solutions for practical DJSCC dispensing with the knowledge of correlation at the receiver. Estimation of the spatial-only correlation parameter has been addressed in [7], [8], [11] and high accuracy in estimating the spatial correlation was attained.…”

“…Hence, the authors of [8]- [10] exploited the spatio-temporal correlation of the sources and demonstrated that further performance improvements can be achieved by exploiting both the spatial and temporal correlations, as compared to spatial correlation only.…”

“…In order to avoid this problem, it was assumed in [8]- [10] that the partial or full statistical knowledge of the spatiotemporal correlation is available at the receiver. However, this idealistic assumption can only be justified by relying on additional resources to forward the correlation coefficients to the receiver.…”