Showing 101 - 120 results of 684 for search '"computational complexity"', query time: 0.06s Refine Results
  1. 101

    Parameter-Efficient Vehicle Trajectory Prediction Based on Attention-Enhanced Liquid Structural Neural Model by Ruochen Wang, Yue Chen, Renkai Ding, Qing Ye

    Published 2024-12-01
    “…Notably, it reduces computational complexity and model size while maintaining superior accuracy, making it well suited for deployment in resource-constrained systems. …”
    Get full text
    Article
  2. 102

    Maximum Closeness Centrality k-Clubs: A Study of Dock-Less Bike Sharing by Ali Rahim Taleqani, Chrysafis Vogiatzis, Jill Hough

    Published 2020-01-01
    “…Due to its computational complexity, the problem cannot be solved exactly in a large-scale setting, as is such of an urban area. …”
    Get full text
    Article
  3. 103

    A phase factor generation using RNNs deep learning algorithm-based PTS method for PAPR reduction of beyond 5G FBMC waveform by Aziz Nanthaamornphong, Nishant Gaur, Lakshmana Phaneendra Maguluri, Arun Kumar

    Published 2025-01-01
    “…RNNs improve the performance of the PTS by efficiently predicting optimal phase factors, reducing computational complexity, and lowering the PAPR of the FBMC waveform. …”
    Get full text
    Article
  4. 104

    Linear Multivariate Decision Trees for Fast QTMT Partitioning in VVC by Jose N. Filipe, Luis M. N. Tavora, Sergio M. M. Faria, Antonio Navarro, Pedro A. A. Assuncao

    Published 2025-01-01
    “…One such tool is the Quaternary Tree and Multi-Type Tree (QTMT) used in the Versatile Video Coding (VVC), which significantly improves coding efficiency over previous standards, but introduces substantially higher computational complexity. To address the challenge of reducing computational complexity with minimal impact on coding efficiency, this paper presents a novel approach for intra-coding 360<inline-formula><tex-math notation="LaTeX">$^{\circ }$</tex-math></inline-formula> video in Equirectangular Projection (ERP) format. …”
    Get full text
    Article
  5. 105

    LSP transcoding method between 3GPP AMR-NB and ITU-T G.729A based on GMM by LIU Zhang-yu, BAO Chang-chun, QIU Jian-wei, XU Hao

    Published 2010-01-01
    “…An efficient transcoding algorithm of LSP(line spectrum pairs) parameters based on GMM(Gaussian mixture model) was proposed and implemented through the mathematical analysis of GMM.Meanwhile,several practical issues in details were analyzed under experiments.The experiments indicate that the computational complexity of the proposed LSP transcoding algorithm is reduced by above 78% and the transcoded speech quality is not worse than DTE method.…”
    Get full text
    Article
  6. 106

    Approach to weak signal extraction and detection via sparse representation by Ya-fei TANG, Yun-yong ZHANG, Zhi-bin GUO

    Published 2015-11-01
    “…The sparsity models and their popular evaluation algorithms were presented.A sparse representation based approach to weak signal extraction and detection was proposed.Furthermore,a fast algorithm was developed to reduce the computational complexity of the proposed method.In addition,both qualitative and quantitative evaluation methods were designed to analyze the proposed approach.A large number of experiments demonstrate the robustness and the adaptivity of the proposed approach.…”
    Get full text
    Article
  7. 107

    Probability updating-based adaptive hybrid coding

    Published 2008-01-01
    “…Experiment results demonstrate that both of the coding effi-ciency and computational complexity of this probability updating-based adaptive hybrid coding (PUAHC) were between UVLC and CABAC.…”
    Get full text
    Article
  8. 108

    Trusted measure model for the communication network system by Senxin ZHOU, Jianghong HAN, Yaohui ZHANG, Chao LI

    Published 2016-01-01
    “…The trusted measure model for communication was proposed by computing its value of security,control and survivability with continuous-time reward Markov method.The“state bomb”problem in traditional state analysis method was solved by the way of structural equation solution.The generic function optimization algorithm was used to reduce computational complexity.Simulation experiments show that the model is correct and feasible.…”
    Get full text
    Article
  9. 109

    Trajectory Tracking for 3-Wheeled Independent Drive and Steering Mobile Robot Based on Dynamic Model Predictive Control by Chaobin Xu, Xingyu Zhou, Rupeng Chen, Bazhou Li, Wenhao He, Yang Li, Fangping Ye

    Published 2025-01-01
    “…This paper proposes a dynamic model predictive control (DMPC) controller for trajectory tracking of 3WID3WIS mobile robots to simplify the computational complexity and improve the accuracy of traditional model predictive control (MPC). …”
    Get full text
    Article
  10. 110

    Medical image segmentation based on frequency domain decomposition SVD linear attention by Liu Qiong, Li Chaofan, Teng Jinnan, Chen Liping, Song Jianxiang

    Published 2025-01-01
    “…This method reduces computational complexity while preserving essential features. …”
    Get full text
    Article
  11. 111

    Face Detection Using Hybrid SNN-ANN to Process Neuromorphic Event Stream by Waseem Shariff, Paul Kielty, Joe Lemley, Peter Corcoran

    Published 2025-01-01
    “…Traditional frame-based methods often suffer from high computational complexity and under-sampling issues. In turn this limits their effectiveness in real-time applications and increase energy budget. …”
    Get full text
    Article
  12. 112

    Turbo detection-decoding method for bit-interleavered random layered space-time codes by LI Xiao-wei, CHEN Fang-jiong, WEI Gang

    Published 2006-01-01
    “…Based on one kind of layered space-time code which used bit-interleavered and random-layered model,a joint detection-decoding method based on the Turbo principle was proposed.The new method used soft-interference canceller and SISO decoder and improved the exchange of soft information between them.By iterative procession it improved the performance of the whole system.The potential practice capability is proved by simulation results and computational complexity analysis.…”
    Get full text
    Article
  13. 113

    Analytical Computation of Information Rate for MIMO Channels by Jinbao Zhang, Zhenhui Tan, Song Chen

    Published 2017-01-01
    “…However, the computational complexity makes information rate rather difficult to analyze for arbitrary fading multiple-input multiple-output (MIMO) channels. …”
    Get full text
    Article
  14. 114

    Frequency offset estimator for OFDM with time-frequency training sequence by JIANG Yan-xiang, WANG Dong-ming, GAO Xi-qi, YOU Xiao-hu

    Published 2006-01-01
    “…A ratio-adjustable time-frequency training sequence was proposed.The coarse carrier frequency offset(CFO) estimation was accomplished with the aid of the training sequence in frequency domain and a predefined lookup table,while the fine one was obtained by the aid of the training sequence in time domain.Simulation results show that the per-formance of the proposed method is better than Lei’s method with almost the same overhead.However,its computational complexity is much lower than Lei’s.…”
    Get full text
    Article
  15. 115

    Constructions of perfect Gaussian integer sequences of odd prime length by Yubo LI, Miao CHEN, Tao LIU, Ying ZHANG

    Published 2018-11-01
    “…Constructions of perfect Gaussian integer sequences (PGIS) based on the cyclotomic classes were proposed.The PGIS with degree 3 and 5 were constructed respectively from the cyclotomic classes of order 2 and 4.The presented sequences with odd prime length have ideal autocorrelations.The methods solved the problem that the traditional constructions of PGIS from the cyclotomic classes have high computational complexity.As a result,this kind of sequences will be useful in the applications of wireless communications.…”
    Get full text
    Article
  16. 116

    Pol-CCES based modulation recognition method under impulsive noise by Jiang’an DAI, Shengyang LUAN, Minglong ZHAO, Zhaojun ZHANG, Tianshuang QIU

    Published 2021-12-01
    “…To realize signal classification in impulsive noise environment, a modulation recognition scheme based on polished cyclic correntropy spectrum and shallow residual network was proposed.The proposed scheme not only has low computational complexity but also shows robustness to impulsive noise.Simulation results demonstrate the proposed solution’s superior performance under impulsive noise, even when the generalized signal-to-noise ratio is very low.…”
    Get full text
    Article
  17. 117

    Fractional Mixed Weighted Convolution and Its Application in Convolution Integral Equations by Rongbo Wang, Qiang Feng

    Published 2024-01-01
    “…Based on the fractional mixed-weighted convolution and fractional cosine transform, two kinds of convolution integral equations are considered, the explicit solutions of fractional convolution integral equations are obtained, and the computational complexity of solutions are also analyzed.…”
    Get full text
    Article
  18. 118

    Efficient TTI for 3G Multimedia Applications by Costas Chaikalis

    Published 2007-01-01
    “…An efficient TTI choice can save computational complexity. However, different multimedia scenarios are investigated using the maximum UMTS frame length, and simulation results are presented for the four possible outer block interleaver configurations in the case of flat Rayleigh fading channel. …”
    Get full text
    Article
  19. 119

    Low-complexity sparse channel estimation for massive MIMO systems by Xin FANG, Yunju LIU, Haiyan CAO, Peng PAN

    Published 2016-05-01
    “…Due to the high computational complexity of massive MIMO system,a low-complexity sparse channel estimation algorithm was proposed utilizing the inherent sparsity of the wireless communication channel to improve the estimation performance.The proposed algorithm separated channel tap from noise space based on the traditional discrete Fourier transform by adopting integral separation algorithm.This channel estimation algorithm need only calculate the channel tap,thus markedly reducing complexity of the algorithm.Numerical simulations show that proposed algorithm can approach to the performance of the minimum mean-square error estimator while maintaining lower complexity.…”
    Get full text
    Article
  20. 120

    Credit Risk Evaluation with a Least Squares Fuzzy Support Vector Machines Classifier by Lean Yu

    Published 2014-01-01
    “…In the proposed LS-FSVM model, the purpose of incorporating the concepts of fuzzy sets is to add generalization capability and outlier insensitivity, while the least squares method is adopted to reduce the computational complexity. For illustrative purposes, a real-world credit risk dataset is used to test the effectiveness and robustness of the proposed LS-FSVM methodology.…”
    Get full text
    Article