To remove the restriction on code length of polar codes,this paper proposes a construction scheme,called stepwise polar codes,which can gen-erate arbitrary-length polar codes.The stepwise polar codes are generated by ...To remove the restriction on code length of polar codes,this paper proposes a construction scheme,called stepwise polar codes,which can gen-erate arbitrary-length polar codes.The stepwise polar codes are generated by sub-polar codes with different code lengths.To improve coding performance,sub-polar codes are united by polarization effect priority algorithm,which can reduce the number of in-completely polarized channels.Then,the construction method of the generator matrix of the stepwise po-lar code is presented.Furthermore,we prove that the proposed scheme has lower decoding complexity than punctured,multi-kernel polar codes.Simulation results show that the proposed method can achieve similar decoding performance compared with the conventional punctured polar codes,rate-compatible punctured polar code,PC-short and asymmetric polar codes(APC)when code length N=48 and 72,respectively.展开更多
This paper extends the class of Low-Density Parity-Check (LDPC) codes that can be constructed from shifted identity matrices. To construct regular LDPC codes, a new method is proposed. Two simple inequations are adopt...This paper extends the class of Low-Density Parity-Check (LDPC) codes that can be constructed from shifted identity matrices. To construct regular LDPC codes, a new method is proposed. Two simple inequations are adopted to avoid the short cycles in Tanner graph, which makes the girth of Tanner graphs at least 8. Because their parity-check matrices are made up of circulant matrices, the new codes are quasi-cyclic codes. They perform well with iterative decoding.展开更多
To adjust the variance of source rate in linear broadcast networks, global encoding kernels should have corresponding dimensions to instruct the decoding process. The algorithm of constructing such global encoding ker...To adjust the variance of source rate in linear broadcast networks, global encoding kernels should have corresponding dimensions to instruct the decoding process. The algorithm of constructing such global encoding kernels is to adjust heterogeneous network to possible link failures. Linear algebra, graph theory and group theory are applied to construct one series of global encoding kernels which are applicable to all source rates. The effectiveness and existence of such global encoding kernels are proved. Based on 2 information flow, the algorithm of construction is explicitly given within polynomial time O（｜E｜ ｜T｜.ω^2max）, and the memory complexity of algorithm is O（｜E｜）. Both time and memory complexity of this algorithm proposed can be O（ωmax） less than those of algorithms in related works.展开更多
Integrated sensing and communication(ISAC)technology enhances the spectrum utilization of the system by interchanging the spectrum between communication and sensing,which has gained popularity in scenarios such as veh...Integrated sensing and communication(ISAC)technology enhances the spectrum utilization of the system by interchanging the spectrum between communication and sensing,which has gained popularity in scenarios such as vehicle-to-everything(V2X).With the aim of providing more dependable services for vehicles in high-speed mobile scenarios,we propose a scheme based on sense-assisted polarisation coding.Specifically,the base station acquires the vehicle's positional information and channel strength parameters through the forward time slot echo information.This information informs the creation of the coding architecture for the following time slot.This approach not only optimizes resource consumption but also enhances system dependability.Our simulation results confirm that the introduced scheme displays a notable improvement in the bit error rate(BER)when compared to traditional communication frameworks,maintaining this advantage across both unimpeded and compromised channel conditions.展开更多
基金supported in part by Joint Fund for Smart Computing of Natural Science Foundation of Shandong Province(ZR2019LZH001)Shandong University Youth Innovation Supporting Program(2019KJN020,2019KJN024)+1 种基金Shandong Key Research and Development Project(2019GGX101066)the Taishan Scholar Program of Shandong Province,the Natural Science Foundation of China(61701284).
文摘To remove the restriction on code length of polar codes,this paper proposes a construction scheme,called stepwise polar codes,which can gen-erate arbitrary-length polar codes.The stepwise polar codes are generated by sub-polar codes with different code lengths.To improve coding performance,sub-polar codes are united by polarization effect priority algorithm,which can reduce the number of in-completely polarized channels.Then,the construction method of the generator matrix of the stepwise po-lar code is presented.Furthermore,we prove that the proposed scheme has lower decoding complexity than punctured,multi-kernel polar codes.Simulation results show that the proposed method can achieve similar decoding performance compared with the conventional punctured polar codes,rate-compatible punctured polar code,PC-short and asymmetric polar codes(APC)when code length N=48 and 72,respectively.
基金Supported by the Key Project of National Nature Science Foundation of China(No.60390540)
文摘This paper extends the class of Low-Density Parity-Check (LDPC) codes that can be constructed from shifted identity matrices. To construct regular LDPC codes, a new method is proposed. Two simple inequations are adopted to avoid the short cycles in Tanner graph, which makes the girth of Tanner graphs at least 8. Because their parity-check matrices are made up of circulant matrices, the new codes are quasi-cyclic codes. They perform well with iterative decoding.
基金Project(60872005) supported by National Natural Science Foundation of China
文摘To adjust the variance of source rate in linear broadcast networks, global encoding kernels should have corresponding dimensions to instruct the decoding process. The algorithm of constructing such global encoding kernels is to adjust heterogeneous network to possible link failures. Linear algebra, graph theory and group theory are applied to construct one series of global encoding kernels which are applicable to all source rates. The effectiveness and existence of such global encoding kernels are proved. Based on 2 information flow, the algorithm of construction is explicitly given within polynomial time O（｜E｜ ｜T｜.ω^2max）, and the memory complexity of algorithm is O（｜E｜）. Both time and memory complexity of this algorithm proposed can be O（ωmax） less than those of algorithms in related works.
基金This work was supported in part by the Sichuan Major R&D Project(2022YFQ0090)in part by the Sichuan Science and Technology Program(2023NSFSC1375)+1 种基金in part by the Natural Science Foundation of China(62132004,62301122)in part by the UESTC Yangtze Delta Region Research Institute-Quzhou(2022D031,2023D005).
文摘Integrated sensing and communication(ISAC)technology enhances the spectrum utilization of the system by interchanging the spectrum between communication and sensing,which has gained popularity in scenarios such as vehicle-to-everything(V2X).With the aim of providing more dependable services for vehicles in high-speed mobile scenarios,we propose a scheme based on sense-assisted polarisation coding.Specifically,the base station acquires the vehicle's positional information and channel strength parameters through the forward time slot echo information.This information informs the creation of the coding architecture for the following time slot.This approach not only optimizes resource consumption but also enhances system dependability.Our simulation results confirm that the introduced scheme displays a notable improvement in the bit error rate(BER)when compared to traditional communication frameworks,maintaining this advantage across both unimpeded and compromised channel conditions.
