检索结果-内蒙古大学图书馆

IEEE Global Communications Conference

作者： Shimin Gong Ping Wang Lingjie Duan Nanyang Technological University Singapore University of Technology and Design

ISBN: (纸本)9781479935130

In cognitive radio networks, it is challenging for secondary users (SUs) to keep track of their interference at the receivers of primary users (PUs), due to the error in channel estimation and irregular information exchange between SUs and PUs. In this paper, we practically consider that SUs have only partial knowledge about the channel gains from SUs to PUs, based on which SUs estimate the worst-case channel gains and decide transmit power to robustly protect PUs. As it is rare that all SU-PU channels experience the worst-case conditions simultaneously, we proposed the worst-case selective robust model for SUs to estimate the aggregate interference power at PU receivers by predicting that only a part of SU-PU channels are in the worst-case conditions. We study SUs' robust power control problem in a non-cooperative game, where each SU maximizes its own throughput subject to interference constraints at PU receivers. We propose an iterative algorithm for SUs to achieve unique Nash equilibrium in a distributed manner. Extensive numerical results show that our algorithm provides guaranteed protection for PUs provided with uncertain SU-PU channel information.

关键词： channel estimation cognitive radio game theory iterative methods power control radiofrequency interference robust control telecommunication control PU receivers SU robust power control problem SU-PU channel information aggregate interference power estimation channel estimation error channel gains cognitive radio networks game theoretic approach interference constraints irregular information exchange iterative algorithm noncooperative game primary users secondary users transmit power unique Nash equilibrium worst-case selective robust model Aggregates Channel estimation Interference Power control Receivers Robustness Uncertainty

来源：评论

学校读者我要写书评

暂无评论

Joint Downlink and Uplink Resource Allocation for Energy-Efficient Carrier Aggregation

Joint Downlink and Uplink Resource Allocation for Energy-Eff...

引用

IEEE Global Communications Conference

作者： Guanding Yu Qimei Chen Rui Yin Huazi Zhang Geoffrey Ye Li Department of Information Science and Electronic Engineering Zhejiang University College of Information and Electronic Engineering Zhejiang Gongshang University School of ECE Georgia Institute of Technology

ISBN: (纸本)9781479935130

In this paper, we propose a novel energy-efficient resource allocation method to simultaneously improve both downlink and uplink energy efficiency (EE) for time division duplex (TDD) systems with carrier aggregation (CA). We aim at EE tradeoff between downlink and uplink by optimizing the power and bandwidth allocation on each carrier component (CC) for each user. The objective function is a sum of several fractional functions, therefore, a novel nonlinear sum-of-ratios programming technique is used to solve it. We first transform the problem into an equivalent and better tractable one and then propose an iterative algorithm to find the global optimum solution. Numerical results show that our method can converge with an acceptable number of iterations and achieve flexible EE tradeoff between downlink and uplink.

关键词： energy conservation iterative methods resource allocation time division multiplexing TDD systems bandwidth allocation carrier aggregation carrier component energy efficiency energy-efficient carrier aggregation energy-efficient resource allocation method fractional functions global optimum solution iterative algorithm joint downlink-uplink resource allocation nonlinear sum-of-ratios programming technique time division duplex systems Bandwidth Base stations Downlink Optimization Power demand Resource management Uplink

来源：评论

学校读者我要写书评

暂无评论

An INS Error Estimation Method Based on Passive Observation to single Feature Target for Cruise Missile

An INS Error Estimation Method Based on Passive Observation ...

引用

2014中国制导、导航与控制学术会议

作者： Kunhu Kou Bin Li Daquan Tang Department of Control Engineering Naval Aeronautical Engineering InstituteYantaiShandong 264001 P.R.China Military Representative Naval Chamber AnshunGuizhou 561018 P.R.China

ISBN: (纸本)9781479946983

In absence of the other navigation system,cruise missile INS error will be cumulated continuously with the increase of ***,this article proposes a novel practical INS error estimation and compensation method based on continuous observation to feature *** the observation sequence and pseudo observation sequence,the residual error sequence is *** the error estimation equation is established by treating the residual error sequence as the *** the INS level channel error and vertical channel error are estimated respectively by iterative *** de-noising approach is used to improve the estimation *** INS error compensation method is a real time *** simulation result shows that this method can reduce the INS position error to 3m and velocity error to *** it could be applied to cruise missile autonomous *** if other navigation systems are available,this method could also be used to increase the reliability of the integrated navigation system.

关键词： compensation inertial navigation iterative methods missile control path planning INS error estimation method INS level channel error compensation method cruise missile INS error cruise missile autonomous navigation error estimation equation inertial navigation system iterative algorithm means denoising approach observation sequence pseudo observation sequence residual error sequence vertical channel error Accuracy Channel estimation Equations Error analysis Measurement uncertainty Missiles Navigation

