
Low‐complexity multiple‐signal joint decoding for overlapped x domain multiplexing signalling
Author(s) -
Lin Peng,
Wang Yafeng,
Li Daoben
Publication year - 2018
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2017.1402
Subject(s) - joint (building) , decoding methods , computer science , multiplexing , signalling , signal (programming language) , domain (mathematical analysis) , telecommunications , mathematics , engineering , mathematical analysis , mathematical economics , programming language , architectural engineering
By multiplexing waveform mapped with shifting and weighted symbols, overlapped x domain multiplexing (OVXDM) encoding scheme can obtain high spectral efficiency under a low signal‐to‐noise ratio. Though the maximum likelihood sequence detection decoders can obtain the optimal decoding performance, their computational complexities which increase exponentially with spectral efficiency in OVXDM are unbearable for practical implementations. In this study, a low‐complexity multiple‐signal joint decoding (MSJD) algorithm for OVXDM signalling is proposed over additive white Gaussian noise (AWGN) channel and extended to frequency selective fading (FSF) channel. Based on a novel joint information‐based metric, the proposed algorithm utilises information of each transmitted symbol contained in multiple received signals, and selects the proper number of received signals for decoding to achieve performance maximisation. Moreover, theoretical analysis is provided for the proposed algorithm in both AWGN and FSF channels, which indicates the relationship between performance and number of received signals under different OVXDM encoding parameters including multiplexing waveform and overlapping fold. Simulation results confirm the superior performance of the MSJD algorithm in terms of decoding performance and computational complexity compared with the present approaches.