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

23nd Signal Processing and Communications Applications Conference (SIU)

作者： Khan, Rida Kurt, Gunes Karabulut Altunbas, Ibrahim Istanbul Tech Univ Dept Elect & Commun Wireless Commun Res Lab Istanbul Turkey

ISBN: (纸本)9781467373869

Network coding allows a significant increase in throughput in multicast and broadcast scenarios;by letting intermediate nodes between data sources and destinations forward a coded version of incoming packets. Random network coding is a type of network coding in which the coefficients used to encode the data packets are randomly extracted from a Galois field. Hence, it can be used in a network where the network topology is unknown. In a network coded system with practical wireless communication links, a decoding error at the destination may be observed due to linearly dependent coefficient vectors or due to missing packets at the intermediate relays because of fading channel characteristics. Taking these factors into account, in this paper we have analyzed the impact of Rayleigh and Rician fading channels on the performance of a random network coded systems.

关键词： Random linear network coding decoding failure probability Rayleigh fading Rician fading

来源：评论

学校读者我要写书评

暂无评论

Rateless Coded Blockchain for Dynamic IoT Networks

引用

IEEE INTERNET OF THINGS JOURNAL 2024年第6期11卷 10695-10708页

作者： Yang, Changlin Ashikhmin, Alexei Wang, Xiaodong Zheng, Zibin Sun Yat sen Univ Sch Software Engn Zhuhai 519000 Guangdong Peoples R China Nokia Bell Labs Commun & Stat Sci Res Dept Murray Hill NJ 07974 USA Columbia Univ Elect Engn Dept New York NY 10027 USA

A key constraint that limits the implementation of blockchain in Internet of Things (IoT) is its large storage requirement resulting from the fact that each blockchain node has to store the entire blockchain. This increases the burden on blockchain nodes, and increases the communication overhead for new nodes joining the network since they have to copy the entire blockchain. In order to reduce storage requirements without compromising on system security and integrity, coded blockchains, based on error correcting codes with fixed rates and lengths, have been recently proposed. This approach, however, does not fit well with dynamic IoT networks in which nodes actively leave and join. In such dynamic blockchains, the existing coded blockchain approaches lead to high-communication overheads for new joining nodes and may have high-decoding failure probability. This article proposes a rateless coded blockchain with coding parameters adjusted to network conditions. Our goals are to minimize both the storage requirement at each blockchain node and the communication overhead for each new joining node, subject to a target decoding failure probability. We evaluate the proposed scheme in the context of real-world Bitcoin blockchain and show that both storage and communication overhead are reduced by 99.6% with a maximum 10(-12) decoding failure probability.

关键词： Coded blockchain decoding failure probability dynamic Internet of Things (IoT) networks rateless code storage reduction

来源：评论

学校读者我要写书评

暂无评论

Bounds on the Finite-Length RaptorQ Codes Under Maximum Likelihood decoding 6th

Bounds on the Finite-Length RaptorQ Codes Under Maximum Like...

引用

6th International Conference on Communications, Signal Processing, and Systems (ICCSPS)

作者： Zhang, Ke Jiao, Jian Gu, Shushi Wu, Shaohua Zhang, Qinyu Harbin Inst Technol Commun Engn Res Ctr Shenzhen Guangdong Peoples R China

ISBN: (纸本)9789811065712;9789811065705

In this paper, we analysis the maximum likelihood (ML) decoding failure probability (DFP) of finite length RaptorQ codes with a high-order low density generator-matrix (LDGM) code as the pre-code. By investigating the rank of the product of two random coefficient matrices, we derive upper and lower bounds of DFP on the RaptorQ codes under ML decoding algorithm. Finally, we verify the accuracy of derived theoretical bounds through the Monte Carlo simulations with different degree distributions. The high accuracy bounds can be used to design near-optimum RaptorQ codes with short and moderate lengths.

