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

On causal source codes with side information

IEEE TRANSACTIONS ON INFORMATION THEORY 2005年第11期51卷 4003-4013页

作者： Weissman, T Merhav, N Stanford Univ Dept Elect Engn Informat Syst Lab Stanford CA 94305 USA Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

We study the effect of the introduction of side information into the causal source coding setting of Neuhoff and Gilbert. We find that the spirit of their result, namely, the sufficiency of time-sharing scalar quantizers (followed by appropriate lossless coding) for attaining optimum performance within the family of causal source codes, extends to many scenarios involving availability of side information (at both encoder and decoder, or only on one side). For example, in the case where side information is available at both encoder and decoder, we find that time-sharing side-information-dependent scalar quantizers (at most two for each side-information symbol) attains optimum performance. This remains true even when the reproduction sequence is allowed noncausal dependence on the side information and even for the case where the source and the side information, rather than consisting of independent and identically distributed (i.i.d.) pairs, form, respectively, the output of a memoryless channel and its stationary ergodic input.

关键词： causal source codes entropy coding lossy source coding scalar quantization side information slepian-wolf source coding

来源：评论

学校读者我要写书评

暂无评论

Low-density parity-check matrices for coding of correlated sources

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2005年第10期51卷 3645-3654页

作者： Muramatsu, J Uyematsu, T Wadayama, T NTT Corp NTT Commun Sci Labs Kyoto 6190237 Japan Tokyo Inst Technol Meguro Ku Tokyo 1528552 Japan Nagoya Inst Technol Showa Ku Nagoya Aichi 4668555 Japan

Linear codes for a coding problem of correlated sources are considered. It is proved that we can construct codes by using low-density parity-check (LDPC) matrices with maximum-likelihood (or typical set) decoding. As applications of the above coding problem, a construction of codes is presented for multiple-access channel with correlated additive noises and a coding theorem of parity-check codes for general channels is proved.

关键词： linear codes low-density parity-check (LDPC) matrix multiterminal source coding multiterminal channel coding multiple-access channel with correlated additive noise slepian-wolf source coding

来源：评论

学校读者我要写书评

暂无评论

Optimal Rate Allocation for Distributed source coding over Gaussian Multiple Access Channels

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2013年第5期12卷 2002-2013页

作者： Wang, Tianqi Seyedi, Alireza Vosoughi, Azadeh Heinzelman, Wendi Qualcomm Atheros QCA Algorithm & Dev Dept San Jose CA USA Univ Cent Florida Dept Elect Engn & Comp Sci Orlando FL 32816 USA Univ Rochester Dept Elect & Comp Engn Rochester NY 14627 USA

We study the problem of joint optimization of slepian-wolf (SW) source coding and transmission rates over a Gaussian multiple access channel with the considerations of circuit power consumption and average transmit power constraint. The goal is to maximize the sample rate at the source nodes. We first derive a criterion to determine the optimality of different multiple access schemes such that the highest sample rate can be achieved at the source nodes when SW coding is used. Based on the derived optimality criterion, we propose a rate allocation procedure to determine the jointly optimal SW coding and transmission rates corresponding to orthogonal code division multiple access (CDMA), frequency division multiple access (FDMA), time division multiple access (TDMA) and superposition coding with successive interference cancellation (SCSIC) schemes. Several demonstrative numerical examples are provided to show the performance gain of the proposed joint rate allocation scheme.

关键词： Distributed source coding slepian-wolf source coding Gaussian multiple access channel optimal rate allocation CDMA Orthogonal CDMA superposition coding successive interference cancelation FDMA TDMA

来源：评论

学校读者我要写书评

暂无评论

Self-Corrected Belief-Propagation Decoder for source coding With Unknown source Statistics

引用

IEEE COMMUNICATIONS LETTERS 2021年第7期25卷 2133-2137页

作者： Dupraz, Elsa Yaoumi, Mohamed Univ Bretagne Loire UBL Lab STICC IMT Atlantique F-29238 Brest France

This letter describes a practical slepian-wolf source coding scheme based on Low Density Parity Check (LDPC) codes. It considers the realistic setup where the parameters of the statistical model between the source and the side information are unknown. A novel Self-Corrected Belief-Propagation (SC-BP) algorithm is proposed in order to make the coding scheme robust to incorrect model parameters by introducing some memory inside the LDPC decoder. A Two Dimensional Density Evolution (2D-DE) analysis is then developed to predict the theoretical performance of the SC-BP decoder. Both the 2D-DE analysis and Monte-Carlo simulations confirm the robustness of the SC-BP decoder. The proposed solution allows for an important complexity reduction and shows a performance very close to existing methods which jointly estimate the model parameters and the source sequence.

