Showing 761 - 780 results of 11,272 for search 'both’s algorithm', query time: 0.14s Refine Results
  1. 761

    Orthogonal beam codebook based hybrid precoding algorithm for mmWave MIMO system by Weiting ZHAO, Dongliang XIA

    Published 2017-07-01
    “…Due to the high cost and power consumption of some mixed signal components at mmWave frequencies,the conventional full digital precoding technique encounters the problem of high hardware complexity.Consequently,the hybrid analog-digital precoding architecture has attracted the attentions from both academy and industry.Based on this,an orthogonal beam codebook based hybrid precoding algorithm for mmWave MIMO systems was proposed,which utilized the orthogonality of beam codebook to design the analog beamforming vector of each radio frequency (RF) chain in parallel.As a result,the large computational complexity of the conventional orthogonal matching pursuit (OMP) algorithm and the hardware complexity could be greatly reduced.…”
    Get full text
    Article
  2. 762

    VLSI implementation of AES algorithm against differential power attack and differential fault attack by HAN Jun, ZENG Xiao-yang, ZHAO Jia

    Published 2010-01-01
    “…A VLSI implementation of AES algorithm against both differential power attack and differential fault attack was proposed. …”
    Get full text
    Article
  3. 763

    Stackelberg games-based distributed algorithm of pricing and resource allocation in heterogeneous wireless networks by Yong JIANG, Shan-zhi CHEN, Bo HU

    Published 2013-01-01
    “…To deal with resource allocation in heterogeneous wireless networks,an algorithm based on multi-leader multi-follower Stackelberg games model was proposed to satisfy optimal utility of both operators and mobile users.The mobile user’s utility function with payoff and cost was designed,and it was demonstrated that the utility function obey concave function condition after defining operator price strategy,which assured the existence of Nash equilibrium point.A distributed iterative algorithm was presented to obtain optimal strategies of mobile user’s bandwidth allocation and operator’s pricing.At last,simulation experiments acquire player’s optimal strategies and Subgame perfect Nash equilibrium.…”
    Get full text
    Article
  4. 764

    New Hybrid (Oren- Al-Bayati) Self-Scaling Algorithm With Armijo Line-Search by Abbas Al-Bayati, Runak Abdullah

    Published 2010-12-01
    “…This algorithm has implemented both theoretically and numerically and tested on some well-known test cases. …”
    Get full text
    Article
  5. 765

    Hybrid Algorithm of Particle Swarm Optimization and Grey Wolf Optimizer for Improving Convergence Performance by Narinder Singh, S. B. Singh

    Published 2017-01-01
    “…A newly hybrid nature inspired algorithm called HPSOGWO is presented with the combination of Particle Swarm Optimization (PSO) and Grey Wolf Optimizer (GWO). …”
    Get full text
    Article
  6. 766

    Experimental Evaluation of Optimal Rate Delay and Power Allocation Algorithm in Wireless Control Networks by Muhammad Tahir, S. K. Mazumder

    Published 2010-01-01
    “…The network utility maximization (NUM) framework, widely used for wireless networks to achieve optimal resource allocation, has led to both centralized as well as distributed algorithms. …”
    Get full text
    Article
  7. 767

    Fast numerical algorithms for solving opposite-bordered tridiagonal Toeplitz linear systems and their applications by Hcini Fahd

    Published 2025-05-01
    “…Both algorithms are designed to solve a system of n equations in linear time. …”
    Get full text
    Article
  8. 768

    Multi-cell downlink coordinated beam forming algorithm based on fairness duality theory by Shi-wen HE, Yong-ming HUANG, Lv-xi YANG

    Published 2013-01-01
    “…With the goal to optimize the multi-cell downlink beamforming based on the criterion of the worst-user rate maximization,the Lagrangian duality theory was first used to derive a virtual multi-cell uplink optimization problem that was dual to the primal multi-cell downlink beamforming optimization problem.Base on that,an iterative algorithm was developed to solve the virtual uplink problem by combining the methods of bisection search and geometric programming.Then,the primal multi-cell downlink coordinated beamforming optimization problem could be solved by converting the solution of the virtual uplink problem to the downlink.Simulation results demonstrate that,in contrast to the existing coordinated beamforming schemes,the proposed scheme achieves better performance in terms of both the worst-user rate and the rate per energy (RPE).…”
    Get full text
    Article
  9. 769

    A Genetic and Simulated Annealing Combined Algorithm for Optimization of Wideband Antenna Matching Networks by Aixin Chen, Tiehua Jiang, Zhizhang Chen, Yanjun Zhang

    Published 2012-01-01
    “…As a result, advantages of both the genetic algorithm (GA) and simulated annealing (SA) are taken. …”
    Get full text
    Article
  10. 770

    Cutting-Edge Stochastic Approach: Efficient Monte Carlo Algorithms with Applications to Sensitivity Analysis by Ivan Dimov, Rayna Georgieva

    Published 2025-04-01
    “…The theoretical proof demonstrates that these algorithms exhibit an optimal rate of convergence for functions with continuous and bounded first derivatives and for functions with continuous and bounded second derivatives, respectively, both in terms of probability and mean square error. …”
    Get full text
    Article
  11. 771

    Network media streaming offloading algorithm based on QoE in mobile edge network by Zaijian WANG, Hao CHENG

    Published 2024-02-01
    “…Aiming at the problems of high-latency, high energy consumption, high bandwidth, and poor quality of experience (QoE) caused by emerging network media streaming business in mobile edge computing, a computing offloading algorithm based on QoE feedback configuration was proposed.Firstly, both preprocessing and priority were comprehensively considered to maximize network resource utilization.Meanwhile, different weights were assigned to the computation tasks for establishing a resource allocation relationship.Secondly, after comprehensively taking into account deadline, computing resource, power and bandwidth constraint, an QoE model was established where the optimization objective was the weighted sum of task delay, energy consumption and precision, and the method of Lagrange multipliers was utilized to solve the established model.Simulation results indicate that, compared with the deep reinforcement learning-based online offloading algorithm, the proposed algorithm can effectively optimize the resource allocation and better improve the QoE.…”
    Get full text
    Article
  12. 772

    Best Possible Approximation Algorithms for Single Machine Scheduling with Increasing Linear Maintenance Durations by Xuefei Shi, Dehua Xu

    Published 2014-01-01
    “…We also show that there is no polynomial time approximation algorithm with a worst-case bound less than 2 for the problem with b≥0 unless P=NP, which implies that the FFD-LS2I algorithm is the best possible algorithm for the case b>1 and that the FFD-LS algorithm, which is proposed in the literature, is the best possible algorithm for the case b≤1 both from the worst-case bound point of view.…”
    Get full text
    Article
  13. 773

    Low complexity hybrid precoding algorithm for massive MIMO based on modified Newton method by Bo HU, Anding WANG, Guiyi WEI

    Published 2023-11-01
    “…A phase tracking algorithm was proposed for massivemultiple-input multiple-output(MIMO) systems based on the modified Newton (MN) method, which effectively reduced the high computational complexity in traditional high-performance hybrid precoding schemes.The algorithm optimized the analog precoding matrix from the perspective ofsub-dimensional vector recovery.In each sub-dimension optimization, the phase tracking method was used to transform the recovery of the analog precoding vectors into an unconstrained nonlinear optimization problem, which was then solved using the MN method.Concurrently, this strategy led to a marked reduction in the computational intricacy pertaining to both the computation of correction factors and the inversion of the Hessian matrix within the framework of the MN method.This was achieved through the insightful incorporation of Gerschgorin’s Disk theorem and the Hermitian matrix block-inverse lemma.Simulation results show that the proposed algorithm has higher spectral efficiency and lower computational complexity than several conventional high-performance hybrid precoding schemes.…”
    Get full text
    Article
  14. 774
  15. 775

    Two Novel DV-Hop Localization Algorithms for Randomly Deployed Wireless Sensor Networks by Guozhi Song, Dayuan Tam

    Published 2015-07-01
    “…Simulations have been conducted to prove that the accuracy is improved by both of the two algorithms and IWC-DV-hop is the best choice.…”
    Get full text
    Article
  16. 776
  17. 777

    Successive interference cancellation receiver algorithms for uplink STBC coded MC-CDMA systems by ZENG Yan-xing, YIN Qin-ye, DENG Ke, DENG Jian-guo

    Published 2006-01-01
    “…Simulation results demonstrate the proposed algorithms outperform the ZF receiver algorithm in both independent and correlated fading channels and they require 4 dB less signal-to-noise ratio than the traditional one for a bit error rate of 10?…”
    Get full text
    Article
  18. 778
  19. 779

    A Modified Iterative Alternating Direction Minimization Algorithm for Impulse Noise Removal in Images by Di Guo, Xiaobo Qu, Meng Wu, Keshou Wu

    Published 2014-01-01
    “…Simulation results demonstrate that the proposed algorithm outperforms typical denoising methods in terms of preserving edges and textures for both salt-and-pepper noise and random-valued impulse noise. …”
    Get full text
    Article
  20. 780

    An Efficient Optimization Algorithm for Measurement Matrix Based on SVD and Improved Nesterov Accelerated Gradient by B. ZHANG, R. YI, Z. WANG, J. PU, . Y. SUN

    Published 2025-06-01
    “…The experimental results and analysis show that the proposed algorithm performs well in terms of both computational complexity and reconstruction performance.…”
    Get full text
    Article