A Near-Optimum Multiuser Receiver for STBC MC-CDMA Systems Based on Minimum Conditional BER Criterion and Genetic Algorithm-Assisted Channel Estimation

,


Introduction
Future mobile communications standards will be required to provide high performance in terms of data rate, capacity, and quality of service.For this reason, the efficient exploitation of diversity in different domains (time, space, frequency) will be an issue.Multicarrier modulations [1] and Multiple-Input Multiple-Output (MIMO) space-time coding [2] are among the enabling technologies of future diversity-based highcapacity wireless communications.As claimed by Ahmadi in [3], next-generation mobile WiMAX technology will be based on Orthogonal Frequency Division Multiple Access (OFDMA), supported by Time-Division Duplexing (TDD) or Frequency-Division Duplexing (FDD), and advanced multiantenna systems, exploiting novel space-time coding schemes.OFDM and OFDMA apparently dominate the panorama of multicarrier modulations in wireless standards.However, in these last years, the spread-spectrum extension of OFDM, namely, Multicarrier CDMA (MC-CDMA), is raising a renewed interest.MC-CDMA is intrinsically more robust than OFDMA over frequency-selective channels.MC-CDMA transmits a user's symbol in parallel over a subcarrier set.Therefore, for the same number of subcarriers, MC-CDMA obtains a frequency diversity gain with respect to OFDMA.The price to be paid is an increasing amount of multiuser interference (MUI) due to the overlap of different symbols over the same subcarrier set.The adoption of lowcomplexity multiuser detection makes MC-CDMA a valuable competitor with OFDMA with some clear advantages in terms of anti-multipath resilience, in particular in mobile environments.It is worth to mention a recent work [4] that considers the evolution of High-Speed Packet Access (HSPA) from single-carrier DS/CDMA (HSPA currently adopts a PHY-layer scheme rather similar to Wideband CDMA of UMTS) to Multicarrier CDMA.Such an evolution is motivated by the synergies of HSPA with 3GPP Long-Term Evolution (LTE), which considers OFDMA and Single-Carrier FDMA (SC-FDMA) as preferential PHY-layer options.MC-CDMA may become a competitor also in future WiMAX standardization.Very recently, Aldhaheri and Al-Qahtani presented in [5] a novel MC-CDMA transmission scheme for fixed and mobile WiMAX.The performance improvement attainable by MC-CDMA with respect to the conventional OFDMA is relevant, in particular when the speed of the terminal is very high.
In such a framework, multiantenna systems, space-time coding, and multicarrier CDMA can be regarded as key technologies for future broadband wireless networking.In [6], it is shown that MC-CDMA with Space-Time Block Coding (STBC) can jointly exploit diversity in space and frequency domains in order to counteract multipath fading effects and, therefore, to provide performances quite close to the single-user bound.As it happens in Single-Input Single-Output (SISO) MC-CDMA, multiuser detection (MUD) plays a key role in improving system performances.
Theoretically optimum nonlinear maximum likelihood detection is characterized by an unsustainable computational complexity (exponentially growing with the number of users).For this reason, suboptimum linear MUD strategies should be investigated.Minimum Mean Square Error-(MMSE-) MUD techniques have been proposed for STBC MC-CDMA systems in [7].Although MMSE is a good choice in order to provide a simple implementation of adaptive receivers (Least-Mean-Square (LMS) and Recursive-Least-Squared (RLS) implementations are allowed), it is intrinsically suboptimal because it minimizes the Mean Squared Error between the received signal and the noiseless signal pattern.This results in a maximization of the Signal-to-Noise plus Interference Ratio (SINR), rather than in the minimization of the Bit Error Rate (BER) that is the expected target of an efficient receiver.The Minimum Bit Error Rate (MBER) criterion for multiuser detection has been successfully applied to DS-CDMA [8], MC-CDMA [9], and SDMA [10].Partial equalization and adaptive Threshold Orthogonality Restoring (TORC) based on BER minimization have been also proposed for MC-CDMA in [11,12].The potential advantages of implementing linear MBER MUD in STBC MC-CDMA context can be easily explained.STBC MC-CDMA is a transmission methodology, where diversity is obtained both in space and in frequency domain.The diversity gain, increased with respect to the conventional SISO case, is obtained at the price of an increased system complexity.In our opinion, the exploitation of the "full potential" of STBC MC-CDMA techniques can be obtained only by means of optimized multiuser detection approaches.In such a perspective, the investigation of MBER strategies can be regarded as a step ahead towards the computationally affordable signal detection optimization also in the STBC MC-CDMA case.The application of MBER reception to STBC MC-CDMA is not straightforward and should be investigated by carefully taking into account tight requirements in terms of ease of implementation and reduced computational effort.An example of application of MBER criterion to STBC MC-CDMA MUD has been shown in [13].The unknown probability density function (PDF) of the decision variable has been expressed in closed, but approximated, form by using the Parzen windows methodology.Then, the LMS criterion has been applied in order to adaptively implement the MBER receiver.The MBER-MUD approach of [13] does not require Channel State Information (CSI) knowledge and is characterized by a moderate computational complexity.Despite these favorable features, the multiuser receiver of [13] is quite far from optimality, in particular when the number of users increases.
In this paper, we are proposing a near-optimum multiuser detector for STBC MC-CDMA transmission systems based on the Minimum Conditional Bit Error Rate (MCBER) and on Genetic Algorithm-(GA-) assisted channel estimation.The design of MCBER-MUD and GA-assisted channel estimation for STBC MC-CDMA is motivated by the basic requirements of implementing an actual receiver scheme (that, therefore, cannot assume the ideal CSI knowledge) characterized by affordable computational load and nearoptimal performance.MCBER-MUD criterion has been successfully applied in [14] to DS/CDMA systems and in [15] to SISO MC-CDMA systems.MCBER-MUD is a slight modification of the original MBER-MUD criterion that allows reducing the computational complexity to a linear order with the number of users without significant losses in BER performances with respect to theoretically optimum ML-MUD.The STBC scheme considered in the present paper is the well-known Alamouti's scheme [16] characterized by ease of concept and implementation, computational efficiency and performance very close to theoretical bounds when employed in multipath fading channels.The practical implementation of the proposed MCBER detector relies on an adaptive optimization strategy based on the concept of deterministic gradient.In particular, we considered LMS to derive the MCBER solution in numerical iterative form.Such a choice has been motivated by the necessity of testing a computationally tractable algorithm like gradient descent, widely employed in practical MUD implementations.In this framework, it is worth citing a very recent paper [17], where another LMS-based adaptive receiver has been proposed for MC-CDMA systems with Alamouti's STBC.Such receiver is based on a modified MSE cost function and an improved LMS optimization strategy.The convergence rate is increased with respect to conventional LMS receiver.We think that our approach represents a step ahead with respect to [17], as it tries to minimize the system BER instead of minimizing the MSE between the filter output and the expected symbol belonging to the STBC block.The explicit BER minimization is conceptually closer to optimality than partial equalization and TORC of [11,12], whose performance is lower bounded by that of MMSE receiver exploiting ideal CSI knowledge.
It is known from the literature that formal MBER and MCBER criteria require CSI knowledge to work.Therefore, the problem of channel estimation should be adequately considered in the perspective of the provision of a technically viable solution.Searching for reliable and computationally efficient adaptive channel estimation, we decided to propose a Genetic Algorithm-(GA-) assisted semi adaptive MMSE channel estimation.The idea of exploiting a GA-based approach in order to efficiently implement channel estimation has been suggested by the promising results achieved in [18].In this work, Genetic Algorithm has been considered for near-optimal channel estimation applied to STBC MC-CDMA with MMSE multiuser detection.Substantially, the effectiveness of the GA-based approach has been assessed by comparing BER performance of the Wiener solution to MMSE-MUD, obtained by using the ideally known channel matrices and that one obtained by using estimated channel matrices.The maximum performance loss due to nonideal channel estimation was only 1 dB.On the other hand, results shown in [18] evidenced that iterative LMS-based MMSE-MUD may provide unsatisfactory performance, in particular when the interference load increases.
The paper is organized as follows.Section 2 contains the description of the system model.Section 3 details the implementation of the proposed near-optimal receiver based on MCBER and GA-assisted channel estimation.Section 4 shows some selected simulation results aimed at assessing the effectiveness of the proposed approach by means of a thorough comparison with other state-of-the-art receivers.Moreover, some considerations about computational complexity and parameterization both of MCBER reception and GA-assisted channel estimation are sketched at the end of Section 4. Finally, paper conclusions are drawn in Section 5.

