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

joint source-channel coding with Correlated Interference

IEEE TRANSACTIONS ON COMMUNICATIONS 2012年第5期60卷 1315-1327页

作者： Huang, Yu-Chih Narayanan, Krishna R. Texas A&M Univ Dept Elect & Comp Engn College Stn TX 77843 USA

We study the joint source-channel coding problem of transmitting a discrete-time analog source over an additive white Gaussian noise (AWGN) channel with interference known at transmitter. We consider the case when the source and the interference are correlated. We first derive an outer bound on the achievable distortion and then, we propose two joint source-channel coding schemes. The first scheme is the superposition of the uncoded signal and a digital part which is the concatenation of a Wyner-Ziv encoder and a dirty paper encoder. In the second scheme, the digital part is replaced by the hybrid digital and analog scheme proposed by Wilson et al. When the channel signal-to-noise ratio (SNR) is perfectly known at the transmitter, both proposed schemes are shown to provide identical performance which is substantially better than that of existing schemes. In the presence of an SNR mismatch, both proposed schemes are shown to be capable of graceful enhancement and graceful degradation. Interestingly, unlike the case when the source and interference are independent, neither of the two schemes outperforms the other universally. As an application of the proposed schemes, we provide both inner and outer bounds on the distortion region for the generalized cognitive radio channel.

关键词： Distortion region joint source-channel coding cognitive radios

来源：评论

学校读者我要写书评

暂无评论

joint source-channel coding of a Gaussian mixture source over the Gaussian broadcast channel

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2002年第3期48卷 776-781页

作者： Reznic, Z Zamir, R Feder, M Tel Aviv Univ Dept Elect Engn Syst IL-69978 Tel Aviv Israel Texas Instruments Inc Cable Broadband Commun Libit IL-46766 Herzliyya Israel

Suppose that we want to send a description of a single source to two listeners through a Gaussian broadcast channel, where the channel is used once per source sample. The problem of joint source-channel coding is to design a communication system to minimize the distortion D-1 at receiver 1 and at the same time minimize the distortion D-2 at receiver 2. If the source is Gaussian, the optimal solution is well known, and it is achieved by an uncoded "analog" scheme. In this correspondence, we consider a Gaussian mixture source. We derive inner and outer bounds for the distortion region of all (D-1, D-2) pairs that are simultaneously achievable. The outer bound is based on the entropy power inequality, while the inner bound is attained by a digital-over-analog encoding scheme, which we present here. We also show that if the modes of the Gaussian mixture are highly separated, our bounds are tight, and hence, our scheme attains the entire distortion region. This optimal region exceeds the region attained by separating source and channel coding, although it does not contain the "ideal" point (D-1, D-2) = (R-1(C-1), R-1(C-2)).

关键词： digital-over-analog scheme distortion region joint source-channel coding separation principle

来源：评论

学校读者我要写书评

暂无评论

joint source-channel coding for Broadcasting Correlated sources

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2017年第7期65卷 3012-3022页

作者： Koken, Erman Tuncel, Ertem Univ Calif Riverside Dept Elect & Comp Engn Riverside CA 92521 USA

This paper studies lossy transmission of a memoryless bivariate Gaussian source over a bandwidthmismatched memoryless Gaussian broadcast channel with two receivers, where each receiver is interested in reconstructing only one source component. For both bandwidth expansion and compression regimes, novel hybrid digital/analog (HDA) coding schemes are proposed. With appropriate choice of parameters, our schemes are shown to specialize to separate source-channel coding studied by Gao and Tuncel, and is, therefore, superior to it in both bandwidth regimes. Our scheme for bandwidth expansion also outperforms the HDA coding scheme of Behroozi et al. On the other hand, if a proposed conjecture (supported by numerical observations) is indeed true, the same superiority follows for the bandwidth compression regime as well. Finally, when the bandwidth expansion/compression ratio approaches 1, both of our schemes become optimal as their performance approaches that of the bandwidth-matched scheme of Tian et al.

关键词： Bandwidth expansion/compression broadcast channels correlated sources hybrid digital/analog coding joint source-channel coding

来源：评论

学校读者我要写书评

暂无评论

joint source-channel coding of JPEG 2000 Image Transmission Over Two-Way Multi-Relay Networks

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2017年第7期26卷 3594-3608页

作者： Bi, Chongyuan Liang, Jie Simon Fraser Univ Sch Engn Sci Burnaby BC V5A 1S6 Canada

