Distributed Joint Source-Channel Coding for Correlated Sources Using Non-systematic Repeat-Accumulate Based Codes

In this paper, we propose a technique for coding the data from multiple correlated binary sources, with the aim of providing an alternative solution to the correlated source compression problem. Using non-systematic repeat-accumulate based codes, it is possible to achieve compression which is close to the Slepian–Wolf bound without relying on massive puncturing. With the technique proposed in this paper, instead of puncturing, compression is achieved by increasing check node degrees. Hence, the code rate can be more flexibly adjusted with the proposed technique in comparison with the puncturing-based schemes. Furthermore, the technique is applied to distributed joint source-channel coding (DJSCC). It is shown that in many cases tested, the proposed scheme can achieve mutual information very close to one with the lower signal-to-noise power ratio than turbo and low density generator matrix based DJSCC in additive white Gaussian noise channel. The convergence property of the system is also evaluated via the extrinsic information transfer analysis.     

Performance of Multilayered Video Encoding and Delivery over Lossy Channels Using a Joint Source-Channel Coding Approach

In this paper, the performance of selected error-control schemes based on forward error-control (FEC) coding for H.263+ video transmission over an additive white Gaussian noise (AWGN) channel is studied. Joint source and channel coding (JSCC) techniques that employ single-layer and 2-layer H.263+ coding in conjunction with unequal error protection (UEP) to combat channel errors are quantitatively compared. Results indicate that with appropriate joint source and channel coding, tailored to the respective layers, FEC-based error control in combination with 2-layer video coding techniques can lead to more acceptable quality for wireless video delivery in the presence of channel impairments. Yong Pei is currently a tenure-track assistant professor in the Computer Science and Engineering Department, Wright State University, Dayton, OH. Previously he was a visiting assistant professor in the Electrical and Computer Engineering Department, University of Miami, Coral Gables, FL. He received his B.S. degree in electrical power engineering from Tsinghua University, Beijing, in 1996, and M.S. and Ph.D. degrees in electrical engineering from Rensselaer Polytechnic Institute, Troy, NY, in 1999 and 2002, respectively. His research interests include information theory, wireless communication systems and networks, and image/video compression and communications. He is a member of IEEE and ACM. James W. Modestino (S′67- M′73- SM′81- F′87) was born in Boston, MA, on April 27, 1940. He received the B.S. degree from Northeastern University, Boston, MA, in 1962, and the M.S. degree from the University of Pennsylvania, Philadelphia, PA, in 1964, both in electrical engineering. He also received the M.A. and Ph.D. degrees from Princeton University, Princeton, NJ, in 1968 and 1969, respectively. He has held a number of industrial positions, including positions with RCA Communications Systems Division, Camden, NJ; General Electronic Laboratories, Cambridge, MA; AVCO Systems Division, Wilmington, MA; GTE Laboratories, Waltham, MA; and MIT Lincoln Laboratories, Lexington, MA. From 1970 to 1972, he was an Assistant Professor in the Department of Electrical Engineering, Northeastern University. In 1972, he joined Rensselaer Polytechnic Institute, Troy, NY, where until leaving in 2002 he was an Institute Professor in the Electrical, Computer and Systems Engineering Department and Director of the Center for Image Processing Research. He has been responsible for teaching and research in the communication, information and signal processing systems area. His specific research interests include communication in fading dispersive channels; detection, estimation and filtering in impulsive or burst noise environments; digital signal, image and video processing; and multimedia communication systems and networks. In 2002 he joined the Department of Electrical and Computer Engineering at the University of Miami, Coral Gables, FL, as the Victor E. Clarke Endowed Scholar, Professor and Chair. He has held visiting positions with the University of California at San Diego, LaJolla, CA (1981–1982); GE Research and Development Center, Schenectady, NY (1988–1989); and Massachusetts Institute of Technology, Cambridge, MA (1995–1996). Dr. Modestino is a past member of the Board of Governors of the IEEE Information Theory Group. He is a past Associate Editor and Book Review Editor for the IEEE TRANSACTIONS ON INFORMATION THEORY. In 1984, he was co-recipient of the Stephen O. Rice Prize Paper Award from the IEEE Communications Society and in 2000 he was co-recipient of the best paper award at the International Packet Video Conference.     

Lossy Distributed Source Coding Using LDPC Codes

In this paper, we propose a practical scheme for lossy distributed source coding with side information available at the decoder. Our proposed scheme is based on sending parity bits using LDPC codes. We provide the design procedure for the LDPC code that guarantees performance close to the Wyner-Ziv limit for long LDPC codes. Using simulation results, we show that the proposed method performs close to the theoretical limit for even short length codes.     

