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

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

来源：评论

学校读者我要写书评

暂无评论

Optimizing distributed source coding for Interactive Multiview Video Streaming over Lossy Networks

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2013年第10期23卷 1781-1794页

作者： Liu, Zhi Cheung, Gene Ji, Yusheng Grad Univ Adv Studies Natl Inst Informat Chiyoda Ku Tokyo 1018430 Japan

In interactive multiview video streaming (IMVS), a user observes one view at a time, but can periodically switch to a desired neighboring captured view as the video is played back in time. Previous IMVS works focus on efficient compression techniques that facilitate interactive view switching. In this paper, in addition to the loss-resilient aspect during network streaming we address how to design efficient coding tools and optimize frame structure for transmission to facilitate view switching and contain error propagation in differentially coded video due to packet losses. We first design a new unified distributed source coding (uDSC) frame-a new coding tool that simultaneously offers view switching and loss-resilient capabilities-for periodic insertion into the multiview frame structure. After inserting uDSC-frames into the coding structure, we schedule packets for network transmission in a rate-distortion optimal manner for both wireless multicast and wired unicast streaming scenarios. For wireless multicast over a Gilbert-Elliott loss model, frames in a group of pictures are packetized and reordered, so that uDSC frames are correctly decoded with high probability, mitigating error propagation. For wired unicast, we use a Markov decision process to optimize packet transmission to minimize expected distortion given a bandwidth constraint. Experimental results show that systems that insert uDSC frames and optimize packet transmission can outperform other competing coding schemes by up to 2.8 and 11.6 dB in wireless multicast and wired unicast streaming scenarios, respectively.

关键词： distributed source coding interactive multiview video streaming Markov decision process

来源：评论

学校读者我要写书评

暂无评论

Functional Duality Between distributed source coding with One Distortion Criterion and Semi-Deterministic Broadcast Channel coding in the Case of Correlated Messages

引用

IEEE COMMUNICATIONS LETTERS 2013年第6期17卷 1236-1239页

作者： Choi, Suhan Yun, Ji-Hoon Choi, Kae Won Seoul Natl Univ Sci & Technol SeoulTech Dept Elect & Informat Eng Seoul South Korea Seoul Natl Univ Sci & Technol SeoulTech Dept Comp Sci & Engn Seoul South Korea

In this letter, functional duality between distributed source coding with One Distortion Criterion (DSC-ODC) and correlated messages and Semi-Deterministic Broadcast Channel coding (SD-BCC) with correlated messages is considered. It is shown that under certain conditions, for a given DSC-ODC problem with correlated messages, a functional dual SD-BCC problem with correlated messages can be obtained, and vice versa. In particular, the correlation structure of the messages in the two dual problems are the same. The source distortion measure and the channel cost measure for this duality are also specified.

关键词： Functional duality distributed source coding semi-deterministic broadcast channel coding correlated messages

来源：评论

学校读者我要写书评

暂无评论

A Novel Rate-Adaptive distributed source coding Scheme Using Polar Codes

引用

IEEE COMMUNICATIONS LETTERS 2013年第1期17卷 143-146页

作者： Lv, Xiaoqian Liu, Rongke Wang, Runxin Beihang Univ Sch Elect & Informat Engn Beijing 100191 Peoples R China

In this paper, we propose a rate-adaptive distributed source coding (DSC) scheme for two correlated sources using polar codes. We change the rule of selecting new frozen bits when the decoder requests more information. In our scheme, new frozen bits are chosen according to successive cancellation (SC) decoding instead of Bhattacharyya parameter. On receipt of a new frozen bit, SC decoding will continue from the new bit rather than restart from the first one. The novel scheme eliminates the recalculation of the previously decoded bits while reaching a competitive compression rates compared with alternatives. Furthermore, we derive a method for computing the average compression rates of the schemes in this paper, which match with the simulation results properly. Analysis shows that our novel scheme can reduce the decoding complexity significantly.

关键词： distributed source coding polar codes rate-adaptive feedback channel

来源：评论

学校读者我要写书评

暂无评论

No Advantage of Non-Local Cooperation in distributed Compression of Classical sources

