Yanfei Yan

Yanfei Yan

Auto-generated profile, based on publicly available information

Yanfei Yan

Huawei Technologies Co., Ltd

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 October 2018 in IEEE Transactions on Communications
Verified
Journal Article
Open access
LLLing Liu
Ling Liu
YYYanfei Yan
Yanfei Yan
CLCong Ling
Cong Ling
XWXiaofu Wu
Xiaofu Wu
In this paper, we propose a new class of lattices constructed from polar codes, namely polar lattices, to achieve the capacity 1/2 log(1 + SNR) of the additive white Gaussian-noise (AWGN) channel. Our construction follows the multilevel approach of Forney et al., where we construct a capacity-achieving polar code on each level. The component polar codes are shown to be naturally nested, thereby fulfilling the requirement of the multilevel lattice construction. We prove that polar lattices are AWGN-good. Furthermore, using the technique of source polarization, we propose discrete Gaussian shaping over the polar lattice to satisfy the power constraint. Both the construction and shaping are explicit, and the overall complexity of encoding and decoding is O(N logN) for any fixed target error probability.

17 January 2018 in IEEE Transactions on Information Theory
Verified
Journal Article
Open access
LLLing Liu
Ling Liu
YYYanfei Yan
Yanfei Yan
Cong LingCong Ling
Cong Ling
In this work, an explicit scheme of wiretap coding based on polar lattices is proposed to achieve the secrecy capacity of the additive white Gaussian noise (AWGN) wiretap channel. Firstly, polar lattices are used to construct secrecygood lattices for the mod-Ʌs Gaussian wiretap channel. Then we propose an explicit shaping scheme to remove this mod-Ʌs front end and extend polar lattices to the genuine Gaussian wiretap channel. The shaping technique is based on the lattice Gaussian distribution, which leads to a binary asymmetric channel at each level for the multilevel lattice codes. By employing the asymmetric polar coding technique, we construct an AWGNgood lattice and a secrecy-good lattice with optimal shaping simultaneously. As a result, the encoding complexity for the sender and the decoding complexity for the legitimate receiver are both O(N logN log(logN)). The proposed scheme is proven to be semantically secure.