来源：评论

学校读者我要写书评

暂无评论

The Design and Implementation of a Symmetric Encryption algorithm Based on DES

The Design and Implementation of a Symmetric Encryption Algo...

引用

2014 IEEE 5th International Conference on Software Engineering and Service Science

作者： Zhou Yingbing LI Yongzhen Dept. of Computer Science & Technology Yanbian University

In this age of explosive growth in information exchanges,there is indeed no time at which security does not *** of the symmetric encryption algorithms,DES,has kept its dominant position in the area of data encryption over the last few ***,with a rapid development in the field of computer hardware,DES has already been proved *** takes a short time to translate the ciphertext to its corresponding plaintext using brute-force method at a reasonable *** is mainly due to the small key size DES *** these issues,the objective of this article is to suggest an alternative on DES to obtain higher security and better execution efficiency by increasing the key size and updating the iteration *** were conducted with both DES and the advanced DES named triple DES(3DES).The results have demonstrated that the proposed algorithm outperforms both previous algorithms.

关键词： DES key expansion iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

A Novel Precoder Design for MIMO Multicasting with MMSE-DFE Receivers

A Novel Precoder Design for MIMO Multicasting with MMSE-DFE ...

引用

IEEE Vehicular Technology Conference

作者： Zilong Zhang Xiaodong Xu Baisheng Du Zhiyong Chen Department of Electronic Engineering and Information Science University of Science and Technology of China

ISBN: (纸本)9781479944484

A novel precoding scheme is proposed for MIMO multicasting systems, using the criterion of maximizing the minimal signal-to-interference-plus-noise ratio (SINR) among multiple data streams, while considering the minimum mean-squared-error decision feedback equalizer (MMSE-DFE) at each user side. We decompose the precoding matrix into a transformation matrix multiplied by a unitary matrix, and perform the design process within two steps. In the first step, the transformation matrix is obtained by solving a convex optimization and using Gaussian randomization. In the second one, the unitary matrix is iteratively optimized by decomposing the original multiple-stream problem into several simplified dual-stream sub-problems. At each iteration, the dual-stream sub-problem is converted into a real-valued optimization problem equivalently, which can be solved by an iterative approach based on the Lozano's algorithm. Simulation results indicate that the proposed scheme achieves better performance in terms of both achievable rate and symbol error rate than the other existing schemes.

关键词： MIMO Precoder design Physical layer multi-casting MMSE-DFE iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

An iterative algorithm based on M-proximal mappings for a system of generalized implicit variational inclusions in Banach spaces

引用

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS 2009年第2期233卷 361-371页

作者： Kazmi, K. R. Bhat, M. I. Ahmad, Naeem Aligarh Muslim Univ Dept Math Aligarh 202002 Uttar Pradesh India Univ Kashmir Dept Math Anantnag 192101 Jammu & Kashmir India Aligarh Muslim Univ Dept Appl Math Aligarh 202002 Uttar Pradesh India

In this paper, we give the notion of M-proximal mapping, an extension of P-proximal mapping given in [X.P. Ding, F.Q. Xia, A new class of completely generalized quasi-variational inclusions in Banach spaces, J. Comput. Appl. Math. 147 (2002) 369-383], for a nonconvex, proper, lower semicontinuous and subdifferentiable functional on Banach space and prove its existence and Lipschitz continuity. Further, we consider a system of generalized implicit variational inclusions in Banach spaces and show its equivalence with a system of implicit Wiener-Hopf equations using the concept of M-proximal mappings. Using this equivalence, we propose a new iterative algorithm for the system of generalized implicit variational inclusions. Furthermore, we prove the existence of solution of the system of generalized implicit variational inclusions and discuss the convergence and stability analysis of the iterative algorithm. (C) 2009 Elsevier B.V. All rights reserved.

关键词： System of generalized implicit variational inclusions M-proximal mapping System of implicit Wiener-Hopf equations iterative algorithm Convergence and stability

来源：评论

学校读者我要写书评

暂无评论

Strong convergence of an iterative algorithm on an infinite countable family of nonexpansive mappings

引用

APPLIED MATHEMATICS AND COMPUTATION 2009年第1期208卷 211-218页

作者： Yao, Yonghong Liou, Yeong-Cheng Kang, Shin Min Gyeongsang Natl Univ Dept Math Kyungnam 660701 Jinju South Korea Gyeongsang Natl Univ RINS Kyungnam 660701 Jinju South Korea Tianjin Polytech Univ Dept Math Tianjin 300160 Peoples R China Cheng Shiu Univ Dept Informat Management Kaohsiung 833 Taiwan