In this paper, we develop a two-way multi-relay scheme for JPEG 2000 image transmission. We adopt a modified time-division broadcast 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 for each JPEG 2000 codeblock that can minimize the reconstructed image distortion for the two users, subject to a rate constraint. Two fast algorithms based on dynamic programming and branch and bound are then developed. Simulation demonstrates that the proposed JSCC scheme achieves better performance and lower complexity than other similar transmission systems.

关键词： joint source-channel coding two-way multi-relay system relay selection power allocation JPEG 2000

来源：评论

学校读者我要写书评

暂无评论

joint source-channel coding for Transmitting Correlated sources Over Broadcast Networks

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2009年第8期55卷 3864-3868页

作者： Coleman, Todd P. Martinian, Emin Ordentlich, Erik Univ Illinois Coordinated Sci Lab Urbana IL 61801 USA Bain Capital Boston MA 02199 USA Hewlett Packard Labs Palo Alto CA 94304 USA

We consider a set of S independent encoders that must transmit a set of correlated sources through a network of noisy, independent, broadcast channels to T receivers, with no interference at the receivers. For the general problem of sending correlated sources through broadcast networks, it is known that the source-channel separation theorem breaks down and the achievable rate region as well as the proper method of coding are unknown. For our scenario, however, we establish the optimal rate region using a form of joint source-channel coding. When the optimal channel input distribution from transmitter i to receiver j is independent of j, our result has a max-flow/min-cut interpretation. Specifically, in this case, our result implies that if it is possible to send the sources to each receiver separately while ignoring the others, then it is possible to send to all receivers simultaneously.

关键词： joint source-channel coding network information theory separation theorem

来源：评论

学校读者我要写书评

暂无评论

joint source-channel coding and Unequal Error Protection for Video Plus Depth

引用

IEEE SIGNAL PROCESSING LETTERS 2015年第1期22卷 31-34页

作者： Vosoughi, Arash Cosman, Pamela C. Milstein, Laurence B. Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA

We consider the joint source-channel coding (JSCC) problem of 3-D stereo video transmission in video plus depth format over noisy channels. Full resolution and downsampled depth maps are considered. The proposed JSCC scheme yields the optimum color and depth quantization parameters as well as the optimum forward error correction code rates used for unequal error protection (UEP) at the packet level. Different coding scenarios are compared and the UEP gain over equal error protection is quantified for flat Rayleigh fading channels.

关键词： 3-D video joint source-channel coding unequal error protection video plus depth

来源：评论

学校读者我要写书评

暂无评论

joint source-channel coding and channelization for Embedded Video Processing With Flash Memory Storage

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2012年第8期60卷 4403-4414页

作者： Li, Yiran Dong, Guiqiang Zhang, Tong Rensselaer Polytech Inst Dept Elect Comp & Syst Engn Troy NY 12180 USA

This paper presents a joint source coding, channel coding, and flash memory channelization design framework to obtain optimized tradeoffs among energy consumption, bit rate, and end-to-end distortion (i.e., optimal E-R-D tradeoff space) for embedded and mobile devices with limited power source and abundant flash memory storage capacity. The optimal E-R-D tradeoff space enables embedded and mobile devices to cohesively optimize the source coding and data storage system operations subject to run-time power source, storage capacity, and/or distortion constraints. By treating flash memory as a communication channel, this work differs from classical joint source-channel coding from two perspectives: i) Classical joint source-channel coding aims to obtain an optimized R-D (bit rate and distortion) tradeoff space, while we aim to obtain an optimized E-R-D tradeoff space;ii) Flash memory can be configured (or channelized) over an energy consumption versus raw bit error rate tradeoff spectrum, and channelization is an integral part of the joint design. With the focus on video coding, this paper presents theoretical investigations and specific approaches for both scenarios where channel can and cannot contribute to end-to-end distortion. Based on detailed power estimation and representative video sequences, we quantitatively demonstrate the application of the proposed design approaches for obtaining optimized E-R-D tradeoff space.

关键词： Energy consumption H.264/AVC joint source-channel coding NAND flash memory video coding

来源：评论

学校读者我要写书评

暂无评论

joint source-channel coding for Image Super-Resolution Tasks in Semantic Communications

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2024年第12期73卷 19034-19039页

