Optimised design and tree analysis of regularised variable‐node BATS codes | Zendy

Xiang Mian | Zendy; Yi Benshun | Zendy; Tan Jianjun | Zendy; Zhu Li | Zendy; Zhou Anan | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Optimised 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) - variable (mathematics) , tree (set theory) , node (physics) , computer science , mathematics , algorithm , engineering , combinatorics , structural engineering , mathematical analysis

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research