Combined Source-Channel Coding of Images

A combined source-channel coding approach is described for the encoding, transmission and remote reconstruction of image data. The source encoder employs two-dimensional (2-D) differential pulse code modulation (DPCM). This is a relatively efficient encoding scheme in the absence of channel errors. In the presence of channel errors, however, the performance degrades rapidly. By providing error control protection to those encoded bits which contribute most significantly to image reconstruction, it is possible to minimize this degradation without sacrificing transmission bandwidth. The result is a relatively robust design which is reasonably insensitive to channel errors and yet provides performance approaching the rate-distortion bound. Analytical results are provided for assumed 2-D autoregressive image models while simulation results are described for real-world images.     

An Efficient Greedy Scheduler for Zero-Forcing Dirty-Paper Coding

In this paper, an efficient greedy scheduler for zero-forcing dirty-paper coding (ZF-DPC), which can be incorporated in complex Householder QR factorization of the channel matrix, is proposed. The ratio of the complexity of the proposed scheduler to the complexity of the channel matrix factorization required by ZF-DPC is O(M^-1), while such ratio for the original greedy scheduler is O(M), where M is the number of transmitters. Therefore, the new scheduler reduces the overhead of scheduling from being the bottleneck of ZF-DPC to being negligible.     

Opportunistic Relay Selection in Cooperative Systems With Dirty-Paper Coding

This paper investigates an optimization of the conventional relay selection for multirelay environments. In contrast with previously reported selection schemes, where a selected relay accesses the channel in a dedicated cooperative slot, the proposed scheme recovers the bandwidth loss of the half-duplex constraint by allowing two relays to simultaneously access the channels. Based on an appropriate dirty-paper coding (DPC) technique among relays, the proposed scheme enables a relay to establish communication with the destination at the same time that another relay forwards the data from the source. It is proven that the interplay between relay selection and the superposition DPC weight factor provides a tradeoff between relaying and new data performance. Hence, an appropriate codesign of the superposition DPC parameter and opportunistic relay selection can achieve efficient communication for the new data without affecting the relaying performance. The proposed scheme is compared with conventional relaying approaches, and its enhancements are provided through theoretical studies and numerical results.      

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.      

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

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

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

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

An Efficient Variable-Length Code Construction for Iterative Source-Channel Decoding

We present a novel variable-length code (VLC) construction which exhibits an inherent error correcting capability due to the exclusive presence of codewords with even Hamming weight. Besides error robustness, the proposed code construction features a similar codeword length distribution as Golomb-Rice codes, and therefore, in particular for sources with exponentially distributed symbols, has good source compression properties at the same time. We show that in a source channel coding framework with outer source encoding, inner channel encoding with a recursive convolutional code, and iterative decoding the proposed VLC construction can lead to significant performance improvements compared to fixed-length source encoding with optimized mappings. In particular, simulation results for the AWGN channel verify that for Gauss-Markov sources a performance close to the theoretical limit can be achieved.     

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.     

Joint Wyner–Ziv/Dirty-Paper Coding by Modulo-Lattice Modulation

