@conference { ISI:000371484600022, title = {Efficient Vertical handover scheme on IMS network and cost analysis}, booktitle = {2014 THIRD IEEE INTERNATIONAL COLLOQUIUM IN INFORMATION SCIENCE AND TECHNOLOGY (CIST{\textquoteright}14)}, series = {Colloquium in Information Science and Technology}, year = {2014}, note = {3rd IEEE International Colloquium on Information Science and Technology (CIST), Tetouan, MOROCCO, OCT 20-22, 2014}, pages = {129-134}, publisher = {IEEE; IEEE Comp Soc; IEEE Commun Soc; IEEE Morocco Sect; IEEE Morocco Comp \& Commun Joint Chapter; UAE IEEE Student Branch; Univ Abdelmalek Essaadi; ENSA Tetouan}, organization = {IEEE; IEEE Comp Soc; IEEE Commun Soc; IEEE Morocco Sect; IEEE Morocco Comp \& Commun Joint Chapter; UAE IEEE Student Branch; Univ Abdelmalek Essaadi; ENSA Tetouan}, abstract = {According to the various mobility, the resource allocation, interference, and the characteristics of heterogeneity and ubiquity of access network based on the next generation network, namely, the network IMS (IP Multimedia subsystem), have imposed several challenges. In regard to mobility management, handover management, and Quality of Service (QoS) provisioning, this paper proposes an adaptive environment based on IMS, between the heterogeneous access technologies, like WiMAX, WLAN, UMTS and LTE/LTE Advanced interfaces. Nevertheless, especially, the problem of handover decision, as resolving it influence, mainly on the handover performance; ANN(Artificial Neural Network) is proposed to solve the problem of decision and selection of best network access based IMS. The objective of proposed approach algorithms, is to maximize handover performance and reliability, with a new generic mobility management architecture, for system resource utilization by reducing handover latency and achieving load balance between different heterogeneous cells and networks}, isbn = {978-1-4799-5979-2}, issn = {2327-185X}, author = {Allouch, Hamid and Belkasmi, Mostafa}, editor = {ElMohajir, M and AlAchhab, M and Chahhou, M} } @article {8699110620120101, title = {Efficient Dual Domain Decoding of Linear Block Codes Using Genetic Algorithms.}, journal = {Journal of Electrical \& Computer Engineering}, year = {2012}, pages = {1 - 12}, abstract = {A computationally efficient algorithm for decoding block codes is developed using a genetic algorithm (GA). The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new approach reduces the complexity of decoding the codes of high rates. We simulated our algorithm in various transmission channels. The performance of this algorithm is investigated and compared with competitor decoding algorithms including Maini and Shakeel ones. The results show that the proposed algorithm gives large gains over the Chase-2 decoding algorithm and reach the performance of the OSD-3 for some quadratic residue (QR) codes. Further, we define a new crossover operator that exploits the domain specific information and compare it with uniform and two point crossover. The complexity of this algorithm is also discussed and compared to other algorithms [ABSTRACT FROM AUTHOR]}, keywords = {Coding theory, Computational complexity, Data transmission systems, Decoders (Electronics) {\textendash} Software, Genetic algorithms, Performance evaluation}, issn = {20900147}, url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=86991106\&site=ehost-live}, author = {Azouaoui, Ahmed and Belkasmi, Mostafa and Farchane, Abderrazak} } @conference { ISI:000310353000141, title = {An Efficient method to find the Minimum Distance of Linear Block Codes}, booktitle = {2012 INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS)}, year = {2012}, note = {International Conference on Multimedia Computing and Systems (ICMCS), Tangiers, MOROCCO, MAY 10-12, 2012}, pages = {773-779}, publisher = {Morocco Sect MTT/AP Joint Chapter}, organization = {Morocco Sect MTT/AP Joint Chapter}, abstract = {Finding the minimum distance of linear codes is in general a NP-hard problem, we propose an efficient algorithm to attack this problem. The principle of this approach is to search code words locally around the all-zero code word perturbed by a level of noise magnitude, in other words the maximum of noise that can be corrected by a Soft-In decoder, anticipating that the resultant nearest non-zero code words will most likely contain the minimum Hamming weight code word, whose Hamming weight is equal to the minimum distance of the linear code. A numerous results prove that the proposed algorithm is valid for general linear codes and it is very fast comparing to all others known techniques, therefore it is a good tool for computing. Comparing to Joanna{\textquoteright}s works, we proof that our algorithm has a low complexity with a fast time of execution. For some linear RQs, QDCs and BCHs codes with unknown minimum distance, we give a good estimation (true) of the minimum distance where the length is less than 439.}, isbn = {978-1-4673-1520-3}, author = {Askali, Mohamed and Nouh, Said and Belkasmi, Mostafa}, editor = {Essaaidi, M and Zaz, Y} } @conference { ISI:000310353000012, title = {Evaluation of Hybrid Geo-location based on UMTS and OPS Technologies}, booktitle = {2012 INTERNATIONAL CONFERENCE ON MULTIMEDIA COMPUTING AND SYSTEMS (ICMCS)}, year = {2012}, note = {International Conference on Multimedia Computing and Systems (ICMCS), Tangiers, MOROCCO, MAY 10-12, 2012}, pages = {63-67}, publisher = {Morocco Sect MTT/AP Joint Chapter}, organization = {Morocco Sect MTT/AP Joint Chapter}, abstract = {The degree of accuracy and availability of service make a distinction between the two main methods of geolocation that areGPS and UMTS. GPS provides good performances in terms of location in open area, but performances degrade to a significant manner when we go into an enclosed area. While the UMTS offers good results in urban areas, we can note a complementarity between these two techniques. In this paper we present a hybrid algorithm that combines these two techniques and takes best advantage of each of them with two approaches one simple and another advanced.}, isbn = {978-1-4673-1520-3}, author = {Saadane, Rachid and Belkasmi, Mostafa and El Koutbi, Mohammed and Dadda, Mohamed Rachid}, editor = {Essaaidi, M and Zaz, Y} } @conference { ISI:000261578001126, title = {An efficient decoder based on the genetic algorithms over a fading multipath channel in CDMA-based cellular systems}, booktitle = {2008 3RD INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGIES: FROM THEORY TO APPLICATIONS, VOLS 1-5}, year = {2008}, note = {3rd International Conference on Information and Communication Technologies, Damascus, SYRIA, APR 07-11, 2008}, pages = {2308+}, abstract = {In this paper, an iterative decoding algorithm of product block codes based on the genetic algorithms is presented. We applied this algorithm over a Rician fading multipath channel in CODIT system, to symmetric and asymmetric PBC constructed from BCH and Quadratic Residue codes of rate 2/5 The results show that the proposed algorithm performances outperforms those of the concatenated Reed-Solomon/Convolutional coding scheme proposed in {[}1]. The excellent results obtained in this paper open broad prospects for iterative decoders based on the genetic algorithms.}, isbn = {978-1-4244-1751-3}, author = {Elbouanani, Faissal and Belkasmi, Mostafa and Berbia, Hassan} }