Abstract:Abstract-In this paper, we develop a two-way multi-relay scheme for JPEG 2000 image transmission. We adopt a modified time-division broadcast (TDBC) cooperative protocol, and derive its power allocation and relay selection under a fairness constraint. The symbol error probability of the optimal system configuration is then derived. After that, a joint source-channel coding (JSCC) problem is formulated to find the optimal number of JPEG 2000 quality layers for the image and the number of channel coding packets … Show more
“…Also when the redundancy of images is utilized in the decoding process, errors can be reduced [7]. In [8], the use of JSCC in JPEG2000 transmission over a two-way relay network is studied; while in [9], [10], the applications of JSCC schemes to wireless video transmissions are investigated. In [11], an iterative joint source-channel decoder is proposed, where messages are exchanged between the decoder of variable length (source) codes (VLC) and the decoder of recursive systematic convolutional codes or low-density parity-check (LDPC) codes.…”
In this paper, we propose using a single protograph to design joint source-channel codes (JSCCs). We present a generalized algorithm, called protograph extrinsic information transfer for JSCC algorithm (PEXIT-JSCC algorithm), for analyzing the channel threshold of the proposed JSCC. We also propose a source single protograph EXIT (SSP-EXIT) algorithm, which is more generic than the generalized source protograph extrinsic information transfer (GSP-EXIT) algorithm, for evaluating the source threshold of a single protograph. Moreover, a collaborative optimization method based on the SSP-EXIT and PEXIT-JSCC algorithms is proposed to construct single-protograph JSCCs with good source and channel thresholds. Finally, we construct single-protograph JSCCs, analyze their decoding thresholds, and compare their theoretical and error performance with JSCC systems based on optimized double-protographs. Results show that our proposed codes can outperform double-protograph-based JSCCs.
“…Also when the redundancy of images is utilized in the decoding process, errors can be reduced [7]. In [8], the use of JSCC in JPEG2000 transmission over a two-way relay network is studied; while in [9], [10], the applications of JSCC schemes to wireless video transmissions are investigated. In [11], an iterative joint source-channel decoder is proposed, where messages are exchanged between the decoder of variable length (source) codes (VLC) and the decoder of recursive systematic convolutional codes or low-density parity-check (LDPC) codes.…”
In this paper, we propose using a single protograph to design joint source-channel codes (JSCCs). We present a generalized algorithm, called protograph extrinsic information transfer for JSCC algorithm (PEXIT-JSCC algorithm), for analyzing the channel threshold of the proposed JSCC. We also propose a source single protograph EXIT (SSP-EXIT) algorithm, which is more generic than the generalized source protograph extrinsic information transfer (GSP-EXIT) algorithm, for evaluating the source threshold of a single protograph. Moreover, a collaborative optimization method based on the SSP-EXIT and PEXIT-JSCC algorithms is proposed to construct single-protograph JSCCs with good source and channel thresholds. Finally, we construct single-protograph JSCCs, analyze their decoding thresholds, and compare their theoretical and error performance with JSCC systems based on optimized double-protographs. Results show that our proposed codes can outperform double-protograph-based JSCCs.
“…Therefore, the joint source-channel coding (JSCC) system has drawn increasing attention through effective utilization of the residual redundancy. The JSCC system have good error-correcting performance [2], complexity [3], [4] and transmission delay [5], and these advantages promote the JSCC system for applications in image processing [6], video transmissions [7] and so on. The JSCC system, where one low-density parity-check (LDPC) code [8] is used for source compression and one LDPC code is used for channel error correction, was proved to perform well in practical applications by utilizing the joint Tanner graph on the decoder side, named the double LDPC (D-LDPC) JSCC system [2].…”
The joint shuffled scheduling decoding (JSSD) algorithm can reduce the decoding complexity of the joint source-channel coding system (JSCC) based on double protograph low-density parity-check (P-LDPC) codes. However, the JSSD algorithm will not work when the linking matrix between check nodes (CNs) of the source P-LDPC and variable nodes (VNs) of the channel P-LDPC is adopted in such a system, and this linking matrix has a significant influence on the system performance. In this paper, a generalized joint shuffled scheduling decoding (GJSSD) algorithm is designed to work for the system, and the JSSD algorithm can be regarded as a special case of this algorithm. Simulations show that the proposed GJSSD algorithm can reduce the decoding complexity with performance improvement when compared with the joint belief-propagation (JBP) algorithm.INDEX TERMS Joint source-channel coding, P-LDPC code, shuffled decoding.
“…This algorithm offers 10X or higher speed compared to the previous algorithms with a slight sacrifice in the coding efficiency. In order to optimize JPEG-2000 for image transmission through wireless networks, Joint Source-Channel Coding (JSCC) has been proposed in [14] and congestion control for interactive applications over SDN networks has been proposed in [15]. Further detailed study of rate-distortion optimization for JPEG-2000 is found in [16], [17].…”
Quality Scalability is one of the important features of interactive imaging to obtain better perceptual quality at a specified target bit rate. In JPEG 2000, it is achieved using quality layers obtained by Rate-Distortion (R-D) optimization techniques in Tier-II coding. Some important concerns here are: (i) inefficient conventional Post-Compression Rate-Distortion (PCRD) optimization algorithms, (ii) lack of quality scalability for less or single quality layer string. This paper takes the above mentioned concerns into account and proposes a Blind Quality Scalable (BlinQS) algorithm that provides scalability with the least computational complexity. The novel part of this method is to eliminate the Tier-II coding and add a blind string selection algorithm through a normal distribution for efficient rate control. The results obtained suggest that the proposed method achieves better results than JPEG-2000 at single quality layer and achieves results close to JPEG-2000 without using PCRD optimization algorithms.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.