关键词： Massive Machine-to-Machine (mM2M) communications RaptorQ codes Maximum likelihood decoding decoding failure probability

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Finite Length Non-Binary Raptor Codes under Ordered Statistics Decoder 90

Performance Analysis of Finite Length Non-Binary Raptor Code...

引用

90th IEEE Vehicular Technology Conference (IEEE VTC-Fall)

作者： Li, Lianqin Zhang, Ke Jiao, Jian Sun, Yunyu Wu, Shaohua Wang, Ye Zhang, Qinyu Harbin Inst Technol Shenzhen Commun Engn Res Ctr Shenzhen 518055 Peoples R China Peng Cheng Lab Shenzhen 518055 Peoples R China

ISBN: (纸本)9781728112206

Raptor code is the current standard of 4G long term evolution (LTE) evolved multimedia broadcast and multi-cast services (eMBMS), which is viewed as a potential approach in the design of ultra-reliable low latency communications (uRLLC) for 5G. This paper analyzes the performance of finite length non-binary (over finite field of order q, GF(q)) Raptor codes under ordered statistics decoder (OSD) towards uRLLC, where the non-binary Raptor code ensembles by a non-binary low density parity-check (LDPC) code as pre-code and a non-binary inner Luby transform (LT) code. Moreover, by investigating the property of code structure and decoding algorithm, an upper bound of decoding failure probability (DFP) of finite length non-binary Raptor code under OSD is derived. Simulation results validate the accuracy of our derived upper bound, and demonstrate that our non-binary Raptor codes can achieve 10(-5) DFP with block length 128 bits at SNR 3.6 dB.

关键词： Non-binary Raptor codes finite length ordered statistics decoder decoding failure probability upper bound

来源：评论

学校读者我要写书评

暂无评论

Bounds on the Reliability of RaptorQ Codes in the Finite-Length Regime

引用

IEEE ACCESS 2017年 5卷 24766-24774页

作者： Zhang, Ke Zhang, Qinyu Jiao, Jian Harbin Inst Technol Shenzhen Commun Engn Res Ctr Guangzhou 518055 Guangdong Peoples R China

In this paper we analyze the bounds on the reliability of RaptorQ codes under maximum likelihood decoding, especially in the finite-length regime. RaptorQ code ensembles by a high-order low density generator-matrix (LDGM) code as pre-code and an inner Luby transform (LT) code. By investigating the rank of the product of two random coefficient matrices of the high-order LDGM code and the inner LT code, we derive the expressions for the upper and lower bounds of decoding failure probability (DFP) on the RaptorQ code. Then, the accuracy of our derived theoretical bounds are verified through the Monte Carlo simulations with different degree distributions and short packets. The high accuracy bounds are then exploited to design near-optimum finite-length RaptorQ codes, enabling a tight control on the tradeoff between decoding complexity and DFP.

关键词： Finite-length RaptorQ codes maximum likelihood decoding decoding failure probability theoretical bounds

来源：评论

学校读者我要写书评

暂无评论

Deadline-Aware Opportunistic Network Coding for Multi-Relay-Aided Single-Source Single-Destination Network

引用

IEEE COMMUNICATIONS LETTERS 2017年第10期21卷 2282-2285页

作者： Hu, Guojie Xu, Kui Xu, Youyun PLA Univ Sci & Technol Coll Commun Engn Nanjing 210007 Jiangsu Peoples R China Nanjing Univ Posts & Telecommun Coll Telecommun & Informat Engn Nanjing 210046 Jiangsu Peoples R China

An opportunistic network coding (NC) scheme is proposed for the multi-relay-aided single-source single-destination network with transmission deadline. With the help of matrix analysis, the lower bound of decoding failure probability of the proposed scheme is given. Simulation results show that: 1) the proposed scheme outperforms NC based on direct recoding scheme and the lower bound is tight when the source-to-relay channel erasure probability is relatively small and 2) given fixed network parameters, the optimal number of systematic packets delivered within deadline could be determined by using the derived bound for maximizing the throughput.

