Seguir
Xuan HE
Título
Citado por
Citado por
Ano
Deep learning-aided dynamic read thresholds design for multi-level-cell flash memories
Z Mei, K Cai, X He
IEEE Transactions on Communications 68 (5), 2850-2862, 2020
322020
Dynamic programming for sequential deterministic quantization of discrete memoryless channels
X He, K Cai, W Song, Z Mei
IEEE Transactions on Communications 69 (6), 3638-3651, 2021
31*2021
On mutual information-maximizing quantized belief propagation decoding of LDPC codes
X He, K Cai, Z Mei
2019 IEEE Global Communications Conference (GLOBECOM), 1-6, 2019
29*2019
Bit mapping design for LDPC coded BICM schemes with multi-edge type EXIT chart
J Du, L Yang, J Yuan, L Zhou, X He
IEEE Communications Letters 21 (4), 722-725, 2016
292016
Systematic codes correcting multiple-deletion and multiple-substitution errors
W Song, N Polyanskii, K Cai, X He
IEEE Transactions on Information Theory 68 (10), 6402-6416, 2022
232022
PEG-like design of binary QC-LDPC codes based on detecting and avoiding generating small cycles
X He, L Zhou, J Du
IEEE Transactions on Communications 66 (5), 1845-1858, 2017
232017
Generalized mutual information-maximizing quantized decoding of LDPC codes with layered scheduling
P Kang, K Cai, X He, S Li, J Yuan
IEEE Transactions on Vehicular Technology 71 (7), 7258-7273, 2022
172022
On multiple-deletion multiple-substitution correcting codes
W Song, N Polyanskii, K Cai, X He
2021 IEEE international symposium on information theory (ISIT), 2655-2660, 2021
162021
Capacity-achieving constrained codes with GC-content and runlength limits for DNA storage
Y Liu, X He, X Tang
2022 IEEE International Symposium on Information Theory (ISIT), 198-203, 2022
122022
On channel quantization for spin-torque transfer magnetic random access memory
Z Mei, K Cai, L Shi, X He
IEEE Transactions on Communications 67 (11), 7526-7539, 2019
102019
The multi-step PEG and ACE constrained PEG algorithms can design the LDPC codes with better cycle-connectivity
X He, L Zhou, J Du, Z Shi
2015 IEEE International Symposium on Information Theory (ISIT), 46-50, 2015
82015
Basis-finding algorithm for decoding fountain codes for DNA-based data storage
X He, K Cai
IEEE Transactions on Information Theory 69 (6), 3691-3707, 2023
72023
Memory efficient mutual information-maximizing quantized min-sum decoding for rate-compatible LDPC codes
P Kang, K Cai, X He, J Yuan
IEEE Communications Letters 26 (4), 733-737, 2022
62022
A logically centralized slotted ALOHA‐based scheme for broadcast services in vehicular ad hoc networks
S Peng, L Zhou, J Du, X He
Transactions on Emerging Telecommunications Technologies 31 (12), e3909, 2020
62020
Systematic single-deletion multiple-substitution correcting codes
W Song, N Polyanskii, K Cai, X He
arXiv preprint arXiv:2006.11516, 2020
62020
A new multi-edge metric-constrained PEG algorithm for designing binary LDPC code with improved cycle-structure
X He, L Zhou, J Du
IEEE Transactions on Communications 66 (1), 14-25, 2017
62017
A progressive edge growth algorithm for bit mapping design of LDPC coded BICM schemes
J Du, J Yuan, L Zhou, X He
2016 IEEE International Symposium on Information Theory (ISIT), 2129-2133, 2016
62016
Mutual information-maximizing quantized layered min-sum decoding of QC-LDPC codes
C Lv, X He, P Kang, K Cai, J Xing, X Tang
GLOBECOM 2022-2022 IEEE Global Communications Conference, 3490-3495, 2022
52022
Disjoint-set data structure-aided structured Gaussian elimination for solving sparse linear systems
X He, K Cai
IEEE Communications Letters 24 (11), 2445-2449, 2020
52020
The joint demodulation and decoding for BICM-ID system with BEC approximation and optimized bit mapping
J Du, L Zhou, X He
2015 IEEE Global Communications Conference (GLOBECOM), 1-6, 2015
52015
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20