scispace - formally typeset
Search or ask a question
Author

Idriss Chana

Bio: Idriss Chana is an academic researcher from Arts et Métiers ParisTech. The author has contributed to research in topics: Decoding methods & Block code. The author has an hindex of 6, co-authored 24 publications receiving 82 citations.

Papers
More filters
Journal ArticleDOI
TL;DR: A hard-decision decoding technique based on Genetic Algorithms (HDGA) is described, which is applicable to the general case of error correcting codes where the only known structure is given by the generating matrix G.
Abstract: In this paper, we describe a hard-decision decoding technique based on Genetic Algorithms (HDGA), which is applicable to the general case of error correcting codes where the only known structure is given by the generating matrix G. Then we present a new soft-decision decoding based on HDGA and the Chase algorithm (SDGA). The performance of some binary and non-binary Linear Block Codes are given for HDGA and SDGA over Gaussian and Rayleigh channels. The performances show that the HDGA decoder has the same performances as the Berlekamp-Massey Algorithm (BMA) in various transmission channels. On the other hand, the performances of SDGA are equivalent to soft-decision decoding using Chase algorithm and BMA (Chase-BMA). The complexity of decoders proposed is also discussed and compared to those of other decoders.

16 citations

Journal Article
TL;DR: An efficient stop criterion is proposed and it reduces considerably the decoding complexity of the algorithm and shows that the proposed decoder is less complex than its competitors that are based also on genetic algorithms.
Abstract: Recently Genetic algorithms are successfully used for decoding some classes of error correcting codes. For decoding a linear block code C, these genetic algorithms computes a permutation p of the code generator matrix depending of the received word. Our main contribution in this paper is to choose the permutation p from the automorphism group of C. This choice allows reducing the complexity of re-encoding in the decoding steps when C is cyclic and also to generalize the proposed genetic decoding algorithm for binary nonlinear block codes like the Kerdock codes. In this paper, an efficient stop criterion is proposed and it reduces considerably the decoding complexity of our algorithm. The simulation results of the proposed decoder, over the AWGN channel, show that it reaches the error correcting performances of its competitors. The study of the complexity shows that the proposed decoder is less complex than its competitors that are based also on genetic algorithms.

13 citations

Proceedings ArticleDOI
01 Oct 2016
TL;DR: The impact of MTC devices that try to massively and simultaneously have random access to LTE are studied to compare the performance of these solutions according to three metrics: success probability, collision probability and average delay.
Abstract: Machine-Type-Communication (MTC), also known as Machine to Machine (M2M) communication is one of the emerging technologies in mobile broadband networks such as LTE (Long Term Evolution) known as a key technology for the future. Several problems occur in the presence of massive M2M communications, such as the congestion at the radio access because of simultaneous signals or data messages sent from a large number of MTC devices. In this work, we study the impact of MTC devices that try to massively and simultaneously have random access to LTE. The part of radio congestion was treated by 3GPP as an indispensable element to control the congestion, 3GPP proposed several solutions. In this paper, we analyze and compare the performance of these solutions according to three metrics: success probability, collision probability and average delay.

8 citations

Proceedings ArticleDOI
07 Apr 2011
TL;DR: An efficient new soft-decision decoding algorithm suitable to be applied to any binary cyclic codes, exploitation of the cyclic property available on the most popular linear block codes which are cyclic Codes is presented.
Abstract: In this paper we present an efficient new soft-decision decoding algorithm suitable to be applied to any binary cyclic codes. The idea behind our decoding algorithm is the exploitation of the cyclic property available on the most popular linear block codes which are cyclic codes. Numerical results for the proposed algorithm are presented; the plotted curves show that the performances of our decoder are relatively better than the performances of OSD-1 (Ordered Statistic Decoding) [1] and Chase type II [2] algorithm.

8 citations

Proceedings ArticleDOI
01 Oct 2018
TL;DR: A new security level of authentication protocol is proposed that satisfies the security requirements by providing protection against several attacks, reducing bandwidth consumption by optimizing the authentication messages and secures an efficient communications among various IoT devices.
Abstract: Nowadays, systems communications have evolved greatly and creating a new ecosystem with appearance of a high variety of objects, which are able to communicate with each other. The convergence of the cellular networks is raising a new concept called Machine-to-Machine (M2M) communication, which are the most popular application for the Internet of Things (IoT). The future IoT causes different challenges among them we can cite the security of communication and privacy of users. The standard authentication and key agreement protocol (EPS-AKA) normalized by the 3rd Generation Partnership Project (3GPP) in Long Term Evolution (LTE) system is proposed to provide the authentication service between the device and the network. However, this protocol does not support IoT objects and has some issues, including security attack vulnerabilities and traffic overload due to control message. In this article, we propose a new security level of authentication protocol that satisfies the security requirements by providing protection against several attacks, reducing bandwidth consumption by optimizing the authentication messages and secures an efficient communications among various IoT devices. Simulation results showed that the proposed when compared to existing protocols offers better performances in terms of security, overhead and computations delay.

7 citations


Cited by
More filters
01 Jun 1995
TL;DR: S-polynomials eliminating the leading term Buchberger's criterion and algorithm andWavelet Design construct wavelet filters proof of the Buchberger criterion termination and elimination.
Abstract: 1 S-polynomials eliminating the leading term Buchberger's criterion and algorithm 2 Wavelet Design construct wavelet filters 3 Proof of the Buchberger Criterion two lemmas proof of the Buchberger criterion termination and elimination

