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

A Flexible Rate Slepian-Wolf Code Construction

IEEE TRANSACTIONS ON COMMUNICATIONS 2009年第8期57卷 2301-2308页

作者： Zamani, Mahdi Lahouti, Farshad Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada Univ Tehran Coll Engn Sch Elect & Comp EngnWireless Multimedia Commun Ctr Excellence Appl Electromagnet Syst Tehran Iran

A flexible rate Slepian-Wolf (SW) code is constructed, which is vital for wireless sensor network applications. The proposed solution is based on an efficient and practical algorithm to compute the syndrome of the rate-compatible convolutional codes (RCPC). Using this algorithm, there is no need to compute the syndrome of punctured version of the mother code for each puncturing matrix, which is complex. Instead, the syndrome of the punctured code is the punctured version of the syndrome of the mother code using the same pattern of puncturing. The algorithm is general for all convolutional codes in Z.. The strategy is also generalized for parallel and serial concatenated convolutional codes. For the cases, where the dependencies among sources are modeled as a virtual discrete channel, a simplified decoding scheme is suggested. This method is generalized to achieve all points on the SW boundary using a simple code design technique. Simulation results demonstrate the performance and effectiveness of the proposed methods.

关键词： Slepian-Wolf theorem distributed source coding syndrome turbo code concatenated convolutional code codes on ring

来源：评论

学校读者我要写书评

暂无评论

Interactive Encoding and Decoding for One Way Learning: Near Lossless Recovery With Side Information at the Decoder

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2010年第4期56卷 1808-1824页

作者： Yang, En-Hui He, Da-Ke Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA

A source coding paradigm called interactive encoding and decoding (IED) is considered for a source network where a finite alphabet source X is to be encoded, and another finite alphabet source Y correlated with is available only to the decoder as a helper. The optimal performance achievable asymptotically (OPAA) by IED is investigated, where the performance is measured as the average number of bits per symbol exchanged by the encoder and decoder until the decoder learns with high probability. First, it is shown that for any stationary (X, Y), the OPAA by IED is given by the conditional entropy rate H (X vertical bar Y) of X given Y. This is in contrast with noninteractive Slepian-Wolf (SW) coding, where the OPAA is shown in general to be strictly greater than H (X vertical bar Y) when (X, Y) is not ergodic. Second, for a memory-less source pair (X, Y), it is shown that IED approaches H (X vertical bar Y) faster than SW coding does. Finally, it is demonstrated that one can convert any classical universal data compression algorithm with side information to a universal IED algorithm for the class A of all stationary ergodic source pairs. In contrast, universal SW coding algorithms for the class A do not exist.

关键词： distributed source coding entropy interactive encoding and decoding source networks universal data compression

来源：评论

学校读者我要写书评

暂无评论

Codebook Cardinality Spectrum of distributed Arithmetic coding for Independent and Identically-distributed Binary sources

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2020年第10期66卷 6580-6596页

作者： Fang, Yong Stankovic, Vladimir Changan Univ Sch Informat Engn Xian 710064 Peoples R China Univ Strathclyde Dept Elect & Elect Engn Glasgow G1 1XW Lanark Scotland

It was demonstrated that, as a nonlinear implementation of Slepian-Wolf coding, distributed Arithmetic coding (DAC) outperforms traditional Low-Density Parity-Check (LPDC) codes for short code length and biased sources. This fact triggers research efforts into theoretical analysis of DAC. In our previous work, we proposed two analytical tools, Codebook Cardinality Spectrum (CCS) and Hamming Distance Spectrum, to analyze DAC for independent and identically-distributed (i.i.d.) binary sources with uniform distribution. This article extends our work on CCS from uniform i.i.d. binary sources to biased i.i.d. binary sources. We begin with the final CCS and then deduce each level of CCS backwards by recursion. The main finding of this article is that the final CCS of biased i.i.d. binary sources is not uniformly distributed over [0, 1). This article derives the final CCS of biased i.i.d. binary sources and proposes a numerical algorithm for calculating CCS effectively in practice. All theoretical analyses are well verified by experimental results.

关键词： Decoding Parity check codes Channel coding Correlation Complexity theory Estimation distributed source coding Slepian-Wolf coding distributed arithmetic coding codebook cardinality spectrum biased sources

来源：评论

学校读者我要写书评

暂无评论

distributed arithmetic coding with interval swapping

引用

SIGNAL PROCESSING 2015年 116卷 29-37页

作者： Zhou, Junwei Wong, Kwok-Wo Yang, Yanchao Wuhan Univ Technol Sch Comp Sci & Technol Wuhan Peoples R China City Univ Hong Kong Dept Elect Engn Hong Kong Hong Kong Peoples R China

