Kagudde Abbas

Kagudde Abbas

Auto-generated profile, based on publicly available information

Kagudde Abbas

Department of Information and Communication Engineering, Yeungnam University, Gyeongsan, South Korea

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
30 October 2025 in IEEE Access
Verified
Journal Article
Open access
KAKagudde Abbas
Kagudde Abbas
Kwonhue ChoiKwonhue Choi
Kwonhue Choi
This paper presents a tunable power allocation algorithm specifically for down link non-orthogonal multiple access (DL-NOMA) systems. This power allocation strategy operates by assigning power to users with aim of minimizing the maximum absolute difference between the weighted signal to interference plus noise ratio (SINR) between adjacent users. By using or setting a tunable weight or parameter ω, this approach can be able to achieve a balance between system throughput and user fairness. By adjusting the tunable weight parameter, the network designers or operators can be able to meet specific application requirements and system performance goals. In order to increase fairness among users, fairness antenna selection is also incorporated in the power allocation strategy. Power allocation coefficients are determined for each and every antenna available at the base station (BS). The antennas with highest sum rate are grouped together and the final selection is done using Jain’s Fairness Index (JFI), which is a widely recognized fairness metric for evaluating and promoting fairness. The combination of fairness tunable power allocation and antenna selection ensures a balanced strategy for promoting both fairness and system throughput. Simulation results show that the proposed algorithm balances user fairness and system throughput, even in situations that involve imperfect successive interference cancellation (SIC).

16 January 2025 in Journal of Electrical and Computer Engineering
Verified
Journal Article
Open access
AKAbel Kamagara
Abel Kamagara
AKAbbas Kagudde
Abbas Kagudde
BABaris Atakan
Baris Atakan
The efficiency of recovery and signal decoding efficacy at the receiver in end‐to‐end communications using linearly predicted coefficients are susceptible to errors, especially for highly compressed signals. In this paper, we propose a method to efficiently recover linearly predicted coefficients for high signal compression for end‐to‐end communications. Herein, the steepest descent algorithm is applied at the receiver to decode the affected linear predicted coefficients. This algorithm is used to estimate the unknown frequency, time, and phase. Subsequently, the algorithm facilitates down‐conversion, time and carrier recovery, equalization, and correlation processes. To evaluate the feasibility of the proposed method, parameters such as multipath interference, additive white Gaussian noise, timing, and phase noise are modeled as channel errors in signal compression using the software‐defined receiver. Our results show substantial recovery efficiency with noise variance between 0 and y × 10E − 3, where y lies between 0 and 10 using the modeled performance metrics of bit error rate, symbol error rate, and mean square error. This is promising for modeling software‐defined networks using highly compressed signals in end‐to‐end communications.

24 October 2026 in AEU - International Journal of Electronics and Communications
Verified
Journal Article
Closed access
KAKagudde Abbas
Kagudde Abbas
Kwonhue ChoiKwonhue Choi
Kwonhue Choi