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

source and channel coding for Correlated sources Over Multiuser channels

IEEE TRANSACTIONS ON INFORMATION THEORY 2009年第9期55卷 3927-3944页

作者： Gunduz, Deniz Erkip, Elza Goldsmith, Andrea Poor, H. Vincent Princeton Univ Dept Elect Engn Princeton NJ 08544 USA Stanford Univ Dept Elect Engn Stanford CA 94305 USA NYU Polytech Inst Dept Elect & Comp Engn Brooklyn NY 11201 USA

source and channel coding over multiuser channels in which receivers have access to correlated source side information are considered. For several multiuser channel models necessary and sufficient conditions for optimal separation of the source and channel codes are obtained. In particular, the multiple-access channel, the compound multiple-access channel, the interference channel, and the two-way channel with correlated sources and correlated receiver side information are considered, and the optimality of separation is shown to hold for certain source and side information structures. Interestingly, the optimal separate source and channel codes identified for these models are not necessarily the optimal codes for the underlying source coding or the channel coding problems. In other words, while separation of the source and channel codes is optimal, the nature of these optimal codes is impacted by the joint design criterion.

关键词： Network information theory separation theorem source and channel coding

来源：评论

学校读者我要写书评

暂无评论

Delay-Limited source and channel coding of Quasi-Stationary sources over Block Fading channels: Design and Scaling Laws

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2013年第4期61卷 1562-1572页

作者： Joda, Roghayeh Lahouti, Farshad Univ Tehran Coll Engn Ctr Wireless Multimedia Commun Ctr Excellence Appl Elect SystSch Elect & Comp E Tehran 14395515 Iran

In this paper, delay-limited transmission of quasi-stationary sources over block fading channels is considered. Considering distortion outage probability as the performance measure, two source and channel coding schemes with power adaptive transmission are presented. The first one is optimized for fixed rate transmission, and hence enjoys simplicity of implementation. The second one is a high performance scheme, which also benefits from optimized rate adaptation with respect to source and channel states. In high SNR regime, the performance scaling laws in terms of outage distortion exponent and asymptotic outage distortion gain are derived, where two schemes with fixed transmission power and adaptive or optimized fixed rates are considered as benchmarks for comparisons. Various analytical and numerical results are provided which demonstrate a superior performance for source and channel optimized rate and power adaptive scheme. It is also observed that from a distortion outage perspective, the fixed rate adaptive power scheme substantially outperforms an adaptive rate fixed power scheme for delay-limited transmission of quasi-stationary sources over wireless block fading channels. The effect of the characteristics of the quasi-stationary source on performance, and the implication of the results for transmission of stationary sources are also investigated.

关键词： Outage capacity quasi-stationary source outage distortion source and channel coding rate and power adaptation

来源：评论

学校读者我要写书评

暂无评论

JET: Joint source and channel coding for error resilient virtual reality video wireless transmission

引用

SIGNAL PROCESSING 2018年 147卷 154-162页

作者： Liu, Zhi Ishihara, Susumu Cui, Ying Ji, Yusheng Tanaka, Yoshiaki Shizuoka Univ 3-5-1 Johoku Hamamatsu Shizuoka 4328561 Japan Shanghai Jiao Tong Univ 800 Dongchuan Rd Minhang Qu 200240 Peoples R China Natl Inst Informat Chiyoda Ku 2-1-2 Hitotsubashi Tokyo 1018430 Japan Waseda Univ Shinjuku Ku 3-4-1 Okubo Tokyo 1698555 Japan

Virtual reality (VR) provides users extraordinary viewing experience and draws more and more attentions from both industry and academia. In this paper, we propose JET: Joint source and channel coding for Error resilient virtual reality video wireless Transmission, where we jointly investigate how to conquer the problem of source video's huge size, how to efficiently satisfy a user's view switch request and how to handle packet loss. Specifically, we first divide a VR video into smaller video tiles. Upon a user's view switch request, the tiles corresponding to the part that the user is requesting, referred to as the field of view (FoV), and the part that the user may switch to before new video can be received, are delivered over a wireless network. We consider unequal error protection (UEP) for FoV and the rest part and formulate the inherent error resilient VR video transmission problem into a joint source and channel coding problem. In particular, we optimize the tile partition, quantization parameter and Forward Error Correction (FEC) packet allocation to maximize a user's received video quality. We also propose a low-complexity heuristic algorithm to solve this optimization problem. Extensive simulations are conducted and simulation results verify the superior performance. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Virtual reality VR 360 video source and channel coding Video streaming Error resilient

来源：评论

学校读者我要写书评

暂无评论

Joint source and channel coding using turbo codes over rings

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1998年第8期46卷 981-984页

作者： Ruscitto, A Biglieri, EM Politecn Torino Dipartimento Elettr I-10129 Turin Italy

