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

Joint source and channel coding with systematic polar codes for wireless sensor communication in next generation networks

引用

JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING 2019年第12期10卷 4641-4649页

作者： Yaacoub, Charles Sarkis, Malak Holy Spirit Univ Kaslik USEK Fac Engn POB 446 Jounieh Lebanon

Polar codes have strongly entered into action within the standardization of the next generation 5G mobile communication systems, which are expected to be an enabling technology for the Internet of Things where networks with a large number of sensors have to handle massive connectivity demands. This paper proposes and investigates the use of systematic polar codes for joint source-channel coding of correlated sources in wireless sensor networks, thus allowing the compression of the volume of data to be transmitted over the network on one hand, and on the other hand, the protection of this data from channel impairments. Results show that systematic polar codes can achieve a distributed compression with rates close to theoretical limits, with better error rates obtained for larger blocks, and a better robustness against transmission errors obtained with stronger compression and shorter block lengths. Furthermore, while the system is able to overcome the effect of noise on parity information with adequate power management, noisy side information significantly degrades system performance with remarkable gaps towards the case of distributed compression with an ideal transmission channel.

关键词： Channel coding Compression distributed source coding Entropy Systematic polar codes Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Centralized and distributed Semiparametric Compression of Piecewise Smooth Functions

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2011年第7期59卷 3071-3085页

作者： Chaisinthop, Varit Dragotti, Pier Luigi Univ London Imperial Coll Sci Technol & Med Dept Elect & Elect Engn Commun & Signal Proc Grp London SW7 2AZ England

This paper introduces novel wavelet-based semi-parametric centralized and distributed compression methods for a class of 1-D piecewise smooth functions. Classical centralized compression schemes are based on a relatively complex, nonlinear encoder and a simple, linear decoder. Recently, a new paradigm in compression called distributed source coding has emerged. This setup involves multiple encoders, where each one partially observes the source, and a centralized decoder. First, we focus on the dual situation of the centralized compression with a simple encoder and a complex decoder. We show that, by incorporating parametric estimation into the decoding procedure, it is possible to achieve the same rate-distortion performance as that of a conventional wavelet-based compression scheme. Second, we consider the distributed compression scenario, where each independent encoder partially observes the 1-D piecewise smooth function. We propose a new wavelet-based distributed compression scheme that uses parametric estimation to perform joint decoding. Our analysis shows that it is possible for the proposed scheme to achieve the same compression performance as that of a joint encoding scheme.

关键词： Approximations compression distributed source coding parametric estimation piecewise smooth functions wavelets

来源：评论

学校读者我要写书评

暂无评论

Multimedia Multicast Based on Multiterminal source coding

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2010年第9期E93A卷 1639-1649页

作者： Aghagolzadeh, Ali Nooshyar, Mahdi Rabiee, Hamid R. Mikaili, Elhameh Univ Tabriz Fac Elect & Comp Engn Tabriz 51664 Iran Sharif Univ Technol Fac Comp Engn Tehran Iran

Multimedia multicast with two servers based on the multiterminal source coding is studied in some previous researches. Due to the possibility of providing an approach for practical code design for more than two correlated sources in IMTSC/CEO setup, in this paper, the framework of Slepian-Wolf coded quantization is extended and a practical code design is presented for IMTSC/CEO with the number of encoders greater than two. Then the multicast system based on the IMTSC/CEO is applied to the cases with three, four and five servers. Since the underlying code design approach for the IMTSC/CEO problem has the capability of applying to an arbitrary number of active encoders, the proposed MMBMSC method can also be used with an arbitrary number of servers easily. Also, explicit expressions of the expected distortion with an arbitrary number of servers in the MMBMSC system are presented. Experimental results with data, image and video signals show the superiority of our proposed method over the conventional solutions and over the MMBMSC system with two servers.

关键词： distributed source coding indirect multi terminal source coding CEO problem multicast

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient adaptive DSC scheme for wireless sensor networks

引用

SIGNAL PROCESSING 2007年第12期87卷 2896-2910页

作者： Tang, Zuoyin Glover, I. A. Evans, A. N. He, Jianhua Univ Bath Dept Elect & Elect Engn Bath BA2 7AY Avon England Univ Strathclyde Dept Elect & Elect Engn Glasgow G1 1XQ Lanark Scotland Huazhong Univ Sci & Technol Dept Elect & Informat Engn Wuhan 430074 Peoples R China

