Výsledky vyhľadávania - low computation complexity algorithm
-
1
A Non-Feedback-Loop and Low-Computation- Complexity Algorithm Design for a Novel 2-D Sliding DFT Computation
ISSN: 2169-3536, 2169-3536Vydavateľské údaje: Piscataway IEEE 2019Vydané 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
Low-complexity direct computation algorithm for cubic-spline interpolation scheme
ISSN: 1047-3203, 1095-9076Vydavateľské údaje: Elsevier Inc 01.01.2018Vydané v Journal of visual communication and image representation (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
Constructing an Evolutionary Tree and Path–Cycle Graph Evolution along It
ISSN: 2227-7390, 2227-7390Vydavateľské údaje: Basel MDPI AG 24.04.2023Vydané 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
Low Complexity Shalvi-Weinstein Algorithm
ISSN: 0929-6212, 1572-834XVydavateľské údaje: New York Springer US 01.10.2021Vydané 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
Low Complexity and Fast Computation for Recursive MDCT and IMDCT Algorithms
ISSN: 1549-7747, 1558-3791Vydavateľské údaje: New York IEEE 01.07.2010Vydané v IEEE transactions on circuits and systems. II, Express briefs (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
Fast Sinkhorn II: Collinear Triangular Matrix and Linear Time Accurate Computation of Optimal Transport
ISSN: 0885-7474, 1573-7691Vydavateľské údaje: New York Springer US 01.01.2024Vydané 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
Reduced-Complexity LCC Reed-Solomon Decoder Based on Unified Syndrome Computation
ISSN: 1063-8210, 1557-9999Vydavateľské údaje: New York, NY IEEE 01.05.2013Vydané v IEEE transactions on very large scale integration (VLSI) systems (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
Cloud‐Fog Cooperative Computation Offloading and Resource Allocation in Heterogeneous Networks Based on Genetic Algorithm
ISSN: 1751-8628, 1751-8636Vydavateľské údaje: Stevenage John Wiley & Sons, Inc 01.01.2025Vydané 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
Bit error rate aware accurate prediction of original signals with low distortion using low complexity detection algorithms
ISSN: 1532-0626, 1532-0634Vydavateľské údaje: Hoboken Wiley Subscription Services, Inc 10.02.2021Vydané 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
Relations Among Some Low-Rank Subspace Recovery Models
ISSN: 1530-888X, 1530-888XVydavateľské údaje: United States 01.09.2015Vydané 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
High-convergence-speed low-computation-complexity SVD algorithm for MIMO-OFDM systems
ISBN: 1424427819, 9781424427819Vydavateľské údaje: IEEE 01.04.2009Vydané v 2009 International Symposium on VLSI Design, Automation and Test (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
Log-Domain Decoding of Quantum LDPC Codes Over Binary Finite Fields
ISSN: 2689-1808, 2689-1808Vydavateľské údaje: New York IEEE 2021Vydané v 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…”
Získať plný text
Journal Article -
13
Low-Complexity Message-Passing Algorithms for Distributed Computation
ISBN: 1303374234, 9781303374234Vydavateľ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
Collaborative beamforming in wireless sensor networks using a novel particle swarm optimization algorithm variant
ISSN: 2405-8440, 2405-8440Vydavateľské údaje: Elsevier Ltd 01.10.2021Vydané 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
On the deterministic approach to active queue management
ISSN: 1018-4864, 1572-9451Vydavateľské údaje: New York Springer US 01.09.2016Vydané 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
Parallel and Pipelined Architectures for Cyclic Convolution by Block Circulant Formulation Using Low-Complexity Short-Length Algorithms
ISSN: 1051-8215, 1558-2205Vydavateľské údaje: New York, NY IEEE 01.10.2008Vydané v IEEE transactions on circuits and systems for video technology (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
A novel low complexity fast algorithm for effectively designing optimal mixed-level experiments
ISSN: 0361-0918, 1532-4141Vydavateľské údaje: Philadelphia Taylor & Francis 02.01.2024Vydané v Communications in statistics. Simulation and computation (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
A new analysis approach for T2 relaxometry myelin water quantification: Orthogonal Matching Pursuit
ISSN: 0740-3194, 1522-2594, 1522-2594Vydavateľské údaje: Hoboken Wiley Subscription Services, Inc 01.05.2019Vydané 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
A Low-Complexity Digital Predistortion Algorithm for Power Amplifier Linearization
ISSN: 0018-9316, 1557-9611Vydavateľské údaje: New York IEEE 01.12.2014Vydané 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
Minimizing the computation latency of FDMA‐based wireless powered edge computing network
ISSN: 1751-8628, 1751-8636Vydavateľské údaje: Stevenage John Wiley & Sons, Inc 01.10.2023Vydané 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

