Outage analysis and power optimization in uplink and downlink NOMA systems with Rician fading by Dipinkrishnan R, Vinoth Babu Kumaravelu

“…By approximating the Rician distribution with a Gamma distribution, the closed-form expressions for outage probability are derived, reducing computational complexity. A novel low-complexity power allocation (PA) strategy is introduced to maximize the sum spectral efficiency (SSE) in NOMA systems even in the presence of iSIC. …”
Get full text

A high speed processor for elliptic curve cryptography over NIST prime field by Xianghong Hu, Xueming Li, Xin Zheng, Yuan Liu, Xiaoming Xiong

“…It is challenging to implement a scalar multiplication (SM) operation which has the highest computational complexity in ECC. In this study, we propose a hardware processor which achieves high speed and high security for ECC. …”
Get full text

Multi-Centroid Extraction Method for High-Dynamic Star Sensors Based on Projection Distribution of Star Trail by Xingyu Tang, Qipeng Cao, Zongqiang Fu, Tingting Xu, Rui Duan, Xiubin Yang

“…First, the mapping relationship between attitude information and star trails is constructed based on a geometric imaging model, and an endpoint centroid group extraction strategy is designed from the perspectives of time synchronization and computational complexity. Then, the endpoint position parameters are determined by fitting the star trail grayscale projection using a line spread function, and accurate centroid localization is achieved through principal axis analysis and inter-frame correlation. …”
Get full text

Quantum complexity of time evolution with chaotic Hamiltonians by Vijay Balasubramanian, Matthew DeCross, Arjun Kar, Onkar Parrikar

“…Our analysis relates complexity to familiar properties of physical theories like their spectra and the structure of energy eigenstates and has implications for the hypothesized computational complexity class separations PSPACE BQP/poly and PSPACE BQSUBEXP/subexp, and the “fast-forwarding” of quantum Hamiltonians.…”
Get full text

Multiaircraft Optimal 4D Trajectory Planning Using Logical Constraints by Dinesh B. Seenivasan, Alberto Olivares, Ernesto Staffetti

“…In this way, the optimal control problem with logical constraints is converted into a smooth optimal control problem which is solved using traditional techniques, thereby reducing the computational complexity of finding the solution. The effectiveness of the approach is demonstrated through several numerical experiments by computing the optimal trajectories of multiple aircraft in converging and intersecting arrival routes with time-based separation constraints, distance-based separation constraints, and operational constraints.…”
Get full text

A Multistage Decision-Feedback Receiver Design for LTE Uplink in Mobile Time-Variant Environments by Juinn-Horng Deng, Shu-Min Liao

“…Instead of using a conventional equalizer, this work uses a group frequency-domain equalizer (GFDE) to reduce computational complexity. Furthermore, this work utilizes a dual iterative structure of group parallel interference cancellation (GPIC) and frequency-domain group parallel interference cancellation (FPIC) to mitigate the ICI effect. …”
Get full text

Complexity Analysis of New Future Video Coding (FVC) Standard Technology by Soulef Bouaafia, Randa Khemiri, Seifeddine Messaoud, Fatma Elzahra Sayadi

“…Second, a fast FVC mode decision is proposed to reduce encoding computational complexity. Then, a comparison between three configurations, namely, Random Access, Low-Delay B, and Low-Delay P, is proposed, in terms of Bitrate, PSNR, and encoding time. …”
Get full text

3D Face Modeling Algorithm for Film and Television Animation Based on Lightweight Convolutional Neural Network by Cheng Di, Jing Peng, Yihua Di, Siwei Wu

“…The algorithm uses the difference criterion instead of the entropy criterion to avoid the “small sample” problem, and the use of QR decomposition can extract more effective discriminative features for facial recognition, while also reducing the computational complexity of feature extraction. Compared with traditional feature extraction methods, GMMSD avoids the problem of “small samples” and does not require preprocessing steps on the samples; it uses QR decomposition to extract features from the original samples and retains the distribution characteristics of the original samples. …”
Get full text

A Numerical Integration Method for Calculating the Bit Error Rate of Time-Modulated Array by Kexin Wang, Jian Zhang, Gang Xin, Xue Lei, Jun Gao, Tianpeng Li

“…The findings demonstrate consistency between the two methods while significantly reducing computational complexity.…”
Get full text

Detecting respiratory diseases using machine learning-based pattern recognition on spirometry data by Ahmed I. Taloba, R.T. Matoog

“…Due to issues with dimensionality and computational complexity, the relevant features are selected using Forward Feature Selection (FFS). …”
Get full text

Adaptive Filtering for Channel Estimation in RIS-Assisted mmWave Systems by Shuying Shao, Tiejun Lv, Pingmu Huang

