Suchergebnisse - low computation complexity algorithm

  1. 1

    A Non-Feedback-Loop and Low-Computation- Complexity Algorithm Design for a Novel 2-D Sliding DFT Computation von Juang, Wen-Ho, Lai, Shin-Chi

    ISSN: 2169-3536, 2169-3536
    Veröffentlicht: Piscataway IEEE 2019
    Veröffentlicht in IEEE access (2019)
    “… ) algorithm based on the column-row 2-D DFT concept and the shifted window property. After applying a descending dimension method (DDM …”
    Volltext
    Journal Article
  2. 2

    Low-complexity direct computation algorithm for cubic-spline interpolation scheme von Hong, Shao-Hua, Wang, Lin, Truong, Trieu-Kien

    ISSN: 1047-3203, 1095-9076
    Veröffentlicht: Elsevier Inc 01.01.2018
    “… •A low-complexity direct computation algorithm for CSI scheme is developed to improve the computational efficiency …”
    Volltext
    Journal Article
  3. 3

    Constructing an Evolutionary Tree and Path–Cycle Graph Evolution along It von Gorbunov, Konstantin, Lyubetsky, Vassily

    ISSN: 2227-7390, 2227-7390
    Veröffentlicht: Basel MDPI AG 24.04.2023
    Veröffentlicht in Mathematics (Basel) (24.04.2023)
    “… As a result, we construct an exact cubic-time algorithm which outputs a tree with the minimum cost of embedding into it and of embedding it into a given network (Theorem 1 …”
    Volltext
    Journal Article
  4. 4

    Low Complexity Shalvi-Weinstein Algorithm von Sun, Yongjun, Zhang, Liaoping, Jia, Cuiyuan, Liu, Zujun

    ISSN: 0929-6212, 1572-834X
    Veröffentlicht: New York Springer US 01.10.2021
    Veröffentlicht in Wireless personal communications (01.10.2021)
    “… A low complexity SWA based on dichotomous coordinate descent algorithm is proposed in the paper, whose computation complexity is on the same order of magnitude as the CMA …”
    Volltext
    Journal Article
  5. 5

    Low Complexity and Fast Computation for Recursive MDCT and IMDCT Algorithms von Lei, Sheau-Fang, Lai, Shin-Chi, Cheng, Po-Yin, Luo, Ching-Hsing

    ISSN: 1549-7747, 1558-3791
    Veröffentlicht: New York IEEE 01.07.2010
    “… Fast algorithms are derived for modified discrete cosine transform (MDCT) and inverse MDCT (IMDCT) in this brief. The proposed algorithms based on type II …”
    Volltext
    Journal Article
  6. 6

    Fast Sinkhorn II: Collinear Triangular Matrix and Linear Time Accurate Computation of Optimal Transport von Liao, Qichen, Wang, Zihao, Chen, Jing, Bai, Bo, Jin, Shi, Wu, Hao

    ISSN: 0885-7474, 1573-7691
    Veröffentlicht: New York Springer US 01.01.2024
    Veröffentlicht in Journal of scientific computing (01.01.2024)
    “… In our previous work (Liao et al. in Commun Math Sci, 2022), the complexity of Sinkhorn iteration is reduced from O ( N 2 ) to the optimal O ( N …”
    Volltext
    Journal Article
  7. 7

    Reduced-Complexity LCC Reed-Solomon Decoder Based on Unified Syndrome Computation von Zhang, Wei, Wang, Hao, Pan, Boyang

    ISSN: 1063-8210, 1557-9999
    Veröffentlicht: New York, NY IEEE 01.05.2013
    “… ). Compared with other ASD algorithms, the low-complexity Chase (LCC) decoding algorithm needs less computation complexity with similar or higher coding gain …”
    Volltext
    Journal Article
  8. 8

    Cloud‐Fog Cooperative Computation Offloading and Resource Allocation in Heterogeneous Networks Based on Genetic Algorithm von Wang, Qiang, Zhu, Chenming, Pan, Su, Zhong, Min, Li, Zibo

    ISSN: 1751-8628, 1751-8636
    Veröffentlicht: Stevenage John Wiley & Sons, Inc 01.01.2025
    Veröffentlicht in IET communications (01.01.2025)
    “… ‐fog cooperative heterogeneous networks, an improved genetic algorithm (IGA) is proposed in this paper, which can maintain a low computation complexity while obtaining the optimal solution …”
    Volltext
    Journal Article
  9. 9

    Bit error rate aware accurate prediction of original signals with low distortion using low complexity detection algorithms von Kasiselvanathan, M., Kumar, N. Sathish

    ISSN: 1532-0626, 1532-0634
    Veröffentlicht: Hoboken Wiley Subscription Services, Inc 10.02.2021
    Veröffentlicht in Concurrency and computation (10.02.2021)
    “… This problem is focused in previous method whose foremost objective is to attain the low complexity …”
    Volltext
    Journal Article
  10. 10

    Relations Among Some Low-Rank Subspace Recovery Models von Zhang, Hongyang, Lin, Zhouchen, Zhang, Chao, Gao, Junbin

    ISSN: 1530-888X, 1530-888X
    Veröffentlicht: United States 01.09.2015
    Veröffentlicht in Neural computation (01.09.2015)
    “… Recovering intrinsic low-dimensional subspaces from data distributed on them is a key preprocessing step to many applications …”
    Weitere Angaben
    Journal Article
  11. 11

    High-convergence-speed low-computation-complexity SVD algorithm for MIMO-OFDM systems von Cheng-Zhou Zhan, Kai-Yuan Jheng, Yen-Lian Chen, Ting-Jhun Jheng, An-Yeu Wu

    ISBN: 1424427819, 9781424427819
    Veröffentlicht: IEEE 01.04.2009
    “… This work proposes a SVD algorithm with fast convergence speed, which is suitable for the MIMO channels with short coherent time …”
    Volltext
    Tagungsbericht
  12. 12

    Log-Domain Decoding of Quantum LDPC Codes Over Binary Finite Fields von Lai, Ching-Yi, Kuo, Kao-Yueh

    ISSN: 2689-1808, 2689-1808
    Veröffentlicht: New York IEEE 2021
    Veröffentlicht in IEEE transactions on quantum engineering (2021)
    “… We study the decoding of quantum low-density parity-check (LDPC) codes over binary finite fields <inline-formula><tex-math notation="LaTeX">\operatorname{GF}(q=2^l)</tex-math></inline-formula …”
    Volltext
    Journal Article
  13. 13

    Low-Complexity Message-Passing Algorithms for Distributed Computation von Noorshams, Nima

    ISBN: 1303374234, 9781303374234
    Veröffentlicht: ProQuest Dissertations & Theses 01.01.2013
    “… Central to many statistical inference problems is the computation of some quantities defined over variables that can be fruitfully modeled in terms of graphs …”
    Volltext
    Dissertation
  14. 14

    Collaborative beamforming in wireless sensor networks using a novel particle swarm optimization algorithm variant von Maina, Robert Macharia, Kibet Lang'at, Philip, Kihato, Peter Kamita

    ISSN: 2405-8440, 2405-8440
    Veröffentlicht: Elsevier Ltd 01.10.2021
    Veröffentlicht in Heliyon (01.10.2021)
    “… Particle Swarm Optimization (PSO) algorithm is a good candidate for use in CBF owing to its simplicity and low computation complexity …”
    Volltext
    Journal Article
  15. 15

    On the deterministic approach to active queue management von Chrost, Lukasz, Chydzinski, Andrzej

    ISSN: 1018-4864, 1572-9451
    Veröffentlicht: New York Springer US 01.09.2016
    Veröffentlicht in Telecommunication systems (01.09.2016)
    “… At the same time, the algorithm is of low computation complexity, which allows for energy-efficient implementations in routers …”
    Volltext
    Journal Article
  16. 16

    Parallel and Pipelined Architectures for Cyclic Convolution by Block Circulant Formulation Using Low-Complexity Short-Length Algorithms von Meher, P.K.

    ISSN: 1051-8215, 1558-2205
    Veröffentlicht: New York, NY IEEE 01.10.2008
    “… Low-complexity algorithms are derived for efficient computation of those error terms, and overall complexities of the proposed technique are estimated for r =2, 3, 4, 6, 8 and 9 …”
    Volltext
    Journal Article
  17. 17

    A novel low complexity fast algorithm for effectively designing optimal mixed-level experiments von Elsawah, A. M.

    ISSN: 0361-0918, 1532-4141
    Veröffentlicht: Philadelphia Taylor & Francis 02.01.2024
    “… The practice demonstrated that large EExpDs are needed for many real-world multidimensional experiments and the existing algorithms loss their efficiency …”
    Volltext
    Journal Article
  18. 18

    A new analysis approach for T2 relaxometry myelin water quantification: Orthogonal Matching Pursuit von Drenthen, Gerhard S., Backes, Walter H., Aldenkamp, Albert P., Op ’t Veld, Giel J., Jansen, Jacobus F. A.

    ISSN: 0740-3194, 1522-2594, 1522-2594
    Veröffentlicht: Hoboken Wiley Subscription Services, Inc 01.05.2019
    Veröffentlicht in Magnetic resonance in medicine (01.05.2019)
    “… The orthogonal matching pursuit is a greedy sparse reconstruction algorithm with a low computation complexity …”
    Volltext
    Journal Article
  19. 19

    A Low-Complexity Digital Predistortion Algorithm for Power Amplifier Linearization von Qian, Hua, Yao, Saijie, Huang, Hao, Feng, Weifeng

    ISSN: 0018-9316, 1557-9611
    Veröffentlicht: New York IEEE 01.12.2014
    Veröffentlicht in IEEE transactions on broadcasting (01.12.2014)
    “… To estimate the DPD coefficients, numerical instability and computational complexity are bottlenecks …”
    Volltext
    Journal Article
  20. 20

    Minimizing the computation latency of FDMA‐based wireless powered edge computing network von Chen, Xi, Jiang, Guodong, Chi, Kaikai, Zhang, Shubin, Wei, Xinchen, Chen, Gang

    ISSN: 1751-8628, 1751-8636
    Veröffentlicht: Stevenage John Wiley & Sons, Inc 01.10.2023
    Veröffentlicht in IET communications (01.10.2023)
    “… ‐complexity algorithms is crucial for optimal network performance. This paper focuses on the computation latency of the FDMA‐based WP …”
    Volltext
    Journal Article