@article {Elhadjv20163239, title = {An accurate recognizer for basic Arabic sounds}, journal = {ARPN Journal of Engineering and Applied Sciences}, volume = {11}, number = {5}, year = {2016}, note = {cited By 0}, pages = {3239-3243}, abstract = {This paper is part of an ongoing work aiming to build an accurate Arabic sounds recognizer for teaching and learning purposes. Early phases of this work were dedicated to the development of a particular sound database from recitations of the Holy Quran to cover classical Arabic sounds; speech signals of this sound database were manually segmented and labelled on three levels: Word, phoneme, and allophone. Next, two baseline recognizers were built to validate the speech segmentation on both phoneme and allophone levels and also to test the feasibility of the sounds{\textquoteright} recognition intended target. This current phase considers the development of an elaborated recognizer, by considering the basic sounds and looking for their distinctive features (e.g. duration, energy, etc.) to determine which ones will be particularly helpful to identify the phonological variation of the basic sound. Here, we present the first results of the basic sounds recognition obtained so far. {\textcopyright} 2006-2016 Asian Research Publishing Network (ARPN).}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84961680252\&partnerID=40\&md5=b6050206ac83191694490b10877629ec}, author = {Elhadjv, Y.O.M.a b and Khelifa, M.O.M.c and Abdellah, Y.d and Belkasmi, M.c} } @article {Nouh2016742, title = {New efficient scheme based on reduction of the dimension in the multiple impulse method to find the minimum distance of linear codes}, journal = {International Review on Computers and Software}, volume = {11}, number = {9}, year = {2016}, note = {cited By 0}, pages = {742-751}, abstract = {In order to find a minimum weight codeword in a linear code, the Multiple Impulse Method uses the Ordered Statistics Decoder of order 3 having a complexity which increases with the code dimension. This paper presents an important improvement of this method by finding a sub code of C of small dimension containing a lowest weight codeword. In the case of Binary Extended Quadratic Residue codes, the proposed technique consists on finding a self invertible permutation σ from the projective special linear group and searching a codeword having the minimum weight in the sub code fixed by σ. The proposed technique gives the exact value of the minimum distance for all binary quadratic residue codes of length less than 223 by using the Multiple Impulse Method on the sub codes in less than one second. For lengths more than 223, the obtained results prove the height capacity of the proposed technique to find the lowest weight in less time. The proposed idea is generalized for BCH codes and it has permits to find the true value of the minimum distance for some codes of lengths 1023 and 2047. The proposed methods performed very well in comparison to previously known results. {\textcopyright} 2016 Praise Worthy Prize S.r.l. - All rights reserved.}, doi = {10.15866/irecos.v11i9.9702}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85006717110\&doi=10.15866\%2firecos.v11i9.9702\&partnerID=40\&md5=0cb2c7691fda83c0ef9764a93095e64c}, author = {Nouh, S.a and Joundan, I.A.a and Aylaj, B.b and Belkasmi, M.c and Namir, A.a} } @conference {Naamane2016, title = {A saddle-point based approach for semi-Analytical performance evaluation of a digital communication system}, booktitle = {IEEE Wireless Communications and Networking Conference, WCNC}, volume = {2016-September}, year = {2016}, note = {cited By 0}, abstract = {Nowadays, it has become difficult to obtain the expected performance of a digital communication system using the Monte Carlo simulation method. This is due to advanced technologies used in the transmitter and the receiver. In this paper, we propose a new semi-Analytical approach for deriving the error probability. It combines the saddle-point approximation and bootstrap technique for estimating the probability density function. Simulation results show that the obtained semi-Analytical error probability is close to that measured with Monte Carlo simulation and provides a significant gain in terms of computing time. {\textcopyright} 2016 IEEE.}, doi = {10.1109/WCNC.2016.7565011}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84989913404\&doi=10.1109\%2fWCNC.2016.7565011\&partnerID=40\&md5=a195d901faec2cafa27156b093772baf}, author = {Naamane, F.E.a and Et-tolba, M.b and Belkasmi, M.c} } @article {Ayoub20162179, title = {Serially concatenated OSMLD codes: Design and iterative decoding}, journal = {Applied Mathematical Sciences}, volume = {10}, number = {41-44}, year = {2016}, note = {cited By 0}, pages = {2179-2188}, abstract = {In this paper, the performance of serially concatenated one-step ma- jority logic decodable (SC-OSMLD) codes is investigated. The iterative decoding process uses a soft-input soft-output threshold decoding algo- rithm [1] as component decoder with our proposed connection scheme [2]. The effect of various components codes, interleaver size (Number of sub-blocks), and the number of iterations are investigated. Simulation results for SC-OSMLD codes transmitted over Additive White Gaussian Noise channel(AWGN) are provided. The simulation result will show that the slope of curves and coding gain are improved by increasing the number of decoder iterations and/or the interleaver size. {\textcopyright} 2016 Fouad Ayoub et al.}, doi = {10.12988/ams.2016.6387}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84983503792\&doi=10.12988\%2fams.2016.6387\&partnerID=40\&md5=46efa596ad7d8a871fc411883576d89c}, author = {Ayoub, F.a and Farchane, A.b and Mohamed, A.c and Belkasmi, M.c and Himmi, M.M.d} }