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

A Polynomial Formula for Finite-Length bats code Performance

IEEE COMMUNICATIONS LETTERS 2017年第2期21卷 222-225页

作者： Zhao, Huakai Yang, Shenghao Dong, Guangliang Beijing Inst Tracking & Commun Technol Beijing 100094 Peoples R China Chinese Univ Hong Kong Sch Sci & Engn Shenzhen 518172 Peoples R China

Batched sparse (bats) codes have been proposed for communication through networks with packet loss. bats codes include a matrix generalization of fountain codes as the outer code and random linear network coding at the intermediate network nodes as the inner code. bats codes, however, do not possess a universal degree distribution that achieves the optimal rate for any distribution of the transfer matrix ranks, so that fast performance evaluation of finite-length bats codes is important for optimizing the degree distribution. The state-of-the-art finite-length performance evaluation method has a computational complexity of O(K(2)n(2)M), where K, n, and M are the number of input symbols, the number of batches, and the batch size, respectively. We propose a polynomial-form formula for finite-length bats codes performance evaluation with the computational complexity of O(K(2)n ln n). Numerical results demonstrate that the polynomial-form formula can be significantly faster than the previous methods.

关键词： Network coding bats code finite-length analysis LT code belief propagation polynomial form

来源：评论

学校读者我要写书评

暂无评论

Expanding-Window bats code With Intermediate Feedback

引用

IEEE COMMUNICATIONS LETTERS 2018年第9期22卷 1750-1753页

作者： Xiang, Mian Yi, Benshun Qiu, Kang Huang, Taiqi Wuhan Univ Dept Sch Elect Informat Wuhan 430072 Hubei Peoples R China Wuhan Univ Shenzhen Inst Shenzhen 518000 Peoples R China China Elect Technol Grp Corp Res Inst 28 Nanjing 210007 Jiangsu Peoples R China

In this letter, we investigate feedback in expanding window bats (EW-bats) code. A single intermediate message is fed back to inform the more important packets have been decoded completely. The asymptotic decoding probabilities of various types of input packets with the proposed feedback expanding window bats (FEW-bats) code is analyzed via And-Or tree evaluation, we also optimized the degree distribution for FEW-bats code based on the analytical results. Simulation results show that the proposed FEW-bats code can decrease average overhead of successful decoding in less important packets and has no affect to decoding performance of more important packets.

关键词： bats code unequal error protection And-Or tree analysis feedback

来源：评论

学校读者我要写书评

暂无评论

RESEARCH ON A SLIDING WINDOW bats code METHOD 17

RESEARCH ON A SLIDING WINDOW BATS CODE METHOD

引用

17th IEEE International Computer Conference on Wavelet Active Media Technology and Information Processing (ICCWAMTIP)

作者： Zhuo Yongning Zhou Xiaoxue Wang Qin Zou Zongzheng Wang Si Liu Yun Univ Elect Sci & Technol China Natl Key Lab Sci & Technol Commun Chengdu 611731 Peoples R China Fudan Univ Sch Comp Sci Shanghai 201203 Peoples R China Shanghai Acad Spaceflight Technol Beijing R&D Ctr Beijing 100048 Peoples R China 54th Res Inst China Elect Technol Grp Corp Beijing R&D Ctr Beijing 100070 Peoples R China

ISBN: (数字)9781665405058

ISBN: (纸本)9780738142593

Aimed to realize reliable but time efficient data transmission in vulnerable space environment, an optimized sliding window transmission method based on bats code (Batched Sparse code) is proposed. In the scheme the unequal sliding step length of the window are used. While the small degree Batches are used to encode the data in the non-overlapping part of the window, the big degree Batches are used to encode the data in whole sliding window, and the probability distribution of the Batch degree is optimized through a heuristic algorithm. The results of the simulation experiment show that compared with the traditional successive sliding window, the transmission efficiency of our method is significantly improved, while the reliability is maintained at a similar level as the traditional method, hence the trade-off between the transmission reliability and time efficiency is improved.

关键词： bats code Fountain coding Network coding Sliding window Space communication

来源：评论

