Leila Najjar Atallah
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Leila Najjar Atallah has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Imen Nasr
University of Carthage,Department COSIM,Ariana,Tunisia
3 shared publications - Sofiane Cherif
Ariana, Ariana Tunisia
3 shared publications - Benoit Geller
Department U2IS, ENSTA-ParisTech, 91120 Palaiseau, France
2 shared publications Jianxiao Yang
Unité d'Informatique et d'Ingénierie des Systèmes (U2IS), Ecole Nationale Supérieure de Techniques Avancées (ENSTA ParisTech), Palaiseau, France
1 shared publicationKunlun Wang
Network Coding and Transmission Laboratory, Shanghai Jiao Tong University, China
1 shared publication- Leïla Gazzah1 shared publication
Latest Publications
- 9 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 17 (1) , 636-651
Near MAP Dynamical Delay Estimator and Bayesian CRB for Coded QAM Signals
This paper presents an off-line algorithm for dynamical time delay recovery for which the whole observation block is used. The time offset varies over the observation interval following a random walk model. The proposed synchronizer applies to data-aided (DA), non-data-aided (NDA) and code-aided (CA) modes. Theoretical performance of the off-line technique is derived and compared to simulation results. The Bayesian Cramer-Rao Bound (BCRB) is also evaluated for DA, NDA and CA modes and for both the off-line and on-line scenarios. Simulation results show the improvement brought by the off-line and the CA schemes. The presented algorithm outperforms the conventional on-line estimator, which only takes into account the current and previous observations, and its MSE approaches the BCRB.
- 9 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 17 (1) , 636-651
Near MAP Dynamical Delay Estimator and Bayesian CRB for Coded QAM Signals
This paper presents an off-line algorithm for dynamical time delay recovery for which the whole observation block is used. The time offset varies over the observation interval following a random walk model. The proposed synchronizer applies to data-aided (DA), non-data-aided (NDA) and code-aided (CA) modes. Theoretical performance of the off-line technique is derived and compared to simulation results. The Bayesian Cramer-Rao Bound (BCRB) is also evaluated for DA, NDA and CA modes and for both the off-line and on-line scenarios. Simulation results show the improvement brought by the off-line and the CA schemes. The presented algorithm outperforms the conventional on-line estimator, which only takes into account the current and previous observations, and its MSE approaches the BCRB.
- 1 February 2017
- Published by Elsevier in Computer Networks
- Vol. 114, 13-22
Trade-off between node selection and space diversity for accurate uncooperative localization
- 1 February 2017
- Published by Elsevier in Computer Networks
- Vol. 114, 13-22
Trade-off between node selection and space diversity for accurate uncooperative localization
- Open Access
- 1 February 2016
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 12 (2) , 8162580:1-8162580:16
Improving Rare Events Detection in WSN through Cluster-Based Power Control Mechanism
Rare events detection is one of the main applications in Wireless Sensor Networks (WSN) and is currently a central concern of a vast literature. Compressed Sensing (CS) theory has been proved to be quite adapted to this objective. Although this is not the first work on applying CS to sparse events detection in WSN, it is the first to highly justify the validity of the targets detection and counting problem formulation. In order to enhance the CS recovery capacity in WSN, this work considers an approach based on a coherence reduction of the sensing matrix premised on the transmitted power control (PC). Simulation results prove that, under the constraint of equal power consumption, the detection and counting performance is improved when the proposed power control scheme is employed compared to the case without PC.
- 1 February 2016
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 12 (2) , 8162580:1-8162580:16
Open AccessImproving Rare Events Detection in WSN through Cluster-Based Power Control Mechanism
Rare events detection is one of the main applications in Wireless Sensor Networks (WSN) and is currently a central concern of a vast literature. Compressed Sensing (CS) theory has been proved to be quite adapted to this objective. Although this is not the first work on applying CS to sparse events detection in WSN, it is the first to highly justify the validity of the targets detection and counting problem formulation. In order to enhance the CS recovery capacity in WSN, this work considers an approach based on a coherence reduction of the sensing matrix premised on the transmitted power control (PC). Simulation results prove that, under the constraint of equal power consumption, the detection and counting performance is improved when the proposed power control scheme is employed compared to the case without PC.
- 12 October 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 64 (3) , 799-811
Performance Study of a Near Maximum Likelihood Code-Aided Timing Recovery Technique
In this paper, we propose a new code-aided (CA) timing recovery algorithm for various linear constant modulus constellations based on the Maximum Likelihood (ML) estimator. The first contribution is the derivation of a soft estimator expression of the transmitted symbol instead of its true or hard estimated value which is fed into the timing error detector (TED) equation. The proposed expression includes the Log-Likelihood Ratios (LLRs) obtained from a turbo decoder. Our results show that the proposed CA approach achieves almost as good results as the data-aided (DA) approach over a large interval of SNR values while achieving a higher spectral efficiency. We also derive the corresponding CA Cramer Rao Bounds (CRB) for various modulation orders. Contrarily to former work, we develop here the CRB analytical expression for different M-PSK modulation orders and validate them through comparison to empirical CRB obtained by Monte Carlo iterations. The proposed CA estimator realizes an important gain over the nondata-aided approach (NDA) and achieves a smaller gap when compared to its relative CA CRB, especially at moderate SNR values where modern systems are constrained to work.
- 12 October 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 64 (3) , 799-811
Performance Study of a Near Maximum Likelihood Code-Aided Timing Recovery Technique
In this paper, we propose a new code-aided (CA) timing recovery algorithm for various linear constant modulus constellations based on the Maximum Likelihood (ML) estimator. The first contribution is the derivation of a soft estimator expression of the transmitted symbol instead of its true or hard estimated value which is fed into the timing error detector (TED) equation. The proposed expression includes the Log-Likelihood Ratios (LLRs) obtained from a turbo decoder. Our results show that the proposed CA approach achieves almost as good results as the data-aided (DA) approach over a large interval of SNR values while achieving a higher spectral efficiency. We also derive the corresponding CA Cramer Rao Bounds (CRB) for various modulation orders. Contrarily to former work, we develop here the CRB analytical expression for different M-PSK modulation orders and validate them through comparison to empirical CRB obtained by Monte Carlo iterations. The proposed CA estimator realizes an important gain over the nondata-aided approach (NDA) and achieves a smaller gap when compared to its relative CA CRB, especially at moderate SNR values where modern systems are constrained to work.
- 10 April 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in China Communications
- Vol. 12 (2) , 1-10
On a hybrid preamble/soft-output demapper approach for time synchronization for IEEE 802.15.6 narrowband WBAN
In this paper, we present a maximum likelihood (ML) based time synchronization algorithm for Wireless Body Area Networks (WBAN). The proposed technique takes advantage of soft information retrieved from the soft demapper for the time delay estimation. This algorithm has a low complexity and is adapted to the frame structure specified by the IEEE 802.15.6 standard for the narrowband systems. Simulation results have shown good performance which approach the theoretical mean square error limit bound represented by the Cramer Rao Bound (CRB).
- 10 April 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in China Communications
- Vol. 12 (2) , 1-10
On a hybrid preamble/soft-output demapper approach for time synchronization for IEEE 802.15.6 narrowband WBAN
In this paper, we present a maximum likelihood (ML) based time synchronization algorithm for Wireless Body Area Networks (WBAN). The proposed technique takes advantage of soft information retrieved from the soft demapper for the time delay estimation. This algorithm has a low complexity and is adapted to the frame structure specified by the IEEE 802.15.6 standard for the narrowband systems. Simulation results have shown good performance which approach the theoretical mean square error limit bound represented by the Cramer Rao Bound (CRB).
- 25 May 2013
- Published by Springer Nature in Annals of Telecommunications
- Vol. 69 (5-6) , 321-330
Performance evaluation of an efficient reduced-complexity time synchronization approach for OFDM systems
- 25 May 2013
- Published by Springer Nature in Annals of Telecommunications
- Vol. 69 (5-6) , 321-330
Performance evaluation of an efficient reduced-complexity time synchronization approach for OFDM systems