分布式视频编码中符号Turbo码交织器的设计

分析了交织器在Turbo码中的作用,指出了现有的几种交织器的缺点.设计了两种新型的基于块交织的S随机交织器和基于伪随机交织的S随机交织器.仿真结果表明,与现有的几种交织器相比,这两种交织器在Turbo码译码迭代次数及延时方面性能更好,更适合于分布式视频编码系统.     

Linear-Codes-Based Lossless Joint Source-Channel Coding for Multiple-Access Channels

A general lossless joint source-channel coding (JSCC) scheme based on linear codes and random interleavers for multiple-access channels (MACs) is presented and then analyzed in this paper. By the information-spectrum approach and the code-spectrum approach, it is shown that a linear code with a good joint spectrum can be used to establish limit-approaching lossless JSCC schemes for correlated general sources and general MACs, where the joint spectrum is a generalization of the input–output weight distribution. Some properties of linear codes with good joint spectra are investigated. A formula on the “distance” property of linear codes with good joint spectra is derived, based on which, it is further proved that, the rate of any systematic codes with good joint spectra cannot be larger than the reciprocal of the corresponding alphabet cardinality, and any sparse generator matrices cannot yield linear codes with good joint spectra. The problem of designing arbitrary rate coding schemes is also discussed. A novel idea called “generalized puncturing” is proposed, which makes it possible that one good low-rate linear code is enough for the design of coding schemes with multiple rates. Finally, various coding problems of MACs are reviewed in a unified framework established by the code-spectrum approach, under which, criteria and candidates of good linear codes in terms of spectrum requirements for such problems are clearly presented.      

Improved Bit-Based Joint Source-Channel Decoding of Variable Length Codes

Joint source channel decoding (JSCD) for variable length codes (VLCs) has been shown to be effective for error- prone channels. In this paper, we propose two schemes to enhance the performance of the existing bit-based JSCD approach for VLCs. Simulation results show that the performance of the decoder can be significantly improved, while the computational complexity is only slightly increased by using our proposed schemes.     

Distributed Video Coding

Distributed coding is a new paradigm for video compression, based on Slepian and Wolf's and Wyner and Ziv's information-theoretic results from the 1970s. This paper reviews the recent development of practical distributed video coding schemes. Wyner-Ziv coding, i.e., lossy compression with receiver side information, enables low-complexity video encoding where the bulk of the computation is shifted to the decoder. Since the interframe dependence of the video sequence is exploited only at the decoder, an intraframe encoder can be combined with an interframe decoder. The rate-distortion performance is superior to conventional intraframe coding, but there is still a gap relative to conventional motion-compensated interframe coding. Wyner-Ziv coding is naturally robust against transmission errors and can be used for joint source-channel coding. A Wyner-Ziv MPEG encoder that protects the video waveform rather than the compressed bit stream achieves graceful degradation under deteriorating channel conditions without a layered signal representation.     

不等概率可变长符号联合信源信道编码的调制

传统的信源信道编码调制,都是基于四十年代香农分离理论的比特级和定长符号级解调译码,采用均匀分布和等概率的星座映射,在资源受限的无线通信系统中,难以与动态变化的多径信道相匹配,不可逾越通信技术发展所面对的可靠性墙和功耗墙等障碍.本文针对比特级和定长符号级调制/解调译码框架的局限,将变长信源信道编码与非等概率、优化的非均匀...     

信源-信道联合编码／调制中映射方式的优化

在信源-信道联合编码/调制中,通过优化信源和信道调制符号间的映射关系,在端到端均方误差的失真度量标准下,可以得到比传统级联编码系统更好的性能。且通过类似BSA的交换算法求得局部最优映射方式,有更高的重建信噪比,系统复杂度低。     

Efficient Stereoscopic Video Coding Using Joint Disparity-Motion Estimation

The goal of this paper is to determine dense disparity and motion fields jointly and efficiently, given a sequence of stereoscopic images. At each time instant, the motion field of left sequences is estimated by using the current disparity field, the next disparity field, and the motion field of right sequences. The improved concepts for the proposed joint estimation are based on an edge-preserving regularization, an ambiguous vector region detection, and a median filtering for block-based vector generation. The reported approach is verified by processing a set of stereo sequences. Results are given with real stereoscopic data.     

Joint Source-Channel Distortion Modeling for MPEG-4 Video