学校读者我要写书评

暂无评论

An Improved Sliding Window bats code 11

An Improved Sliding Window BATS Code

引用

11th International Symposium on Topics in Coding (ISTC)

作者： Jayasooriya, Sachini Yuan, Jinhong Xie, Yixuan Univ New South Wales Sch Elect Engn & Telecommun Sydney NSW Australia

ISBN: (纸本)9781665409438

Batched sparse (bats) codes, a class of random linear network coding, are proposed to transmit a collection of packets through erasure networks. bats codes generalize the fountain codes and preserve properties such as ratelessness and low encoding/decoding complexity. In bats codes, the destination node starts decoding information packets only after receiving a sufficient number of coded packets. This induces a latency. The larger the size of information block is, the longer the latency. In this paper, we apply a sliding window framework over bats codes, that divides the information block into smaller sub-blocks, thus helping to reduce the latency. In the proposed sliding window bats coding scheme, multiple degree distributions are designed based on the overlapping pattern of input packets in a window, and coded packets are generated accordingly. Based on asymptotic performance analysis, we formulate a heuristic optimization problem to jointly optimize the degree distribution and the window selection probability for each sub-window. Simulation results show that the proposed sliding window bats code outperforms the standard bats codes and existing sliding window bats codes in terms of overhead and latency.

关键词： bats code network coding sliding window

来源：评论

学校读者我要写书评

暂无评论

Finite-Length Analysis of bats codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2018年第1期64卷 322-348页

作者： Yang, Shenghao Ng, Tsz-Ching Yeung, Raymond W. Chinese Univ Hong Kong Sch Sci & Engn Shenzhen 518172 Peoples R China Shenzhen Res Inst Big Data Shenzhen 518172 Peoples R China SUNY Stony Brook Dept Appl Math & Stat Stony Brook NY 11794 USA Chinese Univ Hong Kong Inst Network Coding Hong Kong Hong Kong Peoples R China Chinese Univ Hong Kong Dept Informat Engn Hong Kong Hong Kong Peoples R China

bats codes were proposed for communication through networks with packet loss. A bats code consists of an outer code and an inner code. The outer code is a matrix generation of a fountain code, which works with the inner code that comprises random linear coding at the intermediate network nodes. In this paper, the performance of finite-length bats codes is analyzed with respect to both belief propagation (BP) decoding and inactivation decoding. Our results enable us to evaluate efficiently the finite-length performance in terms of the number of batches used for decoding ranging from 1 to a given maximum number, and provide new insights on the decoding performance. Specifically, for a fixed number of input symbols and a range of the number of batches used for decoding, we obtain recursive formulae to calculate the stopping time distribution of BP decoding and the inactivation probability in inactivation decoding. We also find that both the failure probability of BP decoding and the expected number of inactivations in inactivation decoding can be expressed in a power-sum form where the number of batches appears only as the exponent. This power-sum expression reveals clearly how the decoding failure probability and the expected number of inactivation decrease with the number of batches. When the number of batches used for decoding follows a Poisson distribution, we further derive recursive formulas with potentially lower computational complexity for both decoding algorithms. For the BP decoder that consumes batches one by one, three formulae are provided to characterize the expected number of consumed batches until all the input symbols are decoded.

关键词： Network coding fountain code LT code raptor code bats code finite-length analysis belief propagation inactivation decoding degree-distribution optimization error probability error exponent

来源：评论

学校读者我要写书评

暂无评论

Tree Analysis of bats codes

引用

IEEE COMMUNICATIONS LETTERS 2016年第1期20卷 37-40页

作者： Yang, Shenghao Zhou, Qiaoqiao Chinese Univ Hong Kong Sch Sci & Engn Shenzhen 518172 Peoples R China Chinese Univ Hong Kong Inst Network Coding Shatin Hong Kong Peoples R China

bats codes are a class of efficient random linear network codes. In this letter, bats codes are generalized to incorporate batches of different sizes, and the corresponding belief propagation (BP) decoding performance is studied. Using a tree-based analysis, a sufficient condition is obtained such that the BP decoder can recover a given fraction of the input symbols with high probability. Some assumptions in the previous works are relaxed in our analysis so that the analytical results can be applied to more general scenarios.