Turbo codes are a practical solution for achieving large coding gains. In this letter we present a new turbo coding scheme where the component codes are convolutional codes (CC's) over the ring of integers module M, with M being the alphabet size of the source encoder. The a priori knowledge of the source statistics is used during the iterative decoding procedure for improved decoder performance. As an example of application, we examine differential pulse code modulation (DPCM)-encoded image transmission.

关键词： image coding source and channel coding turbo codes

来源：评论

学校读者我要写书评

暂无评论

Layered cooperative source and channel coding

Layered cooperative source and channel coding

引用

IEEE International Conference on Communications (ICC 2005)

作者： Xu, XF Gunduz, D Erkip, E Wang, Y Polytech Univ Dept Elect & Comp Engn Brooklyn NY 11201 USA

ISBN: (纸本)0780389387

Cooperative techniques form a new wireless communication paradigm in which terminals help each other in relaying information to combat the random fading and to provide diversity in radio channels. Past work has focused on improving channel reliability through cooperation. We propose to jointly allocate bits among source coding, channel coding and cooperation to minimize the expected source distortion. Recognizing that not all source bits are equal, we further propose to protect the more important bits through user cooperation. To evaluate the gain of layered cooperation, we simulate four modes of communications that differ in their error protection strategy (equal vs. layered, with vs. without cooperation) with a practical channel coder, and show that, for i.i.d. Gaussian sources, layered cooperation can achieve significant performance gains over non-layered/non-cooperative communication. We also carry out an information theoretic analysis illustrating fundamental benefits of layered cooperation.

关键词： cooperative diversity unequal error protection layered compression source and channel coding

来源：评论

学校读者我要写书评

暂无评论

Progressive source coding for a power constrained Gaussian channel

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2001年第8期49卷 1301-1306页

作者： Fossorier, MPC Xiong, ZX Zeger, K Univ Hawaii Dept Elect Engn Honolulu HI 96822 USA Texas A&M Univ Dept Elect Engn College Stn TX 77843 USA Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA

We consider the progressive transmission of a lossy source across a power constrained Gaussian channel using binary phase-shift keying modulation. Under the theoretical assumptions of infinite bandwidth, arbitrarily complex channel coding, and lossless transmission, we derive the optimal channel code rate and the optimal energy allocation per transmitted bit. Under the practical assumptions of a low complexity class of algebraic channel codes and progressive image coding, we numerically optimize the choice of channel code rate and the energy, per bit allocation. This model provides an additional degree of freedom with respect to previously proposed schemes, and can achieve a higher performance for sources such as images. It also allows one to control bandwidth expansion or reduction.

关键词： image compression source and channel coding

来源：评论

学校读者我要写书评

暂无评论

Asymptotically dense spherical codes .1. Wrapped spherical codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1997年第6期43卷 1774-1785页

作者： Hamkins, J Zeger, K UNIV CALIF SAN DIEGO DEPT ELECT & COMP ENGN LA JOLLA CA 92093 USA

A new class of spherical codes called wrapped spherical codes is constructed by ''wrapping'' any sphere packing Lambda in Euclidean space onto a finite subset of the unit sphere in one higher dimension. The mapping preserves much of the structure of Lambda, and unlike previously proposed maps, the density of wrapped spherical codes approaches the density of Lambda as the minimum distance approaches zero. We show that this implies that the asymptotically maximum spherical coding density is achieved by wrapped spherical codes whenever Lambda is the densest possible sphere packing.

关键词： asymptotic density laminated lattices packing source and channel coding spherical codes

来源：评论

学校读者我要写书评

暂无评论

Asymptotically dense spherical codes .2. Laminated spherical codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1997年第6期43卷 1786-1798页

作者： Hamkins, J Zeger, K UNIV CALIF SAN DIEGO DEPT ELECT & COMP ENGNLA JOLLACA 92093

New spherical codes called laminated spherical codes are constructed in dimensions 2-49 using a technique similar to the construction of laminated lattices. Each spherical code is recursively constructed from existing spherical codes in one lower dimension. Laminated spherical codes outperform the best known spherical codes in the minimum distance sense for many code sizes. The density of a laminated spherical code approaches the density of the laminated lattice in one lower dimension, as the minimum distance approaches zero. In particular, the three-dimensional laminated spherical code is asymptotically optimal, in the sense that its density approaches the Fejes Toth upper bound as the minimum distance approaches zero. Laminated spherical codes perform asymptotically as well as wrapped spherical codes in those dimensions where laminated lattices are optimal sphere packings.

关键词： asymptotic density laminated lattices packing source and channel coding spherical codes

来源：评论

学校读者我要写书评

暂无评论

Performance of quantizers on noisy channels using structured families of codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2000年第7期46卷 2468-2476页

作者： Méhes, A Zeger, K Royal Inst Technol Stockholm Sweden Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA

Achievable distortion bounds are derived for the cascade of structured families of binary linear channel codes and binary lattice vector quantizers. it is known that for the cascade of asymptotically good channel codes and asymptotically good vector quantizers the end-to-end distortion decays to zero exponentially fast as a function of the overall transmission rate, and is achieved by choosing a channel code rate that is independent of the overall transmission rate. We show that for certain families of practical channel codes and binary lattice vector quantizers, the overall distortion can be made to decay to zero exponentially fast as a function of the square root of transmission rate. This is achieved by carefully choosing a channel code rate that decays to zero as the transmission rate grows. Explicit channel code rate schedules are obtained for several well-known families of channel codes.

关键词： data compression lattice vector quantization linear error-correcting codes source and channel coding

来源：评论

学校读者我要写书评

暂无评论

Binary lattice vector quantization with linear block codes and affine index assignments

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1998年第1期44卷 79-94页

作者： Mehes, A Zeger, K Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA

We determine analytic expressions for the performance of some low-complexity combined source-channel coding systems, The main tool used is the Hadamard transform, In particular, we obtain formulas for the average distortion of binary lattice vector quantization with affine index assignments, linear block channel coding, and a binary-symmetric channel, The distortion formulas are specialized to nonredundant channel codes for a binary-symmetric channel, and then extended to affine index assignments on a binary-asymmetric channel, Various structured index assignments are compared. Our analytic formulas provide a computationally efficient method for determining the performance of various coding schemes, One interesting result shown is that for a uniform source and uniform quantizer, the Natural Binary Code is never optimal for a nonsymmetric channel, even though it is known to be optimal for a symmetric channel.

关键词： index assignment lattices linear error-correcting codes source and channel coding vector quantization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：