Based on the fact that the variation of tile direction of arrival (DOA) isslower than that of the channel fading, the steering vector of the desired signal is estimatedfirstly using a subspace decomposition method and...Based on the fact that the variation of tile direction of arrival (DOA) isslower than that of the channel fading, the steering vector of the desired signal is estimatedfirstly using a subspace decomposition method and then a constrained condition is configured.Traffic signals are further employed to estimate the channel vector based on the constrained leastsquares criterion. We use the iterative least squares with projection (ILSP) algorithm initializedby the pilot to get the estimation. The accuracy of channel estimation and symbol detection can beprogressively increased through the iteration procedure of the ILSP algorithm. Simulation resultsdemonstrate that the proposed algorithm improves the system performance effectively compared withthe conventional 2-D RAKE receiver.展开更多
We study the influence of the constraint in the parameter space on quantum games.Decomposing SU(2)operator into product of three rotation operators and controlling one kind of them,we impose a constraint on the parame...We study the influence of the constraint in the parameter space on quantum games.Decomposing SU(2)operator into product of three rotation operators and controlling one kind of them,we impose a constraint on the parameter space of the players' operator.We find that the constraint can provide a tuner to make the bilateral payoffs equal,so that the mismatch of the players' action at multi-equilibrium could be avoided.We also find that the game exhibits an intriguing structure as a function of the parameter of the controlled operators,which is useful for making game models.展开更多
Grapiglia et al.(2013) proved subspace properties for the Celis-Dennis-Tapia(CDT) problem. If a subspace with lower dimension is appropriately chosen to satisfy subspace properties, then one can solve the CDT problem ...Grapiglia et al.(2013) proved subspace properties for the Celis-Dennis-Tapia(CDT) problem. If a subspace with lower dimension is appropriately chosen to satisfy subspace properties, then one can solve the CDT problem in that subspace so that the computational cost can be reduced. We show how to find subspaces that satisfy subspace properties for the CDT problem, by using the eigendecomposition of the Hessian matrix of the objection function. The dimensions of the subspaces are investigated. We also apply the subspace technologies to the trust region subproblem and the quadratic optimization with two quadratic constraints.展开更多
基金The National Hi-Tech Development Plan (863-317-03-01-02-04-20).
文摘Based on the fact that the variation of tile direction of arrival (DOA) isslower than that of the channel fading, the steering vector of the desired signal is estimatedfirstly using a subspace decomposition method and then a constrained condition is configured.Traffic signals are further employed to estimate the channel vector based on the constrained leastsquares criterion. We use the iterative least squares with projection (ILSP) algorithm initializedby the pilot to get the estimation. The accuracy of channel estimation and symbol detection can beprogressively increased through the iteration procedure of the ILSP algorithm. Simulation resultsdemonstrate that the proposed algorithm improves the system performance effectively compared withthe conventional 2-D RAKE receiver.
文摘We study the influence of the constraint in the parameter space on quantum games.Decomposing SU(2)operator into product of three rotation operators and controlling one kind of them,we impose a constraint on the parameter space of the players' operator.We find that the constraint can provide a tuner to make the bilateral payoffs equal,so that the mismatch of the players' action at multi-equilibrium could be avoided.We also find that the game exhibits an intriguing structure as a function of the parameter of the controlled operators,which is useful for making game models.
基金supported by National Natural Science Foundation of China(Grant Nos.11171217 and 11571234)
文摘Grapiglia et al.(2013) proved subspace properties for the Celis-Dennis-Tapia(CDT) problem. If a subspace with lower dimension is appropriately chosen to satisfy subspace properties, then one can solve the CDT problem in that subspace so that the computational cost can be reduced. We show how to find subspaces that satisfy subspace properties for the CDT problem, by using the eigendecomposition of the Hessian matrix of the objection function. The dimensions of the subspaces are investigated. We also apply the subspace technologies to the trust region subproblem and the quadratic optimization with two quadratic constraints.
