Zouheir Rezki

Dr. Zouheir Rezki

Department of Electrical and Computer Engineering, University of California Santa Cruz, Santa Cruz, CA 95064, USA
orcid

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 February 2018 in IEEE Communications Letters
Verified
Journal Article
Closed access
MAMohannad Abu-Romoh
Mohannad Abu-Romoh
AAAhmed Aboutaleb
Ahmed Aboutaleb
ZRZouheir Rezki
Zouheir Rezki
Motivated by the fact that moments of the received signal are easy to compute and can provide a simple way to automatically classify the modulation of the transmitted signal, we propose a hybrid method for automatic modulation classification that lies in the intersection between likelihood-based and feature-based classifiers. Specifically, the proposed method relies on statistical moments along with a maximum likelihood engine. We show that the proposed method offers a good trade-off between classification accuracy and complexity relative to the maximum likelihood classifier. Furthermore, our classifier outperforms state-of-the-art machine learning classifiers, such as genetic programming-based K-nearest neighbor classifiers, the linear support vector machine classifier and the fold-based Kolmogorov-Smirnov algorithm.

25 December 2018 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
MAMohamed Amine Arfaoui
Mohamed Amine Arfaoui
HZHajar Zaid
Hajar Zaid
ZRZouheir Rezki
Zouheir Rezki
AGAli Ghrayeb
Ali Ghrayeb
ACAnas Chaaban
Anas Chaaban
MAMohamed-Slim Alouini
Mohamed-Slim Alouini
This paper investigates the secrecy performance of the multiple-input single-output visible light communication (VLC) wiretap channel. The considered system model comprises three nodes: a transmitter (Alice) equipped with multiple fixtures of LEDs, a legitimate receiver (Bob), and an eavesdropper (Eve), each equipped with one photo-diode. The VLC channel is modeled as a real-valued amplitude-constrained Gaussian channel. Eve is assumed to be randomly located in the same area as Bob. Due to this, artificial noise-based beamforming is adopted as a transmission strategy in order to degrade Eve's signal-to-noise ratio. Assuming discrete input signaling, we derive an achievable secrecy rate in a closed-form expression as a function of the beamforming vectors and the input distribution. We investigate the average secrecy performance of the system using stochastic geometry to account for the location randomness of Eve. We also adopt the truncated discrete generalized normal (TDGN) as a discrete input distribution. We present several examples through which we confirm the accuracy of the analytical results via Monte Carlo simulations. The results also demonstrate that the TDGN distribution, albeit being not optimal, yields performance close to the secrecy capacity.

19 February 2018 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
ACAnas Chaaban
Anas Chaaban
ZRZouheir Rezki
Zouheir Rezki
MAMohamed-Slim Alouini
Mohamed-Slim Alouini
The capacity of the intensity modulation direct detection multiple-input-multiple-output channel is studied. Therein, the nonnegativity constraint of the transmit signal limits the applicability of classical schemes, including precoding. Thus, new ways are required for deriving capacity bounds for this channel. To this end, capacity lower bounds are developed in this paper by deriving the achievable rates of two precoding-free schemes: channel inversion and orthogonal-upper triangular matrix product decomposition. The achievable rate of a dc-offset singular-value decomposition-based scheme is also derived as a benchmark. Then, capacity upper bounds are derived and compared against the lower bounds. As a result, the capacity at high signal-to-noise ratio (SNR) is characterized for the case where the number of transmit apertures is not larger than the number of receive apertures, and is shown to be achievable by the QR decomposition scheme. This is shown for a channel with average intensity or peak intensity constraints. Under both constraints, the high-SNR capacity is approximated within a small gap. Extensions to a channel with more transmit apertures than receive apertures are discussed, and capacity bounds for this case are derived.

