时变信道下线性网络分批稀疏码秩分布研究

doi:10.11959/j.issn.1000-0801.2022096

Abstract

Abstract:

As a two-step coding technique applied in multi-hop networks with a low complexity, the transmission performance of batched sparse (BATS) code was directly related to the rank distribution of the transfer matrix.Based on the assumption that the packet loss rate of each link on the erasure channel was constant, the rank distribution of the batch sparse codes on the erasure correction channel had been widely studied.However, in some scenarios such as the industrial Internet, a large number of mobile nodes were deployed in the whole network, which may cause the channels among nodes to become time-varying, that was, the packet loss rate on the link may vary with time.Therefore, under the assumption that the link packet loss rate between nodes in the network changes randomly, the rank distribution of batched sparse code transmission matrix was studied when random linear network coding (RLNC) and system recoding were used as inner coding schemes, and the closed solution of normalized rank expectation was deduced when the link packet loss rate obeyed the finite interval normal distribution.The correctness of the closed solutions was verified by Monte Carlo simulation.

Key words: BATS code, random linear network coding, system recoding, rank distribution, time-variant channel

CLC Number:

TN911

Shiheng WANG, Heng LIU, Lin TANG, Jinling SU, Ruiqi ZHANG. Analysis for rank distribution of BATS codes under time-variant channels[J]. Telecommunications Science, 2022, 38(5): 64-74.

Figures/Tables 10

References 20

[1]	AHLSWEDE R , CAI N , LI S Y R ,et al. Network information flow[J]. IEEE Transactions on Information Theory, 2000,46(4): 1204-1216.
[2]	HO T , MEDARD M , KOETTER R ,et al. A random linear network coding approach to multicast[J]. IEEE Transactions on Information Theory, 2006,52(10): 4413-4430.
[3]	YANG S H , YEUNG R W . Batched sparse codes[J]. IEEE Transactions on Information Theory, 2014,60(9): 5322-5346.
[4]	HO T , KOETTER R , MEDARD M ,et al. The benefits of coding over routing in a randomized setting[C]// Proceedings of IEEE International Symposium on Information Theory,2003. Piscataway:IEEE Press, 2003:442.
[5]	SHRADER B , EPHREMIDES A . A queueing model for random linear coding[C]// Proceedings of MILCOM 2007 - IEEE Military Communications Conference. Piscataway:IEEE Press, 2007: 1-7.
[6]	YUE J , XIAO M , PANG Z B . Distributed BATS-based schemes for uplink of industrial Internet of Things[C]// Proceedings of ICC 2019 - 2019 IEEE International Conference on Communications. Piscataway:IEEE Press, 2019: 1-6.
[7]	YANG S H , YEUNG R W . BATS codes:theory and practice[J]. Synthesis Lectures on Communication Networks, 2017,10(2): 1-226.
[8]	杨旭, 肖子玉, 张明 ,等. 5G核心网面向3GPP R16演进关键技术及引入策略[J]. 电信科学, 2021,37(6): 150-159.
	YANG X , XIAO Z Y , ZHANG M ,et al. Key technologies and introduction strategies for 3GPP R16 oriented evolution of 5G core network[J]. Telecommunications Science, 2021,37(6): 150-159.
[9]	YANG S H , YEUNG R W , CHEUNGJ H F ,et al. BATS:Network coding in action[C]// Proceedings of 2014 52nd Annual Allerton Conference on Communication,Control,and Computing (Allerton). Piscataway:IEEE Press, 2014: 1204-1211.
[10]	YIN H H F , YANG S H , ZHOU Q Q ,et al. Adaptive recoding for BATS codes[C]// Proceedings of 2016 IEEE International Symposium on Information Theory. Piscataway:IEEE Press, 2016: 2349-2353.
[11]	XIAO M , SKOGLUND M . On network coding with finite channel state information[C]// Proceedings of 2011 8th International Symposium on Wireless Communication Systems. Piscataway:IEEE Press, 2011: 487-491.
[12]	XU X L , GUAN Y L , ZENG Y ,et al. Quasi-universal BATS code[J]. IEEE Transactions on Vehicular Technology, 2017,66(4): 3497-3501.
[13]	FEIZI S , LUCANI D E , S?RENSEN C W ,et al. Tunable sparse network coding for multicast networks[C]// Proceedings of 2014 International Symposium on Network Coding (NetCod). Piscataway:IEEE Press, 2014: 1-6.
[14]	LI Y , SOLJANIN E , SPASOJEVIC P . Effects of the generation size and overlap on throughput and complexity in randomized linear network coding[J]. IEEE Transactions on Information Theory, 2011,57(2): 1111-1123.
[15]	WANG M A , LI B C . How practical is network coding?[C]// Proceedings of 200614th IEEE International Workshop on Quality of Service. Piscataway:IEEE Press, 2006: 274-278.
[16]	MAHDAVIANI K , ARDAKANI M , BAGHERI H ,et al. Gamma Codes:a low-overhead linear-complexity network coding solution[C]// Proceedings of 2012 International Symposium on Network Coding (NetCod). Piscataway:IEEE Press, 2012: 125-130.
[17]	SEHAT H , PAHLEVANI P . An analytical model for rank distribution in sparse network coding[J]. IEEE Communications Letters, 2019,23(4): 556-559.
[18]	LI X L , MOW W H , TSANG F L . Singularity probability analysis for sparse random linear network coding[C]// Proceedings of 2011 IEEE International Conference on Communications. Piscataway:IEEE Press, 2011: 1-5.
[19]	LI X L , MOW W H , TSANG F L . Rank distribution analysis for sparse random linear network coding[C]// Proceedings of 2011 International Symposium on Networking Coding. Piscataway:IEEE Press, 2011: 1-6.
[20]	TANG L , LIU H , YANG L ,et al. Analysis for rank distribution of BATS codes under time-variant channels[C]// Proceedings of 2020 IEEE 91st Vehicular Technology Conference. Piscataway:IEEE Press, 2020: 1-5.

