Ldpc Decoding With Low Complexity For Ofdm Index Modulation

IEEE ACCESS(2021)

引用 3|浏览3
暂无评分
摘要
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.
更多
查看译文
关键词
Communication systems, Simulation, OFDM, Bit error rate, Modulation, Parity check codes, Encoding, Communication system signaling, OFDM, decoding, index modulation, LDPC coding
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要