Open AccessOptimised design and tree analysis of regularised variable‐node BATS codes
Author(s) -
Xiang Mian,
Yi Benshun,
Tan Jianjun,
Zhu Li,
Zhou Anan
Publication year - 2020
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2020.0030
Subject(s) - decoding methods , node (physics) , overhead (engineering) , luby transform code , computer science , fountain code , online codes , variable (mathematics) , tree (set theory) , transmission (telecommunications) , encoding (memory) , erasure , erasure code , algorithm , degree (music) , raptor code , sequential decoding , mathematics , concatenated error correction code , block code , telecommunications , artificial intelligence , engineering , combinatorics , mathematical analysis , physics , structural engineering , acoustics , programming language , operating system
In this Letter, the authors investigate a modified encoding scheme of batched sparse (BATS) codes to improve the erasure floor performance. In the proposed regularised variable‐node (RBATS) codes, variable‐node degrees are regularised to maximise the minimum degree for transmission. The asymptotical decoding performance of RBATS codes is analysed by a tree‐based analysis. Furthermore, they optimise check‐node degree distribution of RBATS codes to decrease decoding overhead according to the decoding condition. It is demonstrated through simulation results that the optimised RBATS codes can not only lower the transmission overhead but also improve erasure floor performance compared with traditional BATS codes.