Spectrally compatible multiple‐input multiple‐output radar waveform design based on alternating direction method of multipliers by Rui Yang, Hong Jiang, Qi Zhang, Liangdong Qu

“…Due to the decomposability of ADMM, only a few quadratic programming subproblems need to be solved during each iteration in the authors' algorithm, which reduces the computational complexity. In numerical simulations, the proposed ADMM algorithm is compared with the semidefinite relaxation algorithm and the existing ADMM algorithm in a single‐antenna scenario and a multi‐antenna scenario, respectively. …”
Get full text

A Hybrid 3DMLUV-FIA Method for Scattering from a 3D Dielectric Object above a 2D Dielectric Rough Surface by Wu Xuezhi, Wenping Yu

“…Comparing to the case when object and rough surface are both PEC, the memory requirement and computational complexity for dielectric models are increased due to doubled unknown number. …”
Get full text

A Generalized Multi-Layer Framework for Video Coding to Select Prediction Parameters by Muhammad Asif, Maaz Bin Ahmad, Imtiaz A. Taj, Muhammad Tahir

“…The exploitation of the RDO technique contributes significantly to increase the computational complexity of the coding process. In this paper, a generalized multi-layer framework is presented, which provides a hierarchical optimized way to select MB prediction parameters. …”
Get full text

Eliminating Network Depth: Genetic Algorithm for Parameter Optimization in CNNs by M. Askari, S. Soleimani, M. H. Shakoor, M. Momeni

“…However, CNNs often require large numbers of parameters, leading to increased computational complexity, prolonged training times, and substantial resource demands. …”
Get full text

A cross-layer approach to message authentication based on sparse representation for wireless body area networks by Ning Wang, Weiwei Li, Ting Jiang

“…Furthermore, the computational complexity of the proposed algorithm and the efficiency of the cross-layer approach are analyzed, respectively. …”
Get full text

Infrared Image Detection and Recognition of Substation Electrical Equipment Based on Improved YOLOv8 by Haotian Tao, Agyemang Paul, Zhefu Wu

“…It also outperforms five existing baseline models, with the highest accuracy of 98.7%, and it reduces the computational complexity by 18.5%, thereby validating the effectiveness of the YOLOv8_Adv model. …”
Get full text

A Simplified Multiband Sampling and Detection Method Based on MWC Structure for Mm Wave Communications in 5G Wireless Networks by Min Jia, Xue Wang, Xuemai Gu, Qing Guo

“…In the reconstruction stage, the proposed method simplifies the computational complexity by exploiting simple linear operations instead of CS recovery algorithms and provides more stable performance of signal recovery. …”
Get full text

Study on coded distributed fast Hadamard transform based non-binary LDPC code decoding algorithm by Rui LIU, Yong LI

“…Despite the excellent error correction performance and burst error resistance capability of non-binary LDPC codes, the complexity of the decoding algorithms hinders their broader application.In the classic FHT-QSPA decoding, the fast Hadamard transform (FHT) and its inverse transform (IFHT) have become the main bottleneck for updating the check nodes.Therefore, a coded distributed FHT scheme based on systematic MDS codes was proposed.In the scheme, the channel probability was modeled by the master node as a matrix and it was segmented, and those sub-matrices were encoded into redundant ones.Then, all the sub-matrices were offloaded to worker nodes to perform parallel FHT and IFHT, and the results were sent back to the master node for the final decoding.By embedding redundant information, the proposed scheme resolved the straggling problem, improving the efficiency, and accelerating the entire decoding process.Comparisons with other coded matrix multiplication schemes, the proposed scheme provides lower encoding complexity, higher numerical accuracy in decoding recovery, and maintains an efficient butterfly operation, effectively reducing the computational complexity of worker nodes.The time comparison and decoding performance analysis reveal that the proposed scheme achieves up to approximately 3.8 times acceleration compared to the traditional single-node FHT scheme, significantly enhances the FHT-QSPA decoding efficiency without affecting the decoding performance.…”
Get full text

Quantum Computing for Advanced Driver Assistance Systems and Autonomous Vehicles: A Review by Avantika Rattan, Abhishek Rudra Pal, Muralimohan Gurusamy

