# Random Multiplexing

arXiv: https://arxiv.org/abs/2512.24087 · HTML: https://mlsanity.com/paper/2512.24087/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 20 of its 76 references that are in the map.
- First posted on arXiv 30 Dec 2025.

## Builds on (most cited first, 20 of 20)

- [Overview of Deep Learning-based CSI Feedback in Massive MIMO Systems](https://mlsanity.com/paper/2206.14383/) (2022)
- [Approximate Message Passing algorithms for rotationally invariant matrices](https://mlsanity.com/paper/2008.11892/) (2020)
- [A Survey on Fundamental Limits of Integrated Sensing and Communication](https://mlsanity.com/paper/2104.09954/) (2021)
- [PCA Initialization for Approximate Message Passing in Rotationally Invariant Models](https://mlsanity.com/paper/2106.02356/) (2021)
- [Memory AMP](https://mlsanity.com/paper/2012.10861/) (2020)
- [Capacity-achieving Sparse Superposition Codes via Approximate Message Passing Decoding](https://mlsanity.com/paper/1501.05892/) (2015)
- [On Capacity Optimality of OAMP: Beyond IID Sensing Matrices and Gaussian Signaling](https://mlsanity.com/paper/2108.08503/) (2021)
- [Affine Frequency Division Multiplexing for Next Generation Wireless Communications](https://mlsanity.com/paper/2204.12798/) (2022)
- [Model-Driven Deep Learning-Based MIMO-OFDM Detector: Design, Simulation, and Experimental Results](https://mlsanity.com/paper/2206.10909/) (2022)
- [Interleaved Block-Sparse Transform](https://mlsanity.com/paper/2407.13255/) (2024)
- [OTFS Signaling for Uplink NOMA of Heterogeneous Mobility Users](https://mlsanity.com/paper/2102.04682/) (2021)
- [Low-Complexity Linear Diversity-Combining Detector for MIMO-OTFS](https://mlsanity.com/paper/2201.11317/) (2022)
- [Sufficient Statistic Memory Approximate Message Passing](https://mlsanity.com/paper/2206.11674/) (2022)
- [Low-Complexity Memory AMP Detector for High-Mobility MIMO-OTFS SCMA Systems](https://mlsanity.com/paper/2303.08531/) (2023)
- [Cross-Field Channel Estimation for Ultra Massive-MIMO THz Systems](https://mlsanity.com/paper/2305.13757/) (2023)
- [Sparse-DFT and WHT Precoding with Iterative Detection for Highly Frequency-Selective Channels](https://mlsanity.com/paper/2309.04149/) (2023)
- [Memory AMP for Generalized MIMO: Coding Principle and Information-Theoretic Optimality](https://mlsanity.com/paper/2311.04012/) (2023)
- [Massive Unsourced Random Access for Near-Field Communications](https://mlsanity.com/paper/2401.14008/) (2024)
- [Interleave Frequency Division Multiplexing](https://mlsanity.com/paper/2405.02604/) (2024)
- [Random Modulation: Achieving Asymptotic Replica Optimality over Arbitrary Norm-Bounded and Spectrally Convergent Channel Matrices](https://mlsanity.com/paper/2508.08099/) (2025)

## Built on by (most cited first, 1 of 1)

- [Diffusion-OAMP for Joint Image Compression and Wireless Transmission](https://mlsanity.com/paper/2604.27952/) (2026)

## Abstract (arXiv)

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 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, 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, leveraging the sparsity of the time-domain channel and the randomness 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. 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.