Abstract
Low density signature orthogonal frequency division multiplexing (LDS-OFDM) and low density parity-check (LDPC) codes are multiple access and forward error correction (FEC) techniques, respectively. Both of them can be expressed by a bipartite graph. In this paper, we construct a joint sparse graph combining the single graphs of LDS-OFDM and LDPC codes, namely joint sparse graph for OFDM (JSG-OFDM). Based on the graph model, a low complexity approach for joint multiuser detection and FEC decoding (JMUDD) is presented. The iterative structure of JSG-OFDM receiver is illustrated and its extrinsic information transfer (EXIT) chart is researched. Furthermore, design guidelines for the joint sparse graph are derived through the EXIT chart analysis. By offline optimization of the joint sparse graph, numerical results show that the JSG-OFDM brings about 1.5–1.8 dB performance improvement at bit error rate (BER) of $10^{-5} $ over similar well-known systems such as group-orthogonal multi-carrier code division multiple access (GO-MC-CDMA), LDS-OFDM, and turbo structured LDS-OFDM.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