关键词： Linear network coding bats code belief propagation tree analysis

来源：评论

学校读者我要写书评

暂无评论

Design and Optimization of LDPC Precoded Finite-Length bats codes Under BP Decoding

引用

IEEE COMMUNICATIONS LETTERS 2023年第12期27卷 3151-3155页

作者： Zhang, Wenrui Zhu, Mingyang Jiang, Ming Hu, Nan Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Peoples R China Purple Mt Labs Nanjing 211111 Peoples R China Inst Wireless & Terminal Technol Beijing 100053 Peoples R China China Mobile Res Inst Beijing 100053 Peoples R China

In this letter, we focus on the finite-length batched sparse (bats) codes with low-density parity-check (LDPC) precoding and the design method of degree distributions, which can significantly improve the error-correcting performance of belief propagation (BP) decoding. In this coding scheme, the received batches and parity-check equations of LDPC precoding are decoded by a joint BP decoder. We propose a design approach for the degree distributions of precoded bats codes, which is based on the finite-length analysis of bats codes and the threshold computation of LDPC codes. Although the proposed coding scheme is theoretically suboptimal for a joint BP decoder, simulation results verified that a significantly large gain can be achieved by our design method.

关键词： bats code LDPC code finite-length analysis BP decoding

来源：评论

学校读者我要写书评

暂无评论

Two-Phase Cooperative Broadcasting Based on Batched Network code

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2016年第2期64卷 706-714页

作者： Xu, Xiaoli Kumar, Meenakshi Sundaram Gandhi Praveen Guan, Yong Liang Chong, Peter Han Joo Nanyang Technol Univ Sch Elect & Elect Engn Singapore 639798 Singapore

In this paper, we consider the wireless broadcasting scenario with a source node sending some common information to a group of closely located users, where each link is subject to certain packet erasures. To ensure reliable information reception by all users, the conventional approach generally requires repeated transmission by the source until all the users are able to decode the information, which is inefficient in many practical scenarios. In this paper, by exploiting the close proximity among the users, we propose a novel two-phase wireless broadcasting protocol with user cooperations based on an efficient batched network code, known as batched sparse (bats) code. In the first phase, the information packets are encoded into batches with bats encoder and sequentially broadcasted by the source node until certain terminating criterion is met. In the second phase, the users cooperate with each other by exchanging the network-coded information via peer-to-peer (P2P) communications based on their respective received packets. A fully distributed and light-weight scheduling algorithm is proposed to improve the efficiency of the P2P communication in the second phase. The performance of the proposed two-phase protocol is analyzed and the channel rank distribution at the instance of decoding is derived, based on which the optimal bats code is designed. Simulation results show that the proposed protocol outperforms most existing cooperative packet exchange schemes, especially when the inter-user links are not reliable. Lastly, the performance of the proposed scheme is further verified via testbed experiments.

关键词： bats code P2P communications cooperative broadcasting scheduling channel rank distribution

来源：评论

学校读者我要写书评

暂无评论

Coding for a Network coded Fountain

Coding for a Network Coded Fountain

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Yang, Shenghao Yeung, Raymond W. Chinese Univ Hong Kong Inst Network Coding Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781457705953

Batched sparse (bats) codes are proposed for transmitting a collection of packets through communication networks employing linear network coding. bats codes generalize fountain codes and preserve the properties such as ratelessness and low encoding/decoding complexity. Moreover, the buffer size and the computation capability of the intermediate network nodes required to apply bats codes are independent of the number of packets for transmission. It is verified theoretically for certain cases and demonstrated numerically for the general cases that bats codes achieve rates very close to the capacity of linear operator channels.

关键词： bats code Complexity theory Decoding Encoding Generators Network coding Optimization Peer to peer computing batched sparse code communication complexity communication networks computation capability decoding encoding-decoding complexity fountain codes intermediate network nodes linear codes linear network coding linear operator channel network coding packet transmission telecommunication channels

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：