Hier finden Sie wissenschaftliche Publikationen aus den Fraunhofer-Instituten.

Low complexity demapping algorithms for multilevel codes

: Gül, G.; Vargas, A.; Gerstacker, W.H.; Breiling, M.


IEEE transactions on communications 59 (2011), No.4, pp.998-1008
ISSN: 0090-6778
Journal Article
Fraunhofer IIS ()

In order to reduce the computational complexity of maximumlikelihood symbol estimation (MLSE) demapping of multilevel codes which is based on block partitioning and which produces soft input for a multistage decoding (MSD) process, three different demapping algorithms are proposed. It is theoretically proven that the proposed algorithms can reduce exponentially increasing computational complexity of the MLSE demapping algorithm to a constant complexity (neglecting comparisons). It is shown by extensive simulations for AWGN and Rayleigh fading channels that the proposed low complexity demapping algorithms can achieve near MLSE performance.