作者： Huang, Zhen Jia, Yunjian Zhang, Yulu Liu, Xinyue Shen, Huicong Wen, Wanli Chongqing Univ Sch Microelect & Commun Engn Chongqing 400044 Peoples R China

Image super-resolution (SR) technology is crucial for applications such as telemedicine. Performing image SR tasks using semantic communication allows the received information to be directly applied without the need for complex operations at the receiver. However, research still grapples with the challenges of constructing a joint source-channel coding (JSCC) method that effectively extracts semantic information from LR images for reconstructing HR images, as well as reducing the unfavorable impact of the wireless channel. In this paper, we propose a deep semantic information extraction (DSIE) module for the image SR task in semantic communications. This module ingeniously integrates the advantages of convolutional neural network (CNN) and Transformer architectures and incorporates signal-to-noise ratio (SNR) to dynamically adjust the output via the channel attention mechanism. Building on DSIE, we custom-design the JSCC scheme for image SR tasks in semantic communications. Simulation results confirm the effectiveness of our proposed DSIE and show that the proposed JSCC scheme surpasses the existing DNN-based JSCC schemes and the traditional separated-source channel coding schemes.

关键词： Semantics Wireless communication Task analysis Receivers Transmitters Decoding Image reconstruction Semantic communications joint source-channel coding image super-resolution deep neural network

来源：评论

学校读者我要写书评

暂无评论

joint source-channel coding and guessing with application to sequential decoding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1998年第5期44卷 1756-1769页

作者： Arikan, E Merhav, N Bilkent Univ Dept Elect & Elect Engn TR-06533 Ankara Turkey Hewlett Packard Labs Palo Alto CA USA

We extend our earlier work on guessing subject to distortion to the joint source-channel coding contest. We consider a system in which there is a source connected to a destination via a channel and the goal is to reconstruct the source output at the destination within a prescribed distortion level with respect to (w.r.t) some distortion measure. The decoder is a guessing decoder in the sense that it is allowed to generate successive estimates of the source output until the distortion criterion is met, The problem is to design the encoder and the decoder so as to minimize the average number of estimates until successful reconstruction. We derive estimates on nonnegative moments of the number of guesses, which are asymptotically tight as the length of the source block: goes to infinity. Using the close relationship between guessing and sequential decoding, we give a tight lower bound to the complexity of sequential decoding in joint source-channel coding systems, complementing earlier works by Koshelev and Hellman. Another topic explored here is the probability of error for list decoders with exponential list sizes for joint source-channel coding systems, for which we obtain tight bounds as well. It is noteworthy that optimal performance w.r.t. the performance measures considered here can be achieved in a manner that separates source coding and channel coding.

关键词： guessing joint source-channel coding list decoding rate distortion sequential decoding

来源：评论

学校读者我要写书评

暂无评论

joint source-channel coding for Deep-Space Image Transmission using Rateless Codes

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2013年第8期61卷 3448-3461页

作者： Bursalioglu, O. Y. Caire, G. Divsalar, D. Docomo Innovat Inc Area Wireless Commun MIMO Tech & LTE A Enhancemen Palo Alto CA USA Univ So Calif Ming Hsieh Dept Elect Engn Viterbi Sch Engn Los Angeles CA USA CALTECH Jet Prop Lab Pasadena CA USA

A new coding scheme for image transmission over noisy channel is proposed. Similar to standard image compression, the scheme includes a linear transform followed by successive refinement scalar quantization. Unlike conventional schemes, though, in the proposed system the quantized transform coefficients are linearly mapped into channel symbols using systematic linear encoders. This fixed-to-fixed length "linear index coding" approach avoids the use of an explicit entropy coding stage (e.g., arithmetic or Huffman coding), which is typically fragile to channel post-decoding residual errors. We use linear codes over GF(4), which are particularly suited for this application, since they are matched to the dead-zone quantizer symbol alphabet and to the QPSK modulation used on the deep-space communication channel. We optimize the proposed system where the linear codes are systematic Raptor codes over GF(4). The rateless property of Raptor encoders allows to implement a "continuum" of coding rates, in order to accurately match the channel coding rate to the transmission channel capacity and to the quantized source entropy rate for each transform subband and refinement level. Comparisons are provided with respect to the concatenation of state-of-the-art image coding and channel coding schemes used by Jet Propulsion Laboratories (JPL) for the Mars Exploration Rover (MER) Mission.

关键词： joint source-channel coding deep-space communications image coding raptor codes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：