292 citations

Journal ArticleDOI
Bin Liao1, Yasir Ali, Shah Nazir, Long He1, Habib Ullah Khan2 
TL;DR: This is the first attempt to analyze the security issues and challenges of IoT in light of mobile computing and it will open a gateway towards future research.
Abstract: Internet of Things (IoT) devices are operating in various domains like healthcare environment, smart cities, smart homes, transportation, and smart grid system. These devices transmit a bulk of data through various sensors, actuators, transceivers, or other wearable devices. Data in the IoT environment is susceptible to many threats, attacks, and risks. Therefore, a robust security mechanism is indispensable to cope with attacks, vulnerabilities, security, and privacy challenges related to IoT. In this research, a systematic literature review has been conducted to analyze the security of IoT devices and to provide the countermeasures in response to security problems and challenges by using mobile computing. A comprehensive and in-depth security analysis of IoT devices has been made in light of mobile computing, which is a novel approach. Mobile computing’s technological infrastructures such as smartphones, services, policies, strategies, and applications are employed to tackle and mitigate these potential security threats. In this paper, the security challenges and problems of IoT devices are identified by a systematic literature review. Then, mobile computing has been used to address these challenges by providing potential security measures and solutions. Hardware and software-based solutions furnished by mobile computing towards the IoT security challenges have been elaborated. To the best of our knowledge, this is the first attempt to analyze the security issues and challenges of IoT in light of mobile computing and it will open a gateway towards future research.

90 citations

Journal ArticleDOI
TL;DR: A novel classification for the current Random Access (RA) techniques that have been proposed for M2M communications in LTE networks is introduced, and an analytical comparison has been provided among the different techniques according to the parameters for each approach.
Abstract: Machine-to-machine (M2M) communications refer to the autonomous interaction between connected devices without the human intervention. Recently, the Third-Generation Partnership Project (3GPP) introduced the Long-Term Evolution (LTE) and Long-Term Evolution-Advanced (LTE-A) as the improved version of the fourth-generation (4G) cellular networks. LTE/LTE-A networks have been considered an appropriate infrastructure for implementing M2M communications. However, the LTE/LTE-A networks were originally introduced for human-to-human (H2H) communications which have different characteristics from M2M communications. Thus, the LTE/LTE-A networks must be adapted to support the special characteristics of M2M communications. This work provides a comprehensive review of M2M communications over LTE networks, including M2M architectures, LTE structure, deployment challenges, and access control requirements. Moreover, this work introduces a novel classification for the current Random Access (RA) techniques that have been proposed for M2M communications in LTE networks. According to the main targeted objective, the current RA techniques are classified into three categories: massive access control techniques, energy efficiency techniques, and performance improvement techniques. Each category is further divided into two subcategories, and the relevant RA techniques are presented for each category. Furthermore, an analytical comparison has been provided among the different techniques according to the parameters for each approach. This work can be considered a good starting point for those who are interested in RA techniques for M2M communications over LTE/LTE-A networks.

27 citations

Proceedings ArticleDOI
01 Oct 2018
TL;DR: Experiments showed that peak- to-average power ratio (PAPR) of transmitted sequence is higher than theoretical both in case of “classic” signals with rectangular envelope form and optimal ones (with and without restriction on peak-to- average power ratio).
Abstract: In this paper the research on realization of transmitter for optimal signals which provide high spectral efficiency without significant energy losses is done. HackRF One is chosen as a transmitter. Experiments showed that peak-to-average power ratio (PAPR) of transmitted sequence is higher than theoretical both in case of “classic” signals with rectangular envelope form and optimal ones (with and without restriction on peak-to-average power ratio). It is caused by parasitic amplitude modulation. However, experimental values of PAPR of optimal signals are less than ones of “classic” signals due to absence of transient processes. In future works BER performance of implemented transmitter will be estimated.

21 citations

Journal ArticleDOI
TL;DR: A novel online control algorithm is proposed that enables the most likely successful preamble transmission for the devices that manifest higher priority requirements and is able to resolve congestions for massive activation of IoT devices.
Abstract: Internet of Things (IoT) imbued with several heterogeneous services and applications is integral to the ultimate realization of connected living. However, massive connectivity would pose huge challenges not only due to immense scalability but also due to diverse characteristics of periodicity, delay-criticality, and quality-of-service (QoS) requirement. One important trend of this diversity is that the connected devices would manifest different priorities. Random access procedure (RAP) is the first step by which most devices establish connection to the base station. A major transformation is urgently needed in RAP for cellular IoT as the volume of connected devices would far exceeds human oriented connections of the legacy networks. To prioritize the RAP for IoT devices, we propose novel online control algorithm that enables the most likely successful preamble transmission for the devices that manifest higher priority requirements. In the proposed algorithm, the number of active devices in each priority is recursively estimated based on Bayesian rule and then the preambles to each priority are accordingly allocated. We extend our proposal by adopting access class baring (ACB) to optimize the algorithm and subsequently, enhance it further by incorporating access delay requirements. Extensive simulations show the effectiveness of proposed algorithms over multiple priorities and confirm that the proposed algorithms are able to resolve congestions for massive activation of IoT devices.

15 citations