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

decoding delay Minimization in Inter-Session Network Coding

IEEE TRANSACTIONS ON COMMUNICATIONS 2014年第6期62卷 1944-1957页

作者： Bourtsoulatze, Eirina Thomos, Nikolaos Frossard, Pascal Univ Bern Commun & Distributed Syst Lab CDS CH-3012 Bern Switzerland Univ Essex Colchester CO4 3SQ Essex England Ecole Polytech Fed Lausanne Signal Proc Lab LTS4 4 CH-1015 Lausanne Switzerland

Intra-session network coding has been shown to offer significant gains in terms of achievable throughput and delay in settings where one source multicasts data to several clients. In this paper, we consider a more general scenario where multiple sources transmit data to sets of clients over a wireline overlay network. We propose a novel framework for efficient rate allocation in networks where intermediate network nodes have the opportunity to combine packets from different sources using randomized network coding. We formulate the problem as the minimization of the average decoding delay in the client population and solve it with a gradient-based stochastic algorithm. Our optimized inter-session network coding solution is evaluated in different network topologies and is compared with basic intra-session network coding solutions. Our results show the benefits of proper coding decisions and effective rate allocation for lowering the decoding delay when the network is used by concurrent multicast sessions.

关键词： Network coding decoding delay rate allocation inter-session network coding overlay networks

来源：评论

学校读者我要写书评

暂无评论

decoding delay and Outage Performance Analysis of Full-Duplex Decode-Forward Relaying: Backward or Sliding Window decoding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2016年第11期64卷 4520-4533页

作者： Al Haija, Ahmad Abu Tellambura, Chintha Univ Alberta Dept Elect & Comp Engn Edmonton AB T6G 1H9 Canada

High reliability and low latency are critical performance targets in the fifth-generation cellular networks. How does a full-duplex decode-forward relay fare in this context? To answer this question, we analyze the outage and (average) decoding-delay for both joint and sequential sliding window decoding. For comparison, we also analyze decoding delay of backward decoding and consider its existing outage analysis. In our analysis, we consider a block fading channel with full channel state information (CSI) availability at receivers and with limited CSI at transmitters and outage events at both relay and destination and channel variation over different blocks in sliding window decoding. Moreover, by analyzing the asymptotic performance at high SNR, we prove that both joint and sequential decoding achieve a full diversity order of two and derive the coding gain gaps between backward decoding and joint and sequential sliding window decoding. To see the benefits of full-duplex relaying, we also include the performance of half-duplex schemes and conclude that the preferred scheme depends on the rate, outage, and delay requirements for a specific service.

关键词： Decode-forward relaying backward and sliding window decoding decoding delay outage and diversity analysis

来源：评论

学校读者我要写书评

暂无评论

decoding delay Reduction in Network Coded Cooperative Systems with Intermittent Status Update

Decoding Delay Reduction in Network Coded Cooperative System...

引用

IEEE Information Theory Workshop (ITW)

作者： Karim, Mohammad S. Aboutorab, Neda Nasir, Ali A. Sadeghi, Parastoo Australian Natl Univ Res Sch Engn Canberra ACT Australia

ISBN: (纸本)9781479959990

In this paper, we study the problem of decoding delay reduction for instantly decodable network coding (IDNC) in broadcast cooperative systems, where a group of closely located clients cooperate with each other to obtain their missing packets. In such cooperative systems, one of the clients (referred to as the leader) decides the transmitting client and the packet combination for each transmission. We consider intermittent system status update (SSU) at the leader such that all other clients feed back their packet reception status to the leader after several cooperative transmissions. We first introduce an intermittent local IDNC (ILIDNC) graph to represent all potential packet combinations for a transmitting client. We then formulate the joint client and packet selection problem that results in the minimum expected decoding delay in each cooperative transmission as a maximum weight clique problem over all the IL-IDNC graphs. Since solving the formulated problem is computationally complex, we propose a heuristic algorithm to select the transmitting client and the packet combination that can reduce the decoding delay. Simulation results show that the proposed heuristic algorithm can achieve a tolerable degradation compared to the full SSU performance while using a smaller number of SSUs.

关键词： Instantly Decodable Network Coding decoding delay Cooperative Systems Wireless Networks

来源：评论

学校读者我要写书评

暂无评论

The Final Case of the decoding delay Problem for Maximum Rate Complex Orthogonal Designs

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2010年第1期56卷 103-112页

