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

Robust Communication via Decentralized Processing With Unreliable Backhaul Links

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第7期57卷 4187-4201页

作者： Simeone, Osvaldo Somekh, Oren Erkip, Elza Poor, H. Vincent Shamai (Shitz), Shlomo New Jersey Inst Technol CWCSPR Newark NJ 07102 USA Princeton Univ Dept Elect Engn Princeton NJ 08544 USA Polytech Inst New York Univ Dept ECE Brooklyn NY 11201 USA Technion Israel Inst Technol Dept Elect Engn IL-32000 Haifa Israel

A source communicates with a remote destination via a number of distributed relays. Communication from source to relays takes place over a (discrete or Gaussian) broadcast channel, while the relays are connected to the receiver via orthogonal finite-capacity links. Unbeknownst to the source and relays, link failures may occur between any subset of relays and the destination in a nonergodic fashion. Upper and lower bounds are derived on average achievable rates with respect to the prior distribution of the link failures, assuming the relays to be oblivious to the source code-book. The lower bounds are obtained by proposing strategies that combine the broadcast coding approach, previously investigated for quasi-static fading channels, and different robust distributed compression techniques. Numerical results show that lower and upper bounds are quite close over most operating regimes, and provide insight into optimal transmission design choices for the scenario at hand. Extension to the case of nonoblivious relays is also discussed.

关键词： Broadcast coding distributed source coding erasure channel relay channel robust channel coding

来源：评论

学校读者我要写书评

暂无评论

distributed Block Arithmetic coding for Equiprobable sources

引用

IEEE SENSORS JOURNAL 2013年第7期13卷 2750-2756页

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

distributed arithmetic coding (DAC) is similar to syndrome coding, in the sense that message sequences sharing the same interval can be considered a coset of the space of the source sequences, and the codeword is the index of the coset. In this paper, the minimum Hamming distance of cosets is studied and it is proved that such a distance is as small as one. By only allowing the sequences with a large Hamming distance to overlap in the same interval, an improved DAC scheme is proposed. Simulation results show that, for equiprobable memoryless sources, this approach outperforms DAC in terms of decoding error rate at the same coding cost. In addition, at small sequence length, the decoding error rate of the proposed scheme is lower than that of distributed source coding based on low-density parity-check codes for highly correlated sources.

关键词： distributed source coding Slepian-Wolf coding arithmetic coding low-complexity coding

来源：评论

学校读者我要写书评

暂无评论

Group testing for binary Markov sources: Data-driven group queries for cooperative sensor networks

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2008年第8期54卷 3538-3551页

作者： Hong, Yao-Win Peter Scaglione, Anna Natl Tsing Hua Univ Inst Commun Engn Hsinchu 30013 Taiwan Cornell Univ Dept Elect & Comp Engn Ithaca NY 14853 USA

Group testing has been used in many applications to efficiently identify rare events in a large population. In this paper, the concept of group testing is generalized to applications with correlated source models to derive scheduling policies for sensors' adopting cooperative transmissions. The tenet of our work is that in a wireless sensor network it is advantageous to allocate the same channel dimensions to all sensor sources that have the same response to a sequence of queries or tests. That is, nodes that have the same data attributes should transmit as a cooperative super-source. Specifically, we consider the case where sensors' data are modeled spatially as a one-dimensional Markov chain. Two strategies are considered: the recursive algorithm and the tree-based algorithm. The recursive scheme allows us to illustrate the performance of group testing for finite populations while the tree-based algorithm is used to derive the achievable scaling performances of the class of group testing strategies as the number of sensors increases. We show that the total number of queries required to gather all sensors' data scales in the order of the joint entropy. A further generalization of this concept provides the basis of deriving efficient data-gathering algorithms for correlated sources.

关键词： cooperative communications data gathering in sensor networks distributed source coding group testing multiple access

来源：评论

学校读者我要写书评

暂无评论

Linear Interactive Encoding and Decoding for Lossless source coding With Decoder Only Side Information

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2011年第8期57卷 5281-5297页

作者： Meng, Jin Yang, En-Hui He, Da-Ke Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada Res In Mot SlipStream Waterloo ON N2L 5Z5 Canada

Linear interactive encoding and decoding (IED) for near lossless source coding with decoder only side information is considered, where the interactive encoder uses linear codes (described by parity-check matrices over a finite field chi) for encoding. It is first demonstrated how to convert any classical universal lossless code C(n) (with block length n and with side information available to both the encoder and decoder) into a universal random linear IED scheme based on Gallager's parity check ensemble. It is then shown that there is no performance loss by restricting IED to linear IED, and that the universal random linear IED scheme based on Gallager's parity check ensemble achieves essentially the same rate performance as does C(n) for each and every individual sequence pair (x(n), y(n)) while the word decoding error probability goes to 0 as n --> infinity. Define the density of a linear IED scheme as the percentage of nonzero entries in its parity-check matrix. To reduce the encoding complexity of linear IED, low density linear IED is further investigated in terms of the trade-off among its rate, decoding error probability, and density.