关键词： Decoding Parity check codes source coding Probability distribution Standards Robustness Signal to noise ratio slepian-wolf source coding LDPC codes density evolution

来源：评论

学校读者我要写书评

暂无评论

Lossless coding of Correlated sources With Actions

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2017年第2期63卷 1237-1252页

作者： Sabag, Oron Permuter, Haim H. Cohen, Asaf Ben Gurion Univ Negev Dept Elect & Comp Engn IL-8410501 Beer Sheva Israel Ben Gurion Univ Negev Dept Commun Syst Engn IL-8410501 Beer Sheva Israel

This paper studies the problem of the distributed compression of correlated sources with an action-dependent joint distribution. This class of problems is, in fact, an extension of the slepian-wolf model, but where cost-constrained actions taken by the encoder or the decoder affect the generation of one of the sources. The purpose of this paper is to study the impact of actions on the achievable rates. In particular, two cases where transmission occurs over a rate-limited link are studied;case A for actions taken at the decoder and case B where actions are taken at the encoder. A complete single-letter characterization of the set of achievable rates is given in both cases. Furthermore, a network coding setup for the case where actions are taken at the encoder is investigated. The sources are generated at different nodes of the network and are required at a set of terminal nodes, yet transmission occurs over a general, acyclic, directed network. For this setup, generalized cut-set bounds are derived, and a full characterization of the set of achievable rates using single-letter expressions is provided. For this scenario, random linear network coding is proved to be optimal, even though this is not a classical multicast problem. In addition, two binary examples are investigated and demonstrate how actions taken at different nodes of the system have a significant effect on the achievable rate region, when compared with a naive time-sharing strategy.

关键词： Actions correlated sources distributed compression network coding random linear network coding slepian-wolf source coding

来源：评论

学校读者我要写书评

暂无评论

The Finite Field Multi-Way Relay Channel with Correlated sources: The Three-User Case

The Finite Field Multi-Way Relay Channel with Correlated Sou...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Ong, Lawrence Timo, Roy Lechner, Gottfried Johnson, Sarah J. Kellett, Christopher M. Univ Newcastle Sch Elect Engn & Comp Sci Callaghan NSW 2308 Australia Univ South Australia Inst Telecommun Res Melbourne Vic Australia

ISBN: (纸本)9781457705953

The three-user finite field multi-way relay channel with correlated sources is considered. The three users generate possibly correlated messages, and each user is to transmit its message to the two other users reliably in the Shannon sense. As there is no direct link among the users, communication is carried out via a relay, and the link from the users to the relay and those from the relay to the users are finite field adder channels with additive noise of arbitrary distribution. The problem is to determine the set of all possible achievable rates, defined as channel uses per source symbol for reliable communication. For two classes of source/channel combinations, the solution is obtained using slepian-wolf source coding combined with functional-decode-forward channel coding.

关键词： Channel coding Entropy Mutual information Optical wavelength conversion Relays Reliability Shannon sense slepian-wolf source coding source coding additive noise arbitrary distribution channel coding correlated source correlation theory decode and forward communication finite field adder channel functional-decode-forward channel coding information theory relays reliable communication source coding source-channel combination telecommunication network reliability three-user finite field multiway relay channel

来源：评论

学校读者我要写书评

暂无评论

Low-density parity-check matrices for coding of correlated sources

Low-density parity-check matrices for coding of correlated s...

引用

IEEE International Symposium on Information Theory

ISBN: (纸本)0780377281

来源：评论

学校读者我要写书评

暂无评论

Low density parity check matrices for coding of multiple access networks

Low density parity check matrices for coding of multiple acc...

引用

IEEE Information Theory Workshop

作者： Muramatsu, J Uyematsu, T Wadayama, T NTT Corp NTT Commun Sci Labs Kyoto 6190237 Japan

This paper considers linear matrices for a coding problem for multiple access networks. It is proved that we can construct codes by using sparse matrices, which are also called low density parity check (LDPC) matrices.

ISBN: (纸本)0780377990

关键词： linear codes low density parity check matrix multi-terminal source coding multi-terminal channel coding multiple access channel with correlated additive noise slepian-wolf source coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：