检索结果-内蒙古大学图书馆

source-channel coding for Fading channels With Correlated Interference

IEEE TRANSACTIONS ON COMMUNICATIONS 2014年第11期62卷 3997-4011页

作者： Abou Saleh, Ahmad Chan, Wai-Yip Alajaji, Fady Queens Univ Dept Elect & Comp Engn Kingston ON K7L 3N6 Canada Queens Univ Dept Math & Stat Kingston ON K7L 3N6 Canada

We consider the problem of sending a Gaussian source over a fading channel with Gaussian interference known to the transmitter. We study joint source-channel coding schemes for the case of unequal bandwidth between the source and the channel and when the source and the interference are correlated. An outer bound on the system's distortion is first derived by assuming additional information at the decoder side. We then propose layered coding schemes based on proper combination of power splitting, bandwidth splitting, Wyner-Ziv and hybrid coding. More precisely, a hybrid layer, that uses the source and the interference, is concatenated (superimposed) with a purely digital layer to achieve bandwidth expansion (reduction). The achievable (square error) distortion region of these schemes under matched and mismatched noise levels is then analyzed. Numerical results show that the proposed schemes perform close to the best derived bound and to be resilient to channel noise mismatch. As an application of the proposed schemes, we derive both inner and outer bounds on the source-channel-state distortion region for the fading channel with correlated interference;the receiver, in this case, aims to jointly estimate both the source signal as well as the channel-state (interference).

关键词： joint source-channel coding distortion region correlated interference dirty paper coding hybrid digital-analog coding fading channels

来源：评论

学校读者我要写书评

暂无评论

Distributed source-channel coding Based on Real-Field BCH Codes

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2014年第5期62卷 1171-1184页

作者： Vaezi, Mojtaba Labeau, Fabrice McGill Univ Dept Elect & Comp Engn Montreal PQ H3A 0E9 Canada

We use real-number codes to compress statistically dependent sources and establish a new framework for distributed lossy source coding in which we compress sources before, rather than after, quantization. This change in the order of binning and quantization blocks makes it possible to model the correlation between continuous-valued sources more realistically and compensate for the quantization error partially. We then focus on the asymmetric case, i.e., lossy source coding with side information at the decoder. The encoding and decoding procedures are described in detail for a class of real-number codes called discrete Fourier transform (DFT) codes, both for the syndrome- and parity-based approaches. We leverage subspace-based decoding to improve the decoding and by extending it we are able to perform distributed source coding in a rate-adaptive fashion to further improve the decoding performance when the statistical dependency between sources is unknown. We also extend the parity-based approach to the case where the transmission channel is noisy and thus we perform distributed joint source-channel coding in this context. The proposed system is well suited for low-delay communications, as the mean-squared reconstruction error (MSE) is shown to be reasonably low for very short block length.

关键词： BCH-DFT codes distributed source coding joint source-channel coding parity real-number codes syndrome

来源：评论

学校读者我要写书评

暂无评论

Robust Packet Video Transport Over Wireless Fading channels Using a joint source-channel coding Approach

引用

WIRELESS PERSONAL COMMUNICATIONS 2009年第3期48卷 425-439页

作者： Pei, Yong Modestino, James W. Wright State Univ Dept Comp Sci & Engn Dayton OH 45435 USA Univ Miami Dept Elect & Comp Engn Coral Gables FL 33124 USA

In this paper, we address the problem of robust video transmission over wireless networks. Specifically, we consider packet video transmission over wireless IP networks based on the RTP/UDP/IP protocol stack. Digital video delivered over wireless networks is expected to suffer quality degradation from both packet loss and bit errors in the payload. In this paper, both packet loss and bit errors in the payload are considered and the performance of a joint source-channel coding (JSCC) approach employing forward error-correction (FEC) coding schemes for H.263 + video transmission is studied. Results indicate that with an appropriate JSCC approach, FEC-based error-control techniques can significantly improve the packetization efficiency for a given end-to-end quality requirement and lead to more acceptable video delivery quality over time-varying wireless networks. Another important observation is that with a JSCC approach the fading effects of wireless links upon end-to-end video quality are substantially decreased compared to a system without using channel coding, resulting in attractive robust performance characteristics.

关键词： Video transmission RTP UDP/IP Error-control coding RCPC codes joint source-channel coding Rician fading H.263+

来源：评论

学校读者我要写书评

暂无评论

Shannon-Kotel'nikov Mappings in joint source-channel coding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2009年第1期57卷 94-105页

作者： Hekland, Fredrik Floor, Pai Anders Ramstad, Tor A. ABB Corp Res Ctr NO-1375 Billingstad Norway Norwegian Univ Sci & Technol Dept Elect & Telecommun N-7034 Trondheim Norway