STBC MC-CDMA System Description
In the present dealing, we consider a synchronous multiuser MC-CDMA system using Alamouti's Space Time Block Coding [16].A block scheme of such a transmission system is drawn in Figure 1.Two consecutive data symbols of the generic user k (k = 0, . . ., K − 1)[a k (i − 1), a k (i)] related to the generic ith modulation period (i = 1, 3, . ..) are mapped to two transmitting antennas according to the code matrix Φ k (i), whose elements are given by [16] [ The superscript operator ( * ) denotes the complex conjugate.The matrix of (1) represents Alamouti's STBC block.Alamouti's scheme exhibits some clear advantages.Essentially, it makes available a space diversity gain also for mobile terminals only by exploiting transmit diversity [16].The most economic and advantageous Alamouti's configuration considers two transmit antennas (installed at base station or access point) and a single antenna mounted at the receiver side [16].Such a configuration is considered in our paper, where the focus is on the development of cost-effective mobile terminals.Without losing generality, we suppose to consider binary antipodal BPSK symbols therefore, [a k (i − 1), a k (i)] ∈ {−1, 1}.The encoder outputs are transmitted during two consecutive transmission periods, each one of duration equal to T. During the first transmission period (i.e., (i − 1)T), two symbols a k (i − 1) and a k (i) are modulated by two separate Inverse Fast Fourier Transform-(I-FFT-) based multicarrier transmitters using a unique Hadamard-Walsh sequence where N is the number of subcarriers employed for spreading.Finally, the RF-converted Multicarrier Spread Spectrum (MC-SS) signals are simultaneously transmitted by antenna 1 and antenna 2, respectively.In the same way, during the successive transmission period (i.e., iT), the symbol −a k (i) is transmitted by antenna 1, and the symbol a k (i − 1) is transmitted by antenna 2, respectively.The complex conjugate operator disappears, as we are considering real symbols.In order to make the notation more compact in the multiuser case, we define two vectors of symbols ] T and, similarly, A(i) together with the orthonormal code matrix C as The received signal samples acquired at two consecutive symbol periods after the FFT-based coherent demultiplexing can be expressed as follows: where is the Additive Gaussian Noise vector (all vector components are independent and identically distributed with zero mean and variance σ 2 ), and is the complex channel coefficient related to subcarrier n and to the transmit antenna j.We reasonably assume that fading is flat over each subcarrier and almost time-invariant during two consecutive transmission periods (i.e., the coherence time is much greater than the symbol period).

