Open AccessLDPC Decoding With Low Complexity for OFDM Index Modulation
Author(s) -
Eunchul Yoon,
Soonbum Kwon,
Unil Yun,
Sun-Yong Kim
Publication year - 2021
Publication title -
ieee access
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.587
H-Index - 127
ISSN - 2169-3536
DOI - 10.1109/access.2021.3077256
Subject(s) - aerospace , bioengineering , communication, networking and broadcast technologies , components, circuits, devices and systems , computing and processing , engineered materials, dielectrics and plasmas , engineering profession , fields, waves and electromagnetics , general topics for engineers , geoscience , nuclear engineering , photonics and electrooptics , power, energy and industry applications , robotics and control systems , signal processing and analysis , transportation
In this paper, the posterior probabilities of the low-density parity check (LDPC) coded bits are derived for the orthogonal frequency division multiplexing index modulation (OFDM-IM) system to reduce the implementation complexity of LDPC decoding without performance loss. Specifically, the complexity of LDPC decoding is reduced by decomposing the posterior probability of the coded bit into multiple likelihood probabilities, each of which is obtained for each subcarrier of the corresponding OFDM-IM subblock. The results of the complexity analysis indicate that the proposed approach significantly reduces the implementation complexity of LDPC decoding for OFDM-IM compared to the conventional approach. Furthermore, the simulation results confirm that the proposed approach provides the same bit error rate performance as the conventional approach.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom