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

Initialization Algorithms for convolutional network coding

IEEE TRANSACTIONS ON INFORMATION THEORY 2018年第7期64卷 5277-5295页

作者： Lvov, Maxim Permuter, Haim H. Ben Gurion Univ Negev Dept Elect & Comp Engn IL-84105 Beer Sheva Israel

We present algorithms for initializing a convolutional network coding (CNC) scheme in networks that may contain cycles. An initialization process for finding global encoding kernels (GEK) is needed if the network is unknown or if local encoding kernels are chosen randomly. During the initialization process every source node transmits basis vectors and every sink node gets the impulse response of the network. The impulse response is then used to find the GEK, which are needed for a decoding algorithm and to find the set of all achievable rates. We present two initialization algorithms that find the GEK and one algorithm that finds achievable rates from the GEK. In the first initialization algorithm it is assumed that we can perform a reset operation on the network at some fixed times, while the second algorithm does not operate under this assumption. Unlike acyclic networks, for which it is sufficient to transmit basis vectors one after another, the initialization of cyclic networks is more involved, as test symbols from different times interfere with each other and the impulse response is of infinite duration. Our algorithms use only a finite number of the initial values of the impulse response to find the full GEK. This is possible because a CNC scheme can be described by a state space representation and, using the Cayley-Hamilton theorem, it is possible to find its full impulse response from its initial values.

关键词： Cayley-Hamilton theorem convolutional network coding cyclic networks linear network coding system identification

来源：评论

学校读者我要写书评

暂无评论

The Minimum Decoding Delay for convolutional network coding

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2010年第8期E93A卷 1518-1523页

作者： Guo, Wangmei Cai, Ning Xidian Univ State Key Lab ISN Xian 710071 Peoples R China

In this paper, we derive a lower bound on the minimum decoding delay for convolutional network codes, which provides us with a guide line in the performance of decoding delay for convolutional network code decoders. The lower bound can be achievable by the sequential decoder introduced by E. Erez and F. Feder. Then we discuss the relationship between the network topology and the minimum decoding delay. Finally, we illustrate our results by an example.

关键词： convolutional network coding minimum decoding delay sequential decoder

来源：评论

学校读者我要写书评

暂无评论

Robust and Secure Secret Sharing in Wireless networks with convolutional network coding

Robust and Secure Secret Sharing in Wireless Networks with C...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Liang, Joyce Kuo, C. -C. Jay Univ Southern Calif Inst Signal & Image Proc Los Angeles CA 90089 USA Univ Southern Calif Inst Signal & Image Proc Ming Hsieh Dept Elect Engn Los Angeles CA 90089 USA

ISBN: (纸本)9781424456383

We investigate methods to enable robust and secure sharing among trusted peers in wireless erasure networks based on network coding (NC). The proposed communication model allows an eavesdropper to take advantage of the broadcast medium to successfully overhear messages transmitted along a min-cut. In situations where there is no secure capacity, we give a convolutional NC scheme that achieves weak secrecy to decrease the number of symmetric keys required. Furthermore, we demonstrate the fundamental duality between robustness and secrecy enforced by the wireless environment.

关键词： convolutional network coding secrecy robust secret sharing wireless erasure networks

来源：评论

学校读者我要写书评

暂无评论

Initialization Of convolutional network coding For Unknown networks

Initialization Of Convolutional Network Coding For Unknown N...

引用

International Symposium on network coding (NetCod)

作者： Lvov, Maxim Permuter, Haim H. Ben Gurion Univ Negev IL-84105 Beer Sheva Israel

ISBN: (纸本)9781479962174

We present algorithms for initializing networks that use a convolutional network coding scheme and that may contain cycles. During the initialization process every source node transmits basis vectors and every sink node measures the impulse response of the network. The impulse response is then used to find a relation between the transmitted and the received symbols, which is needed for a decoding algorithm and to find the set of all achievable rates. An initialization process is needed if the network is unknown or if local encoding kernels are chosen randomly. Unlike acyclic networks, for which it is enough to transmit basis vectors one after another, the initialization of cyclic networks is more complicated, as pilot symbols interfere with each other and the impulse response is of infinite duration.

关键词： Linear network coding cyclic networks convolutional network coding system identification

来源：评论

学校读者我要写书评

暂无评论

Improved Adaptive Random convolutional network coding Algorithm

引用

China Communications 2012年第11期9卷 63-69页

作者： Guo Wangmei Cai Ning Wang Xiao The Key Laboratory of Integrated Services Network Xidian UniversityXi'an 710071P.R.China