Metrics

Recommended 0

No Suggested Reading articles found!

参数	描述	取值
μ	有限区间分布的均值	0.2
a	有限区间分布的半区间长度	0.13
k	有限区间正态分布阶数	0, 1, 2, 3
q_m	基域	2, 256
M	批大小	8, 16, 32

Analysis for rank distribution of BATS codes under time-variant channels

RichHTML

PDF下载

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 10

References 20

Related Articles 15

Metrics

Recommended 0

[1]	Haoyu ZHANG, Li YAO, Chaoxu CHEN, Jianyang SHI, Chao SHEN, Nan CHI. Application of BO-BiGRU based post equalizer in high-speed underwater visible light communication system [J]. Telecommunications Science, 2023, 39(5): 11-19.
[2]	Yue QIAO, Yusun FU, Muyun YUAN, Jinhui TANG. Research and development of degree distribution in the rateless code [J]. Telecommunications Science, 2022, 38(10): 1-19.
[3]	Jianhui CAI, Guangqiu LI, Yanxu DUAN. MBER power allocation for joint precoding and space-time coding GFDM [J]. Telecommunications Science, 2021, 37(12): 25-31.
[4]	Jianhui CAI, Guangqiu LI, Jingjie SHEN. Low complexity algorithm for PAPR reduction in GFDM system [J]. Telecommunications Science, 2021, 37(4): 82-89.
[5]	Xuan YU, Xuan GENG. A reduced-complexity compressed sensing channel estimation for underwater acoustic channel [J]. Telecommunications Science, 2021, 37(3): 114-124.
[6]	Jie ZHANG, Lihua YANG, Zenghao WANG, Bo HU, Qian NIE. A novel deep learning based time-varying channel prediction method [J]. Telecommunications Science, 2021, 37(1): 39-47.
[7]	Jiafeng QIU. Optimized BM3D for mmWave massive MIMO channel estimation [J]. Telecommunications Science, 2020, 36(9): 44-50.
[8]	Jiafeng QIU. Low-complexity beamspace channel estimation for wideband millimeter-wave massive MIMO system [J]. Telecommunications Science, 2020, 36(8): 122-129.
[9]	Ning HUI,Jie WU,Yiqing ZHOU,Ling LIU,Zhengang PAN. Future vehicular fog computing networks [J]. Telecommunications Science, 2020, 36(6): 14-27.
[10]	Rui GUO,Fanchun RAN. Polar codes decoding algorithm based on convolutional neural network [J]. Telecommunications Science, 2020, 36(6): 119-124.
[11]	Jiafeng QIU. Low-complexity massive MIMO channel estimation for mmWave systems via matrix completion [J]. Telecommunications Science, 2020, 36(4): 99-106.
[12]	Yajie LI,Yongli ZHAO,Shoudong LIU,Jie ZHANG. Overview of research on fiber nonlinear equalization algorithm based on artificial intelligence [J]. Telecommunications Science, 2020, 36(3): 61-70.
[13]	Qichao SUN,Jianrong BAO,Chao LIU,Bin JIANG,Fang ZHU,Jianhai HE. Improved Polar selective decoding and forwarding cooperation [J]. Telecommunications Science, 2020, 36(1): 77-87.
[14]	Tao JIANG,Guangqiu LI,Jianhui CAI. Error performance of CE-OFDM based AF systems with relay selection [J]. Telecommunications Science, 2019, 35(12): 57-66.
[15]	Shunlan LIU, Haibo BIAN, Aiming HU. A method for shorting of the system Polar code based on bit-reverse permutation [J]. Telecommunications Science, 2019, 35(10): 77-83.