Chulong Liang

Dr. Chulong Liang

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
11 July 2017 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
JMJunjie Ma
Junjie Ma
CLChulong Liang
Chulong Liang
CXChongbin Xu
Chongbin Xu
LPLi Ping
Li Ping
This paper is concerned with pilot transmission schemes in a large antenna system with non-orthogonal multiple-access (NOMA). We investigate two pilot structures-orthogonal pilot (OP) and superimposed pilot (SP). In OP, pilots occupy dedicated time (or frequency) slots, while in SP, pilots are superimposed with data. We study an iterative data-aided channel estimation (IDACE) receiver, where partially decoded data are used to refine channel estimation. We analyze the achievable rates for systems with IDACE receivers for both OP and SP. We show that the optimal portion of pilot power tends to zero for SP with Gaussian signaling. This result is consistent with existing findings obtained via the replica method in statistical physics. The latter involves multiple codes, which is convenient for theoretical analysis but difficult to implement. As a comparison, IDACE is potentially implementable in practice. We demonstrate that, with code optimization, SP can outperform OP in a high mobility environment with a large number of users. We provide numerical examples to verify our analysis.

3 June 2021 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
Lei LiuLei Liu
Lei Liu
CLChulong Liang
Chulong Liang
JMJunjie Ma
Junjie Ma
LPLi Ping
Li Ping
This paper studies a large random matrix system (LRMS) model involving an arbitrary signal distribution and forward error control (FEC) coding. We establish an area property based on the approximate message passing (AMP) algorithm. Under the assumption that the state evolution for AMP is correct for the coded system, the achievable rate of AMP is analyzed. We prove that AMP achieves the constrained capacity of the LRMS with an arbitrary signal distribution provided that a matching condition is satisfied. As a byproduct, we provide an alternative derivation for the constraint capacity of an LRMS using a proved property of AMP. We discuss realization techniques for the matching principle of binary signaling using irregular low-density parity-check (LDPC) codes and provide related numerical results. We show that the optimized codes demonstrate significantly better performance over un-matched ones under AMP. For quadrature phase shift keying (QPSK) modulation, bit error rate (BER) performance within 1 dB from the constrained capacity limit is observed.

1 December 2020 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
SLShansuo Liang
Shansuo Liang
CLChulong Liang
Chulong Liang
JMJunjie Ma
Junjie Ma
LPLi Ping
Li Ping
This paper considers a compressed-coding scheme that combines compressed sensing with forward error control coding. Approximate message passing (AMP) is used to decode the message. Based on the state evolution analysis of AMP, we derive the performance limit of compressed-coding. We show that compressed-coding can approach Gaussian capacity at a very low compression ratio. Further, the results are extended to systems involving non-linear effects such as clipping. We show that the capacity approaching property can still be maintained when generalized AMP is used to decode the message. To approach the capacity, a low-rate underlying code should be designed according to the curve matching principle, which is complicated in practice. Instead, analog spatial-coupling is used to avoid sophisticated low-rate code design. In the end, we study the coupled scheme in a multiuser environment, where analog spatial-coupling can be realized in a distributive way. The overall block length can be shared by many users, which reduces block length per-user.

6 June 2023 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
ZZZiyang Zhang
Ziyang Zhang
XYXiaohu You
Xiaohu You
Dongming WangDongming Wang
Dongming Wang
XXxinjiang xia
xinjiang xia
PZPengcheng Zhu
Pengcheng Zhu
JWJiangzhou Wang
Jiangzhou Wang
As an important part of beyond the fifth-generation (B5G) and the sixth-generation (6G) mobile communication systems, ultra-reliable and low latency communications (uRLLC) puts forward strict requirements for delay and reliability (e.g., 99.9999% reliability and 500 μs latency). At present, the evaluation measures of delay and reliability are usually based on infinite block length and rely on long-term statistics, which cannot meet the requirement of low latency. The cell-free system, with a very large number of distributed antennas, has the characteristics of macro-diversity and spatial sparsity, which can further enhance the performance of uRLLC. In this paper, the downlink multidevice cell-free system with hard deadlines is considered and analyzed in the finite block length (FBL) regime. The communication’s delay and reliability are described based on two instantaneous evaluation measures: transmission error (TE) and time overflow (TO) probability. From the perspective of information theory, this paper analyzes the analytic expression of TE probability for a single device and the performance impact of FBL on the traditional channel capacity analysis. Considering the multidevice TO probability in a cell-free system, the closed-form expressions of upper and lower bounds are derived and compared with the gamma approximation results. This paper further provides three methods, namely, transmission rate selection, device grouping and space division multiplexing, to balance the delay and reliability of the system and analyzes the performance.

17 October 2018 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
YHYang Hu
Yang Hu
CLChulong Liang
Chulong Liang
Lei LiuLei Liu
Lei Liu
CYChunlin Yan
Chunlin Yan
YYYifei Yuan
Yifei Yuan
LPLi Ping
Li Ping
Interleave-division multiple access (IDMA) is a multiple access scheme that has been considered in several recent proposals for the 5th generation cellular system. In this letter, based on evolution analysis, we show that the performance of IDMA can be enhanced using the transfer function matching principle. Such matching can be realized by superposition coded modulation, power control, repetition coding and zero padding. Zero padding together with cyclic shifting also leads to reduced implementation complexity. Our analysis is based on additive white Gaussian noise channels and we show by simulations that the matching techniques can also provide impressive performance in fading channels.

27 June 2018 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
YHYang Hu
Yang Hu
CLChulong Liang
Chulong Liang
JHJianhao Hu
Jianhao Hu
LPLi Ping
Li Ping
We consider a low-cost code shift division multiple-access (CSDMA) scheme, in which user-specific shifting is used to replace user-specific interleaving in interleave division multiple access (IDMA). We also outline a low-cost Gaussian approximation-based linear minimum mean square error message passing detection technique for CSDMA. We show that CSDMA can offer almost the same performance as the original IDMA in low-density parity-check or turbo coded systems, but with considerably lower implementation cost.