The Design of the Near-Optimum STBC MC-CDMA Linear Multiuser Receiver Based on Conditional BER Minimization and GA-Assisted Channel Estimation
3.1.Design Motivations.As remarked in [1], in order to cope with the dramatic increase in demand of high-speed wireless connections, there is an urgent demand of flexible, efficient, and computationally affordable transceivers.The design of attractive wireless transceivers hinges on a range of contradictory factors.Given a certain wireless channel, it is always possible to design a transmission scheme capable of User k increasing transmission integrity at the cost of more sophisticated signal processing.Alternatively, transmission integrity may be increased without increasing system complexity, provided that, for example, channel coding/interleaving delay can be further extended.It is also realistic to increase the system integrity by invoking a more robust but lower throughput modulation scheme.In such a case, the integrity is increased without spending in terms of system complexity, just in terms of bandwidth expense.In this paper, we adopted a transmission scheme characterized by intrinsic robustness against multipath channel impairment (i.e., STBC MC-CDMA).Transmission integrity should be guaranteed without increasing too much system complexity, considering also that we have decided to exploit only transmit diversity in order to keep the mobile terminal cheaper.In order to solve the tradeoff between integrity and complexity, we design an innovative STBC MC-CDMA receiver architecture based on the integration of (a) Minimum-Conditioned BER linear MUD and (b) Genetic Algorithm-assisted channel estimation.In the following part of this section, we shall detail and motivate both the adopted linear MUD criterion and the channel estimation strategy based on evolutionary optimization.