distributed source coding (DSC) has been proven in theory that it can be used to compress correlated signals with or without loss. Recently this coding method has been used for the application of remote signal estimation in wireless sensor networks (WSN), where multiple sensor nodes compress their correlated observations without inter-node communications. Energy and bandwidth are therefore efficiently saved. Challenges remain, however, in the design of practical and adaptive DSC schemes for WSN. In this paper, we study the problem of a random-binning based DSC scheme for remote source estimation in WSN. We design a DSC scheme and analyze its performance on the estimated signal to distortion ratio (SDR), in which observation noise, quantization distortion, DSC decoding errors and network packet losses are all taken into account. With the introduction of a detailed power consumption model for wireless sensor communications, we quantitatively analyze the overall network energy consumption. We further propose a novel adaptive control mechanism for the DSC scheme, which flexibly optimizes the DSC performance in terms of either SDR or energy consumption by adapting the source coding and transmission parameters to the network conditions. Simulations show the proposed DSC scheme and adaptive control mechanism can either save up to 31.6% energy consumption without decreasing the SDR or maximize the SDR with saving up to 9.4% energy consumption. (C) 2007 Elsevier B.V. All rights reserved.

关键词： distributed source coding energy efficiency adaptive control wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Lossless and near-lossless source coding for multiple access networks

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2003年第1期49卷 112-128页

作者： Zhao, Q Effros, M CALTECH Dept Elect Engn Pasadena CA 91125 USA

A multiple access source code (MASC) is a source code designed for the following network configuration: a pair of correlated information sequences {X-i}(i=1)(infinity), and {Y-i}(i=1)(infinity) is drawn independent and identically distributed (i.i.d.) according to joint probability mass function (p.m.f.) p(x, y);the encoder for each source operates without knowledge of the other source;the decoder jointly decodes the encoded bit streams from both sources. The work of Slepian and Wolf describes all rates achievable by MASCs of infinite coding dimension (n --> infinity) and asymptotically negligible error probabilities (P-e((n)) --> 0). In this paper, we consider the properties of optimal instantaneous MASCs with finite coding dimension (n < infinity) and both lossless (P-e((n)) = 0) and near-lossless (P-e((n)) --> 0) performance. The interest in near-lossless codes is inspired by the discontinuity in the limiting rate region at P-e((n)) = 0 and the resulting performance benefits achievable by using near-lossless MASCs as entropy codes within lossy MASCs. Our central results include generalizations of Huffman and arithmetic codes to the MASC framework for arbitrary p(x, y), n, and P-e((n)) and polynomial-time design algorithms that approximate these optimal solutions.

关键词： arithmetic codes distributed source coding Huffman codes lossless coding near-lossless coding network source coding polynomial complexity Slepian-Wolf Wyner-Ziv codes

来源：评论

学校读者我要写书评

暂无评论

DAC Spectrum of Binary sources with Equally-Likely Symbols

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2013年第4期61卷 1584-1594页

作者： Fang, Yong Northwest A&F Univ Coll Informat Engn Yangling 712100 Shaanxi Peoples R China

Though distributed arithmetic coding (DAC) is an effective implementation of Slepian-Wolf coding, its performance, which is closely linked with its decoding complexity, has not received a thorough analysis. With binary sources with equally-likely symbols as the research object, this paper develops the DAC spectrum and makes use of it as a tool to answer the complexity problem of the ideal DAC decoder. Based on an in-depth analysis on DAC decoding process, we define the DAC spectrum and propose to find it by a recursive formulation. Firstly, the initial DAC spectrum is constrained by a functional equation and the Fourier transform is utilized to obtain its general explicit form. Secondly, an equation is given through which stage-(i+1) DAC spectrum can be deduced from stage-i DAC spectrum. A numerical method is also proposed for calculating DAC spectrum, whose convergency is proved. To measure the complexity of the ideal DAC decoder, we define the expansion factor and relate it to DAC spectrum. It is proved that if binary symbols 0 and 1 are mapped onto partially overlapped intervals [0, q) and [1 - q, 1) respectively, the expansion factor will converge to 2q, i.e., the complexity of the ideal rate-alpha DAC decoder is approximately O(2(n(1-alpha))).

关键词： distributed source coding Slepian-Wolf coding distributed arithmetic coding spectrum

来源：评论

学校读者我要写书评

暂无评论

An Achievable Rate Region for Joint Compression and Dispersive Information Routing for Networks

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第9期60卷 5433-5456页

作者： Viswanatha, Kumar B. Akyol, Emrah Rose, Kenneth Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA Univ So Calif Dept Elect Engn Los Angeles CA 90089 USA

This paper considers the problem of minimum cost communication of correlated sources over a network with multiple sinks, which consists of distributed source coding followed by routing. We introduce a new routing paradigm called dispersive information routing (DIR), wherein the intermediate nodes are allowed to split a packet and forward subsets of the received bits on each of the forward paths. This paradigm opens up a rich class of research problems, which focus on the interplay between encoding and routing in a network. Unlike conventional routing methods such as in [1], DIR ensures that each sink receives just the information needed to reconstruct the sources it is required to reproduce. We demonstrate using simple examples that the proposed approach offers better asymptotic performance than conventional routing techniques. We show that, under certain assumptions on the cost function, the problem of finding the minimum cost under DIR essentially reduces to characterizing an achievable rate region for a new multiterminal information theoretic setup. While it is possible to derive an achievable region for this setup using prior results from general multiterminal source coding [3], these techniques do not exploit the underlying problem structure and thereby lead to suboptimal regions. In this paper, we propose a new coding scheme, using principles from multiple descriptions encoding [2], and show that it strictly improves upon a corresponding variant of coding scheme in [3]. We further show that the new coding scheme achieves the complete rate region for certain special cases of the general setup and thereby achieves the minimum communication cost under this routing paradigm.