No Advantage of Non-Local Cooperation in Distributed Compres...

引用

2024 Information Theory Workshop

作者： Park, Hyun-Young Nam, Seung-Hyun Lee, Si-Hyeon Korea Adv Inst Sci & Technol KAIST Sch Elect Engn Daejeon South Korea

ISBN: (纸本)9798350348941;9798350348934

In this paper, we show that there is no advantage of using non-local cooperation between source encoders in improving the optimal compression rate (or rate region) for some canonical distributed compression tasks. The tasks are the lossless distributed compression, the lossless compression with a helper, and some special cases of the lossy distributed compression for 2-component discrete memoryless sources. These negative results for distributed source coding contrast with those for multi-user channel coding: quantum or general no-signaling cooperation between channel encoders improves the capacity region for some multiple access and interference channels.

关键词： distributed compression distributed source coding non-locality no-signaling quantum entanglement

来源：评论

学校读者我要写书评

暂无评论

Genomic Compression With Read Alignment at the Decoder

IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY

引用

IEEE JOURNAL ON SELECTED AREAS IN INFORMATION THEORY 2023年 4卷 314-330页

作者： Gershon, Yotam Cassuto, Yuval Technion Israel Inst Technol Dept Elect & Comp Engn IL-3200003 Haifa Israel

We propose a new compression scheme for genomic data given as sequence fragments called reads. The scheme uses a reference genome at the decoder side only, freeing the encoder from the burdens of storing references and performing computationally costly alignment operations. The main ingredient of the scheme is a multi-layer code construction, delivering to the decoder sufficient information to align the reads, correct their differences from the reference, validate their reconstruction, and correct reconstruction errors. The core of the method is the well-known concept of distributed source coding with decoder side information, fortified by a generalized-concatenation code construction enabling efficient embedding of all the information needed for reliable reconstruction. We first present the scheme for the case of substitution errors only between the reads and the reference, and then extend it to support reads with a single deletion and multiple substitutions. A central tool in this extension is a new distance metric that is shown analytically to improve alignment performance over existing distance metrics.

关键词： distributed source coding generalized concatenation coset coding genomic sequencing data alignment

来源：评论

学校读者我要写书评

暂无评论

distributed Compression in the Era of Machine Learning: A Review of Recent Advances 58

Distributed Compression in the Era of Machine Learning: A Re...

引用

58th Annual Conference on Information Sciences and Systems (CISS)

作者： Ozyilkan, Ezgi Erkip, Elza NYU Dept Elect & Comp Engn Brooklyn NY 11201 USA

ISBN: (纸本)9798350369298;9798350369304

Many applications from camera arrays to sensor networks require efficient compression and processing of correlated data, which in general is collected in a distributed fashion. While information-theoretic foundations of distributed compression are well investigated, the impact of theory in practice-oriented applications to this day has been somewhat limited. As the field of data compression is undergoing a transformation with the emergence of learning-based techniques, machine learning is becoming an important tool to reap the long-promised benefits of distributed compression. In this paper, we review the recent contributions in the broad area of learned distributed compression techniques for abstract sources and images. In particular, we discuss approaches that provide interpretable results operating close to information-theoretic bounds. We also highlight unresolved research challenges, aiming to inspire fresh interest and advancements in the field of learned distributed compression.

关键词： distributed source coding Wyner-Ziv coding lossy compression binning neural networks rate-distortion theory learning

来源：评论

学校读者我要写书评

暂无评论

Practical coding Schemes based on LDPC Codes for distributed Parametric Regression

Practical Coding Schemes based on LDPC Codes for Distributed...

引用

2024 Information Theory Workshop

作者： Wei, Jiahui Dupraz, Elsa Mary, Philippe IMT Atlantique CNRS UMR 6285 Lab STICC Brest France Univ Rennes UMR CNRS INSA IETR Rennes France

ISBN: (纸本)9798350348941;9798350348934