To address the issue of field size in random network coding, we propose an Improved Adaptive Random convolutional network coding (IARCNC) algorithm to considerably reduce the amount of occupied memory. The operation of IARCNC is similar to that of Adaptive Random convolutional network coding (ARCNC), with the coefficients of local encoding kernels chosen uniformly at random over a small finite field. The difference is that the length of the local encoding kernels at the nodes used by IARCNC is constrained by the depth; meanwhile, increases until all the related sink nodes can be decoded. This restriction can make the code length distribution more reasonable. Therefore, IARCNC retains the advantages of ARCNC, such as a small decoding delay and partial adaptation to an unknown topology without an early estimation of the field size. In addition, it has its own advantage, that is, a higher reduction in memory use. The simulation and the example show the effectiveness of the proposed algorithm.

关键词： convolutional network coding adaptive network coding algorithm random coding

来源：评论

学校读者我要写书评

暂无评论

Reliability and Latency Analysis of Sliding network coding With Re-Transmission

Reliability and Latency Analysis of Sliding Network Coding W...

引用

IEEE Wireless Communications and networking Conference (WCNC)

作者： Wu, Fangzhou Tan, Zhiyuan Zhu, Huiying Dong, Pengpeng Huawei Technol Co Ltd Wireless Network RAN Res Dept Shanghai Peoples R China

ISBN: (纸本)9781665491228

Future networks are expected to support various ultra-reliable low-latency communications via wireless links. To avoid the loss of packets and keep the low latency, sliding network coding (SNC) is an emerging technology by generating redundant packets that are the linear combination of the original data packets from the current block and some previous blocks. However, how to take the advantage of re-transmission for SNC is still an open problem since higher reliability could be achieved at the expense of large latency caused by round-trip time (RTT). To deal with this issue, in this paper, we consider the idea of adjusting the transmission phase and the number of the redundant packets for SNC with re-transmission. Specifically, If RTT is large, most of the redundant packets are sent at the first transmission, otherwise, re-transmission will be used. We first derive a concise and tight lower bound of the block error probability of SNC without re-transmission. Then, based on the bound, the theoretical expressions of the proposed retransmission schemes are derived regarding the block error probability, the average code length, and the average packet latency. Results show that the proposed SNC with re-transmission improves block error probability and keeps the low latency.

关键词： Average packet latency convolutional network coding first-block error probability re-transmission sliding network coding

来源：评论

学校读者我要写书评

暂无评论

Time-Variant Decoding of convolutional network Codes

引用

IEEE COMMUNICATIONS LETTERS 2012年第10期16卷 1656-1659页

作者： Guo, Wangmei Cai, Ning Sun, Qifu Tyler Xidian Univ State Key Lab Integrated Serv Networks Xian 710071 Peoples R China Chinese Univ Hong Kong Inst Network Coding Hong Kong Hong Kong Peoples R China

In this paper, a time-variant decoding model of a convolutional network code (CNC) is proposed. New necessary and sufficient conditions are established for the decodability of a CNC at a node r with delay L. They only involve the first L + 1 terms in the power series expansion of the global encoding kernel matrix at r. Concomitantly, a time-variant decoding algorithm is proposed with a decoding matrix over the base symbol field. The present time-variant decoding model only deals with partial information of the global encoding kernel matrix, and hence potentially makes CNCs applicable in a decentralized manner.

关键词： network coding time-variant decoding convolutional network coding

来源：评论

学校读者我要写书评

暂无评论

A 3D-DCT and convolutional FEC Approach to Agile Video Streaming 19

A 3D-DCT and Convolutional FEC Approach to Agile Video Strea...

引用

19th IEEE International Conference on Mobile Ad Hoc and Smart Systems (MASS)

作者： Yang, Han Chen, Xiangyu Chen, Xi Guo, Bin Liu, Shaoteng Zhu, Xia Li, Zongpeng Tsinghua Univ Beijing Peoples R China Huawei Shenzhen Peoples R China Chinatelecom Cloud Beijing Peoples R China

ISBN: (数字)9781665471800

ISBN: (纸本)9781665471800

On today's Internet, including both wide area networks and wireless access networks, multimedia content (images, audio and video) represents a dominating fraction of network data traffic. Efficient encoding and transmission of multimedia data are of considerable importance to smooth operation of the network as well as quality of experience of network users. Wireless users particularly prefer algorithms that are both robust, and lightweight in terms of computation and communication. This work takes a holistic approach to source compression and network transmission of videos. A 3D-DCT module is employed for spatio-temporal compression of pixel cubes, working in concert with a convolutional network coding module, for unequal error protection and forward error correction. We outline the overall framework for such a joint algorithm design, discuss detailed algorithm blocks, while many interesting design choices are still open for future exploration.

关键词： 3D-DCT video compression video streaming FEC convolutional network coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：