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

distributed source coding via Linear Block Codes: A General Framework for Multiple sources

IEEE TRANSACTIONS ON COMMUNICATIONS 2012年第11期60卷 3483-3490页

作者： Cao, Xiaomin Kuijper, Margreta China Mobile Guangzhou Guangdong Peoples R China Univ Melbourne Dept Elect & Elect Engn Parkville Vic 3010 Australia

In this paper, we propose a general framework for distributed source coding (DSC) of multiple sequentially correlated information sources. In particular, we modularize the joint decoding function into a conceptually simple structure by utilizing a notion of "complementarity" on the code space. Assuming a constrained Hamming-distance based correlation, our general framework of DSC achieves arbitrary non-asymmetric-rate compression of multiple sources with a same overall compression rate as asymmetric compression schemes. This DSC framework does not only have flexibility with respect to compression rates, but also accommodates the use of any linear block code and any of its corresponding complements. By investigating the unique connection between syndromes and complementary codewords, we translate the major steps of DSC joint decoding into syndrome decoding followed by channel encoding via a linear block code and also via its complement code. Our aim is to achieve transparency which facilitates practical implementation.

关键词： Complementary code zero-error Slepian-Wolf coding distributed source coding multiple sources non-asymmetric rate

来源：评论

学校读者我要写书评

暂无评论

distributed source coding of Correlated Gaussian Remote sources

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2012年第8期58卷 5059-5085页

作者： Oohama, Yasutada Univ Electrocommun Dept Commun Engn & Informat Tokyo 1828585 Japan

We consider the distributed source coding system for correlated memoryless Gaussian remote sources specified with correlated Gaussian random variables X-i, i = 1, 2, ..., L. We deal with the case where each of distributed encoders cannot directly observe the source X-i but its noisy version Y-i = X-i + N-i. Here, N-i, i = 1, 2, ..., L are independent additive Gaussian noises also independent of X-i, i = 1, 2, ..., L. On this coding system, the determination problem of the rate distortion region remains open in general. In this paper, we derive explicit outer and inner bounds of the rate distortion region. We further find an explicit sufficient condition for those two bounds to match. We also study the sum rate part of the rate distortion region when the correlation has some symmetrical property. We derive an explicit upper bound of the sum rate part from the inner bounds of the rate distortion region. On a lower bound, we derive a new explicit bound by making full use of the symmetrical property of the correlation. We further derive an explicit necessary and sufficient condition for the lower bound to coincide with the upper bound.

关键词： distributed source coding Gaussian remote sources inner and outer bounds matching condition rate-distortion region

来源：评论

学校读者我要写书评

暂无评论

distributed source coding using chaos-based cryptosystem

引用

COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION 2012年第12期17卷 5110-5116页

作者： Zhou, Junwei Wong, Kwok-Wo Chen, Jianyong City Univ Hong Kong Dept Elect Engn Hong Kong Hong Kong Peoples R China Shenzhen Univ Dept Comp Applicat Technol Shenzhen 518060 Peoples R China

A distributed source coding scheme is proposed by incorporating a chaos-based cryptosystem in the Slepian-Wolf coding. The punctured codeword generated by the chaos-based cryptosystem results in ambiguity at the decoder side. This ambiguity can be removed by the maximum a posteriori decoding with the help of side information. In this way, encryption and source coding are performed simultaneously. This leads to a simple encoder structure with low implementation complexity. Simulation results show that the encoder complexity is lower than that of existing distributed source coding schemes. Moreover, at small block size, the proposed scheme has a performance comparable to existing distributed source coding schemes. (C) 2012 Elsevier B.V. All rights reserved.

关键词： Chaos Encryption distributed source coding Slepian-Wolf coding

来源：评论

学校读者我要写书评

暂无评论

distributed source coding for Real-Time ECG Signal Monitoring

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2014年第8期E97D卷 2157-2165页

作者： Wu, Hung-Tsai Tsai, Wei-Ying Chang, Wen-Whei Natl Chiao Tung Univ Inst Commun Engn Hsinchu Taiwan Garmin Corp Dept Engn Taipei Taiwan