关键词： Deadline-aware decoding failure probability network coding opportunistic decoding direct recoding

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Raptor Codes Under Maximum Likelihood decoding

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2016年第3期64卷 906-917页

作者： Wang, Peng Mao, Guoqiang Lin, Zihuai Ding, Ming Liang, Weifa Ge, Xiaohu Lin, Zhiyun Univ Sydney Sch Elect & Informat Engn Darlington NSW 2008 Australia NICTA Sydney NSW 2015 Australia Univ Technol Sydney Sch Comp & Commun Sydney NSW 2007 Australia Data61 Sydney NSW Australia Beijing Univ Posts & Telecommun Beijing 100088 Peoples R China Huazhong Univ Sci & Technol Wuhan 430074 Peoples R China Australian Natl Univ Res Sch Comp Sci Canberra ACT 0200 Australia Huazhong Univ Sci & Technol Sch Elect & Informat Engn Wuhan 430074 Peoples R China Zhejiang Univ Coll Elect Engn Hangzhou 310027 Zhejiang Peoples R China

In this paper, we analyze the maximum likelihood decoding performance of Raptor codes with a systematic low-density generator-matrix code as the pre-code. By investigating the rank of the product of two random coefficient matrices, we derive upper and lower bounds on the decoding failure probability. The accuracy of our analysis is validated through simulations. Results of extensive Monte Carlo simulations demonstrate that for Raptor codes with different degree distributions and pre-codes, the bounds obtained in this paper are of high accuracy. The derived bounds can be used to design near-optimum Raptor codes with short and moderate lengths.

关键词： Raptor codes asymptotic analysis maximum likelihood (ML) decoding decoding failure probability

来源：评论

学校读者我要写书评

暂无评论

Merge-and-forward: a cooperative multimedia transmissions protocol using RaptorQ codes

引用

IET COMMUNICATIONS 2016年第15期10卷 1884-1895页

作者： Gul, Muhammad Talha Ali, Amjad Singh, Deepak Kumar Imtinan, Umera Raza, Imran Hussain, Syed Asad Suh, Doug Young Lee, Jong-wook Kyung Hee Univ Dept Elect & Radio Engn Coll Elect & Informat Yongin 446701 Gyeonggi Do South Korea COMSATS Inst Informat Technol Dept Comp Sci Commun & Networks Res Ctr Lahore Pakistan

Recently, nodes cooperation has emerged as a popular means for improving the quality of multimedia delivery over fifth-generation cellular networks. However, in the conventional relaying scheme such as amplify-and-forward (AaF), there is a higher probability of duplicate packets at the receiver node which affect the decoding probability and consequently deteriorate the quality of multimedia transmission. In this study, the authors propose a cooperative multimedia transmission protocol based on a novel merge-and-forward relaying and the best relay selection (RS) schemes. Their best RS scheme is based on two important parameters: (i) two-hop link distances and (ii) minimum block error rate value. Moreover, to combat the packet loss for enhanced and reliable video delivery, they adopt application layer forward error correction scheme which is based on the most improved and advanced version of fountain codes (i.e. RaptorQ codes). They evaluate the performance of the proposed scheme under different time-sharing scenarios between the direct and best indirect transmission links in terms of decoding failure probability, decoding overhead, peak signal-to-noise ratio, and mean opinion score. Simulation results show that the proposed scheme outperforms the conventional AaF relaying scheme.

关键词： cooperative communication multimedia communication protocols relay networks (telecommunication) telecommunication network reliability error correction codes forward error correction decoding probability cooperative multimedia transmissions protocol RaptorQ code multimedia delivery fifth-generation cellular network amplify-and-forward relaying scheme merge-and-forward relaying scheme RS scheme two-hop link distance minimum block error rate value application layer forward error correction scheme fountain code decoding failure probability signal-to-noise ratio mean opinion score AaF relaying scheme

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：