Ke Lai
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ke Lai has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Jing Lei
National University of Defense Technology
9 shared publications - Gaojie Chen
Sun Yat-sen University
6 shared publications - Lei Wen
Department of Communication Engineering, College of Electronic Science and Engineering, National University of Defense Technology, Changsha, China
6 shared publications Pei Xiao
State Key Laboratory of ISN, Xidian University, Xian, China
3 shared publications- Amine Maaref
Ottawa Wireless Advanced System Competency Centre, Huawei Canada, Ottawa, ON, Canada
2 shared publications - Pei Xiao
University of Surrey
2 shared publications
Latest Publications
- 24 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (6) , 5301-5315
Sparse Code Multiple Access With Enhanced K-Repetition Scheme: Analysis and Design
This work presents a novel K-Repetition based Hybrid Automatic Repeat reQuest (HARQ) scheme for uplink sparse code multiple access (SCMA) systems. Our core idea is to apply network coding (NC) principle to re-encode different packets (after channel coding and interleaving) or their fragments, where K-Repetition is an emerging HARQ technique (recommended in 3GPP Release 15) for enhanced reception in future massive machine-type communications. Such a proposed scheme is referred to as the NC aided K-repetition SCMA (NCK-SCMA) in this paper. We aim to understand the optimal NCK-SCMA design criteria for maximizing the channel diversity as well as the efficient receiver processing for superior error rate performances. It is found that NC can enable a larger diversity order for NCK-SCMA with fewer resources (i.e., higher spectrum efficiency). Toward this objective, some novel design criteria are developed for the efficient configuration of NCK-SCMA. Moreover, we propose an iterative network decoding and SCMA detection (INDSD) algorithm for robust and low-complexity recovery of the transmit data from a low-density parity-check (LDPC) coded uplink NCK-SCMA system. Simulation results demonstrate that the proposed NCK-SCMA lead to higher throughput and improved reliability over the conventional K-SCMA.
- 24 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (6) , 5301-5315
Sparse Code Multiple Access With Enhanced K-Repetition Scheme: Analysis and Design
This work presents a novel K-Repetition based Hybrid Automatic Repeat reQuest (HARQ) scheme for uplink sparse code multiple access (SCMA) systems. Our core idea is to apply network coding (NC) principle to re-encode different packets (after channel coding and interleaving) or their fragments, where K-Repetition is an emerging HARQ technique (recommended in 3GPP Release 15) for enhanced reception in future massive machine-type communications. Such a proposed scheme is referred to as the NC aided K-repetition SCMA (NCK-SCMA) in this paper. We aim to understand the optimal NCK-SCMA design criteria for maximizing the channel diversity as well as the efficient receiver processing for superior error rate performances. It is found that NC can enable a larger diversity order for NCK-SCMA with fewer resources (i.e., higher spectrum efficiency). Toward this objective, some novel design criteria are developed for the efficient configuration of NCK-SCMA. Moreover, we propose an iterative network decoding and SCMA detection (INDSD) algorithm for robust and low-complexity recovery of the transmit data from a low-density parity-check (LDPC) coded uplink NCK-SCMA system. Simulation results demonstrate that the proposed NCK-SCMA lead to higher throughput and improved reliability over the conventional K-SCMA.
- 3 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (7) , 5561-5577
Analyzing Uplink Grant-Free Sparse Code Multiple Access System in Massive IoT Networks
Grant-free sparse code multiple access (GF-SCMA) is considered to be a promising multiple access candidate for future wireless networks. In this article, we focus on characterizing the performance of uplink GF-SCMA schemes in a network with ubiquitous connections, such as the Internet-of-Things (IoT) networks. To provide a tractable approach to evaluate the performance of GF-SCMA, we first develop a theoretical model taking into account the property of multiuser detection (MUD) in the SCMA system. Then, the error rate performance of GF-SCMA in the case of codebook collision is analyzed to investigate the reliability of GF-SCMA when reusing codebook in massive IoT networks. For performance evaluation, accurate approximations for both success probability and average symbol error probability (ASEP) are derived. To elaborate further, the analytical results are utilized to discuss the impact of codeword sparse degree in GF-SCMA. After that, we conduct a comparative study between SCMA and its variant, dense code multiple access (DCMA), with GF transmission to offer insights into the effectiveness of these two schemes. This facilitates the GF-SCMA system design in practical implementation. Simulation results show that denser codebooks can help to support more user equipments (UEs) and increase the reliability of data transmission in a GF-SCMA network. Moreover, a higher success probability can be achieved by GF-SCMA with denser UE deployment at low detection thresholds since SCMA can achieve overloading gain.
- 3 September 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (7) , 5561-5577
Analyzing Uplink Grant-Free Sparse Code Multiple Access System in Massive IoT Networks
Grant-free sparse code multiple access (GF-SCMA) is considered to be a promising multiple access candidate for future wireless networks. In this article, we focus on characterizing the performance of uplink GF-SCMA schemes in a network with ubiquitous connections, such as the Internet-of-Things (IoT) networks. To provide a tractable approach to evaluate the performance of GF-SCMA, we first develop a theoretical model taking into account the property of multiuser detection (MUD) in the SCMA system. Then, the error rate performance of GF-SCMA in the case of codebook collision is analyzed to investigate the reliability of GF-SCMA when reusing codebook in massive IoT networks. For performance evaluation, accurate approximations for both success probability and average symbol error probability (ASEP) are derived. To elaborate further, the analytical results are utilized to discuss the impact of codeword sparse degree in GF-SCMA. After that, we conduct a comparative study between SCMA and its variant, dense code multiple access (DCMA), with GF transmission to offer insights into the effectiveness of these two schemes. This facilitates the GF-SCMA system design in practical implementation. Simulation results show that denser codebooks can help to support more user equipments (UEs) and increase the reliability of data transmission in a GF-SCMA network. Moreover, a higher success probability can be achieved by GF-SCMA with denser UE deployment at low detection thresholds since SCMA can achieve overloading gain.
- 8 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 69 (11) , 13273-13288
Codeword Position Index Modulation Design for Sparse Code Multiple Access System
Codeword position index based sparse code multiple access (CPI-SCMA) is a novel variant of SCMA that employs the idea of index modulation (IM), which has been proposed recently as an effective alternative to the classical SCMA system. In contrast to the conventional SCMA that directly maps the information bits of each user to a predefined $M$ -point codebook, the information in CPI-SCMA is not only conveyed by the $M$ -point codebook as in SCMA, but also by the indexes of the codeword positions. In this paper, we first propose a simplified detector termed as message passing algorithm aided index reliability detection (MPA-IRD) that is more suitable for practical implementation. Moreover, we investigate the spectral efficiency (SE) in CPI-SCMA, and two important features are identified to facilitate the design of the system. A tight approximation of the average block error probability (ABLEP) under the maximum likelihood detector (MLD) is also derived from studying the error rate performance of CPI-SCMA. Finally, to further improve the SE of CPI-SCMA, a modified version of CPI-SCMA termed as hybrid CPI-SCMA (HCPI-SCMA) is proposed. It is shown via both simulation and analytical results that the proposed scheme not only achieves better error rate performance in the high signal-to-noise ratio (SNR) region but also improves the SE and the level of robustness under channel estimation error compares to SCMA.- 8 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 69 (11) , 13273-13288
Codeword Position Index Modulation Design for Sparse Code Multiple Access System
Codeword position index based sparse code multiple access (CPI-SCMA) is a novel variant of SCMA that employs the idea of index modulation (IM), which has been proposed recently as an effective alternative to the classical SCMA system. In contrast to the conventional SCMA that directly maps the information bits of each user to a predefined $M$ -point codebook, the information in CPI-SCMA is not only conveyed by the $M$ -point codebook as in SCMA, but also by the indexes of the codeword positions. In this paper, we first propose a simplified detector termed as message passing algorithm aided index reliability detection (MPA-IRD) that is more suitable for practical implementation. Moreover, we investigate the spectral efficiency (SE) in CPI-SCMA, and two important features are identified to facilitate the design of the system. A tight approximation of the average block error probability (ABLEP) under the maximum likelihood detector (MLD) is also derived from studying the error rate performance of CPI-SCMA. Finally, to further improve the SE of CPI-SCMA, a modified version of CPI-SCMA termed as hybrid CPI-SCMA (HCPI-SCMA) is proposed. It is shown via both simulation and analytical results that the proposed scheme not only achieves better error rate performance in the high signal-to-noise ratio (SNR) region but also improves the SE and the level of robustness under channel estimation error compares to SCMA.- 19 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 24 (1) , 3-6
A Fast Encoding of 3GPP MBMS Raptor Codes Based on Operation Instruction
- 19 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 24 (1) , 3-6
A Fast Encoding of 3GPP MBMS Raptor Codes Based on Operation Instruction
- 27 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 8 (3) , 737-740
Codeword Position Index Based Sparse Code Multiple Access System
- 27 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 8 (3) , 737-740
Codeword Position Index Based Sparse Code Multiple Access System
- Open Access
- 20 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 4380-4390
Physical Layer Encryption Algorithm Based on Polar Codes and Chaotic Sequences
Researches on 5th generation mobile communication networks (5G) are emerging to meet the demands of rapidly developing communications applications. The reliability and security of data have become key factors of its development, and thus 5G has put forward higher requirements for new coding and encryption technologies. In this paper, a physical layer encryption algorithm based on polarization codes and chaotic sequences is proposed to improve the reliability and confidentiality of transmission. In our scheme, chaotic sequences are allocated in the frozen bits of polar codes. Therefore, error correction and encryption can be performed simultaneously. Since the frozen bits are unknown to the eavesdroppers, it is difficult for them to decode the transmitted bits without the knowledge of the chaotic sequences. To further improve the security, we propose to generate the chaotic sequences by using the channel state information. Besides, the chain effects of delayed feedback are applied to increase the decrypted complexity of the eavesdroppers in this paper. Theoretic analysis and simulation results both show that the proposed algorithms can achieve high security without any error rate performance loss.
- 20 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 4380-4390
Open AccessPhysical Layer Encryption Algorithm Based on Polar Codes and Chaotic Sequences
Researches on 5th generation mobile communication networks (5G) are emerging to meet the demands of rapidly developing communications applications. The reliability and security of data have become key factors of its development, and thus 5G has put forward higher requirements for new coding and encryption technologies. In this paper, a physical layer encryption algorithm based on polarization codes and chaotic sequences is proposed to improve the reliability and confidentiality of transmission. In our scheme, chaotic sequences are allocated in the frozen bits of polar codes. Therefore, error correction and encryption can be performed simultaneously. Since the frozen bits are unknown to the eavesdroppers, it is difficult for them to decode the transmitted bits without the knowledge of the chaotic sequences. To further improve the security, we propose to generate the chaotic sequences by using the channel state information. Besides, the chain effects of delayed feedback are applied to increase the decrypted complexity of the eavesdroppers in this paper. Theoretic analysis and simulation results both show that the proposed algorithms can achieve high security without any error rate performance loss.
- 24 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 8 (2) , 336-339
Secure Transmission With Interleaver for Uplink Sparse Code Multiple Access System
Sparse code multiple access (SCMA) is a promising air interface candidate technique for next generation mobile networks. By introducing the Tent map in the Chaos theory, we propose a novel physical layer transmission scheme with codeword level interleaving at the transmitter in this letter, which is termed as interleaver-based SCMA (I-SCMA). Simulation results and analysis show that I-SCMA can provide high security performance without any loss in performance and transmission rate, thus constitutes a viable solution for the next generation wireless networks to provide secure communications.
- 24 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 8 (2) , 336-339
Secure Transmission With Interleaver for Uplink Sparse Code Multiple Access System
Sparse code multiple access (SCMA) is a promising air interface candidate technique for next generation mobile networks. By introducing the Tent map in the Chaos theory, we propose a novel physical layer transmission scheme with codeword level interleaving at the transmitter in this letter, which is termed as interleaver-based SCMA (I-SCMA). Simulation results and analysis show that I-SCMA can provide high security performance without any loss in performance and transmission rate, thus constitutes a viable solution for the next generation wireless networks to provide secure communications.
- Open Access
- 20 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 25066-25080
Sub-Graph Based Joint Sparse Graph for Sparse Code Multiple Access Systems
Sparse code multiple access (SCMA) is a promising air interface candidate technique for next-generation mobile networks, especially for massive machine-type communications. In this paper, we design a low-density parity-check (LDPC) coded SCMA detector by combining the sparse graphs of LDPC and SCMA into one joint sparse graph (JSG). In our proposed scheme, the SCMA sparse graph defined by small size indicator matrix is utilized to construct the JSG, which is termed as sub-graph-based JSG of SCMA (SG-JSG-SCMA). In this paper, we first study the binary-LDPC coded SG-JSG-SCMA system. To combine the SCMA variable node and LDPC variable node into one joint variable node, a nonbinary LDPC (NB-LDPC) coded SG-JSG-SCMA is also proposed. Furthermore, to reduce the complexity of NB-LDPC coded SG-JSG-SCMA, a joint trellis representation (JTR) is introduced to represent the search space of NB-LDPC coded SG-JSG-SCMA. Based on JTR, a low complexity joint trellis-based detection and decoding algorithm is proposed to reduce the computational complexity of the NB-LDPC coded SG-JSG-SCMA system. According to the simulation results, SG-JSG-SCMA brings significant performance improvement compare with the conventional receiver using the disjoint approach, and it can also outperform a turbo-structured receiver with comparable complexity. Moreover, the joint approach also has advantages in terms of processing latency compare with the turbo approaches.
- 20 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 25066-25080
Open AccessSub-Graph Based Joint Sparse Graph for Sparse Code Multiple Access Systems
Sparse code multiple access (SCMA) is a promising air interface candidate technique for next-generation mobile networks, especially for massive machine-type communications. In this paper, we design a low-density parity-check (LDPC) coded SCMA detector by combining the sparse graphs of LDPC and SCMA into one joint sparse graph (JSG). In our proposed scheme, the SCMA sparse graph defined by small size indicator matrix is utilized to construct the JSG, which is termed as sub-graph-based JSG of SCMA (SG-JSG-SCMA). In this paper, we first study the binary-LDPC coded SG-JSG-SCMA system. To combine the SCMA variable node and LDPC variable node into one joint variable node, a nonbinary LDPC (NB-LDPC) coded SG-JSG-SCMA is also proposed. Furthermore, to reduce the complexity of NB-LDPC coded SG-JSG-SCMA, a joint trellis representation (JTR) is introduced to represent the search space of NB-LDPC coded SG-JSG-SCMA. Based on JTR, a low complexity joint trellis-based detection and decoding algorithm is proposed to reduce the computational complexity of the NB-LDPC coded SG-JSG-SCMA system. According to the simulation results, SG-JSG-SCMA brings significant performance improvement compare with the conventional receiver using the disjoint approach, and it can also outperform a turbo-structured receiver with comparable complexity. Moreover, the joint approach also has advantages in terms of processing latency compare with the turbo approaches.
- Open Access
- 10 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 5049-5063
Secure Transmission With Randomized Constellation Rotation for Downlink Sparse Code Multiple Access System
Sparse code multiple access (SCMA) is a promising candidate air interface of next-generation mobile networks. In this paper, we focus on a downlink SCMA system where a transmitter sends confidential messages to multiple users in the presence of external eavesdroppers. Consequently, we develop a novel secure transmission approach over physical layer based on a highly structured SCMA codebook design. In our proposed scheme, we rotate the base constellations (BCs) with random angles by extracting channel phases from the channel state information (CSI). By employing randomized constellation rotation (RCR), the security of downlink SCMA can be ensured. In addition, a tight SCMA upper bound is introduced to guide the design of the encrypted codebook. As a result, we propose an approach to avoid the significant error rate performance loss caused by using codebooks that are designed using our method. The proposed upper-bound-aided codebook design scheme can select relatively good codebooks with low complexity. By combining SCMA codebook design and secure communication, our scheme ensures security for massive quantities of users with low encrypted and decrypted complexity at the cost of transmission rate and possible error rate performance loss. Moreover, the proposed scheme can achieve robustness against channel estimation errors. Analyses and Monte Carlo simulations confirm the effectiveness of our scheme.
- 10 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 5049-5063
Open AccessSecure Transmission With Randomized Constellation Rotation for Downlink Sparse Code Multiple Access System
Sparse code multiple access (SCMA) is a promising candidate air interface of next-generation mobile networks. In this paper, we focus on a downlink SCMA system where a transmitter sends confidential messages to multiple users in the presence of external eavesdroppers. Consequently, we develop a novel secure transmission approach over physical layer based on a highly structured SCMA codebook design. In our proposed scheme, we rotate the base constellations (BCs) with random angles by extracting channel phases from the channel state information (CSI). By employing randomized constellation rotation (RCR), the security of downlink SCMA can be ensured. In addition, a tight SCMA upper bound is introduced to guide the design of the encrypted codebook. As a result, we propose an approach to avoid the significant error rate performance loss caused by using codebooks that are designed using our method. The proposed upper-bound-aided codebook design scheme can select relatively good codebooks with low complexity. By combining SCMA codebook design and secure communication, our scheme ensures security for massive quantities of users with low encrypted and decrypted complexity at the cost of transmission rate and possible error rate performance loss. Moreover, the proposed scheme can achieve robustness against channel estimation errors. Analyses and Monte Carlo simulations confirm the effectiveness of our scheme.
- 24 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Threshold-based extended minimum-sum algorithm for non-binary LDPC codes
In this paper, we propose a new improved algorithm to reduce the decoding complexity of NB-LDPC codes especially when the number of iteration is large. The proposed algorithm is based on the extended min-sum (EMS) which truncates the message vectors and trellis-based EMS (T-EMS) which employs the trellis representation. Our modification of EMS introduces the thresholds to further truncate the incoming messages to the check node. The performance of our improved new algorithm is only 0.05dB (resp 0.2dB) to BP in the waterfall region over GF(8) (resp GF(128)), but the complexity will reduce to lower than half of the EMS when the threshold is chosen reasonable.
- 24 November 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Threshold-based extended minimum-sum algorithm for non-binary LDPC codes
In this paper, we propose a new improved algorithm to reduce the decoding complexity of NB-LDPC codes especially when the number of iteration is large. The proposed algorithm is based on the extended min-sum (EMS) which truncates the message vectors and trellis-based EMS (T-EMS) which employs the trellis representation. Our modification of EMS introduces the thresholds to further truncate the incoming messages to the check node. The performance of our improved new algorithm is only 0.05dB (resp 0.2dB) to BP in the waterfall region over GF(8) (resp GF(128)), but the complexity will reduce to lower than half of the EMS when the threshold is chosen reasonable.