Výsledky vyhľadávania - low computation complexity algorithm

Upresniť hľadanie
  1. 1

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

    ISSN: 2169-3536, 2169-3536
    Vydavateľské údaje: Piscataway IEEE 2019
    Vydané v 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…”
    Získať plný text
    Journal Article
  2. 2

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

    ISSN: 1047-3203, 1095-9076
    Vydavateľské údaje: Elsevier Inc 01.01.2018
    “…•A low-complexity direct computation algorithm for CSI scheme is developed to improve the computational efficiency…”
    Získať plný text
    Journal Article
  3. 3

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

    ISSN: 2227-7390, 2227-7390
    Vydavateľské údaje: Basel MDPI AG 24.04.2023
    Vydané v 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…”
    Získať plný text
    Journal Article
  4. 4

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

    ISSN: 0929-6212, 1572-834X
    Vydavateľské údaje: New York Springer US 01.10.2021
    Vydané v 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…”
    Získať plný text
    Journal Article
  5. 5

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

    ISSN: 1549-7747, 1558-3791
    Vydavateľské údaje: 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…”
    Získať plný text
    Journal Article
  6. 6

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

    ISSN: 0885-7474, 1573-7691
    Vydavateľské údaje: New York Springer US 01.01.2024
    Vydané v 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…”
    Získať plný text
    Journal Article
  7. 7

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

    ISSN: 1063-8210, 1557-9999
    Vydavateľské údaje: 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…”
    Získať plný text
    Journal Article
  8. 8

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

    ISSN: 1751-8628, 1751-8636
    Vydavateľské údaje: Stevenage John Wiley & Sons, Inc 01.01.2025
    Vydané v 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…”
    Získať plný text
    Journal Article
  9. 9

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

    ISSN: 1532-0626, 1532-0634
    Vydavateľské údaje: Hoboken Wiley Subscription Services, Inc 10.02.2021
    Vydané v Concurrency and computation (10.02.2021)
    “… This problem is focused in previous method whose foremost objective is to attain the low complexity…”
    Získať plný text
    Journal Article
  10. 10

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

    ISSN: 1530-888X, 1530-888X
    Vydavateľské údaje: United States 01.09.2015
    Vydané v Neural computation (01.09.2015)
    “…Recovering intrinsic low-dimensional subspaces from data distributed on them is a key preprocessing step to many applications…”
    Zistit podrobnosti o prístupe
    Journal Article
  11. 11

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

    ISBN: 1424427819, 9781424427819
    Vydavateľské údaje: 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…”
    Získať plný text
    Konferenčný príspevok..
  12. 12

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

    ISSN: 2689-1808, 2689-1808
    Vydavateľské údaje: New York IEEE 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…”
    Získať plný text
    Journal Article
  13. 13

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

    ISBN: 1303374234, 9781303374234
    Vydavateľské údaje: 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…”
    Získať plný text
    Dissertation
  14. 14

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

    ISSN: 2405-8440, 2405-8440
    Vydavateľské údaje: Elsevier Ltd 01.10.2021
    Vydané v 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…”
    Získať plný text
    Journal Article
  15. 15

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

    ISSN: 1018-4864, 1572-9451
    Vydavateľské údaje: New York Springer US 01.09.2016
    Vydané v Telecommunication systems (01.09.2016)
    “… At the same time, the algorithm is of low computation complexity, which allows for energy-efficient implementations in routers…”
    Získať plný text
    Journal Article
  16. 16

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

    ISSN: 1051-8215, 1558-2205
    Vydavateľské údaje: 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…”
    Získať plný text
    Journal Article
  17. 17

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

    ISSN: 0361-0918, 1532-4141
    Vydavateľské údaje: 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…”
    Získať plný text
    Journal Article
  18. 18

    A new analysis approach for T2 relaxometry myelin water quantification: Orthogonal Matching Pursuit Autor 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
    Vydavateľské údaje: Hoboken Wiley Subscription Services, Inc 01.05.2019
    Vydané v Magnetic resonance in medicine (01.05.2019)
    “… The orthogonal matching pursuit is a greedy sparse reconstruction algorithm with a low computation complexity…”
    Získať plný text
    Journal Article
  19. 19

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

    ISSN: 0018-9316, 1557-9611
    Vydavateľské údaje: New York IEEE 01.12.2014
    Vydané v IEEE transactions on broadcasting (01.12.2014)
    “… To estimate the DPD coefficients, numerical instability and computational complexity are bottlenecks…”
    Získať plný text
    Journal Article
  20. 20

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

    ISSN: 1751-8628, 1751-8636
    Vydavateľské údaje: Stevenage John Wiley & Sons, Inc 01.10.2023
    Vydané v 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…”
    Získať plný text
    Journal Article