2019/06/26 by Jing Han, Han, Jing, Shengqian Ma +5
Computer Science · Engineering · #Advanced Wireless Communication Techniques #FOS: Computer and information sciences #FOS: Electrical engineering #Information Theory (cs.IT) #PAPR reduction in OFDM #Signal Processing (eess.SP) #Wireless Communication Networks Research #electronic engineering #information engineering
paper · pdf · doi:10.48550/arxiv.1906.10848
openalex publication_date 2019/06/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Orthogonal signal-division multiplexing (OSDM) is an attractive alternative to conventional orthogonal frequency-division multiplexing (OFDM) due to its enhanced ability in peak-to-average power ratio (PAPR) reduction. Combining OSDM with multiple-input multiple-output (MIMO) signaling has the potential to achieve high spectral and power efficiency. However, a direct channel equalization in this case incurs a cubic complexity, which may be expensive for practical use. To solve the problem, low-complexity per-vector and block equalization algorithms of MIMO-OSDM are proposed in this paper for time-invariant and time-varying channels, respectively. By exploiting the channel matrix structures, these algorithms have only a linear complexity in the transformed domain. Simulation results demonstrate their validity and the related performance comparisons.