Lintao Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Lintao Li has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
- Xiaoming Dai
School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China
7 shared publications - Hua Li
School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China
5 shared publications - Qianqian Li
University of Science and Technology Beijing
5 shared publications - Shiya Hao
University of Science and Technology Beijing
5 shared publications Jiayi Lv
3 shared publicationsYimin Li
3 shared publications
Latest Publications
- 10 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (3) , 4205-4217
A Graph-Based Theoretical Framework and Performance Analysis of Pattern Division Random Access
This paper investigates the theoretical foundations and practical benefits of pattern division random access (PDRA) within the massive multiple input multiple output (MIMO) assisted grant-free paradigm. PDRA leverages the superposition or finite-field operations of orthogonal/quasi-orthogonal structural building blocks to provide substantial pilot diversity, thereby effectively mitigating pilot collisions. We characterize PDRA through a random uniform graph process, establishing a novel connection between PDRA and decoding of graph-based codes. Theoretical performance limits are derived for the per-user probability of error (PUPE), quantifying user distinguishability during channel estimation. Furthermore, we conduct a detailed PUPE performance analysis of the PDRA scheme with successive interference cancellation (PDRA-SIC) in the finite-blocklength regime, demonstrating its capability to efficiently resolve collisions and mitigate interference. The analysis shows that PDRA-SIC achieves significantly improved PUPE performance compared to conventional single-pilot schemes in massive ultra-reliable low-latency communication (mURLLC) scenarios, underscoring its practical potential for next-generation wireless systems.
- 10 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 75 (3) , 4205-4217
A Graph-Based Theoretical Framework and Performance Analysis of Pattern Division Random Access
This paper investigates the theoretical foundations and practical benefits of pattern division random access (PDRA) within the massive multiple input multiple output (MIMO) assisted grant-free paradigm. PDRA leverages the superposition or finite-field operations of orthogonal/quasi-orthogonal structural building blocks to provide substantial pilot diversity, thereby effectively mitigating pilot collisions. We characterize PDRA through a random uniform graph process, establishing a novel connection between PDRA and decoding of graph-based codes. Theoretical performance limits are derived for the per-user probability of error (PUPE), quantifying user distinguishability during channel estimation. Furthermore, we conduct a detailed PUPE performance analysis of the PDRA scheme with successive interference cancellation (PDRA-SIC) in the finite-blocklength regime, demonstrating its capability to efficiently resolve collisions and mitigate interference. The analysis shows that PDRA-SIC achieves significantly improved PUPE performance compared to conventional single-pilot schemes in massive ultra-reliable low-latency communication (mURLLC) scenarios, underscoring its practical potential for next-generation wireless systems.
- 8 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. PP (10897798) , 1
Impact of RHIs and ipSIC on Active RIS-NOMA Systems with Low-Precision ADCs
This study evaluates the performance of an active reconfigurable intelligent surface (ARIS)-assisted non-orthogonal multiple access (NOMA) system employing low-precision analog-to-digital converters (ADCs). Analytical approximations for the outage probability (OP) are derived, considering residual hardware impairments (RHIs) and imperfect successive interference cancellation (ipSIC). Additionally, we analyze the asymptotic OP, system throughput, and diversity order at high signal-to-noise ratios (SNRs). Simulation results demonstrate that the proposed quantized ARIS-NOMA system outperforms its passive counterpart (PRIS-NOMA), achieving lower OP and higher throughput with reduced transmit power requirements and fewer reflecting elements. Moreover, the outage performance of both quantized ARIS-NOMA and PRIS-NOMA systems demonstrates significant improvement as the number of reflecting elements increases. The negative impacts of low-precision ADCs can be effectively mitigated by optimizing transmit power and scaling the number of reflecting elements.
- 8 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. PP (10897798) , 1
Impact of RHIs and ipSIC on Active RIS-NOMA Systems with Low-Precision ADCs
This study evaluates the performance of an active reconfigurable intelligent surface (ARIS)-assisted non-orthogonal multiple access (NOMA) system employing low-precision analog-to-digital converters (ADCs). Analytical approximations for the outage probability (OP) are derived, considering residual hardware impairments (RHIs) and imperfect successive interference cancellation (ipSIC). Additionally, we analyze the asymptotic OP, system throughput, and diversity order at high signal-to-noise ratios (SNRs). Simulation results demonstrate that the proposed quantized ARIS-NOMA system outperforms its passive counterpart (PRIS-NOMA), achieving lower OP and higher throughput with reduced transmit power requirements and fewer reflecting elements. Moreover, the outage performance of both quantized ARIS-NOMA and PRIS-NOMA systems demonstrates significant improvement as the number of reflecting elements increases. The negative impacts of low-precision ADCs can be effectively mitigated by optimizing transmit power and scaling the number of reflecting elements.
- 21 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (10) , 16094-16103
On the Design of Capacity-Achieving Distributions for Discrete-Time Poisson Channel With Low-Precision ADCs
This paper investigates the design of the capacity-achieving input distribution for the discrete-time Poisson channel (DTPC) under dark current effects with low-precision analog-to-digital converters (ADCs). An efficient algorithm integrating the Newton-Raphson and Blahut-Arimoto (BA) methods is proposed to jointly optimize the input distribution and amplitude levels under both peak and average power constraints. Additionally, the Karush-Kuhn-Tucker (KKT) conditions are established to provide necessary and sufficient conditions for the optimality of the obtained capacity-achieving distribution. Simulation results illustrate that the proposed algorithm attains 72% and 83% of the theoretical capacity at 5 dB for 1-bit and 2-bit quantized DTPC, respectively. Furthermore, for a DTPC with finite-precision quantization (i.e., ${\log _{2}}K$ bits), the capacity can be achieved by a non-uniform discrete input distribution with support for $K$ mass points, under the given power constraints.
- 21 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (10) , 16094-16103
On the Design of Capacity-Achieving Distributions for Discrete-Time Poisson Channel With Low-Precision ADCs
This paper investigates the design of the capacity-achieving input distribution for the discrete-time Poisson channel (DTPC) under dark current effects with low-precision analog-to-digital converters (ADCs). An efficient algorithm integrating the Newton-Raphson and Blahut-Arimoto (BA) methods is proposed to jointly optimize the input distribution and amplitude levels under both peak and average power constraints. Additionally, the Karush-Kuhn-Tucker (KKT) conditions are established to provide necessary and sufficient conditions for the optimality of the obtained capacity-achieving distribution. Simulation results illustrate that the proposed algorithm attains 72% and 83% of the theoretical capacity at 5 dB for 1-bit and 2-bit quantized DTPC, respectively. Furthermore, for a DTPC with finite-precision quantization (i.e., ${\log _{2}}K$ bits), the capacity can be achieved by a non-uniform discrete input distribution with support for $K$ mass points, under the given power constraints.
- 10 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 14 (7) , 1964-1968
Residual-Impairments-Aware Feedforward-Feedback Detection for Massive MIMO Systems With Decentralized Baseband Processing
Decentralized baseband processing (DBP) has emerged as a promising solution to address the high interconnection costs and computational complexity challenges of centralized processing in massive multiple-input multiple-output (M-MIMO) systems. Despite its promise, as the number of antenna clusters increases, conventional decentralized detectors experience significant performance degradation due to constrained information sharing between clusters. Furthermore, most existing works assume ideal hardware, overlooking the negative impact of hardware impairments. In this letter, we propose a decentralized feedforward-feedback (FF) detector based on vector expectation propagation (VEP) algorithm for DBP architectures. A residual-impairments-aware (RIA) approach with empirically determined transceiver noise is introduced to alleviate the detrimental effect of residual transceiver impairments. Simulation results demonstrate that the proposed FF-VEP detector outperforms conventional EP/VEP detectors, achieving performance comparable to centralized implementations, especially in scenarios with lower BS antenna-to-user ratios and spatially correlated channels. Moreover, the RIA approach also provides notable performance gain over its residual-impairments-agnostic counterpart designed under ideal transceivers.
- 10 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Wireless Communications Letters
- Vol. 14 (7) , 1964-1968
Residual-Impairments-Aware Feedforward-Feedback Detection for Massive MIMO Systems With Decentralized Baseband Processing
Decentralized baseband processing (DBP) has emerged as a promising solution to address the high interconnection costs and computational complexity challenges of centralized processing in massive multiple-input multiple-output (M-MIMO) systems. Despite its promise, as the number of antenna clusters increases, conventional decentralized detectors experience significant performance degradation due to constrained information sharing between clusters. Furthermore, most existing works assume ideal hardware, overlooking the negative impact of hardware impairments. In this letter, we propose a decentralized feedforward-feedback (FF) detector based on vector expectation propagation (VEP) algorithm for DBP architectures. A residual-impairments-aware (RIA) approach with empirically determined transceiver noise is introduced to alleviate the detrimental effect of residual transceiver impairments. Simulation results demonstrate that the proposed FF-VEP detector outperforms conventional EP/VEP detectors, achieving performance comparable to centralized implementations, especially in scenarios with lower BS antenna-to-user ratios and spatially correlated channels. Moreover, the RIA approach also provides notable performance gain over its residual-impairments-agnostic counterpart designed under ideal transceivers.
- Open Access
- 25 March 2025
- Published by MDPI AG in Electronics
- Vol. 14 (7) , 1286
Jamming Detection and Suppression Technique for OTFS Systems in an AWGN Channel
Orthogonal time frequency space (OTFS) modulation is a promising waveform for future wireless communication, offering robustness against time-varying channels and Doppler effects in high-mobility scenarios. However, the anti-jamming capabilities of OTFS systems remain underexplored, leaving gaps in understanding their potential in jamming-prone environments. In this work, we mainly focus on the jamming detection and suppression methods for OTFS systems in additive an white Gaussian noise (AWGN) channel. A frequency-domain anti-jamming technique is presented, employing a time-domain overlapping window approach to reduce jamming sidelobes while mitigating the signal-to-noise ratio (SNR) degradation caused by the window function. Additionally, a smoothing window method is introduced to provide stable samples for jamming detection, effectively reducing the false alarm rate. Furthermore, a low-complexity improved forward consecutive mean excision (FCME) algorithm is proposed, enhancing its practicality and making it more suitable for real-world applications. Finally, the effectiveness of the proposed anti-jamming methods is validated through simulation analyses under single-tone and partial-band jamming scenarios.
- 25 March 2025
- Published by MDPI AG in Electronics
- Vol. 14 (7) , 1286
Open AccessJamming Detection and Suppression Technique for OTFS Systems in an AWGN Channel
Orthogonal time frequency space (OTFS) modulation is a promising waveform for future wireless communication, offering robustness against time-varying channels and Doppler effects in high-mobility scenarios. However, the anti-jamming capabilities of OTFS systems remain underexplored, leaving gaps in understanding their potential in jamming-prone environments. In this work, we mainly focus on the jamming detection and suppression methods for OTFS systems in additive an white Gaussian noise (AWGN) channel. A frequency-domain anti-jamming technique is presented, employing a time-domain overlapping window approach to reduce jamming sidelobes while mitigating the signal-to-noise ratio (SNR) degradation caused by the window function. Additionally, a smoothing window method is introduced to provide stable samples for jamming detection, effectively reducing the false alarm rate. Furthermore, a low-complexity improved forward consecutive mean excision (FCME) algorithm is proposed, enhancing its practicality and making it more suitable for real-world applications. Finally, the effectiveness of the proposed anti-jamming methods is validated through simulation analyses under single-tone and partial-band jamming scenarios.
- 7 March 2025
- Published by Elsevier in Integration
- Vol. 103
Resource-efficient and ultra-high throughput LDPC decoder for CCSDS near-earth standard
- 7 March 2025
- Published by Elsevier in Integration
- Vol. 103
Resource-efficient and ultra-high throughput LDPC decoder for CCSDS near-earth standard
- 13 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 29 (4) , 714-718
Decentralized Feedforward-Feedback Interference Cancellation-Based Detector for M-MIMO Systems
Decentralized baseband processing (DBP) has been considered a promising solution to tackle the excessive computational complexity and substantial interconnection costs challenges faced by centralized implementations in massive multiple-input multiple-output (M-MIMO) systems. However, most existing decentralized detectors experience considerable performance degradation resulting from limited information sharing among antenna clusters. In this letter, we propose a decentralized feedforward-feedback interference cancellation (FFIC) detection paradigm for DBP architectures, which is well-suited for message-passing-based nonlinear detectors. The expectation propagation (EP) algorithm is employed as an illustrative example. Simulation results demonstrate that the proposed FFIC-EP detector yields significant performance improvements compared to conventional methods, providing a flexible trade-off between performance, complexity, and interconnection costs, especially in scenarios with low BS-antenna-to-user ratios.
- 13 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 29 (4) , 714-718
Decentralized Feedforward-Feedback Interference Cancellation-Based Detector for M-MIMO Systems
Decentralized baseband processing (DBP) has been considered a promising solution to tackle the excessive computational complexity and substantial interconnection costs challenges faced by centralized implementations in massive multiple-input multiple-output (M-MIMO) systems. However, most existing decentralized detectors experience considerable performance degradation resulting from limited information sharing among antenna clusters. In this letter, we propose a decentralized feedforward-feedback interference cancellation (FFIC) detection paradigm for DBP architectures, which is well-suited for message-passing-based nonlinear detectors. The expectation propagation (EP) algorithm is employed as an illustrative example. Simulation results demonstrate that the proposed FFIC-EP detector yields significant performance improvements compared to conventional methods, providing a flexible trade-off between performance, complexity, and interconnection costs, especially in scenarios with low BS-antenna-to-user ratios.
- 13 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (6) , 9370-9379
Pattern-Domain NOMA-Based Orthogonal Time Frequency Space Modulation
Orthogonal time frequency space (OTFS) is envisioned as a highly promising modulation technique due to its superior performance in high-mobility scenarios. Meanwhile, non-orthogonal multiple access (NOMA) stands out as a key contender for enhancing spectral efficiency and reducing transmission delay. In this paper, we amalgamate the pattern division multiple access (PDMA), recognized as an appealing NOMA scheme, with OTFS, coined as OTFS-PDMA, to leverage the benefits of both technologies and address the low-latency and massive connectivity demands of sixth-generation (6G) networks. Specifically, we first reformulate the input-output relations in the delay-Doppler domain for localized and distributed-mapping-based OTFS-PDMA systems featuring various PDMA pattern allocation schemes. Then, we propose a low-complexity power vector expectation propagation detection algorithm (PV-EPA) for OTFS-PDMA schemes operating in spatially correlated channels. Simulation results demonstrate that the proposed OTFS-PDMA scheme offers substantial performance improvements over the conventional OTFS-OMA scheme. For irregular PDMA patterns, localized mapping-based OTFS-PDMA schemes exhibit superior performance relative to their distributed counterparts. Additionally, the proposed PV-EPA receiver shows remarkable robustness against channel correlation and achieves a favorable trade-off between performance and complexity.
- 13 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (6) , 9370-9379
Pattern-Domain NOMA-Based Orthogonal Time Frequency Space Modulation
Orthogonal time frequency space (OTFS) is envisioned as a highly promising modulation technique due to its superior performance in high-mobility scenarios. Meanwhile, non-orthogonal multiple access (NOMA) stands out as a key contender for enhancing spectral efficiency and reducing transmission delay. In this paper, we amalgamate the pattern division multiple access (PDMA), recognized as an appealing NOMA scheme, with OTFS, coined as OTFS-PDMA, to leverage the benefits of both technologies and address the low-latency and massive connectivity demands of sixth-generation (6G) networks. Specifically, we first reformulate the input-output relations in the delay-Doppler domain for localized and distributed-mapping-based OTFS-PDMA systems featuring various PDMA pattern allocation schemes. Then, we propose a low-complexity power vector expectation propagation detection algorithm (PV-EPA) for OTFS-PDMA schemes operating in spatially correlated channels. Simulation results demonstrate that the proposed OTFS-PDMA scheme offers substantial performance improvements over the conventional OTFS-OMA scheme. For irregular PDMA patterns, localized mapping-based OTFS-PDMA schemes exhibit superior performance relative to their distributed counterparts. Additionally, the proposed PV-EPA receiver shows remarkable robustness against channel correlation and achieves a favorable trade-off between performance and complexity.
- Open Access
Robust Symbol and Frequency Synchronization Method for Burst OFDM Systems in UAV Communication
This paper introduces a robust synchronization method for orthogonal frequency division multiplexing (OFDM) in multi-unmanned aerial vehicle (UAV) communication systems, focusing on minimizing overhead while achieving reliable synchronization. The proposed synchronization scheme enhances both frame efficiency and implementation simplicity. Initially, a high-efficiency frame structure is designed without a guard time interval, utilizing a preamble sequence to simultaneously achieve both symbol synchronization and automatic gain control (AGC) before demodulation. Subsequently, a novel 2-bit non-uniform quantization method for the Zadoff–Chu sequences is developed, enabling the correlation operations in the traditional symbol synchronization algorithm to be implemented via bitwise exclusive OR (XOR) and addition operations. The complexity of hardware implementation and the energy consumption for symbol synchronization can be reduced significantly. Furthermore, the impact of AGC on frequency synchronization performance is examined, and an improved frequency synchronization method based on AGC gain compensation is proposed. Finally, the performance of the proposed method is rigorously analyzed and compared with that of the traditional method through computer simulations, demonstrating the effectiveness and superiority of the proposed approach.
Open AccessRobust Symbol and Frequency Synchronization Method for Burst OFDM Systems in UAV Communication
This paper introduces a robust synchronization method for orthogonal frequency division multiplexing (OFDM) in multi-unmanned aerial vehicle (UAV) communication systems, focusing on minimizing overhead while achieving reliable synchronization. The proposed synchronization scheme enhances both frame efficiency and implementation simplicity. Initially, a high-efficiency frame structure is designed without a guard time interval, utilizing a preamble sequence to simultaneously achieve both symbol synchronization and automatic gain control (AGC) before demodulation. Subsequently, a novel 2-bit non-uniform quantization method for the Zadoff–Chu sequences is developed, enabling the correlation operations in the traditional symbol synchronization algorithm to be implemented via bitwise exclusive OR (XOR) and addition operations. The complexity of hardware implementation and the energy consumption for symbol synchronization can be reduced significantly. Furthermore, the impact of AGC on frequency synchronization performance is examined, and an improved frequency synchronization method based on AGC gain compensation is proposed. Finally, the performance of the proposed method is rigorously analyzed and compared with that of the traditional method through computer simulations, demonstrating the effectiveness and superiority of the proposed approach.
- 22 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (7) , 1489-1493
Burst Error Identification Method for LDPC Coded Systems
In this work, we propose an erasure aware technique to mitigate the detrimental effects of the burst error in a low density parity check(LDPC) coded system. First, we generate the estimated error pattern based on tentative decision over the received symbols and parity check matrix, via computing the total number of unsatisfied check equations for each variable node. Second, we determine the occurrence of burst errors based on the weight of error pattern, and identify the position and length of the burst error using a sliding window search method. Furthermore, the closed-form expressions of the detection probability and false alarm probability for burst error detection was derived. Finally, numerical and simulation results demonstrated that the proposed erasure-aware technique based on estimated or empirically determined threshold achieves significant performance gain over the conventional erasure-agnostic one.
- 22 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (7) , 1489-1493
Burst Error Identification Method for LDPC Coded Systems
In this work, we propose an erasure aware technique to mitigate the detrimental effects of the burst error in a low density parity check(LDPC) coded system. First, we generate the estimated error pattern based on tentative decision over the received symbols and parity check matrix, via computing the total number of unsatisfied check equations for each variable node. Second, we determine the occurrence of burst errors based on the weight of error pattern, and identify the position and length of the burst error using a sliding window search method. Furthermore, the closed-form expressions of the detection probability and false alarm probability for burst error detection was derived. Finally, numerical and simulation results demonstrated that the proposed erasure-aware technique based on estimated or empirically determined threshold achieves significant performance gain over the conventional erasure-agnostic one.