A Linear Multi-User Detector for STBC MC-CDMA Systems based on the Adaptive Implementation of the Minimum-Conditional Bit-Error-Rate Criterion and on Genetic Algorithm-assisted MMSE Channel Estimation

The implementation of efficient baseband receivers characterized by affordable computational load is a crucial point in the development of transmission systems exploiting diversity in different domains. In this paper, we are proposing a linear multi-user detector for MIMO MC-CDMA systems with Alamouti’s Space-Time Block Coding, inspired by the concept of Minimum Conditional Bit-Error-Rate (MCBER) and relying on Genetic-Algorithm (GA)-assisted MMSE channel estimation. The MCBER combiner has been implemented in adaptive way by using Least-Mean-Square (LMS) optimization. Firstly, we shall analyze the proposed adaptive MCBER MUD receiver with ideal knowledge of Channel Status Information (CSI). Afterwards, we shall consider the complete receiver structure, encompassing also the non-ideal GA-assisted channel estimation. Simulation results evidenced that the proposed MCBER receiver always outperforms state-of-the-art receiver schemes based on EGC and MMSE criterion exploiting the same degree of channel knowledge (i.e. ideal or estimated CSI)

Multiuser detection in a dynamic environment Part I: User identification and data detection

In random-access communication systems, the number of active users varies with time, and has considerable bearing on receiver's performance. Thus, techniques aimed at identifying not only the information transmitted, but also that number, play a central role in those systems. An example of application of these techniques can be found in multiuser detection (MUD). In typical MUD analyses, receivers are based on the assumption that the number of active users is constant and known at the receiver, and coincides with the maximum number of users entitled to access the system. This assumption is often overly pessimistic, since many users might be inactive at any given time, and detection under the assumption of a number of users larger than the real one may impair performance. The main goal of this paper is to introduce a general approach to the problem of identifying active users and estimating their parameters and data in a random-access system where users are continuously entering and leaving the system. The tool whose use we advocate is Random-Set Theory: applying this, we derive optimum receivers in an environment where the set of transmitters comprises an unknown number of elements. In addition, we can derive Bayesian-filter equations which describe the evolution with time of the a posteriori probability density of the unknown user parameters, and use this density to derive optimum detectors. In this paper we restrict ourselves to interferer identification and data detection, while in a companion paper we shall examine the more complex problem of estimating users' parameters.Comment: To be published on IEEE Transactions on Information Theor