This paper deals with lossy joint source-channel coding for transmitting memoryless sources over AWGN channels. The scheme is based on the geometrical interpretation of communication by Kotel'nikov and Shannon where amplitude-continuous, time-discrete source samples are mapped directly onto the channel using curves or planes. The source and channel spaces can have different dimensions and thereby achieving either compression or error control, depending on whether the source bandwidth is smaller or larger than the channel bandwidth. We present a general theory for 1:N and M:1 dimension changing mappings, and provide two examples for a Gaussian source and channel where we optimize both a 2:1 bandwidth-reducing and a 1:2 bandwidth-expanding mapping. Both examples show high spectral efficiency and provide both graceful degradation and improvement for imperfect channel state information at the transmitter.

关键词： joint source-channel coding Shannon-Kotel'nikov mapping direct source-channel mapping bandwidth compression bandwidth expansion

来源：评论

学校读者我要写书评

暂无评论

On Robustness of Hybrid Digital Analog source-channel coding with Bandwidth Mismatch

On Robustness of Hybrid Digital Analog Source-Channel Coding...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Koeken, Erman Tuncel, Ertem Univ Calif Riverside Riverside CA 92521 USA

ISBN: (纸本)9781479951864

The problem of lossy transmission of a Gaussian source over an AWGN bandwidth-mismatched broadcast channel with three receivers is addressed. The tradeoff between the distortion levels at the good and the bad receivers is tackled when the distortion at the median receiver is required to be optimal. The problem was proposed by Tian and Shamai [8], who subsequently found in [9] remarkable achievability results for bandwidth expansion ratios k which are integers or unit fractions, i.e., k = 2, 1/3, 1/5, etc. Their result is extended here to all k >= 2 and k <= 1/2 by generalizing the hybrid digital/analog (HDA) scheme of [10] to the case of bandwidth mismatch. Finally, novel schemes are proposed for 1/2 <= k < 1 and 1 < k <= 2 achieving nontrivial tradeoffs.

关键词： Bandwidth mismatch hybrid digital/analog coding joint source-channel coding robustness

来源：评论

学校读者我要写书评

暂无评论

On the Condition of ε-Transmissible joint source-channel coding for General sources and General channels

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2009年第11期E92A卷 2936-2940页

作者： Nomura, Ryo Matsushima, Toshiyasu Hirasawa, Shigeichi Aoyama Gakuin Univ Coll Sci & Engn Sagamihara Kanagawa 2298558 Japan Waseda Univ Sch Fundamental Sci & Engn Tokyo 1698555 Japan Waseda Univ Sch Creat Sci & Engn Tokyo 1698555 Japan

The joint source-channel coding problem is considered. The joint source-channel coding theorem reveals the existence of a code for the pair of the source and the channel under the condition that the error probability is smaller than or equal to epsilon asymptotically. The separation theorem guarantees that we can achieve the optimal coding performance by using the two-stage coding. In the case that epsilon = 0, Han showed the joint source-channel coding theorem and the separation theorem for general sources and channels. Furthermore the epsilon-coding theorem (0 <= epsilon < 1) in the similar setting was studied. However, the separation theorem was not revealed since it is difficult in general. So we consider the separation theorem in this setting.

关键词： joint source-channel coding separation theorem error probability

来源：评论

学校读者我要写书评

暂无评论

Sending a Laplacian source Using Hybrid Digital-Analog Codes

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2014年第7期62卷 2544-2557页

作者： Abbasi, Fariba Aghagolzadeh, Ali Behroozi, Hamid Univ Tabriz Fac Elect & Comp Engn Tabriz 51664 Iran Babol Univ Technol Fac Elect & Comp Engn Babol Sar *** Iran Sharif Univ Technol Dept Elect Engn Tehran 113659363 Iran

In this paper, we study transmission of a memoryless Laplacian source over three types of channels: additive white Laplacian noise (AWLN), additive white Gaussian noise (AWGN), and slow flat-fading Rayleigh channels under both bandwidth compression and bandwidth expansion. For this purpose, we analyze two well-known hybrid digital-analog (HDA) joint source-channel coding schemes for bandwidth compression and one for bandwidth expansion. Then we obtain achievable (absolute- error) distortion regions of the HDA schemes for the matched signal-to-noise ratio (SNR) case as well as the mismatched SNR scenario. Using numerical examples, it is shown that these schemes can achieve a distortion very close to the provided lower bound (for the AWLNchannel) and to the optimum performance theoretically attainable bound (for AWGN and Rayleigh fading channels) on mean-absolute error distortion under matched SNR conditions. In addition, a non-linear analog coding scheme is analyzed, and its performance is compared to the HDA schemes for bandwidth compression under both matched and mismatched SNR scenarios. The results show that the HDA schemes outperform the non-linear analog coding over the whole CSNR region.

