Chanzi Liu

Dr. Chanzi Liu

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
27 June 2025 in Entropy
Verified
Journal Article
Open access
PDF file
JWJianjian Wu
Jianjian Wu
CLChanzi Liu
Chanzi Liu
XWXindi Wang
Xindi Wang
Chi-Tsun ChengChi-Tsun Cheng
Chi-Tsun Cheng
QZQingfeng Zhou
Qingfeng Zhou
Blind Interference Alignment (BIA) and Sparse Code Multiple Access (SCMA) offer the potential for massive connectivity but face limitations. Our recently proposed Sparsecode-and-BIA-based Multiple Access (SBMA) scheme synergizes their strengths, promising enhanced performance. SBMA leverages flexible user grouping (UG) strategies to effectively manage its unique combination of sparse code constraints and interference alignment requirements, thereby facilitating the fulfillment of diverse Quality of Service (QoS) demands. However, realizing SBMA’s full potential requires efficient joint resource allocation (RA), user scheduling (US), and user grouping (UG). The inherent coupling of these factors within the SBMA framework complicates this task significantly, rendering RA/US solutions designed purely for SCMA or BIA insufficient. This paper addresses this critical open issue. We first formulate the joint RA, US, and UG problems specifically for SBMA systems as an integer optimization task, aiming to maximize the number of users meeting QoS requirements. To tackle this NP-hard problem, we propose an effective algorithm based on Particle Swarm Optimization (PSO), featuring a carefully designed update function tailored specifically for the joint US and UG decisions required in SBMA. Comprehensive simulations demonstrate show that the proposed algorithm significantly outperforms the random-based scheme. Under certain conditions, it serves approximately 280% more users who meet their QoS requirements in high-SNR scenarios.

27 December 2024 in Entropy
Verified
Journal Article
Open access
PDF file
CLChanzi Liu
Chanzi Liu
JWJianjian Wu
Jianjian Wu
QZQingfeng Zhou
Qingfeng Zhou
In this paper, we propose a random frequency division multiplexing (RFDM) method for multicarrier modulation in mobile time-varying channels. Inspired by compressed sensing (CS) technology which use a sensing matrix (with far fewer rows than columns) to sample and compress the original sparse signal simultaneously, while there are many reconstruction algorithms that can recover the original high-dimensional signal from a small number of measurements at the receiver. The approach choose the classic sensing matrix of CS–Gaussian random matrix to compress the signal. However, the signal is not sparse which makes the reconstruction algorithms ineffective. We take full account of the great power of deep neural networks (DNN) to detect the signal as it is an underdetermined equation. The proposed RFDM establishes a novel signal modulation and detection method to target better transmission efficiency, and the simulation results show that the proposed method can achieve good BER, offering a new research paradigm to improve the spectrum efficiency of a multi-subcarrier, multi-antenna, multi-user system.

18 November 2022 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
JWJianjian Wu
Jianjian Wu
XLXinyu Liu
Xinyu Liu
CLChanzi Liu
Chanzi Liu
Chi-Tsun ChengChi-Tsun Cheng
Chi-Tsun Cheng
QZQingfeng Zhou
Qingfeng Zhou
With the increasing number of Internet of Things (IoT), Industry 4.0 (I4.0), and mobile devices, it can be expected that base stations will have to serve more and more clients with a limited number of antennas. For their broadcast channels, nonorthogonal multiple access (NOMA) and blind interference alignment (BIA) are two efficient and commonly adopted transmission schemes. This paper conducts a comparison study on these techniques on a 3-user multiple-input single-output (MISO) broadcast channel with a limited number of transmit antennas. Specifically, space-time block coding based NOMA (STBC-NOMA) and NOMA-assisted beamforming (NOMA-BF) are compared with BIA. Both perfect and imperfect successive interference cancellation (SIC) have been considered for NOMA-based schemes, and the theoretical achievable rates of all schemes have been derived. Furthermore, with a given fairness constraint among end users, the power allocation (PA) problems have been solved for cases when accurate channel state information is available at the transmitter (CSIT) as well as when only path loss information is available. Numerical results show the following: (1) none of the schemes under this study can always outperform the others under different SNR regions. (2) With imperfect SIC, NOMA-BF, and STBC-NOMA both suffer from a significant performance loss under a high SNR condition. (3) Fairness PA with only path loss information provides similar performance as that with perfect CSIT, thus partial CSIT is adequate for system or scheme designs in practice.