Multimedia communication has become one of the main applications in commercial wireless systems. Multimedia sources, mainly consisting of digital images and videos, have high bandwidth requirements. Since bandwidth is a valuable resource, it is important that its use should be optimized for image and video communication. Therefore, interest in developing new joint source-channel coding (JSCC) methods for image and video communication is increasing. Design of any JSCC scheme requires an estimate of the distortion at different source coding rates and under different channel conditions. The common approach to obtain this estimate is via simulations or operational rate-distortion curves. These approaches, however, are computationally intensive and, hence, not feasible for real-time coding and transmission applications. A more feasible approach to estimate distortion is to develop models that predict distortion at different source coding rates and under different channel conditions. Based on this idea, we present a distortion model for estimating the distortion due to quantization and channel errors in MPEG-4 compressed video streams at different source coding rates and channel bit error rates. This model takes into account important aspects of video compression such as transform coding, motion compensation, and variable length coding. Results show that our model estimates distortion within 1.5 dB of actual simulation values in terms of peak-signal-to-noise ratio.      

Pilot Symbol Based Fixed Bipartite Graph Rate Adaptable Codes for Distributed Video Coding

The Distributed Video Coding with correlated side information for Quarter Common Interface Format (QCIF) was considered for the implementation presented in this paper. The size of the QCIF video was used to develop the Short length progressive Edge Growth codes. A novel pilot symbol based rate compatible code with same Bipartite graph for all rates is proposed. The pilot symbol algorithm makes the computation of the punctured nodes deterministic and one time process. The insertion of pilot symbols converts the parallel virtual channel to a uniform channel, thereby improves the decoding performance. The proposed solution reduces the complexity of the encoder by 25 % and decoder by a factor of 20–40 %. The performance analysis is also done for non-uniform sources as most of the practical data falls into non-uniform distribution.     

基于Markov信源和LDPC编码的信源信道联合译码算法

本文通过利用Markov信源的冗余信息,提出了一种基于系统LDPC码编码器的信源信道联合译码算法（JSCD）。仿真结果显示,当信源中存在更多的冗余信息时,该JSCD算法可相应取得更好的系统性能。     

LP Decoding for Joint Source-Channel Codes and for the Non-Ergodic Polya Channel

Linear programming (LP) decoding of low-density parity-check codes over discrete memoryless symmetric channels was introduced by Feldman et al. in [1]. Here, we extend the LP decoding paradigm by applying it to two additional scenarios: joint source-channel (JSC) coding and decoding over the infinitememory non-ergodic binary Polya-contagion channel. Simulation results indicate that the JSC LP decoder yields significant gains over the standard LP decoder for non-uniform sources. Simulations also show that the LP decoder for the Polya channel performs moderately well in relation to the ϵ-capacity limit.     

分布式视频编码在容错视频传输中的应用

经典视频压缩码流的低抗错性、传统抗误码工具的"悬崖"效应以及分布式信源编码的高稳健性,决定了基于分布式视频编码(DVC)的视频压缩码流易错信道的抗误码传输机制与关键技术具有良好的应用前景.基于此,分析了分布式视频编码的容错传输原理,并对其中关键技术的最新进展进行了综述,最后给出了结论和今后的研究方向.     

Distributed Monoview and Multiview Video Coding

Growing percentage of the world population now uses image and video coding technologies on a regular basis. These technologies are behind the success and quick deployment of services and products such as digital pictures, digital television, DVDs, and Internet video communications. Today's digital video coding paradigm represented by the ITU-T and MPEG standards mainly relies on a hybrid of block- based transform and interframe predictive coding approaches. In this coding framework, the encoder architecture has the task to exploit both the temporal and spatial redundancies present in the video sequence, which is a rather complex exercise. As a consequence, all standard video encoders have a much higher computational complexity than the decoder (typically five to ten times more complex), mainly due to the temporal correlation exploitation tools, notably the motion estimation process. This type of architecture is well-suited for applications where the video is encoded once and decoded many times, i.e., one-to-many topologies, such as broadcasting or video-on-demand, where the cost of the decoder is more critical than the cost of the encoder.     

分布式视频编码技术研究

建立在Slepian-Wolf和Wyner-Ziv编码理论基础上的分布式视频编码是一种全新的编码框架。与传统视频编码方案相比,其突出的特点决定它可为未来无线视频信号编码与传输提供具有极大竞争力的解决方案。首先详细介绍了分布式视频编码的理论基础和特点,然后讨论了分布式视频编码的关键技术,最后给出了今后的研究方向。     

一种基于DCT域的分布式视频编码

在简单介绍空域Wyner-Ziv分布式视频编码的基础上,给出了一种编码复杂度较低的基于交换域分布式视频编码方法.仿真结果表明此算法的编码性能优于空域Wyner-Ziv编码算法.