The combination of source coding with decoder side information (the Wyner-Ziv problem) and channel coding with encoder side information (the Gel'fand-Pinsker problem) can be optimally solved using the separation principle. In this work, we show an alternative scheme for the quadratic-Gaussian case, which merges source and channel coding. This scheme achieves the optimal performance by applying a modulo-lattice modulation to the analog source. Thus, it saves the complexity of quantization and channel decoding, and remains with the task of ldquoshapingrdquo only. Furthermore, for high signal-to-noise ratio (SNR), the scheme approaches the optimal performance using an SNR-independent encoder, thus it proves for this special case the feasibility of universal joint source-channel coding.     

Distributed Joint Source-Channel Coding of Video Using Raptor Codes

Extending recent works on distributed source coding, this paper considers distributed source-channel coding and targets at the important application of scalable video transmission over wireless networks. The idea is to use a single channel code for both video compression (via Slepian-Wolf coding) and packet loss protection. First, we provide a theoretical code design framework for distributed joint source-channel coding over erasure channels and then apply it to the targeted video application. The resulting video coder is based on a cross-layer design where video compression and protection are performed jointly. We choose Raptor codes - the best approximation to a digital fountain - and address in detail both encoder and decoder designs. Using the received packets together with a correlated video available at the decoder as side information, we devise a new iterative soft-decision decoder for joint Raptor decoding. Simulation results show that, compared to one separate design using Slepian-Wolf compression plus erasure protection and another based on FGS coding plus erasure protection, the proposed joint design provides better video quality at the same number of transmitted packets. Our work represents the first in capitalizing the latest in distributed source coding and near-capacity channel coding for robust video transmission over erasure channels.     

Hybrid Digital-Analog Coding with Bandwidth Compression for Gaussian Source-Channel Pairs

Three hybrid digital-analog (HDA) systems, denoted by HDA-I, HDA* and HDA-II, for the coding of a memoryless discrete-time Gaussian source over a discrete-time additive memoryless Gaussian channel under bandwidth compression are studied. The systems employ simple linear coding in their analog component and superimpose their analog and digital signals before channel transmission. Information-theoretic upper bounds on the asymptotically optimal mean squared error distortion of the systems are obtained under both matched and mismatched channel conditions. Allocation schemes for distributing the channel input power between the analog and the digital signals are also examined. It is shown that systems HDA* and HDA-II can asymptotically achieve the optimal Shannon-limit performance under matched channel conditions. Low-complexity and low-delay versions of systems HDA-I and HDA-II are next designed and implemented without the use of error correcting codes. The parameters of these HDA systems, which employ vector quantization in conjunction with binary phase-shift keying modulation in their digital part, are optimized via an iterative algorithm similar to the design algorithm for channel-optimized vector quantizers. Both systems have low complexity and low delay, and guarantee graceful performance improvements for high CSNRs. For memoryless Gaussian sources the designed HDA-II system is shown to be superior to the HDA-I designed system. When applied to a Gauss-Markov source under Karhunen-Loeve processing, the HDA-I system is shown to provide considerably better performance.     

基于算术编码的异构双核SoC代码压缩方法

介绍了一种基于二进制算术编码和马尔可夫模型的代码压缩算法,并以此为基础,面向自主研发的异构双核SoC—GEM-SOC,提出了一种软件实现的解码方法。该方法可以根据不同应用的代码特点,选择合适的马尔可夫模型参数,从而达到最佳的代码压缩率。一组媒体应用测试表明,该方法可以显著减小双核SoC中DSP处理器的代码尺寸。     

信道最优的变换编码--联合信源信道编码的一种新方法

简要介绍Shannon分离理论的优缺点，并由此引入对联合信源信道编码的介绍，重点对联合信源信道编码方法中的信道最优的变换编码方法进行了论述，同时也对信道最优的变换编码的设计及其性能进行了介绍。     

一种低码率音频压缩编码的窗切换方法

当前主流音频压缩技术都采用窗切换技术来抑制预回声现象。然而编码器切换到短窗虽然提高了对暂态信号的时间分辨率,但同时却降低了低频平稳信号的频率分辨率。对此提出在短窗时采用一种非均匀时频变换方法来取代短窗时频变换,它对信号的低频平稳分量具有很高的频率分辨率,同时对高频暂态分量也有足够的时间分辨率。最后用实验验证了该方法的可行性和有效性。     

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.     

一种新的分形图像压缩编码方法

本文提出了一种将双线性内插与基于迭代函数系统的分形图像编码相结合的图像编码新方法。实验结果表明，与基本的自动分形图像编码方法相比，在基本保持重建图像质量的前提下，运算时间大大下降而压缩比有显著的提高。     

一种采用模型基辅助的混合视频编码方法

本文提出一种帧内采用波形编码，帧间采用模型基编码的混合视频压缩系统，增强了模型基编码的适用性，改进了CANDIDE头部模型，使之易于匹配，提高了压缩编码的效率，采用仿射率法取代了蒙皮法，克服了遮挡问题，提高了合成图象的主观质量和运算速度。     

A Network Coding Approach to Cooperative Diversity

This paper proposes a network coding approach to cooperative diversity featuring the algebraic superposition of channel codes over a finite field. The scenario under consideration is one in which two ldquopartnersrdquo - node A and node B - cooperate in transmitting information to a single destination; each partner transmits both locally generated information and relayed information that originated at the other partner. A key observation is that node B already knows node A's relayed information (because it originated at node B) and can exploit that knowledge when decoding node A's local information. This leads to an encoding scheme in which each partner transmits the algebraic superposition of its local and relayed information, and the superimposed codeword is interpreted differently at the two receivers i.e., at the other partner and at the destination node, based on their different a priori knowledge. Decoding at the destination is then carried out by iterating between the codewords from the two partners. It is shown via simulation that the proposed scheme provides substantial coding gain over other cooperative diversity techniques, including those based on time multiplexing and signal (Euclidean space) superposition.     

Rate 3/4 Convolutional Coding of 16-PSK: Code Design and Performance Study

Convolutional coding coupled with 16-PSK modulation is investigated for bandwidth efficient transmission. Rate 3/4, small memory codes are found which are optimized in the free-distance sense on the Gaussian channel. These codes provide up to 4.8 dB of coding gain with 32 states over uncoded 8-PSK, a scheme having the same spectral efficiency as the codes described. The performance is compared with earlier findings of Ungerboeck and some recent results onR = 2/3coded 8-PSK. In addition, we present results of a channel transmission study to assess the performance of the four-state code on the band-limited nonlinear channel, and find that performance of the coded scheme degrades comparably with uncoded 8-PSK, i.e., coding gain is roughly preserved.