@article {Illi202190,
	title = {Physical Layer Security of a Dual-Hop Regenerative Mixed RF/UOW System},
	journal = {IEEE Transactions on Sustainable Computing},
	volume = {6},
	number = {1},
	year = {2021},
	note = {cited By 15},
	pages = {90-104},
	abstract = {Ensuring physical layer security is a crucial task in conventional and emerging communication systems, which are typically characterized by stringent quality of service and security requirements. This also accounts for wireless technologies in the context of the Internet of Things paradigm, which are expected to exhibit considerably increased computational complexity. Based on this, the present contribution investigates the secrecy outage performance of a dual-hop decode-and-forward (DF) mixed radio-frequency/underwater optical wireless communication (RF/UOWC) system. Such wireless network configurations are particularly useful in efficient and demanding scenarios, such as military communications. Therefore, our analysis considers one single-antenna source node (SS) communicating with one legitimate destination node (DD) via a DF relay node (RR) equipped with multiple antennas for reception. Particularly, the relay receives the incoming signal from SS via an RF link, applies selection-combining (SC) technique, fully decodes it, re-encodes it, and then forwards it to the destination via a UOWC link. The communication is performed under the eavesdropper{\textquoteright}s attempt to intercept the S-RS-R hop (RF side). In this context, a closed-form expression for the secrecy outage probability is derived along with a thorough asymptotic analysis in the high SNR regime, based on which the achievable diversity order is provided. The offered results provide useful insights on the impact of some key system and channel parameters on the secrecy outage performance, such as the number of eavesdroppers, the number of relay antennas, fading severity parameters of RF links, and water turbulence severity of the UOWC link. The conducted analysis shows that the secrecy outage probability is dominated only by the RR-DD link in the high SNR regime, regardless of the SS-RR parameters, such as the number of relay antennas and the average SNR at the relay branches. The offered analytic results are corroborated with respective results from computer simulations. Since these parameters are closely related with the computational complexity at the involved terminals, the offered insights are useful for the design and computationally sustainable operation of such systems. {\textcopyright} 2016 IEEE.},
	keywords = {Antenna sources, Antennas, Asymptotic analysis, Complex networks, Computational complexity, Cooperative communication, Decoding, Dual-hop relaying, Fading channels, Military communications, Network layers, Optical communication, Performances analysis, Physical layer security, Probability, Quality of service, Secrecy outage probabilities, Secrecy outages, Selection combining, Signal to noise ratio, Single antenna, Source nodes, Underwater optical wireless communication},
	doi = {10.1109/TSUSC.2019.2906545},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85098369882\&doi=10.1109\%2fTSUSC.2019.2906545\&partnerID=40\&md5=3021a37f73c102416a7e51dd6c971930},
	author = {Illi, E. and Bouanani, F.E. and Da Costa, D.B. and Sofotasios, P.C. and Ayoub, F. and Mezher, K. and Muhaidat, S.}
}
@article {Yatribi2020,
	title = {Gradient-descent decoding of one-step majority-logic decodable codes},
	journal = {Physical Communication},
	volume = {39},
	year = {2020},
	note = {cited By 1},
	abstract = {In this paper, a new low-complexity gradient-descent based iterative majority-logic decoder (GD-MLGD) is proposed for decoding One-Step Majority-Logic Decodable (OSMLD) codes. We give a formulation of the decoding problem of binary OSMLD codes, as a maximization problem of a derivable objective function. The optimization problem is solved using a pseudo gradient-descent algorithm, which performs iteratively an update towards the optimal estimated codeword been transmitted, based on the first-order partial derivatives of each variable calculated in the previous iteration. The proposed decoding scheme achieves a fast convergence to an optimum codeword compared to other decoding techniques reviewed in this paper, at the cost of lower computational complexity. The quantized version (QGD-MLGD) is also proposed in order to further reduce the computational complexity. Simulation results show that the proposed decoding algorithms outperform all the existing majority-logic decoding schemes, and also various gradient-descent based bit-flipping algorithms, and performs nearly close to the belief propagation sum{\textendash}product (BP-SP) decoding algorithm of LDPC codes, especially for high code lengths, providing an efficient trade-off between performance and decoding complexity. Moreover, the proposed quantized algorithm has shown to perform better than all the existing decoding techniques. The proposed decoding algorithms have shown to be suitable for ultra reliable, low latency and energy-constrained communication systems where both high performances and low-complexity are required. {\textcopyright} 2020 Elsevier B.V.},
	keywords = {AWGN channel, Backpropagation, Computational complexity, Computer circuits, Decoding complexity, Difference sets, Economic and social effects, Electronic trading, Gradient descent, Gradient methods, Iterative decoding, LDPC codes, Majority logic, Majority logic decoding, Maximum likelihood, Maximum likelihood decoding, Optimization, OSMLD codes},
	doi = {10.1016/j.phycom.2019.100999},
	url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85077749482\&doi=10.1016\%2fj.phycom.2019.100999\&partnerID=40\&md5=830156cfb12a8ec3dbff2e002b3ade63},
	author = {Yatribi, A. and Belkasmi, M. and Ayoub, F.}
}
@article {8699110620120101,
	title = {Efficient Dual Domain Decoding of Linear Block Codes Using Genetic Algorithms.},
	journal = {Journal of Electrical \& Computer Engineering},
	year = {2012},
	pages = {1 - 12},
	abstract = {A computationally efficient algorithm for decoding block codes is developed using a genetic algorithm (GA). The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new approach reduces the complexity of decoding the codes of high rates. We simulated our algorithm in various transmission channels. The performance of this algorithm is investigated and compared with competitor decoding algorithms including Maini and Shakeel ones. The results show that the proposed algorithm gives large gains over the Chase-2 decoding algorithm and reach the performance of the OSD-3 for some quadratic residue (QR) codes. Further, we define a new crossover operator that exploits the domain specific information and compare it with uniform and two point crossover. The complexity of this algorithm is also discussed and compared to other algorithms [ABSTRACT FROM AUTHOR]},
	keywords = {Coding theory, Computational complexity, Data transmission systems, Decoders (Electronics) {\textendash} Software, Genetic algorithms, Performance evaluation},
	issn = {20900147},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=86991106\&site=ehost-live},
	author = {Azouaoui, Ahmed and Belkasmi, Mostafa and Farchane, Abderrazak}
}
@article {8699111820120101,
	title = {Reduced Complexity Iterative Decoding of 3D-Product Block Codes Based on Genetic Algorithms.},
	journal = {Journal of Electrical \& Computer Engineering},
	year = {2012},
	pages = {1 - 8},
	abstract = {Two iterative decoding algorithms of 3D-product block codes (3D-PBC) based on genetic algorithms (GAs) are presented. The first algorithm uses the Chase-Pyndiah SISO, and the second one uses the list-based SISO decoding algorithm (LBDA) based on order-i reprocessing. We applied these algorithms over AWGN channel to symmetric 3D-PBC constructed from BCH codes. The simulation results show that the first algorithm outperforms the Chase-Pyndiah one and is only 1.38 dB away from the Shannon capacity limit at BER of 10-5 for BCH (31, 21, 5){\textthreesuperior} and 1.4 dB for BCH (16, 11, 4){\textthreesuperior}. The simulations of the LBDA-based GA on the BCH (16, 11, 4){\textthreesuperior} show that its performances outperform the first algorithm and is about 1.33 dB from the Shannon limit. Furthermore, these algorithms can be applied to any arbitrary 3D binary product block codes, without the need of a hard-in hardout decoder. We show also that the two proposed decoders are less complex than both Chase-Pyndiah algorithm for codes with large corr},
	keywords = {Computational complexity, Computer simulation, Genetic algorithms, Iterative decoding, Performance evaluation, Three-dimensional imaging},
	issn = {20900147},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=86991118\&site=ehost-live},
	author = {Ahmadi, Abdeslam and Bouanani, Faissal El and Ben-Azza, Hussain and Benghabrit, Youssef}
}
