arrow
Return

Random Multiplexing

delete2026-04-01
delete0
PRE
AI
L
Lei Liu
Y
Yuhao Chi *
Z
Zhang, Zhaoyang
DOI:10.1109/TIT.2026.3653055delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
As wireless communication applications evolve from traditional multipath environments to high-mobility scenarios like unmanned aerial vehicles, multiplexing techniques have advanced accordingly. Traditional single-carrier frequency-domain equalization (SC-FDE) and orthogonal frequency-division multiplexing (OFDM) have given way to emerging orthogonal time-frequency space (OTFS) and affine frequency-division multiplexing (AFDM). These approaches exploit specific channel structures-e.g., Toeplitz-structured multipath channel matrix for OFDM and SC-FDE or doubly selective channels for OTFS and AFDM-to diagonalize or sparsify the effective channel, thereby enabling low-complexity detection. However, their reliance on these structures significantly limits their robustness in dynamic, real-world environments. To address these challenges, this paper studies a random multiplexing technique that is decoupled from the physical channels, thereby enabling its application to arbitrary norm-bounded and spectrally convergent channel matrices. Random multiplexing achieves statistical fading-channel ergodicity for transmitted signals by constructing an equivalent input-isotropic channel matrix in the random transform domain. It guarantees the asymptotic replica MAP bit-error rate (BER) optimality of AMP-type detectors for linear systems with arbitrary norm-bounded, spectrally convergent channel matrices and signaling configurations, under the unique fixed point assumption. A low-complexity cross-domain memory AMP (CD-MAMP) detector is considered for random multiplexing systems, leveraging the sparsity of the time-domain channel and the input isotropy of the equivalent channel. Optimal power allocations are derived to minimize the replica MAP BER and maximize the replica constrained capacity of random multiplexing systems, respectively. The optimal coding principle and replica constrained-capacity optimality of CD-MAMP detector are investigated for random multiplexing systems. Additionally, the versatility of random multiplexing in diverse wireless applications is explored. Numerical results are presented to validate the theoretical findings.
Keywords:
Random transform
linear systems
multiplexing
AMP detection
power allocation
channel encoding and decoding
maximum a posteriori BER
constrained capacity
low complexity
replica optimality
Random transform
linear systems
multiplexing
AMP detection
power allocation
channel encoding and decoding
constrained capacity
low complexity
replica optimality

Journal

I
IEEE Transactions on Information Theory
IF:
2.9
Papers:
317
Citations:
0

Organization

J
japan advanced institute of science & technology (jaist)
Scholars:
2.0K
Papers: 1.9K
Citations: 0
X
xidian university
Scholars:
5.9K
Papers: 2.0K
Citations: 0
Z
zhejiang university
Scholars:
17.4W
Papers: 12.0W
Citations: 152
researcher View more organizations