“…The promise of quantum computing to handle the massive data and computational complexity that classical methods struggle with necessitates new studies in quantum machine learning (QML) for autonomous vehicles.…”
Get full text

Effective Processing of Radar Data for Bridge Damage Detection by Tomasz Owerko, Przemysław Kuras

“…The method’s low computational complexity allows for implementation in real-time solutions. …”
Get full text

Distributionally Robust Policy and Lyapunov-Certificate Learning by Kehan Long, Jorge Cortes, Nikolay Atanasov

“…To avoid the computational complexity involved in dealing with the space of probability measures, we identify a sufficient condition in the form of deterministic convex constraints that ensures the Lyapunov derivative constraint is satisfied. …”
Get full text

TIE‐GCM ROPE ‐ Dimensionality Reduction: Part I by Piyush M. Mehta, Richard J. Licata

“…However, the computational complexity of such models have primarily kept them being used operationally. …”
Get full text

Image Super-Resolution Reconstruction Based on the Lightweight Hybrid Attention Network by Chu Yuezhong, Wang Kang, Zhang Xuefeng, Liu Heng

“…In order to solve the problem that the current image super-resolution model has too many parameters and high computational complexity, this paper proposes a lightweight hybrid attention network (LHAN). …”
Get full text

A-priori multi-objective optimization for the short-term dispatch of distributed energy resources by G. Carpinelli, A.R. Di Fazio, S. Perna, A. Russo, M. Russo

“…Effective linear power flow equations are included into both the objective functions and the inequality constraints of the MOO model, thus yielding benefits in terms of reduced model dimension and computational complexity. The weighted sum (WS) method with the a-priori assignment of weights is used to transform the MOO into a single-objective optimization (SOO) that directly provides the final solution on the Pareto front. …”
Get full text

A randomized block policy gradient algorithm with differential privacy in Content Centric Networks by Lin Wang, Xingang Xu, Xuhui Zhao, Baozhu Li, Ruijuan Zheng, Qingtao Wu

“…In order to reduce computational complexity when processing high-dimensional data, we randomly select a block coordinate to update the gradients at each round. …”
Get full text

Optimizing concrete crack detection an echo state network approach with improved fish migration optimization by Zhichun Fang, Xiuhong Wang, Jiaojiao Gao, Behrooz Eskandarpour

“…However, there are many models available for concrete crack detection, an efficient approach is needed because the existing methods often have flaws like overfitting, high computational complexity, and noise sensitivity, which can lead to accurate crack detection and classification. …”
Get full text

MultiPhys: Heterogeneous Fusion of Mamba and Transformer for Video-Based Multi-Task Physiological Measurement by Chaoyang Huo, Pengbo Yin, Bo Fu

“…Specifically, a Convolutional Neural Network (CNN) is used to quickly extract local features in the early stage, a transformer captures global context and long-distance dependencies, and Mamba is used to compensate for the transformer’s deficiencies, reducing the computational complexity and improving the accuracy of the model. …”
Get full text

5G OFDM channel estimation method based on complex-valued generative adversarial network by LU Yuanzhi, WEI Xianglin, YU Long, YAO Changhua

“…Channel estimation methods based on least square (LS) and minimum mean square error (MMSE) effectively utilize the system’s sparsity, but LS algorithms face low computational precision, while MMSE algorithms suffer from high computational complexity. To promote the estimation accuracy, practitioners have presented several deep learning-based channel estimation methods. …”
Get full text

TAS Scheduling With Grouping Flows by Hironao Abe, Yuhei Kawakami, Hideo Kawata, Takashi Nakanishi, Tomoaki Yoshida

“…This paper proposes a method to reduce the computational complexity of TAS schedules for the problem that the computation time increases exponentially as the amount of scheduled traffic (ST) flows increases. …”
Get full text

BeatNet+: Real-Time Rhythm Analysis for Diverse Music Audio by Mojtaba Heydari, Zhiyao Duan

“…Comprehensive experiments and comparisons with multiple baselines are conducted, and results show that BeatNet+ achieves superior beat tracking and downbeat tracking F1 scores for generic music, isolated singing voices, and non-percussive audio, with competitive latency and computational complexity. Finally, we release beat and downbeat annotations for two datasets that are designed for other tasks, and revised annotations of three existing datasets. …”
Get full text