Fast degree-distribution optimization for BATS codes  

作　　者：Huakai ZHAO Shenghao YANG Guinian FENG 

机构地区：[1]Beijing Satellite Navigation Center, Beijing 100094, China [2]The Chinese University of Hong Kong, Shenzhen 518172, China [3]Beijing Institute of Tracking and Communication Technology, Beijing 100094, China

出　　处：《Science China(Information Sciences)》2017年第10期120-134,共15页中国科学（信息科学）（英文版）

基　　金：supported by Delay/Disruption Tolerant Communication Technology of the Chinese Academy of Sciences(Grant No.2015AA703405A);National Natural Science Foundation of China(Grant No.61471215)

摘　　要：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 an optimal rate for any distribution of the transfer matrix ranks. Therefore, it is important to have a fast degree-distribution optimization approach for finite-length BATS codes. In this paper, we propose the concept of batch release probability （BRP）, and demonstrate some characteristics of BRPs from the degree distributions achieving nearly optimal performance. Based on these BRP characteristics, we propose a novel degree-distribution optimization approach that achieves the similar decoding performance with a much shorter optimization time, compared with the previous approach. Moreover, the universality of BRPs observed in this paper can further simplify the degree-distribution optimization of BATS codes.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 an optimal rate for any distribution of the transfer matrix ranks. Therefore, it is important to have a fast degree-distribution optimization approach for finite-length BATS codes. In this paper, we propose the concept of batch release probability （BRP）, and demonstrate some characteristics of BRPs from the degree distributions achieving nearly optimal performance. Based on these BRP characteristics, we propose a novel degree-distribution optimization approach that achieves the similar decoding performance with a much shorter optimization time, compared with the previous approach. Moreover, the universality of BRPs observed in this paper can further simplify the degree-distribution optimization of BATS codes.

关 键 词：network coding batched sparse （BATS） code finite-length analysis degree distribution batch release probability OPTIMIZATION 

分 类 号：TN911.2[电子电信—通信与信息系统]