28 June 2018 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
MSMorteza Soltani
Morteza Soltani
ZRZouheir Rezki
Zouheir Rezki
This paper studies the optical wiretap channel with input-dependent Gaussian noise, in which the main distortion is caused by an additive Gaussian noise whose variance depends on the current signal strength. Subject to nonnegativity and peakintensity constraints on the channel input, we first present a practical optical wireless communication scenario for which the considered wiretap channel is stochastically degraded. We then study the secrecy-capacity-achieving input distribution of this wiretap channel and prove it to be discrete with a finite number of mass points, one of them located at the origin. Moreover, we show that the entire rate-equivocation region of this wiretap channel is also obtained by discrete input distributions with a finite support. Similar to the case of the Gaussian wiretap channel under a peak-power constraint, here too, we observe that under nonnegativity and peak-intensity constraints, there is a tradeoff between the secrecy capacity and the capacity in the sense that both may not be achieved simultaneously. Furthermore, we prove the optimality of discrete input distributions in the presence of an additional average intensity constraint. Finally, we shed light on the asymptotic behavior of the secrecy capacity in the low- and high-intensity regimes. In the low-intensity regime, the secrecy capacity scales quadratically with the peak-intensity constraint. On the other hand, in the high-intensity regime, the secrecy capacity does not scale with the constraint.

1 August 2018 in IEEE Communications Letters
Verified
Journal Article
Closed access
LKLong Kong
Long Kong
GKGeorges Kaddoum
Georges Kaddoum
ZRZouheir Rezki
Zouheir Rezki
In order to fill the gap of the mathematical analysis's lack for the secrecy outage probability (SOP) over single-input multiple-output (SIMO) α-μ wiretap fading channels, this letter initially provides highly accurate and asymptotic closed-form expressions for the SOP. The novel highly accurate formulations are derived in a simple and general form in terms of the bivariate Fox's H-function, which is extensively used in the literature. In addition, the asymptotic analysis of the SOP is derived at high signal-to-noise ratio regime. The obtained expressions are numerically validated and compared with the Monte-Carlo simulation results. The derived SOP is in highly accurate match with simulation results for the SIMO case, and a perfect match with simulated results for single-input single-output (SISO) case.

4 November 2024 in IEEE Transactions on Machine Learning in Communications and Networking
Verified
Journal Article
Open access
ZAzain ali
zain ali
ZRZouheir Rezki
Zouheir Rezki
MAMohamed-Slim Alouini
Mohamed-Slim Alouini
The next generation of communication devices will require robust connectivity for millions of ground devices such as sensors or mobile devices in remote or disaster-stricken areas to be connected to the network. Non-terrestrial network (NTN) nodes can play a vital role in fulfilling these requirements. Specifically, low-earth orbiting (LEO) satellites have emerged as an efficient and cost-effective technique to connect devices over long distances through space. However, due to their low power and environmental limitations, LEO satellites may require assistance from aerial devices such as high-altitude platforms (HAPs) or unmanned aerial vehicles to forward their data to the ground devices. Moreover, the limited power available at the NTNs makes it crucial to utilize available resources efficiently. In this paper, we present a model in which a LEO satellite communicates with multiple ground devices with the help of HAPs that relay LEO data to the ground devices. We formulate the problem of optimizing power allocation at the LEO satellite and all the HAPs to maximize the sum-rate of the system. To take advantage of the benefits of free-space optical (FSO) communication in satellites, we consider the LEO transmitting data to the HAPs on FSO links, which are then broadcast to the connected ground devices on radio frequency channels. We transform the complex non-convex problem into a convex form and compute the Karush-Kuhn-Tucker (KKT) conditions-based solution of the problem for power allocation at the LEO satellite and HAPs. Then, to reduce computation time, we propose a soft actor-critic (SAC) reinforcement learning (RL) framework that provides the solution in significantly less time while delivering comparable performance to the KKT scheme. Our simulation results demonstrate that the proposed solutions provide excellent performance and are scalable to any number of HAPs and ground devices in the system.