In distributed source coding, ambiguity is usually introduced in the encoding process as it allows multiple plaintext sequences encoded to the same codeword. All these plaintext sequences are decodable and are considered as candidates at the decoder. With the help of side information, the decoder is able to determine which sequence in the candidate set is the best choice. Both the cardinality and the minimum Hamming distance of the candidate set are significant to the decoding performance. In this paper, a Slepian-Wolf code based on arithmetic coding is studied. By employing the interval swapping technique, a linear code is incorporated into binary arithmetic coding. The incorporated linear code improves the minimum Hamming distance within the candidate set which leads to a lower bit error probability. Moreover, binary arithmetic coding exploits the a priori knowledge of the source to reduce the cardinality of the candidate set. Simulation results show that this approach leads to superior performance for moderately skewed sources with linear encoding complexity, which meets the low power consumption requirement of applications such as wireless sensor networks and low-complexity multimedia compression. (C) 2015 Elsevier B.V. All rights reserved.

关键词： Data compression Correlated data distributed source coding Slepian-Wolf coding

来源：评论

学校读者我要写书评

暂无评论

An Index coding Approach to Caching With Uncoded Cache Placement

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2020年第3期66卷 1318-1332页

作者： Wan, Kai Tuninetti, Daniela Piantanida, Pablo Univ Paris Sud Cent Supelec French Natl Ctr Sci Res CNRS L2S F-91192 Gif Sur Yvette France Tech Univ Berlin Elect Engn & Comp Sci Dept D-10587 Berlin Germany Univ Illinois Dept Elect & Comp Engn Chicago IL 60607 USA Univ Paris Sud French Natl Ctr Sci Res CNRS F-91192 Gif Sur Yvette France Univ Montreal MILA Montreal PQ H3T 1N8 Canada

Caching is an efficient way to reduce network traffic congestion during peak hours, by storing some content at the user's local cache memory, even without knowledge of user's later demands. Maddah-Ali and Niesen proposed a two-phase (placement phase and delivery phase) coded caching strategy for broadcast channels with cache-aided users. This paper investigates the same model under the constraint that content is placed uncoded within the caches, that is, when bits of the files are simply copied within the caches. When the cache contents are uncoded and the users' demands are revealed, the caching problem can be connected to an index coding problem. This paper focuses on deriving fundamental performance limits for the caching problem by using tools for the index coding problem that were either known or are newly developed in this work. First, a converse bound for the caching problem under the constraint of uncoded cache placement is proposed based on the "acyclic index coding converse bound." This converse bound is proved to be achievable by the Maddah-Ali and Niesen's scheme when the number of files is not less than the number of users, and by a newly derived index coding achievable scheme otherwise. The proposed index coding achievable scheme is based on distributed source coding and strictly improves on the widely used "composite (index) coding" achievable bound and its improvements, and is of independent interest. An important consequence of the findings of this paper is that advancements on the coded caching problem posed by Maddah-Ali and Niesen are thus only possible by considering strategies with coded placement phase. A recent work by Yu et al has however shown that coded cache placement can at most half the network load compared to the results presented in this paper.

关键词： Coded caching uncoded cache placement index coding distributed source coding

来源：评论

学校读者我要写书评

暂无评论

Achievable rates for pattern recognition

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2008年第1期54卷 299-320页

作者： Westover, M. Brandon O'Sullivan, Joseph A. Massachusetts Gen Hosp Dept Neurol Boston MA 02114 USA Washington Univ Dept Elect Engn St Louis MO 63130 USA

Biological and machine pattern recognition systems face a common challenge: Given sensory data about an unknown pattern, classify the pattern by searching for the best match within a library of representations stored in memory. In many cases, the number of patterns to be discriminated and the richness of the raw data force recognition systems to internally represent memory and sensory information in a compressed format. However, these representations must preserve enough information to accommodate the variability and complexity of the environment, otherwise recognition will be unreliable. Thus, there is an intrinsic tradeoff between the amount of resources devoted to data representation and the complexity of the environment in which a recognition system may reliably operate. In this paper, we describe a mathematical model for pattern recognition systems subject to resource constraints, and show how the aforementioned resource-complexity tradeoff can be characterized in terms of three rates related to the number of bits available for representing memory and sensory data, and the number of patterns populating a given statistical environment. We prove single-letter information-theoretic bounds governing the achievable rates, and investigate in detail two illustrative cases where the pattern data is either binary or Gaussian.

关键词： distributed source coding multiterminal information theory pattern recognition

来源：评论

学校读者我要写书评

暂无评论

A Context-Aware CEO Problem

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2023年第12期71卷 6979-6992页

作者： Seo, Daewon Lim, Sung Hoon Kim, Yongjune Daegu Gyeongbuk Inst Sci & Technol DGIST Dept Elect Engn & Comp Sci Daegu 42988 South Korea Hallym Univ Sch Informat Sci Chunchon 24252 South Korea Pohang Univ Sci & Technol POSTECH Dept Elect Engn Pohang 37673 South Korea Yonsei Univ Inst Convergence Res & Educ Adv Technol Seoul 03722 South Korea

