Results 1 - 10
of
10
Iterative Source-Channel Decoding With Markov Random Field Source Models
"... Abstract—We propose a joint source-channel decoding approach for multidimensional correlated source signals. A Markov random field (MRF) source model is used which exemplarily considers the residual spatial correlations in an image signal after source encoding. Furthermore, the MRF parameters are se ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
(Show Context)
Abstract—We propose a joint source-channel decoding approach for multidimensional correlated source signals. A Markov random field (MRF) source model is used which exemplarily considers the residual spatial correlations in an image signal after source encoding. Furthermore, the MRF parameters are selected via an analysis based on extrinsic information transfer charts. Due to the link between MRFs and the Gibbs distribution, the resulting soft-input soft-output (SISO) source decoder can be implemented with very low complexity. We prove that the inclusion of a high-rate block code after the quantization stage allows the MRF-based decoder to yield the maximum average extrinsic information. When channel codes are used for additional error protection the MRF-based SISO source decoder can be used as the outer constituent decoder in an iterative source-channel decoding scheme. Considering an example of a simple image transmission system we show that iterative decoding can be successfully employed for recovering the image data, especially when the channel is heavily corrupted. Index Terms—EXIT charts, iterative source-channel decoding, joint source-channel coding, Markov random fields. I.
SYMMETRIC INTERPOLATORY FRAMELETS AND THEIR ERASURE RECOVERY PROPERTIES
, 2006
"... A new class of wavelet-type frames in signal space that uses (anti)symmetric waveforms is presented. The construction employs interpolatory filters with rational transfer functions. These filters have linear phase. They are amenable either to fast cascading or parallel recursive implementation. Robu ..."
Abstract
-
Cited by 4 (4 self)
- Add to MetaCart
(Show Context)
A new class of wavelet-type frames in signal space that uses (anti)symmetric waveforms is presented. The construction employs interpolatory filters with rational transfer functions. These filters have linear phase. They are amenable either to fast cascading or parallel recursive implementation. Robust error recovery algorithms are developed by utilizing the redundancy inherent in frame expansions. Experimental results recover images when (as much as) 60 % of the expansion coefficients are either lost or corrupted. The proposed approach inflates the size of the image through framelet expansion and multilevel decomposition thus providing redundant representation of the image. Finally, the frame-based error recovery algorithm is compared with a classical coding approach.
Source-optimized irregular repeat accumulate codes with inherent unequal error protection capabilities and their application to progressive image transmission,” presented at
- the 37th Asilomar Conf. Signals, Systems, Computers
, 2003
"... Abstract—The common practice for achieving unequal error protection (UEP) in scalable multimedia communication systems is to design rate-compatible punctured channel codes before computing the UEP rate assignments. This paper proposes a new approach to designing powerful irregular repeat accumulate ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract—The common practice for achieving unequal error protection (UEP) in scalable multimedia communication systems is to design rate-compatible punctured channel codes before computing the UEP rate assignments. This paper proposes a new approach to designing powerful irregular repeat accumulate (IRA) codes that are optimized for the multimedia source and to ex-ploiting the inherent irregularity in IRA codes for UEP. Using the end-to-end distortion due to the first error bit in channel decoding as the cost function, which is readily given by the operational distortion-rate function of embedded source codes, we incorporate this cost function into the channel code design process via density evolution and obtain IRA codes that minimize the average cost function instead of the usual probability of error. Because the resulting IRA codes have inherent UEP capabilities due to irregu-larity, the new IRA code design effectively integrates channel code optimization and UEP rate assignments, resulting in source-opti-mized channel coding or joint source-channel coding. We simulate our source-optimized IRA codes for transporting SPIHT-coded images over a binary symmetric channel with crossover proba-bility. When = 0 03 and the channel code length is long (e.g., with one codeword for the whole 512 512 image), we are able to operate at only 9.38 % away from the channel capacity with code length 132380 bits, achieving the best published results in terms of average peak signal-to-noise ratio (PSNR). Compared to conventional IRA code design (that minimizes the probability of error) with the same code rate, the performance gain in average PSNR from using our proposed source-optimized IRA code design is 0.8759 dB when = 0 1 and the code length is 12800 bits. As predicted by Shannon’s separation principle, we observe that this performance gain diminishes as the code length increases. Index Terms—Irregular repeat accumulate (IRA) codes, scalable source coding, source-channel coding, source-optimized channel coding, unequal error protection (UEP). I.
Joint Source-Channel Coding with Unequal Error Protection using Asymmetric Turbo Codes
"... Abstract—In this paper, we devise an efficient joint source-channel coding scheme for robust image transmission over noisy channels. We firstly present a novel interleaver, named unequal row column cyclic cross interleaver, which could improve the error correction capability of turbo codes effective ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract—In this paper, we devise an efficient joint source-channel coding scheme for robust image transmission over noisy channels. We firstly present a novel interleaver, named unequal row column cyclic cross interleaver, which could improve the error correction capability of turbo codes effectively. Secondly, we devise two types of asymmetric turbo codes which consist of the parallel concatenated turbo codes using two non-identical component encoders with the different constraint lengths and mixed types of generator polynomials. The presented asymmetric turbo codes can optimize the bit error rate of both water-fall region at low signal to noise ratio and error-floor region at high signal to noise ratio, they outperform the conventional symmetric turbo codes but with reduced decoding complexity. Finally, we propose a joint source-channel coding scheme based on unequal error protection using asymmetric
Symmetric interpolatory framelets and their error correction properties
"... When transmitting images over practical communication channels, they are subject to packet loss and random errors due to the noisy nature of the channel. Errors and data loss are customarily recovered by means of error correction coding/decoding. In this paper, robust error-recovery algorithms are d ..."
Abstract
- Add to MetaCart
(Show Context)
When transmitting images over practical communication channels, they are subject to packet loss and random errors due to the noisy nature of the channel. Errors and data loss are customarily recovered by means of error correction coding/decoding. In this paper, robust error-recovery algorithms are developed by utilizing the redundancy inherent in frame expansions. A new class of wavelet-type frames in signal space using (anti)symmetric waveforms is presented. The construction employs interpolatory filters with rational transfer functions. These filters have linear-phase. They are amenable to fast cascading or parallel recursive implementation. Experimental results recover images when (as much as) 60 % of the packets are either lost or corrupted. The proposed approach inflates the size of the image through framelet expansion thus providing redundant representation of the image; this transform may be followed by compression. Finally, the frame-based error recovery algorithm is compared with a classical coding approach. 1
Robust Image Transmission with Rate- Compatible Low-Density Parity-Check codes over Noisy Channels
, 2004
"... © Copyright ..."
(Show Context)
Source-channel Coding for Robust Image Transmission and for Dirty-paper Coding.
, 2005
"... In this dissertation, we studied two seemingly uncorrelated, but conceptually related problems in terms of source-channel coding: 1) wireless image transmission and 2) Costa (“dirty-paper”) code design. In the first part of the dissertation, we consider progressive image transmission over a wireless ..."
Abstract
- Add to MetaCart
In this dissertation, we studied two seemingly uncorrelated, but conceptually related problems in terms of source-channel coding: 1) wireless image transmission and 2) Costa (“dirty-paper”) code design. In the first part of the dissertation, we consider progressive image transmission over a wireless system employing space-time coded OFDM. The space-time coded OFDM system based on a newly built broadband MIMO fading model is theoretically evaluated by assuming perfect channel state information (CSI) at the receiver for coherent detection. Then an adaptive modulation scheme is proposed to pick the constellation size that offers the best reconstructed image quality for each average signal-to-noise ratio (SNR). A more practical scenario is also considered without the assumption of perfect CSI. We employ low-complexity decision-feedback decoding for differentially space-time coded OFDM systems to exploit transmitter diversity. For JSCC, we adopt a product channel code structure that is proven to provide powerful error protection and bursty error correction. To further improve the system performance, we also apply
ROBUST IMAGE TRANSMISSION BASED ON PRODUCT-CODE OPTIMIZATION FOR DETERMINATE STATE LDPC DECODING
"... We propose a novel scheme for error resilient image transmission. The proposed scheme employs a product coder consisting of LDPC codes and RS codes in order to deal effectively with bit errors. The efficiency of the proposed scheme is based on the exploitation of determinate symbols in Tanner graph ..."
Abstract
- Add to MetaCart
(Show Context)
We propose a novel scheme for error resilient image transmission. The proposed scheme employs a product coder consisting of LDPC codes and RS codes in order to deal effectively with bit errors. The efficiency of the proposed scheme is based on the exploitation of determinate symbols in Tanner graph decoding of LDPC codes and a novel product code optimization technique based on error estimation. Experimental evaluation demonstrates the superiority of the proposed system in comparison to recent state-of-the art techniques for image transmission. Index Terms — Image transmission, Product codes, LDPC codes.
Correspondence LDPC-Based Iterative Joint Source-Channel Decoding for JPEG2000
"... Abstract—A framework is proposed for iterative joint source-channel de-coding of JPEG2000 codestreams. At the encoder, JPEG2000 is used to per-form source coding with certain error-resilience (ER) modes, and LDPC codes are used to perform channel coding. During decoding, the source decoder uses the ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—A framework is proposed for iterative joint source-channel de-coding of JPEG2000 codestreams. At the encoder, JPEG2000 is used to per-form source coding with certain error-resilience (ER) modes, and LDPC codes are used to perform channel coding. During decoding, the source decoder uses the ER modes to identify corrupt sections of the codestream and provides this information to the channel decoder. Decoding is carried out jointly in an iterative fashion. Experimental results indicate that the proposed method requires fewer iterations and improves overall system performance. Index Terms—Error resilience (ER), joint source/channel coding, JPEG2000, LDPC. I.