Fast degree-distribution optimization for BATS codes

Abstract

A complexity-reduced fast successive cancellation list decoder for polar codes SCIENCE CHINA Information Sciences 61, 022309 (2018); The lower and upper bounds of the degree distribution of a graded algebra SCIENCE CHINA Mathematics 56, 983 (2013); Low-degree root-MUSIC algorithm for fast DOA estimation based on variable substitution technique SCIENCE CHINA Information Sciences 63, 159206 (2020); Period distribution of generalized B-J codes and constructions of cyclically permutable (CP ) codesAbstract 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.

Intelligent cognitive spectrum collaboration: Convergence of spectrum sensing, spectrum access, and coding technology

“…[91] proposed a greedy method to find the optimal degree distribution for finite original symbols. Reference [92] used prior information on better degree distribution to greatly reduce the number of optimization variables.…”