Let C be a nonempty closed convex subset of a real strictly convex and reflexive Banach space E which has a uniformly Gateaux differentiable norm. Let f : C -> C be a given contractive mapping and {T-n}(n-1)(infinity) : C -> C be an infinite family of nonexpansive mappings such that the common. fixed point sets F := boolean AND(infinity)(n-1) F(T-n) not equal empty set. Let {alpha(n)} and {beta(n)} be two real sequences in [0, 1]. For given x(0) is an element of C arbitrarily, let the sequence {x(n)} be generated iteratively by x(n+1) = alpha(n)f(x(n)) + beta(n)x(n) + (1 - alpha(n) - beta(n))W(n)x(n), where W-n is the W-mapping generated by the mappings T-n;Tn-1,..., T-1 and xi(n), xi(n-1),..., xi(1). Suppose the iterative parameters {alpha(n)} and {beta(b)} satisfy the following control conditions: (C1) lim(n ->infinity) alpha(n) = 0;(C2) Sigma(infinity)(n-0) alpha(n) = infinity;(B5) lim sup(n ->infinity) beta(n) < 1. Then the sequence {x(n)} converges strongly to p is an element of F where p is the unique solution in F to the following variational inequality: <(I - f)p,j(p - x*)> <= 0 for all x* is an element of F. (C) 2008 Elsevier Inc. All rights reserved.

关键词： An infinite countable family of nonexpansive mappings iterative algorithm Common fixed point Strong convergence

来源：评论

学校读者我要写书评

暂无评论

An iterative algorithm for the least squares bisymmetric solutions of the matrix equations A₁XB₁ = C₁, A₂XB₂ = C₂

引用

MATHEMATICAL AND COMPUTER MODELLING 2009年第7-8期50卷 1237-1244页

作者： Cai, Jing Chen, Guoliang E China Normal Univ Dept Math Shanghai 200062 Peoples R China Huzhou Teachers Coll Sch Sci Huzhou 313000 Zhejiang Peoples R China

In this paper, an iterative algorithm is constructed to solve the minimum Frobenius norm residual problem: min parallel to((A1XB1)(A2XB2)) - ((C1)(C2))parallel to over bisymmetric matrices. By this algorithm, for any initial bisymmetric matrix X-0, a solution X* can be obtained infinite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of initial matrix. Furthermore, in the solution set of the above problem, the unique optimal approximation solution (X) over cap to a given matrix (X) over bar in the Frobenius norm can be derived by finding the least norm bisymmetric solution of a new corresponding minimum Frobenius norm problem. Given numerical examples show that the iterative algorithm is quite effective in actual computation. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： iterative algorithm Least squares bisymmetric solution Matrix equation Optimal approximation solution

来源：评论

学校读者我要写书评

暂无评论

General A-P iterative algorithm in Shift-invariant Spaces

引用

Acta Mathematica Sinica,English Series 2009年第4期25卷 545-552页

作者： Jun XIAN Song LI Department of Mathematics Sun Yat-sen ( Zhongshan) University Guangzhou 510275 P. R. China Department of Mathematics Zhejiang University Hangzhou 310027 P. R. China

A general A-P iterative algorithm in a shift-invariant space is presented. We use the algorithm to show reconstruction of signals from weighted samples and also show that the general improved algorithm has better conv... 详细信息

关键词： irregular sampling iterative algorithm lattice-invariant space shift-invariant space spline subspace

来源：评论

学校读者我要写书评

暂无评论

iterative algorithms for solving inverse problems of heat conduction in multiply connected domains

引用

INTERNATIONAL JOURNAL OF HEAT AND MASS TRANSFER 2012年第4期55卷 744-751页

作者： Frackowiak, A. Cialkowski, M. Wroblewska, A. Poznan Univ Tech Chair Thermal Engn PL-60965 Poznan Poland

The presented paper displays a method of solving the inverse problems of heat transfer in multi-connected regions, consisting in iterative solving of convergent series of the direct problems. For known temperature and flux values at the outer boundary of the region the temperature and flux values at the inner boundaries are sought (the cauchy problem for the Laplace equation). In case of such a formulation of the problem, the solution does not always exist, one of the conditions is met in the mean-square sense, providing the optimization criterion. The idea of the process consists in solving the direct problem in which the boundary condition is subject to iterative changes so as to attain minimum of the optimization criterion (the square functional). Two algorithms have been formulated. In the first of them the heat flux at the inner boundaries of the region, while in the other the temperature were subject to changes. Convergence of both the algorithms have been compared. The numerical calculation has been made for selected examples, for which an analytical solution is known. The effect of random disturbance of the boundary conditions on the solution obtained with iterative algorithms has been checked. Moreover, a function was defined, serving as convergence measure of the solution of the inverse problem solved with the algorithms proposed in the paper. The properties of the function give evidence that it tends to the value exceeding unity. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Inverse problem Cauchy problem iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：