Open AccessComplexity reduced turbo‐bit‐interleaved coded modulation with iterative decoding
Author(s) -
Kang Donghoon,
Oh Wangrok
Publication year - 2015
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.2014.0633
Subject(s) - turbo code , computer science , turbo , demodulation , decoding methods , turbo equalizer , algorithm , serial concatenated convolutional codes , modulation (music) , spectral efficiency , real time computing , concatenated error correction code , telecommunications , channel (broadcasting) , block code , philosophy , aesthetics , automotive engineering , engineering
Spectral efficiency of turbo code can be improved by use of coded modulation methods such as bit‐interleaved coded modulation (BICM) with iterative decoding (BICM‐ID). On the other hand, the performance of the turbo‐BICM can be further improved by iteratively exchanging information between a decoder and a demodulator within a receiver and this scheme is known as the turbo‐BICM‐ID. Unfortunately, the required complexity of the turbo‐BICM‐ID is much higher than that of the turbo bit‐interleaved coded modulation with iterative decoding turbo‐BICM‐ID. In this study, the authors propose a complexity reduced turbo‐BICM‐ID by optimising the mapping of coded bits to modulation symbols and the amount of information fed back from the decoder to the demodulator.