Wireless patient monitoring is an active research area with the goal of ubiquitous health care services. This study presents a novel means of exploiting the distributed source coding (DSC) in low-complexity compression of ECG signals. We first convert the ECG data compression to an equivalent channel coding problem and exploit a linear channel code for the DSC construction. Performance is further enhanced by the use of a correlation channel that more precisely characterizes the statistical dependencies of ECG signals. Also proposed is a modified BCJR algorithm which performs symbol decoding of binary convolutional codes to better exploit the source's a priori information. Finally, a complete setup system for online ambulatory ECG monitoring via mobile cellular networks is presented. Experiments on the MIT-BIH arrhythmia database and real-time acquired ECG signals demonstrate that the proposed system outperforms other schemes in terms of encoder complexity and coding efficiency.

关键词： wireless patient monitoring distributed source coding EGG data compression mobile cellular networks

来源：评论

学校读者我要写书评

暂无评论

distributed source coding in the presence of Byzantine sensors

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2008年第6期54卷 2550-2565页

作者： Kosut, Oliver Tong, Lang Cornell Univ Sch Elect & Comp Engn Ithaca NY 14853 USA

The distributed source coding problem is considered when the sensors, or encoders, are under Byzantine attack;that is, an unknown group of sensors have been reprogrammed by a malicious intruder to undermine the reconstruction at the fusion center. Three different forms of the problem are considered. The first is a variable-rate setup, in which the decoder adaptively chooses the rates at which the sensors transmit. An explicit characterization of the variable-rate achievable sum rates is given for any number of sensors and any groups of traitors. The converse is proved constructively by letting the traitors simulate a fake distribution and report the generated values as the true ones. This fake distribution is chosen so that the decoder cannot determine which sensors are traitors while maximizing the required rate to decode every value. Achievability is proved using a scheme in which the decoder receives small packets of information from a sensor until its message can be decoded, before moving on to the next sensor. The sensors use randomization to choose from a set of coding functions, which makes it probabilistically impossible for the traitors to cause the decoder to make an error. Two forms of the fixed-rate problem are considered, one with deterministic coding and one with randomized coding. The achievable rate regions are given for both these problems, and it is shown that lower rates can be achieved with randomized coding.

关键词： Byzantine attack distributed source coding network security sensor fusion Slepian-Wolf coding

来源：评论

学校读者我要写书评

暂无评论

distributed source coding Using Abelian Group Codes: A New Achievable Rate-Distortion Region

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第3期57卷 1495-1519页

作者： Krithivasan, Dinesh Pradhan, S. Sandeep Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA

A distributed source coding problem with a joint distortion criterion that depends on the sources and the reconstruction is considered in this work. While the prevalent trend in information theory has been to prove achievability results using Shannon's random coding arguments, using structured random codes offer rate gains over unstructured random codes for many problems. Motivated by this, a new achievable rate-distortion region (an inner bound to the performance limit) is presented for this problem for discrete memoryless sources based on "good" structured random nested codes built over abelian groups. For certain sources and distortion functions, the new rate region is shown to be strictly bigger than the Berger-Tung rate region, which has been the best known achievable rate region for this problem till now. This is done using numerical plots. Achievable rates for single-user source coding using abelian group codes are also obtained as a corollary of the main coding theorem. It is shown that nested linear codes achieve the Shannon rate-distortion function in the arbitrary discrete memoryless case.

关键词： distributed source coding structured code ensembles nested linear codes group codes abelian groups

来源：评论

学校读者我要写书评

暂无评论

distributed source coding using syndromes (DISCUS): Design and construction

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2003年第3期49卷 626-643页

作者： Pradhan, SS Ramchandran, K Univ Michigan Dept Elect Engn & Comp Sci Ann Arbor MI 48109 USA Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

We address the problem of compressing correlated distributed sources, i.e., correlated sources which are not co-located or which cannot cooperate to directly exploit their correlation. In this paper, we consider the related problem of compressing a source which is correlated with another source that is available only at the decoder. This problem has been studied in the information theory literature under the name of the Slepian-Wolf source coding problem for the lossless coding case, and as ''rate-distortion with side information" for the lossy coding case. In this work, we provide a constructive practical framework based on algebraic trellis codes dubbed as distributed source coding Using Syndromes (DISCUS), that can be applicable in a variety of settings. Simulation results are presented for source coding of independent and identically distributed (i.i.d.) Gaussian sources with side information available at the decoder in the form of a noisy version of the source to be coded. Our results reveal the promise of this approach: using trellis-based quantization and coset construction, the performance of the proposed approach is 2-5 dB from the Wyner-Ziv bound.

关键词： channel codes distributed source coding rate-distortion with side information Slepian-Wolf coding trellis cosets Wyner-Ziv coding

来源：评论

学校读者我要写书评

暂无评论