关键词： Additive white Laplacian noise (AWLN) channel bandwidth compression/expansion hybrid digital-analog (HDA) codes joint source-channel coding non-linear analog coding

来源：评论

学校读者我要写书评

暂无评论

Computation Over Gaussian Networks With Orthogonal Components

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第12期60卷 7841-7861页

作者： Jeon, Sang-Woon Wang, Chien-Yi Gastpar, Michael Andong Natl Univ Dept Informat & Commun Engn Andong 760749 South Korea Ecole Polytech Fed Lausanne Sch Comp & Commun Sci CH-1015 Lausanne Switzerland Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

Function computation over Gaussian networks with orthogonal components is studied for arbitrarily correlated discrete memoryless sources. Two classes of functions are considered: 1) the arithmetic sum function and 2) the type function. The arithmetic sum function in this paper is defined as a set of multiple weighted arithmetic sums, which includes averaging of the sources and estimating each of the sources as special cases. The type or frequency histogram function counts the number of occurrences of each argument, which yields various fundamental statistics, such as mean, variance, maximum, minimum, median, and so on. The proposed computation coding first abstracts Gaussian networks into the corresponding modulo sum multiple-access channels via nested lattice codes and linear network coding and then computes the desired function using linear Slepian-Wolf source coding. For orthogonal Gaussian networks (with no broadcast and multiple-access components), the computation capacity is characterized for a class of networks. For Gaussian networks with multiple-access components (but no broadcast), an approximate computation capacity is characterized for a class of networks.

关键词： Distributed averaging function computation joint source-channel coding lattice codes linear source coding network coding sensor networks

来源：评论

学校读者我要写书评

暂无评论

A Derivation of the source-channel Error Exponent Using Nonidentical Product Distributions

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第6期60卷 3209-3217页

作者： Tauste Campo, Adria Vazquez-Vilar, Gonzalo Guillen i Fabregas, Albert Koch, Tobias Martinez, Alfonso Univ Pompeu Fabra Dept Informat & Commun Technol Barcelona 08018 Spain Univ Pompeu Fabra Dept Informat & Commun Technol Inst Catalana Recerca & Estudis Avancats Barcelona 08018 Spain Univ Cambridge Dept Engn Cambridge CB2 1PZ England Univ Carlos III Madrid Signal Theory & Commun Dept Leganes 28911 Spain

This paper studies the random-coding exponent of joint source-channel coding for a scheme where source messages are assigned to disjoint subsets (referred to as classes), and codewords are independently generated according to a distribution that depends on the class index of the source message. For discrete memoryless systems, two optimally chosen classes and product distributions are found to be sufficient to attain the sphere-packing exponent in those cases where it is tight.

关键词： joint source-channel coding reliability function random coding product distributions sphere-packing bound

来源：评论

学校读者我要写书评

暂无评论

Zero-Delay Sequential Transmission of Markov sources Over Burst Erasure channels

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第8期60卷 4584-4613页

作者： Etezadi, Farrokh Khisti, Ashish Trott, Mitchell Univ Toronto Toronto ON M5S 1A1 Canada HP Labs Palo Alto CA 94304 USA

A setup involving zero-delay sequential transmission of a vector Markov source over a burst erasure channel is studied. A sequence of source vectors is compressed in a causal fashion at the encoder, and the resulting output is transmitted over a burst erasure channel. The destination is required to reconstruct each source vector with zero-delay, but those source sequences that are observed either during the burst erasure, or in the interval of length W following the burst erasure need not be reconstructed. The minimum achievable compression rate is called the rate-recovery function. We assume that each source vector is independent identically distributed (i.i.d.) across the spatial dimension and is sampled from a stationary, first-order Markov process across the temporal dimension. For discrete sources, the case of lossless recovery is considered, and upper and lower bounds on the rate-recovery function are established. Both these bounds can be expressed as the rate for predictive coding, plus a term that decreases at least inversely with the recovery window length W. For Gauss-Markov sources and a quadratic distortion measure, upper and lower bounds on the minimum rate are established when W = 0. These bounds are shown to coincide in the high resolution limit. Finally, another setup involving i.i.d. Gaussian sources is studied and the rate-recovery function is completely characterized in this case.

关键词： joint source-channel coding distributed source coding Gauss-Markov sources Kalman filter burst erasure channels multi-terminal information theory rate-distortion theory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：