New Computational Complexity Reducing IDD Scheme Designed with Optimum Parameters

Abstract

An Iterative Detection and Decoding (IDD) scheme in a high-order Multiple-Input Multiple-Output (MIMO) wireless communication system requires a heavy computational complexity for an outstanding Bit Error Rate (BER) performance in a given Signal-to-Noise Ratio (SNR) environment. A new computational complexity reducing IDD scheme designed with optimum parameters is proposed in this paper to guarantee Quality of Service (QoS) without the loss of BER performance. There are three parameters to control the trade-off between computational complexity and BER performance of an IDD scheme: a candidate list size of Dynamic List Sphere Detector (D-LSD), a number of intra-iteration of Turbo decoder, and a number of IDD iteration. A complexity reduction of about 70 % is demonstrated in this study, when the target BER is around 1.0 x 10((-4)) at E-b/N-0 = 7dB in the case of a 4 x 4 MIMO system with 16-ary Quadrature Amplitude Modulation (QAM).