关键词： distributed source coding achievable region minimum cost routing compression for networks

来源：评论

学校读者我要写书评

暂无评论

Power Control and coding Formulation for State Estimation With Wireless Sensors

引用

IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY 2014年第2期22卷 413-427页

作者： Quevedo, Daniel E. Ostergaard, Jan Ahlen, Anders Univ Newcastle Sch Elect Engn & Comp Sci Callaghan NSW 2308 Australia Aalborg Univ Dept Elect Syst DK-9220 Aalborg Denmark Uppsala Univ S-75121 Uppsala Sweden

Technological advances made wireless sensors cheap and reliable enough to be brought into industrial use. A major challenge arises from the fact that wireless channels introduce random packet dropouts. Power control and coding are key enabling technologies in wireless communications to ensure efficient communication. In this paper, we examine the role of power control and coding for Kalman filtering over wireless correlated channels. Two estimation architectures are considered;initially, the sensors send their measurements directly to a single gateway (GW). Next, wireless relay nodes provide additional links. The GW decides on the coding scheme and the transmitter power levels of the wireless nodes. The decision process is carried out online and adapts to varying channel conditions to improve the tradeoff between state estimation accuracy and energy expenditure. In combination with predictive power control, we investigate the use of multiple-description coding (MDC), zero-error coding (ZEC), and network coding and provide sufficient conditions for the expectation of the estimation error covariance matrix to be bounded. Numerical results suggest that the proposed method may lead to energy savings of around 50%, when compared with an alternative scheme, wherein transmission power levels and bit-rates are governed by simple logic. In particular, ZEC is preferable at time instances with high channel gains, whereas MDC is superior for time instances with low gains. When channels between the sensors and the GW are in deep fades, network coding improves estimation accuracy significantly without sacrificing energy efficiency.

关键词： distributed source coding Kalman filtering multiple-description coding network coding power control relays wireless sensors (WSs)

来源：评论

学校读者我要写书评

暂无评论

Image authentication using distributed arithmetic coding

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2018年第12期77卷 15505-15520页

作者： Zhou, Junwei Liu, Fang Cheng, Lee-Ming Wuhan Univ Technol Sch Comp Sci & Technol Wuhan Hubei Peoples R China City Univ Hong Kong Dept Elect Engn Hong Kong Hong Kong Peoples R China

Image authentication using distributed arithmetic coding (DAC) is studied in this paper. The quantized random projections of the original image are compressed by a DAC encoder and the codeword is taken as the authentication data. With the help of a target image as side information, the DAC decoder could recover the projections. The authentication process is achieved by examining the Euclidean distance between the reconstructed projections and the side information. Compared with existing approaches, the proposed approach has a simpler structure without the help of an additional cryptographic hash function to verify the decoding result. Moreover, the authentication data is more compact with fewer size. Simulation results justify that the proposed approach achieves a comparable performance as existing schemes.

关键词： Security distributed arithmetic coding Image authentication distributed source coding

来源：评论

学校读者我要写书评

暂无评论

Wyner-Ziv-based multiview video coding

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2008年第6期18卷 713-724页

作者： Guo, Xun Lu, Yan Wu, Feng Zhao, Debin Gao, Wen MediaTek Inc Beijing 100080 Peoples R China Harbin Inst Technol Sch Comp Sci & Technol Harbin 150001 Peoples R China Microsoft Res Asia Beijing 100080 Peoples R China Peking Univ Sch Elect Engn & Comp Sci Beijing 100080 Peoples R China

Utilizing video correlations among views would definitely improve multiview video compression in terms of coding efficiency, which usually requests an expensive system to collect videos from different cameras and jointly compress them. Thanks to recent developments on distributed video coding, this paper proposes a new multiview video coding scheme based on Wyner-Ziv (WZ) coding technique, in which the complicated temporal and interview correlation exploration process is shifted from the encoder side to the decoder side so that broadband raw data traffic and high intensive computation for jointly encoding can be avoided. At the encoder side, a wavelet-based WZ scheme is proposed to compress video of every camera. Furthermore, in order to better utilize correlation in wavelet domain, all coefficients are organized as that done in SPIHT bit plane by bit plane. At the decoder side, a more flexible prediction technique that can jointly utilize temporal and view correlations is proposed to generate side information. Finally, experimental results show the proposed scheme significantly outperforms the conventional intra-frame coding for better random access and is even close to the inter-frame coding for better efficiency. Furthermore, compressed data is much robust when it is transmitted over an error-prone channel.

关键词： distributed source coding multiview video coding (MVC) wavelet Wyner-Ziv (WZ) video coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：