作者： Adams, Sarah Spence Karst, Nathaniel Murugan, Mathav Kishore Franklin W Olin Coll Engn Needham MA 02492 USA Cornell Univ Ctr Appl Math Ithaca NY 14853 USA Indian Inst Technol Kharagpur 721302 W Bengal India

Complex orthogonal space-time block codes (COSTBCs) based on generalized complex orthogonal designs (CODs) have been successfully implemented in wireless systems with multiple transmit antennas and single or multiple receive antennas. It has been shown that for a maximum rate COD with 2m - 1 or 2m columns, a lower bound on decoding delay is (2m m - 1) and this delay is achievable when the number of columns is congruent to 0, 1, or 3 modulo 4. In this paper, the final case is addressed, and it is shown that when the number of columns is congruent to modulo 4, the lower bound on decoding delay cannot be achieved. In this case, the shortest decoding delay a maximum rate COD can achieve is twice the lower bound. New techniques for analyzing CODs are introduced with connections to binary vector spaces.

关键词： Complex orthogonal designs decoding delay diversity multiple-input multiple-output (MIMO) systems space-time block codes

来源：评论

学校读者我要写书评

暂无评论

Instantly Decodable Network Coding for Completion Time or decoding delay Reduction in Cooperative Data Exchange Systems

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2016年第3期65卷 1212-1228页

作者： Aboutorab, Neda Sadeghi, Parastoo Australian Natl Univ Res Sch Informat Sci & Engn GPO Box 4 Canberra ACT 0200 Australia

In this paper, we investigate the use of instantly decodable network coding (IDNC) for improving two fundamental performance metrics, namely, the completion time (as a measure of throughput) and mean decoding delay, in multicast cooperative data exchange (CDE) systems, where a group of geographically close clients cooperate with each other to obtain their missing packets. Here, an IDNC scheme is used for the transmissions across these clients. We utilize the stochastic shortest path (SSP) technique to study the minimum mean completion time problem. However, since finding the optimum solution is intractable, we use the obtained formulation to draw some theoretical guidelines to heuristically find solutions that can efficiently reduce the completion time. Second, we formulate the minimum mean decoding delay problem as selecting the appropriate maximal clique over well-structured graphs at the clients, and in order to reduce its complexity, we propose a simple heuristic algorithm for it. The effectiveness of our proposed algorithms is verified through extensive simulations and comparisons with existing techniques.

关键词： Cooperative data exchange completion time decoding delay instantly decodable network coding multicast

来源：评论

学校读者我要写书评

暂无评论

Broadcasting over uncertain channels with decoding delay constraints

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2006年第3期52卷 904-921页

作者： Whiting, PA Yeh, EM Bell Labs Lucent Technol Math Sci Res Ctr Murray Hill NJ 07974 USA MIT Dept Elect Engn Cambridge MA 02139 USA

We examine communication over slowly varying flat-fading additive white Gaussian noise (AWGN) channels with delayed channel state information (CSI) feedback to the transmitter and finite decoding delay constraints. Under a block-fading channel model, it is shown that a broadcast strategy maximizes the expected reliably received rate when the decoding delay constraint is one block and in certain cases when the delay constraint is two blocks. The latter requires a new analysis of underlying parallel Gaussian broadcast channels (GBCs) which are not degraded in the same direction.

关键词： broadcast channel capacity versus outage composite channels decoding delay delay-limited capacity delayed channel feedback expected capacity fading channels nonergodic capacity superposition coding

来源：评论

学校读者我要写书评

暂无评论

Enabling a Tradeoff between Completion Time and decoding delay in Instantly Decodable Network Coded Systems

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2014年第4期62卷 1296-1309页

作者： Aboutorab, Neda Sadeghi, Parastoo Sorour, Sameh Australian Natl Univ Res Sch Informat Sci & Engn Canberra ACT 0200 Australia King Fahd Univ Petr & Minerals Dept Elect Engn Dhahran 31261 Eastern Provinc Saudi Arabia

