Gül, G.G.GülVargas, A.A.VargasGerstacker, W.H.W.H.GerstackerBreiling, M.M.Breiling2022-03-042022-03-042011https://publica.fraunhofer.de/handle/publica/22530010.1109/TCOMM.2011.020411.090497In 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.en621journal article