Jihad Fahs

Prof. Jihad Fahs

orcid

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
9 November 2017 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
JFJihad Fahs
Jihad Fahs
IAIbrahim Abou-Faycal
Ibrahim Abou-Faycal
We study the classical problem of characterizing the channel capacity and its achieving distribution in a generic fashion. We derive a simple relation between three parameters: the input-output function, the input cost function and the noise probability density function, one which dictates the type of the optimal input. In Layman terms we prove that the support of the optimal input is bounded whenever the cost grows faster than a “cut-off” growth rate equal to the logarithm of the inverse of the noise probability density function evaluated at the inputoutput function. Furthermore, we prove a converse statement that says whenever the cost grows slower than the “cut-off” rate, the optimal input has necessarily an unbounded support. In addition, we show how the discreteness of the optimal input is guaranteed whenever the triplet satisfy some analyticity properties. We argue that a suitable cost function to be imposed on the channel input is one that grows similarly to the “cut-off” rate. Our results are valid for any cost function that is superlogarithmic. They summarize a large number of previous channel capacity results and give new ones for a wide range of communication channel models, such as Gaussian mixtures, generalized- Gaussians and heavy-tailed noise models, that we state along with numerical computations.

20 December 2017 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
JFJihad Fahs
Jihad Fahs
IAIbrahim Abou-Faycal
Ibrahim Abou-Faycal
Recent studies found that many channels are affected by additive noise that is impulsive in nature and is best explained by heavy-tailed symmetric alpha-stable distributions. Dealing with impulsive noise environments comes with an added complexity with respect to the standard Gaussian environment: the alpha-stable probability density functions do not possess closed-form expressions except in few special cases. Furthermore, they have an infinite second moment and the “nice” Hilbert space structure of the space of random variables having a finite second moment is lost along with its tools and methodologies. This is indeed the case in estimation theory where classical tools to quantify the performance of an estimator are tightly related to the assumption of having finite variance variables. In alphastable environments, expressions such as the mean square error and the Cramer-Rao bound are hence problematic. In this work, we tackle the parameter estimation problem in impulsive noise environments and develop novel tools that are tailored to the alpha-stable and heavy-tailed noise environments, tools that coincide with the standard ones adopted in the Gaussian setup; namely a generalized “power” measure and a generalized Fisher information. We generalize known information inequalities commonly used in the Gaussian context: the de Bruijn identity, the Fisher information inequality, the isoperimetric inequality for entropies and the Cramer-Rao bound. Additionally, we derive upper bounds on the differential entropy of independent sums having a stable component. Intermediately, the new power measure is used to shed some light on the additive alpha-stable noise channel capacity in a setup that generalizes the linear average power constrained AWGN channel. Our theoretical findings are paralleled with numerical evaluations of various quantities and bounds using developed Matlab packages.

24 November 2015 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
JFJihad Fahs
Jihad Fahs
IAIbrahim Abou-Faycal
Ibrahim Abou-Faycal
Evaluating the channel capacity is one of many key problems in information theory. In this work, we derive rather-mild sufficient conditions under which the capacity of continuous channels is finite and achievable. These conditions are derived for generic, memoryless, and possibly nonlinear additive noise channels. The results are based on a novel sufficient condition that guarantees the convergence of differential entropies under point-wise convergence of probability density functions. Perhaps surprisingly, the finiteness of channel capacity holds for the majority of setups, including those where inputs and outputs have possibly infinite second-moments.

19 December 2015 in Entropy
Verified
Journal Article
Open access
PDF file
JFJihad Fahs
Jihad Fahs
IAIbrahim Abou-Faycal
Ibrahim Abou-Faycal
We consider the independent sum of a given random variable with a Gaussian variable and an infinitely divisible one. We find a novel tight upper bound on the entropy of the sum which still holds when the variable possibly has an infinite second moment. The proven bound has several implications on both information theoretic problems and infinitely divisible noise channels’ transmission rates.

7 July 2021 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
JFJihad Fahs
Jihad Fahs
ATAslan Tchamkerten
Aslan Tchamkerten
MYMansoor Yousefi
Mansoor Yousefi
The per-sample zero-dispersion channel model of the optical fiber is considered. It is shown that capacity is uniquely achieved by an input probability distribution that has continuous uniform phase and discrete amplitude that takes on finitely many values. This result holds when the channel is subject to general input cost constraints, that include a peak amplitude constraint and a joint average and peak amplitude constraint.

11 December 2024 in Entropy
Verified
Journal Article
Open access
PDF file
JFJihad Fahs
Jihad Fahs
IAIbrahim Abou-Faycal
Ibrahim Abou-Faycal
IIIbrahim Issa
Ibrahim Issa
The isotropic Cauchy distribution is a member of the central α-stable family that plays a role in the set of heavy-tailed distributions similar to that of the Gaussian density among finite second-moment laws. Given a sequence of n observations, we are interested in characterizing the performance of Likelihood Ratio Tests, where two hypotheses are plausible for the observed quantities: either isotropic Cauchy or isotropic Gaussian. Under various setups, we show that the probability of error of such detectors is not always exponentially decaying with n, with the leading term in the exponent shown to be logarithmic instead, and we determine the constants in that leading term. Perhaps surprisingly, the optimal Bayesian probabilities of error are found to exhibit different asymptotic behaviors.