Karim El-Abbasy

Dr. Karim El-Abbasy

Spectrum Management and Regulatory Affairs Department, The Egyptian Satellite Company (Nilesat)
+1
orcid
Manager of Spectrum Management and Regulatory Affairs Depart...

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
3 September 2021 in Electronics
Verified
Journal Article
Open access
PDF file
Karim El-AbbasyKarim El-Abbasy
Karim El-Abbasy
RERamy Farouk Taki Eldin
Ramy Farouk Taki Eldin
SRSalwa El Ramly
Salwa El Ramly
BABassant Abdelhamid
Bassant Abdelhamid
Polar codes are featured by their low encoding/decoding complexity for symmetric binary input-discrete memoryless channels. Recently, flexible generic Successive Cancellation List (SCL) decoders for polar codes were proposed to provide different throughput, latency, and decoding performances. In this paper, we propose to use polar codes with flexible fast-adaptive SCL decoders in Digital Video Broadcasting (DVB) systems to meet the growing demand for more bitrates. In addition, they can provide more interactive services with less latency and more throughput. First, we start with the construction of polar codes and propose a new mathematical relation to get the optimized design point for the polar code. We prove that our optimized design point is too close to the one that achieves minimum Bit Error Rate (BER). Then, we compare the performance of polar and Low-Density Parity Check (LDPC) codes in terms of BER, encoder/decoder latencies, and throughput. The results show that both channel coding techniques have comparable BER. However, polar codes are superior to LDPC in terms of decoding latency, and system throughput. Finally, we present the possible performance enhancement of DVB systems in terms of decoding latency and complexity when using optimized polar codes as a Forward Error Correction (FEC) technique instead of Bose Chaudhuri Hocquenghem (BCH) and LDPC codes that are currently adopted in DVB standards.

1 December 2015
Verified
Conference Paper
Closed access
Karim El-AbbasyKarim El-Abbasy
Karim El-Abbasy
BABassant Abdelhamid
Bassant Abdelhamid
SESalwa Elramly
Salwa Elramly
Recently, Digital Video Broadcasting (DVB) has evolved to improve the spectrum efficiency of current multimedia communications. This paper summarizes the main features and presents the error performance for the second generation of satellite DVB (DVB-S2) utilizing an upgraded MATLAB simulation model. In addition, the paper makes a validation of the developed simulation model by comparing between model results and field measurements. Furthermore, a new version of DVB-S2 (DVB-S2X) is simulated to evaluate its performance. The validity of simulation is tested by comparing with the standard error performance for different modulation and coding (MODCOD). The results show that the actual bit error rate (BER) of the measured DVB-S2 system is higher than those obtained in simulation due to variations in realistic satellite link channel conditions. The simulation results showed that DVB-S2X improves the capacity and the spectral efficiency at very high signal to noise ratio (SNR) by including a new higher order Amplitude Phase Shift Keying (APSK) modulation. Moreover, the new coding ratios for DVB-S2X were found to increase the granularity for more capacity options, and provide certain MODCOD optimized only for linear satellite channel. Finally, the new smaller roll-off factors added to DVB-S2X increase the bitrate capacity for the same bandwidth, but it needs a high complex filter design.

1 July 2020 in IET Communications
Verified
Journal Article
Open access
PDF file
Karim El-AbbasyKarim El-Abbasy
Karim El-Abbasy
RERamy Taki ElDin
Ramy Taki ElDin
SESalwa Elramly
Salwa Elramly
BABassant Abdelhamid
Bassant Abdelhamid
Recently, polar codes were proposed by Arikan to achieve optimum channel capacity given by Shannon theorem with low encoding and decoding complexity. Polar code construction depends on two main foundation criteria which are kernel matrix and Bhattacharyya parameter. They are related to each other, therefore the selection method for both affects the performance of polar code. Firstly, in this study, the derivations of the bounds for Bhattacharyya parameter are proved and generalised together with a proposed method to select the best kernel matrix to achieve the optimum capacity. Then, recursive channel transformations and successive cancellation decoding of the selected 3 × 3 best kernel matrix are proved. Furthermore, a general formula for polar code complexity and hardware implementation has been discussed. Simulation results show that the achievable bit error rate for the proposed methodology of selection is the same as some existing methods with the same order of complexity, which indicates its effectiveness. Polar code performance for the selected 3 × 3 best kernel matrix is improved as the code length increases. Moreover, this proposed method is general to be for higher dimension kernel matrices.

24 May 2021
Verified
Conference Paper
Closed access
Karim El-AbbasyKarim El-Abbasy
Karim El-Abbasy
RERamy Taki ElDin
Ramy Taki ElDin
SESalwa El-Ramly
Salwa El-Ramly
BABassant Abdelhamid
Bassant Abdelhamid
Recently, generalized polar codes were introduced to provide more code lengths and rates without the need for shortening or puncturing. However, as the size of the kernel matrix increases, computing the Log-Likelihood Ratio (LLR) functions in successive cancellation decoder for these codes becomes mathematically more complicated. In this paper, a new simplified general method is proposed to calculate these LLR functions based on the schematic diagram of the selected kernel matrix for sizes higher than 2. Our proposed method fragments the main block into some basic components whose formulas have been previously proven by Arikan for $2 \times 2$ kernel matrix. The validity of the resulting LLR functions is tested on different kernel matrices and proven to be similar to those in literature.

28 October 2024
Verified
Preprint
Open access
PDF file
Karim El-AbbasyKarim El-Abbasy
Karim El-Abbasy
The paper is worthy of publication with minor revisions to: * Correct definition 3 of U_nm; it should be for n,m = 0,1,2,…, d-1. * Define each symbol or operator in the first call of it, and clarify the notation and conditions in Theorem 1. * Ex...