LMS-Based MCBER Multiuser
Detector.In this subsection, we shall describe the Minimum Conditional Bit-Error-Rate criterion for STBC MC-CDMA linear multiuser detection.A generic linear multiuser detector generates two decision variables based on the linear combination of the received signal samples.Thus, the (scalar) decision variables for the user k, denoted by x k (i − 1) and x k (i), related to the ith modulation period can be expressed as follows: where w k (i − 1) and w k (i) are the N -elements vectors of receiver gains employed by the generic kth user in order to recombine the baseband output of the FFT-based demodulation stage.The operator (•) denotes the scalar product.
As we are considering a BPSK modulation, the couple of bits contained in a single STBC block can be estimated by observing the real part of x k (i − 1) and x k (i), respectively.Conditioned on the transmitted bit vectors A(i − 1) and A(i), assuming the perfect knowledge of the channel matrices H 1 and H 2 the random variables Re{x k (i − 1)} and Re{x k (i)} are Gaussian-distributed with mean values as follows: and variance S 2 To make the derivation of the probability of error easier, we can refer to the so-called sign-adjusted decision variables [10] defined as follows: y k (i−1) =a k (i−1) Re{x k (i− 1)} and y k (i) =a k (i) Re{x k (i)}.These new decision variables are Gaussian-distributed as well with mean values a k (i − 1)x k (i − 1) and a k (i)x k (i) and variances S 2 k (i − 1) and S 2 k (i), respectively.It is clear that the correct block detection event happens if and only if {y k (i − 1) > 0, y k (i) > 0}.Thus, the probability to have an error in the STBC block transmitted by user k can be written as follows: As y k (i − 1) and y k (i) are independent random variables, we obtain We can analytically compute the single probabilities of (7), conditioned on the bit vectors A(i − 1) and A(i) as follows: Pr where Q(x) is the conventional Gaussian error function.The calculation of the probability of error conditioned on A(i−1) and A(i) is straightforward: Assuming that the two symbols contained in an STBC block have the same probability of error, the third term in ( 9) is negligible with respect to the first two ones.Thus, a good approximation of ( 9) is given by By considering that the 2 2K possible transmitted bit vectors are independent and equiprobable, the average probability of error for the kth user can be written as ∀A(i−1) ∀A(i) The theoretical MBER criterion would lead to the computation of the couple of receiver gain vectors {w OPT k (i − 1), w OPT k (i)} minimizing the average probability of error of (11).The computational complexity of this detector is exponential in the number of users O(2 2K ), so its practical application becomes unfeasible as K increases.An alternative near-optimum linear detection criterion forecasts the minimization of the conditional probability of error [14,15].The Minimum Conditional BER (MCBER) can be expressed, in the considered STBC MC-CDMA case, as follows: The BER is conditioned in (12) only to the symbols not transmitted by the kth user in its own STBC block and is thus averaged with respect to all the possible combinations of the kth user's symbols.In our case, Alamouti's block is 2 × 2 sized; therefore, the number of possible symbol combinations is 2 2 = 4. Dua et al. claim in [14] that the Minimum Conditional BER (MCBER) adaptive MUD has a convergence rate comparable to MBER-MUD with a marginally low degradation in terms of bit error rate and affordable computational burden linearly increasing with users' number.Formally, the following optimization problem must be solved: Note that the couple of vectors {w opt k (i−1), w opt k (i)} minimizing (13) are different from {w OPT k (i−1), w OPT k (i)} minimizing (11).In [14], it is pointed out that no closed-form expression for MBER solution has to be found.The same fact is verified for MCBER solution.For this reason, a numerical solution has to be investigated.A possible solution is to exploit the Least-Mean-Square (LMS) algorithm based on the concept of gradient descent.LMS updating of the receiver weights is done iteratively along the negative gradient of the error probability surface, along both directions w opt k (i − 1) and w opt k (i).The updating rule at ith iteration is given by: where λ is the step-size parameter and ∇ 1 (•) and ∇ 2 (•) represent the gradient along the two directions w k (i − 1) and w k (i), respectively.For the first iteration (namely, i = 1), the following initialization has been chosen: . This is a reasonable choice, commonly used in the literature dealing with adaptive detection of MC-CDMA signals (see, e.g., [9]).
The LMS implementation of the MCBER detector can be obtained straightforwardly by using the updating rule of (11) combined with the gradient expressions reported in the following (mathematical details are omitted for the sake of brevity): , As far as data symbols transmitted by users k / = k are concerned, we define the vectors A(i − 1) =[ a 1 (i − 1), . . ., a k (i − 1), . . ., a K (i − 1)] and A(i) =[ a 1 (i), . . ., a k (i), . . ., a K (i)] in which the elements a k (i − 1) and a k (i) represent the symbol decisions performed by user k.The choice of exploiting the symbol decisions taken by users k / = k instead of using random symbols has been considered in order to improve the convergence of the adaptive optimization algorithm (as already noted in [14]).