This paper studies the complicated interplay of the completion time (as a measure of throughput) and the decoding delay performance in instantly decodable network coded (IDNC) systems over wireless broadcast erasure channels with memory. We propose two new algorithms that enable a tradeoff for an improved balance between completion time and decoding delay of broadcasting a block of packets. We first formulate the IDNC packet selection problem that improves the balance between completion time and decoding delay as a statistical shortest path (SSP) problem. However, since finding such packet selection policy using the SSP technique is computationally complex, we employ its geometric structure to find some guidelines and use them to propose two efficient heuristic packet selection algorithms for broadcast erasure channels with a wide range of memory conditions. It is shown that each one of the two proposed algorithms is superior for a specific range of memory conditions. Furthermore, we show that the proposed algorithms achieve an improved fairness in terms of the decoding delay across all receivers.

关键词： Instantly Decodable Network Coding decoding delay Completion time Broadcast Gilbert-Elliott channels

来源：评论

学校读者我要写书评

暂无评论

Systematic analysis of the decoding delay in multiview video

引用

JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION 2014年第4期25卷 689-697页

作者： Carballeira, Pablo Cabrera, Julian Jaureguizar, Fernando Garcia, Narciso Univ Politecn Madrid ETSI Telecomun Grp Tratamiento Imagenes E-28040 Madrid Spain

We present a framework for the analysis of the decoding delay in multiview video coding (MVC). We show that in real-time applications, an accurate estimation of the decoding delay is essential to achieve a minimum communication latency. As opposed to single-view codecs, the complexity of the multiview prediction structure and the parallel decoding of several views requires a systematic analysis of this decoding delay, which we solve using graph theory and a model of the decoder hardware architecture. Our framework assumes a decoder implementation in general purpose multi-core processors with multi-threading capabilities. For this hardware model, we show that frame processing times depend on the computational load of the decoder and we provide an iterative algorithm to compute jointly frame processing times and decoding delay. Finally, we show that decoding delay analysis can be applied to design decoders with the objective of minimizing the communication latency of the MVC system. (C) 2013 Elsevier Inc. All rights reserved.

关键词： Three-dimensional video Multiview video coding Video conference Low latency decoding delay Parallel processing Graph theory Process scheduling

来源：评论

学校读者我要写书评

暂无评论

decoding delay Reduction in Broadcast Erasure Channels with Memory for Network Coding

Decoding Delay Reduction in Broadcast Erasure Channels with ...

引用

IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Karim, Mohammad S. Sadeghi, Parastoo Australian Natl Univ Res Sch Engn Canberra ACT 0200 Australia

ISBN: (纸本)9781467325691

This paper studies feedback based instantly decodable network coding with the aim of minimizing decoding delay per transmission over wireless broadcast erasure channels with memory. We model such channels with a Gilbert-Elliott two-state Markov model with good and bad states. We first present a weighted sum generalized instantly decodable network coding (G-IDNC) scheme, where the aim is to service a subset of receivers with expected good channel state. We then propose an improved variation of the weighted sum G-IDNC that appropriately targets a broader set of receivers (while giving initial priority to receivers with expected good channel state) to reduce decoding delay over a wider range of erasure channels with memory. Simulation results show that our proposed improved weighted sum G-IDNC algorithm always considerably outperforms an earlier approach in the literature for erasure channels with memory, namely the weighted sum strict instantly decodable network coding (S-IDNC).

关键词： Instantly decodable network coding decoding delay Integer linear programming Gilbert-Elliott channel

来源：评论

学校读者我要写书评

暂无评论

The Explicit decoding delay Probability Distribution Based on Random Linear Coding Scheme

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2013年第11期E96A卷 2299-2301页

作者： Zhao, Xubo Zhou, Hang Li, Xiaoping China Univ Petr Coll Sci Qingdao 266580 Shandong Peoples R China Xidian Univ ISN State Key Lab Xian 710071 Shanxi Peoples R China Univ Chinese Peoples Armed Police Force Xian 710086 Peoples R China

Under random linear coding (RLC) scheme, we present a simple expression of the probability distribution p(D = K) for decoding delay D incurred by the lossy channel, where K is a positive integer. In contrast with the previous contribution, our focus is firstly on deriving the cumulative distribution function of the discrete random variable D over a perfect channel. One benefit of such dispose is that, from the overall viewpoint, computing the cumulative distribution function of delay D can be related with calculating the cardinalities of sets of some special matrices, so that the former can be obtained from the latter. Moreover, our expression of the probability distribution is an explicit form, and is valid for any number of packets M, freewill field size q and arbitrary channel loss rate epsilon.

关键词： random linear coding lossy channel decoding delay

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：