In many sensor network applications, a fusion center often has additional valuable information, such as context data, which cannot be obtained directly from the sensors. Motivated by this, we study a generalized CEO problem where a CEO has access to context information. The main contribution of this work is twofold. Firstly, we characterize the asymptotically optimal error exponent per rate as the number of sensors and sum rate grow without bound. The proof extends the Berger-Tung coding scheme and the converse argument by Berger et al. (1996) taking into account context information. The resulting expression includes the minimum Chernoff divergence over context information. Secondly, assuming that the sizes of the source and context alphabets are respectively |X | and |S|, we prove that it is asymptotically optimal to partition all sensors into at most (|X| 2) |S| groups and have the sensors in each group adopt the same encoding scheme. Our problem subsumes the original CEO problem by Berger et al. (1996) as a special case if there is only one letter for context information;in this case, our result tightens its required number of groups from (|X| 2) + 2 to (|X| 2). We also numerically demonstrate the effect of context information for a simple Gaussian scenario.

关键词： CEO problem side information distributed source coding error exponent

来源：评论

学校读者我要写书评

暂无评论

distributed video coding based on part intracoding and soft side information estimation

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2009年第2期41卷 183-195页

作者： Ding, Guiguang Tsinghua Univ Sch Software Minist Educ Tsinghua Natl Lab Informat Sci & TechnolKey Lab Beijing 100084 Peoples R China

Recently, distributed source coding (DSC) has been proposed to implement source compression by exploiting source statistics at the decoder only, which enables low-complexity video coding. However, to date, the video codecs based on DSC have been unable to compress as efficiently as traditional predictive video codecs, such as H.264. So, new techniques have to be investigated to improve the performance of the distributed video coding scheme for practical applications. In this paper, I propose a novel distributed video coding scheme based on part intracoding and soft side information estimation. Firstly, at the encoder side, to improve the compression performance of distributed video coding system, we divide the video data into strongly correlative data encoded by Slepian-Wolf codec and weakly correlative data encoded by Intracoding codec. Secondly, at the decoder side, to improve the accuracy of side information estimation, a soft side information estimation method is proposed, which is more suitable for video coding due to the non-stationary feature of video data. Our experimental results show that the performance of our coding system is better than that of the traditional distributed video coding system while keeping the simple encoding property. Also the concept of soft side information is a new idea in distributed video coding and will significantly influence the side information estimation method.

关键词： distributed source coding Video coding Side information Intracoding mode

来源：评论

学校读者我要写书评

暂无评论

distributed Lossless Compression Algorithm for Hyperspectral Images Based on Classification

引用

SPECTROSCOPY LETTERS 2015年第7期48卷 528-535页

作者： Huang, Bingchao Nian, Yongjian Wan, Jianwei Natl Univ Def Technol Coll Elect Sci & Engn Changsha 410073 Hunan Peoples R China

This article addresses the problem of distributed lossless compression for hyperspectral images and proposes an effective lossless compression algorithm based on classification. First, a band selection algorithm was performed on the hyperspectral images to select those bands with considerable information. Next, the K-means algorithm was performed on those selected bands to obtain the classification map. To make full use of the spectral and spatial correlation, a multilinear regression model was introduced to construct the high-quality side information of each class within the identical block according to the classification map. Subsequently, the (n, k) linear grouping codes were employed to perform the distributed source coding for each class separately. The experimental results showed that the proposed algorithm has a competitive lossless compression performance compared with other state-of-the-art algorithms.

关键词： band selection distributed source coding hyperspectral images lossless compression spectral classification

来源：评论

学校读者我要写书评

暂无评论

A Channel coding Approach for Human Authentication From Gait Sequences

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2009年第3期4卷 428-440页

作者： Argyropoulos, Savvas Tzovaras, Dimitrios Ioannidis, Dimosthenis Strintzis, Michael G. Aristotle Univ Thessaloniki Dept Elect & Comp Engn GR-54624 Thessaloniki Greece Ctr Res & Technol Hellas Informat & Telemat Inst GR-57001 Thermi Greece

Human authentication using biometric traits has become an increasingly important issue in a large range of applications. In this paper, a novel channel coding approach for biometric authentication based on distributed source coding principles is proposed. Biometric recognition is formulated as a channel coding problem with noisy side information at the decoder and error correcting codes are employed for user verification. It is shown that the effective exploitation of the noise channel distribution in the decoding process improves performance. Moreover, the proposed method increases the security of the stored biometric templates. As a case study, the proposed framework is employed for the development of a novel gait recognition system based on the extraction of depth data from human silhouettes and a set of discriminative features. Specifically, gait sequences are represented using the radial and the circular integration transforms and features based on weighted Krawtchouk moments. Analytical models are derived for the effective modeling of the correlation channel statistics based on these features and integrated in the soft decoding process of the channel decoder. The experimental results demonstrate the validity of the proposed method over state-of-the-art techniques for gait recognition.

关键词： Authentication biometrics channel coding distributed source coding gait recognition low-density parity check (LDPC) codes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：