The Proposed GA-Assisted Channel Estimation.
In a realistically implemented receiver, the channel matrices H 1 and H 2 are not deterministically known, as assumed in Section 3.2, but they should be replaced by their estimates H 1 and H 2 .It is clear that the estimation of CSI strongly impacts on MCBER receiver performance.The theoretical nearoptimality of MCBER criterion may be seriously impaired by unreliable channel estimation.In this paper, we considered the GA-assisted MMSE channel estimation for STBC MC-CDMA system already presented in [18].Such a channel estimation strategy, applied to the ideal MMSE multiuser detection, demonstrated itself very robust and near-optimal, clearly outperforming state-of-the-art techniques based on gradient descent.Genetic algorithms have a 20-year history of successful applications in telecommunications, signal processing, and electromagnetic fields due to some basic features, useful to solve complex problems with reasonable computational effort [19].
(1) The convergence to the optimal solution is theoretically guaranteed (provided that a proper parameterization of the GA procedure is set), avoiding that solution be trapped in local minima.
(2) The GA-based procedure can dynamically adapt itself to time-varying system conditions, because a new population of individuals is computed at each new generation.
Such features make advantageous the use of the so-called evolutionary optimization strategies (among which GAs are classified) to find practical solutions to optimization problems characterized by nonlinear cost functions and heavy computational burden (a highlighting example is shown in [20], where the inverse scattering problem is dealt with in electromagnetism).Standard GA implementations [19] represent feasible solutions as a set of individuals (called population).The cost function to be minimized (or maximized) is called fitness function.In our case, the fitness function is the following MMSE metric that must be   minimized with respect to the estimated channel matrices H 1 and H 2 : At each iteration (namely, generation), the genetic operators of crossover and mutation are applied on selected chromosomes with probabilities α and γ, respectively, in order to generate new solutions belonging to the search space.The population generation terminates when a satisfactory solution has been produced or when a fixed number of generations have been completed (see Figure 2).
The block diagram of the complete MCBER MUD receiver with GA-assisted channel estimation is shown in Figure 3.In order to make channel estimation robust and adaptive with respect to channel variations, we adopted a GA-assisted MMSE strategy articulated into two steps.The bits of the training sequence are organized in L/2 consecutive pairs, each one corresponding to a pair of symbols transmitted in two consecutive signaling periods.In such a way, the vectors of known bits EURASIP Journal on Wireless Communications and Networking employed to compute the MSE metric.The training step is repeated with a period approximately equal to the coherence time of the channel.The GA optimizer computes at each signaling period the estimated channel matrices using a selected parameterization in terms of generation number G Tr , population size P Tr , crossover, and mutation probabilities α Tr and γ Tr , respectively.The footer Tr means that the GA parameterization is related to the training step.
(2) Decision-Directed Adaptive Step: the output of the training step is the channel matrices ( H Tr obtained by the GA-based optimizer parameterized in such a way to "learn" the channel in reliable way.During a coherence time period, the stochastic values of the channel coefficients acting over each subcarrier are strongly correlated.By this, a decisiondirected adaptive updating step should be reasonably forecast.In the present dealing, the decision-directed updating step is performed by the GA, working with a different parameterization.The GA-based updating procedure is initialized by the solution computed during the training-aided step.During a symbol period, a iteration is performed by the GA, and a single generation of individuals is produced.The symbols employed in this step to fill the data vectors A(i − 1) and A(i) are the estimated symbols decided at the previous signaling period, that is, A(i − 1) and A(i).In such a step, crossover and mutation operators do not work, because only a GA generation runs.This updating procedure is "light," but this is reasonable because only small variations of the channel amplitude and phase are to be tracked during the coherence period.Moreover, in such a way, the effects of possible symbol errors on channel estimation are conveniently reduced.
In order to make our approach clearer to the reader, we can summarize the whole GA-assisted channel estimation procedure as follows (the flowchart of the procedure has been shown in Figure 4).
(i) At time t = 0 the GA-based procedure is initialized by a constant-value population.In particular, the identity matrices have been chosen for initialization.
(ii) The training-aided step begins.The L-bit known training sequence is transmitted, and the estimated channel matrices are computed by minimizing the cost function of (13).The GA parameterization is chosen as generation number = G Tr , population size = P Tr , crossover probability = α Tr , and mutation probability = γ Tr .
(iii) The training-aided step ends with the computation of the channel matrices at the time t = LT + εT (ε is the execution time of the GA-based optimization procedure expressed in number of bit periods).Now, the GA switches to the decision-directed adaptive modality.
(iv) At the beginning of the adaptive step, the GA is initialized with the channel matrices computed at the end of (ii), and the GA parameters are reassigned as follows: generation number G D = 1, population size P D , crossover probability α D = 0, and mutation probability γ D = 0.The footer D means that the GA parameterization is related now to the decisiondirected adaptive step.The GA procedure produces a single population of individuals that are quite close to the one chosen during the previous signaling interval.Such kind of population is stochastically generated in Gaussian way, imposing to the Gaussian generator an updating standard deviation σ up that actually is a system parameter.Such a parameter is linked to the Doppler spread and to the signal-to-noise ratio.
An explicit mathematical link is very difficult to be obtained, but, as thumb rule, we can say that it needs to be increased as SNR and Doppler spread increase.(v) The decision-directed updating step ends at the time t = LT + εT + W coh T, where W coh is the coherence time-window of the channel (expressed in number of bits).The GA is reinitialized with the channel matrices computed at the end of the coherence timewindow and reparameterized in order to start again with the training-aided step (ii).In such a way, we shall be able to test the effectiveness of the channel estimation strategy adopted together with the impact of nonideal channel estimation on MCBER performances.

Experimental Results
In order to verify the effectiveness of the proposed approach, we considered other state-of-the-art receivers for comparison, namely, (i) the ideal MMSE MUD receiver exploiting ideal CSI knowledge [7]; (ii) the LMS adaptive implementation of MMSE receiver [7]; (iii) the single-user Equal-Gain Combining (EGC) receiver [7]; (iv) the MMSE MUD receiver supported by the GAassisted channel estimation [18].As lower bound, we considered the BER curve obtained by Maximal Ratio Combining (MRC) detection in the singleuser case (i.e., the optimal single-user detection, supposing the absence of multiuser interference).In our simulations, we considered three different scenarios including K = 2, K = 4, and K = 6 users.The GA optimizer has been parameterized as follows: (i) training-aided step G Tr = 30, P Tr = 30, α Tr = 0.9, γ Tr = 0.01, L = 32, (ii) decisiondirected adaptive step P D = 10.As the Jakes channel model has been adopted for simulation, the channel coherence time window approximately equals about 1800 bits.Therefore, the overhead due to the insertion of the training sequence equals to less than 1.8%.
The corresponding BER curves versus E b /N 0 are shown for all the tested receivers in Figures 5, 6, and 7, respectively.It can be seen that in all scenarios the proposed LMS-based MCBER detector with and without ideal CSI knowledge clearly outperforms both EGC detector and LMS-based MMSE adaptive detector that exhibit a nasty error floor as the number of users increases.Moreover, the proposed MCBER detector exploiting ideal CSI knowledge yields performances that are better than those ones of ideal MMSE detector.Such a last improvement is clearly evident for K = 2 and K = 4 users, whereas it becomes slighter for K = 6 users.In general, for an increasing number of users, BER curves related to ideal MMSE and MCBER tend to become closer to each other and more distant with respect to the singleuser bound.Such behaviour is not unexpected.As number of users K increases, the global detection noise (including AWGN and multiuser interference) is getting more and more Gaussian-distributed, and, therefore, optimizing the receiver with respect to the MMSE provides very close results to optimizing on BER.Moreover, the single-user bound curve depicted in Figures 5-7 is a lower bound also on theoretically 4.2.Computational Complexity Considerations and Algorithmic Parameterization.As far as computational issues are concerned, the current literature claims that MCBER criterion has a computational order which is linear with the number of users [14].In such a case, the computational effort would be reduced with respect to the ideal MMSE detector (which is O(K 3 ) [7]), and it would be comparable with the LMS-based adaptive implementation of MMSE (which is linear again).In our opinion, the reduction of the computational complexity is one of the main advantages yielded by the proposed approach.In fact, the MCBER criterion is theoretically closer to optimality than MMSE, and simulation results shown in Figures 5-7 confirm this claim.But the developed adaptive MCBER-MUD algorithm is also less demanding from a computational viewpoint than ideal MMSE, despite requiring the same knowledge of the channel state information.About computational complexity of the GA-assisted channel estimator we can say that GA requires a number of elementary operations to derive a solution that is equal to υ op = (α + γ)GP [19].Thus, the computational burden required during the training-aided step is of the order of L • K • N • G Tr • P Tr elementary operations to be executed during an execution time window εT, where ε > 1.The value assigned to ε mainly depends on the computational power of the signal-processing device employed.During the decisiondirected adaptive step, the computational requirement of the GA is reduced to K • M • P D elementary operations to be executed during an STBC modulation period.Such a computational requirement is comparable with that one involved in state-of-the-art STBC channel estimation algorithms (see [18] for the comparison).
In order to conclude this section, we provide now some notes about algorithmic parameterization.The stepsize parameter λ of both LMS-based algorithms (MMSE and MCBER) has been chosen empirically for each scenario in order to minimize the overall BER over the various E b /N 0 values.From the parameters selection phase, we noted that LMS-based MCBER detector is characterized by a reduced sensitivity to parameterization with respect to state-of-theart LMS-based MMSE MUD.Indeed, fixing the number of users K, the step-size λ is substantially invariant with respect to E b /N 0 values.On the other hand, LMS-based MMSE multiuser detector would require a different value of λ for each E b /N 0 in order to provide satisfactory BER performances.As far as the parameterization of the GAbased optimizer is concerned, we must say that formal methodologies targeted to find an optimal parameterization of genetic procedures are not available.In the literature, there are only some interesting heuristic analyses like the one proposed by Tsoy in [21] .So GA parameters have been selected by means of explicitly devoted simulation trials, performed by keeping into account the major guidelines pointed out in [21] that basically are the following two: (a) the population size should be sufficiently large in order to have a conveniently dimensioned space search, and (b) the number of generations should be appropriately assigned in dependence of the population size.In fact, in case of large population, too strict limit for the search time can force algorithm to stop without having enough time to realize its search possibility.At the end of the simulation trials devoted to parameterization, we found numerical values for generation number, population size, crossover, and mutation probabilities (shown in Section 4.1) that have assured the best tradeoff between achieved results and computational load.In particular, we assumed an intermediate E b /N 0 equal to 15 dB as reference value, and we derived by simulations the best parameterization for this value.Then, we observed by other simulations that the GA parameterization chosen for the reference E b /N 0 is "very close to the best" also for higher and lower E b /N 0 .The reduced sensitivity to parameterization of GA procedures, already observed in [18], is again confirmed.

Conclusions
In this paper, a novel receiver scheme has been investigated for MC-CDMA systems using Alamouti's space-time block coding.In particular, we considered a Minimum Conditional Bit-Error-Rate (MCBER) MUD linear receiver in order to reduce the computational complexity without significant performance degradations with respect to the formal MBER criterion.In the perspective of a real receiver deployment, an adaptive LMS-based implementation of the MCBER detector has been integrated with a robust and computationally affordable channel estimation assisted by a genetic optimizer.The proposed MCBER approach always allows improving BER performances with respect to other state-of-the-art linear detectors working with the same degree of channel knowledge.It is worth noting that the performance improvement with respect to MMSE-MUD strategies is achieved by spending a reduced computational effort, linearly increasing with the number of users.Numerical results evidenced that BER curves of MCBER and ideal MMSE are getting closer as the number of users approaches the maximum allowable value.This behaviour is intrinsic to the linear multiuser detection and fully motivated by the nature of the MCBER criterion adopted.
Future research activities might concern the utilization of evolutionary optimization algorithms (e.g., GA, Particle Swarm Optimization (PSO), etc.) to provide a numerical solution to the MCBER problem instead of the proposed LMS-based solution.Also the adoption of PSO-assisted channel estimation, instead of GA-assisted one, may represent an interesting topic for future research.

Figure 3 :
Figure 3: Block diagram of the MCBER receiver supported by GA-assisted MMSE channel estimation.

( 1 )
Training-Aided  Step.during this step, an L bitlength binary training sequence a k = [ a 1 k , . . ., a L k ] is transmitted in the form of header for each user k.

4. 1 .
Simulation Results.The performances of the proposed STBC MC-CDMA receiver are evaluated by means of intensive simulation trials (performed in MATLAB-SIMULINK 7.5 environment) in a Rayleigh fading channel fixing the following parameters: number of subcarriers N = 8, transmission data rate r b = 1024 Kb/s, coherence bandwidth of the channel 2.1 MHz, and Doppler spread of the channel 100 Hz.We considered two test cases: the most theoretical case related to the MCBER detector exploiting the ideal CSI knowledge and the more realistic case related to the MCBER detector supported by the GA-assisted channel estimation.

Figure 4 :
Figure 4: Flowchart of the GA-assisted channel estimation algorithm for STBC MC-CDMA.