Visible to the public Biblio

Filters: Keyword is channel polarization  [Clear All Filters]
2023-07-31
Tao, Kai, Long, Zhijun, Qian, Weifeng, Wei, Zitao, Chen, Xinda, Wang, Weiming, Xia, Yan.  2022.  Low-complexity Forward Error Correction For 800G Unamplified Campus Link. 2022 20th International Conference on Optical Communications and Networks (ICOCN). :1—3.
The discussion about forward error correction (FEC) used for 800G unamplified link (800LR) is ongoing. Aiming at two potential options for FEC bit error ratio (BER) threshold, we propose two FEC schemes, respectively based on channel-polarized (CP) multilevel coding (MLC) and bit interleaved coded modulation (BICM), with the same inner FEC code. The field-programmable gate array (FPGA) verification results indicate that with the same FEC overhead (OH), proposed CP-MLC outperforms BICM scheme with less resource and power consumption.
2020-09-08
Wu, Xiaoge, Zhang, Lin.  2019.  Robust Chaos-Based Information Masking Polar Coding Scheme for Wiretap Channel in Practical Wireless Systems. 2019 IEEE 90th Vehicular Technology Conference (VTC2019-Fall). :1–5.
In practical wireless communication systems, the channel conditions of legitimate users can not always be better than those of eavesdroppers. This realistic fact brings the challenge for the design of secure transmission over wiretap channels which requires that the eavesdropping channel conditions should be worse than legitimate channels. In this paper, we present a robust chaos-based information masking polar coding scheme for enhancing reliability and security performances under realistic channel conditions for practical systems. In our design, we mask the original information, wherein the masking matrix is determined by chaotic sequences. Then the masked information is encoded by the secure polar coding scheme. After the channel polarization achieved by the polar coding, we could identify the bit-channels providing good transmission conditions for legitimate users and the bit-channels with bad conditions for eavesdroppers. Simulations are performed over the additive white Gaussian noise (AWGN) and slow flat-fading Rayleigh channels. The results demonstrate that compared with existing schemes, the proposed scheme can achieve better reliability and security even when the eavesdroppers have better channel conditions than legitimate users, hence the practicability is greatly enhanced.
2020-07-13
Wu, Xiaoge, Zhang, Lin.  2019.  Chaos-based Information Rotated Polar Coding Scheme for Visible Light Wiretap Channel. 2019 International Conference on Computing, Networking and Communications (ICNC). :864–868.

In this paper, we present a chaos-based information rotated polar coding scheme for enhancing the reliability and security of visible light communication (VLC) systems. In our scheme, we rotate the original information, wherein the rotation principle is determined by two chaotic sequences. Then the rotated information is encoded by secure polar coding scheme. After the channel polarization achieved by the polar coding, we could identify the bit-channels providing good transmission conditions for legitimate users and the bit-channels with bad conditions for eavesdroppers. Simulations are performed over the visible light wiretap channel. The results demonstrate that compared with existing schemes, the proposed scheme can achieve better reliability and security even when the eavesdroppers have better channel conditions.

2019-11-25
Chen, Shi, Deng, Lipeng, Shen, Ruihua, Ruan, Kebei.  2018.  Research and Implementation of SC Recursive Decoding Algorithm for Polar Codes. Proceedings of the International Conference on Information Technology and Electrical Engineering 2018. :58:1–58:6.
The polar codes is a new kind of linear block code proposed based on the theory of channel polarization. It was proved to be a kind of channel coding method that can achieve the shannon capacity limits. It requires a lot of computation and storage when SC (Successive Cancellation) decoding algorithm is used to decode long polar codes, it is not conducive to high-speed communication. To solve this problem, we propose SC recursion decoding algorithm. Analysis indicates that the new algorithm is less complex than the SC decoding algorithm. Simulation results show that the BER performance of SC recursive decoding algorithm is similar to that of SC decoding algorithm, but its delay is only one tenth of SC decoding algorithm.