In the framework of goal-oriented communications, this paper investigates parametric regression over coded data. For this problem, information-theoretic bounds are provided in terms of rate versus regression generalization error, by considering quantize and binning achievability schemes. Alternatively, this paper focuses on practical implementations by proposing a coding scheme that combines a scalar quantizer with a non-binary LDPC code for the binning part. Given that the LDPC decoder requires prior knowledge of the regression parameters, the paper introduces a novel method to estimate these parameters directly over the LDPC-coded syndrome, without the need for prior decoding. This technique allows to both address the regression task and initialize the LDPC decoder for further data reconstruction. Monte-Carlo simulations show the efficiency of the proposed approach in terms of regression generalization error.

关键词： distributed source coding goal-oriented communications parametric regression non-binary LDPC codes

来源：评论

学校读者我要写书评

暂无评论

ADAE: ADVERSARIAL distributed source AUTOENCODER FOR POINT CLOUD COMPRESSION

ADAE: ADVERSARIAL DISTRIBUTED SOURCE AUTOENCODER FOR POINT C...

引用

IEEE International Conference on Image Processing (ICIP)

作者： Milani, Simone Univ Padova Dept Informat Engn Padua Italy

ISBN: (纸本)9781665441155

The current paper presents an adversarial autoencoding strategy for voxelized point cloud geometry based on the principles of distributed source coding. The encoder characterizes the input voxel blocks with an array of hash bytes while the decoder combines them with side information blocks in order to reconstruct the original data. The reconstruction process is optimized by classifying the reconstructed block with an adversarial discriminator in order to make the recovered data as close as possible to an original block. Experimental results show that the proposed solution generalizes well while obtaining better coding performance with respect to other state-of-the-art solutions and allowing high flexibility in rate shaping and decoding operations.

关键词： point cloud compression adversarial autoencoder distributed source coding decoding loss

来源：评论

学校读者我要写书评

暂无评论

Landmarking for Navigational Streaming of Stored High-Dimensional Media

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2022年第8期32卷 5663-5679页

作者： Yuan, Yuan Cheung, Gene Frossard, Pascal Zhao, H. Vicky Huang, Jiwu Guangdong Polytech Normal Univ Sch Comp Sci Guangzhou 510665 Peoples R China York Univ Dept EECS Toronto ON M3J 1P3 Canada Ecole Polytech Fed Lausanne EPFL Signal Proc Lab LTS4 CH-1015 Lausanne Switzerland Tsinghua Univ Dept Automat Beijing 100084 Peoples R China Shenzhen Univ Guangdong Key Lab Intelligent Informat Proc Shenzhen 518060 Peoples R China Shenzhen Univ Shenzhen Key Lab Media Secur Shenzhen 518060 Peoples R China Shenzhen Inst Artificial Intelligence & Robot Soc Shenzhen 518172 Peoples R China

Modern media data such as 360 degrees videos and light field (LF) images are typically captured in much higher dimensions than the observers' visual displays. To efficiently browse high-dimensional media, a navigational streaming model is considered: a client navigates the media space by dictating a navigation path to a server, who in response transmits the corresponding pre-encoded media data units (MDU) to the client one-by-one in sequence. Assuming that the MDU quality is pre-chosen and fixed, the problem resides in selecting and storing redundant representations of MDUs at the server in order to best trade off storage and transmission costs, while enabling adequate user's random access. We address this problem with a landmark-based MDU optimization framework. The media space is divided into neighborhoods, each containing one landmark (a chosen MDU). MDUs in a neighborhood use the associated landmark as a predictor for inter-coding. Thus, for any MDU transition within the same neighborhood, only one inter-coded MDU transmission is required when the landmark resides in the decoder buffer. It results in lower transmission cost and enables navigational random access. To optimize an MDU structure, we employ tree-structured vector quantizer (TSVQ) to first optimize landmark locations, then iteratively add P-MDUs as refinements using a fast branch-and-bound technique. Taking interactive LF images and viewport adaptive 360 degrees images as illustrative applications, and I-, P- and previously proposed merge frames to intra- and inter-code MDUs, we show experimentally that landmarked MDU structures can noticeably reduce the expected transmission cost compared with MDU structures without landmarks.

关键词： Navigation Media Costs Servers Streaming media Encoding Videos Navigational streaming media compression distributed source coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：