distributed source coding using symbol-based and non-binary turbo codes - applications to wireless sensor networks

引用

IET COMMUNICATIONS 2008年第8期2卷 1089-1097页

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

A simple but powerful scheme for distributed source coding (DSC) based on the concept of binning and syndromes and non traditional turbo codes is proposed. The previous works on the compression with side information using turbo codes and the binning technique are focused on binary turbo codes. The source is considered to be binary or is converted to a binary stream. This conversion, however, reduces the redundancy that could be exploited by the compression algorithm. To achieve higher compression efficiency, the authors propose using a scheme based on a turbo decoder that decides over symbols rather than bits. In the same direction and for further performance improvement, at the cost of increased encoder complexity, they also present a DSC scheme based on non-binary turbo codes. The results demonstrate improved performance. Based on the suggested algorithms, a scheme for gathering real data in wireless sensor networks and assess the corresponding energy savings is proposed.

关键词： distributed source coding wireless sensor network wireless sensor networks source coding symbol-based turbo codes turbo decoder binary codes nonbinary turbo codes binary stream compression algorithm encoder complexity binning technique energy savings turbo codes

来源：评论

学校读者我要写书评

暂无评论

distributed source coding Using Raptor Codes for Hidden Markov sources

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2009年第7期57卷 2868-2875页

作者： Fresia, M. Vandendorpe, L. Poor, H. V. Princeton Univ Dept Elect Engn Princeton NJ 08544 USA Catholic Univ Louvain Dept Elect Engn B-1348 Louvain Belgium

In this correspondence, the problem of distributed source coding (DSC) of binary sources with side information at the decoder is addressed. A scheme is proposed based on raptor codes which are a new class of rateless codes. The decoding scheme is adapted to this problem by implementing a message passing strategy between the constituent decoders of raptor codes at each decoding iteration. The case in which the sources are modeled as independent and identically distributed (i.i.d) processes as well as the more general case in which the sources are modeled as hidden Markov processes (HMPs) are considered. The proposed approach achieves better performance than those achieved by the solutions based on turbo codes, and by the solutions based on regular low density parity check (LDPC) codes when i.i.d. sources are considered. On the other hand, when modeling sources as HMPs, an additional module to exploit the underlying Markovian nature is necessary to achieve good performance.

关键词： distributed source coding Markov model raptor codes

来源：评论

学校读者我要写书评

暂无评论

distributed source coding and Its Applications in Relaying-Based Transmission

引用

IEEE ACCESS 2016年 4卷 1940-1970页

作者： Aljohani, Abdulah Jeza Ng, Soon Xin Hanzo, Lajos Univ Southampton Southampton SO17 1BJ Hants England Univ Southampton Sch Elect & Comp Sci Southampton SO17 1BJ Hants England

distributed source coding (DSC) schemes rely on separate encoding but joint decoding of statistically dependent sources, which exhibit correlation. DSC has numerous promising applications ranging from reduced-complexity handheld video communications to onboard hyperspectral image coding under computational limitations. The concept of separate encoding at the first sight compromises the attainable encoding performance. However, the DSC theory proves that independent encoding can in fact be designed as efficiently as joint encoding, as long as joint decoding is allowed. More specifically, distributed joint source-channel coding (DJSC) is associated with the scenario, where the correlated source signals are transmitted through a noisy channel. In this paper, we present a concise historic background of DSC concerning both its theory and its practical aspects. In addition, a series of turbo trellis-coded modulation (TTCM)-aided DJSC-based cooperative transmission schemes are proposed. DJSC scheme is conceived for the transmission of a pair of correlated sources to a destination node (DN). The first source sequence is TTCM encoded, and then, it is compressed before it is transmitted both over a Rayleigh fading channel, where the second source signal is assumed to be perfectly decoded side-information at the DN for the sake of improving the achievable decoding performance of the first source. The proposed scheme is capable of performing reliable communications for various levels of correlation near to the theoretical Slepian-Wolf/Shannon (SW/S) limit. Pursuing our objective of designing practical DJSC schemes, we further extended the above-mentioned arrangement to a more realistic cooperative communication system, where the pair of correlated sources are transmitted to a DN with the aid of a relay node (RN). Explicitly, the pair of correlated source sequences are TTCM encoded and compressed before transmission over a Rayleigh fading multiple access channel, where our propo

关键词： distributed joint source coding distributed source coding Slepian-Wolf coding joint source-channel decoding TTCM superposition modulation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：