关键词： distributed source coding entropy and conditional entropy individual sequences interactive encoding and decoding parity-check matrix Slepian-Wolf coding stationary and ergodic sources

来源：评论

学校读者我要写书评

暂无评论

Universal Multiterminal source coding Algorithms With Asymptotically Zero Feedback: Fixed Database Case

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2008年第12期54卷 5575-5590页

作者： Yang, En-hui He, Da-Ke Uyematsu, Tomohiko Yeung, Raymond W. Univ Waterloo Dept Elect & Comp Engn Waterloo ON N2L 3G1 Canada IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA Tokyo Inst Technol Dept Commun & Integrated Syst Tokyo 1528552 Japan Chinese Univ Hong Kong Dept Informat Engn Hong Kong Hong Kong Peoples R China

Consider a source network in which a finite alphabet source X = {X-i}(i=0)(infinity) is to be encoded and transmitted, and another finite alphabet source Y = {Y-i}(i=0)(infinity) correlated with X is available only to the decoder as side information. Traditionally, the channel between the encoder and decoder in the source network is assumed to be one-way. This, together with the fact that the encoder does not have access to Y, implies that the encoder has to know the achievable rates before encoding. In this paper, we consider universal source coding for a feedback source network in which the channel between the encoder and decoder is two-way and asymmetric. Assume that the encoder and decoder share a random database that is independent of both X and Y. A string matching-based (variable-rate) block coding algorithm with simple progressive encoding and joint typicality decoding is first proposed for the feedback source network. The simple progressive encoder does not need to know the achievable rates at the beginning of encoding. It is proven that for any (X, Y) in a large class of sources satisfying some mixing conditions, the average number of bits per letter transmitted from the encoder to the decoder (compression rate) goes to the conditional entropy H (X vertical bar Y) of X given 11 asymptotically, and at the same time the average number of bits per letter transmitted from the decoder to the encoder (feedback rate) goes to 0 asymptotically. The algorithm and the corresponding analysis results are then extended to the case where both X and Y are to be encoded separately, but decoded jointly. Finally, a universal decoding algorithm is proposed to replace the joint typicality decoding, and the resulting universal compression algorithm consisting of the simple progressive encoder and the universal decoding algorithm is further shown to be asymptotically optimal for the class of all jointly memoryless source-side information pairs (X,Y).

关键词： Database distributed source coding entropy feedback phi-mixing string matching universal data compression

来源：评论

学校读者我要写书评

暂无评论

Robust Video coding Based on Multiple Description Scalar Quantization With Side Information

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY 2010年第6期20卷 769-779页

作者： Crave, Olivier Pesquet-Popescu, Beatrice Guillemot, Christine Telecom ParisTech Dept Signal & Image Proc F-75634 Paris 13 France Inst Natl Rech Informat & Automat F-35042 Rennes France

This paper addresses the problem of video compression for robust transmission on lossy Internet networks. The approach developed relies on multiple description coding (MDC) principles. Predictive multiple description video coding has already been considered for robust video transmission over lossy channels. However, MDC, when combined with motion-compensated prediction, is known to suffer from predictive mismatch: in presence of losses, the prediction signal available at the decoder may differ from the one used at the encoder. In this paper, we describe a video compression scheme based on MDC and Wyner-Ziv (WZ) coding. The input sequence is structured into groups of pictures which contain one key frame and one WZ frame. Each frame is first transformed with a wavelet transform and the resulting frequency bands are quantized with a multiple description scalar quantizer. Two balanced descriptions of the video input are thus generated. The quantization indexes of the WZ frames are coded with an low-density parity-check accumulate-based Slepian-Wolf (SW) coder. The lateral receivers first decode the received key frame lateral descriptions, and then construct the side information needed for decoding the corresponding WZ frame descriptions by motion-compensated interpolation. In the case where the two WZ data descriptions are received, the central decoder can perform a separate SW decoding of the two sequences of quantization indexes. A joint iterative decoding approach of the two WZ descriptions is also described which improve the central WZ data decoding performance, however, at the expense of increased decoding complexity. The influence of the proposed iterative decoding technique and of the amount of redundancy on the lateral and central rate-distortion performance of the algorithm is studied.

关键词： distributed source coding multiple description coding Wyner-Ziv (WZ)

来源：评论