“…Our analysis also reveals that both algorithms have lower computational complexity compared to existing methods. Extensive simulations validate our findings, with results illustrating the performance of the proposed algorithms under different parameters, demonstrating significant improvements in channel estimation accuracy and convergence speed over established methods, including NLMS, sparse exponential forgetting window least mean square (SEFWLMS), and sparse hybrid adaptive filtering algorithms (SHAFA).…”
Get full text

Novel techniques for efficient PAPR reduction in NOMA systems for future wireless networks by Inam Abousaber, Amira A. Mohamed, Haitham F. Abdallah

“…PTS-ISSA minimizes PAPR by phase rotation of sub-blocks, offering the best reduction but at higher computational complexity, making it ideal for systems with abundant resources. …”
Get full text

Multifeature Fusion Detection Method for Fake Face Attack in Identity Authentication by Haiqing Liu, Shiqiang Zheng, Shuhua Hao, Yuancheng Li

“…Experimental results show that this method can improve detection accuracy while also reducing computational complexity. In this paper, we use the CASIA, PRINT-ATTACK, and REPLAY-ATTACK database to compare the various LBP algorithms that incorporate optical flow and fusion algorithms.…”
Get full text

A Randomized Non‐overlapping Encryption Scheme for Enhanced Image Security in Internet of Things (IoT) Applications by Muhammad Aqeel, Arfan Jaffar, Muhammad Faheem, Muhammad Waqar Ashraf, Nadeem Iqbal, Shahid Yousaf, Hossam Diab

“…Results demonstrate that the algorithm not only ensures strong protection against unauthorized access but also maintains low computational complexity, making it ideal for IoT applications. …”
Get full text

Tennis Assistance Technology Based on Dynamic Time Warping Algorithm by Penggang Wang, Pengpeng Zhang, Guanxi Fan

“…This technology combines components such as normalization, support vector machine, joint detection, sparse matrix, and second-order stepping mode to improve algorithm performance and reduce computational complexity. The experiment outcomes indicate that this method can validly raise the training effect of tennis players, with an accuracy rate of 95.66%, a calculation time of 0.32 seconds, a variance of 0.88, and an average absolute error of 4.22. …”
Get full text

Subspace Compressive GLRT Detector for MIMO Radar in the Presence of Clutter by Siva Karteek Bolisetti, Mohammad Patwary, Khawza Ahmed, Abdel-Hamid Soliman, Mohamed Abdel-Maguid

“…While Subspace Compressive GLRT (SSC-GLRT) detector is known to give optimised radar target detection performance with reduced computational complexity, it however suffers a significant deterioration in target detection performance in the presence of clutter. …”
Get full text

VRU-YOLO: A Small Object Detection Algorithm for Vulnerable Road Users in Complex Scenes by Yunxiang Liu, Yuqing Shi

“…Additionally, a lightweight Optimized Shared Detection Head (OSDH-Head) is introduced, reducing computational complexity while improving detection efficiency. …”
Get full text

Identifying Key Bus Stations Based on Complex Network Theory considering the Hybrid Influence and Passenger Flow: A Case Study of Beijing, China by Jianlin Jia, Yanyan Chen, Ning Chen, Hui Yao, Yongxing Li, Zhuo Liu

“…The influence of bus stations was calculated based on the local structure of the network, which refines from finding the shortest paths with high computational complexity. To evaluate the performance of the method, we used the efficiency of the network and vehicle average speed at the station to examine the accuracy. …”
Get full text

YOLOv8n-CA: Improved YOLOv8n Model for Tomato Fruit Recognition at Different Stages of Ripeness by Xin Gao, Jieyuan Ding, Ruihong Zhang, Xiaobo Xi

“…Experimental results showed that the YOLOv8n-CA model had a parameter count of only 2.45 × 10⁶, computational complexity of 6.9 GFLOPs, and a weight file size of just 4.90 MB. …”
Get full text

A Lightweight Model for Shine Muscat Grape Detection in Complex Environments Based on the YOLOv8 Architecture by Changlei Tian, Zhanchong Liu, Haosen Chen, Fanglong Dong, Xiaoxiang Liu, Cong Lin

“…This study addresses these challenges by proposing a lightweight YOLOv8-based model, incorporating DualConv and the novel C2f-GND module to enhance feature extraction and reduce computational complexity. Evaluated on the newly developed Shine-Muscat-Complex dataset of 4715 images, the proposed model achieved a 2.6% improvement in mean Average Precision (mAP) over YOLOv8n while reducing parameters by 36.8%, FLOPs by 34.1%, and inference time by 15%. …”
Get full text