学校读者我要写书评

暂无评论

Quality and Complexity Controllable DVC Bitstream Organizer

引用

IEICE TRANSACTIONS ON COMMUNICATIONS 2012年第5期E95B卷 1894-1897页

作者： Kim, Chul Keun Cho, Yongwoo Park, Jongbin Suh, Doug Young Jeon, Byeungwoo Kyung Hee Univ Seoul South Korea Sungkyunkwan Univ Seoul South Korea

Applying distributed Video coding (DVC) to mobile devices that have limited computation and power resources can be a very challenging problem due to its high-complexity decoding. To address this, this paper proposes a DVC bitstream organizer. The proposed DVC bitstream organizer reduces the complexity associated with repetitive channel decoding and SI generation in a flexible manner. It allows users to choose a means of minimizing the computational complexity of the DVC decoder according to their preferences and the device's resource limitations. An experiment shows that the proposed method increases decoding speeds by up to 25 times.

关键词： distributed video coding distributed source coding video compression video communication

来源：评论

学校读者我要写书评

暂无评论

Joint Decoding and Estimation of S patio-Temporally Correlated Binary sources

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2018年第7期67卷 6690-6694页

作者： Izbar, Mohd Azri Mohd Aljohani, Abdullah Jeza Ng, Soon Xin Hanzo, Lajos Univ Teknol Malaysia Razak Sch Engn & Adv Technol Wireless Commun Ctr Kuala Lumpur 54100 Malaysia Univ Teknol Malaysia Razak Sch Engn & Adv Technol U BAN Grp Kuala Lumpur 54100 Malaysia Umm Alqura Univ Mecca Saudi Arabia Univ Southampton Sch Elect & Comp Sci Southampton SO17 1BJ Hants England

In the context of distributed joint source-channel coding, we conceive a joint decoding and estimation scheme for binary Markov sources exhibiting spatio-temporal correlation. The proposed scheme is designed based on the serial concatenation of a trellis coded modulation (TCM) scheme and a unity-rate code. The symbol-based maximum a posteriori algorithm employed for TCM. decoding is modified in order to exploit the source correlation. The estimation of both the spatial and temporal correlation parameters is performed jointly with the iterative decoding, hence allowing the estimated parameters to he updated after each iteration. Our simulation results reveal that when both the spatial and temporal correlation parameters are unknown, the proposed joint decoding and estimation scheme approaches the performance to the ideal system relying on perfectly known correlation parameters, therefore, demonstrating the superiority of the proposed scheme.

关键词： Joint source-channel coding distributed source coding joint decoding and estimation

来源：评论

学校读者我要写书评

暂无评论

Design of Degree Distributions for LDPCA Codes

引用

IEEE COMMUNICATIONS LETTERS 2009年第7期13卷 525-527页

作者： Cen, Feng Tongji Univ Dept Control Sci & Engn Shanghai 200092 Peoples R China

A degree distribution design method of Low-Density Parity-Check Accumulate (LDPCA) codes [6] is proposed for rate-compatible asymmetric Slepian-Wolf coding (SWC) of correlated binary memoryless sources. The degree distribution is designed by seeking the simultaneous optimum at the lowest and the highest compression rates of the specified range with density evolution algorithm. The experimental results show that the coding efficiency of codes constructed with the designed degree distribution is close to the Slepian-Wolf limit over the entire target range and better than all other reported results of the rate-compatible asymmetric SWC.

关键词： Rate-compatible codes distributed source coding Slepian-Wolf coding LDPCA codes LDPC codes

来源：评论

学校读者我要写书评

暂无评论

Joint source-Channel coding for Asymmetric Slepian-Wolf Multiple Access Relay Channel

引用

IEEE WIRELESS COMMUNICATIONS LETTERS 2017年第5期6卷 642-645页

作者： Liu, Lei Li, Ying Yuen, Chau Guan, Yong Liang Sun, Yue Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Shaanxi Peoples R China Singapore Univ Technol & Design Singapore 487372 Singapore Nanyang Technol Univ Sch EEE Singapore 639798 Singapore

This letter considers a code design for an asymmetric Slepian-Wolf multiple-access relay channel, in which the users and relay have different channel conditions. In this case, the conventional parity approach distributed source coding is no longer applicable. Hence, a new distributed joint source-channel superposition coding (DJSC-SC) is proposed. The proposed DJSC-SC matches the asymmetric channels, and makes full use of the good channel to obtain a better performance. Simulation results show that, compared with the conventional PA, the performance of the DJSC-SC scheme has a significant improvement and is within 1.4 dB from the capacity limit.

关键词： distributed source coding superposition coding joint source-channel coding asymmetric MARC

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：