Power control problems for wireless communication networks are investigated in direct-sequence codedivision multiple-access （DS/CDMA） channels. It is shown that the underlying problem can be formulated as a constrai...Power control problems for wireless communication networks are investigated in direct-sequence codedivision multiple-access （DS/CDMA） channels. It is shown that the underlying problem can be formulated as a constrained optimization problem in a stochastic framework. For effective solutions to this optimization problem in real time, recursive algorithms of stochastic approximation type are developed that can solve the problem with unknown system components. Under broad conditions, convergence of the algorithms is established by using weak convergence methods.展开更多
This paper introduces several algorithms for signal estimation using binary-valued outputsensing.The main idea is derived from the empirical measure approach for quantized identification,which has been shown to be con...This paper introduces several algorithms for signal estimation using binary-valued outputsensing.The main idea is derived from the empirical measure approach for quantized identification,which has been shown to be convergent and asymptotically efficient when the unknown parametersare constants.Signal estimation under binary-valued observations must take into consideration oftime varying variables.Typical empirical measure based algorithms are modified with exponentialweighting and threshold adaptation to accommodate time-varying natures of the signals.Without anyinformation on signal generators,the authors establish estimation algorithms,interaction between noisereduction by averaging and signal tracking,convergence rates,and asymptotic efficiency.A thresholdadaptation algorithm is introduced.Its convergence and convergence rates are analyzed by using theODE method for stochastic approximation problems.展开更多
This work is concerned with rates of convergence of numerical methods using Markov chainapproximation for controlled diffusions with stopping (the first exit time from a bounded region).In lieuof considering the assoc...This work is concerned with rates of convergence of numerical methods using Markov chainapproximation for controlled diffusions with stopping (the first exit time from a bounded region).In lieuof considering the associated finite difference schemes for Hamilton-Jacobi-Bellman (HJB) equations,a purely probabilistic approach is used.There is an added difficulty due to the boundary condition,which requires the continuity of the first exit time with respect to the discrete parameter.To prove theconvergence of the algorithm by Markov chain approximation method,a tangency problem might arise.A common approach uses certain conditions to avoid the tangency problem.Here,by modifying thevalue function,it is demonstrated that the tangency problem will not arise in the sense of convergencein probability and in L^1.In addition,controlled diffusions with a discount factor is also treated.展开更多
基金Research of G.Yin was supported by the National Science Foundation (CMS-0510655,DMS-0624849)the National Security Agency (MSPF-068-029)+3 种基金the National Natural Science Foundation of China (No.60574069)research of C.-A. Tan was supported by the National Science Foundation (CMS-0510655)research of L.Y.Wang was supported by the National Science Foundation (ECS-0329597, DMS-0624849)research of C.Z.Xu was supported by the National Science Foundation (CCF-0611750,DMS-0624849,CNS-0702488,CRI-0708232).
文摘Power control problems for wireless communication networks are investigated in direct-sequence codedivision multiple-access （DS/CDMA） channels. It is shown that the underlying problem can be formulated as a constrained optimization problem in a stochastic framework. For effective solutions to this optimization problem in real time, recursive algorithms of stochastic approximation type are developed that can solve the problem with unknown system components. Under broad conditions, convergence of the algorithms is established by using weak convergence methods.
基金supported in part by the National Science Foundation under ECS-0329597 and DMS-0624849in part by the Air Force Office of Scientific Research under FA9550-10-1-0210+2 种基金supported by the National Science Foundation under DMS-0907753 and DMS-0624849in part by the Air Force Office of Scientific Research under FA9550-10-1-0210supported in part by a research grant from the Australian Research Council
文摘This paper introduces several algorithms for signal estimation using binary-valued outputsensing.The main idea is derived from the empirical measure approach for quantized identification,which has been shown to be convergent and asymptotically efficient when the unknown parametersare constants.Signal estimation under binary-valued observations must take into consideration oftime varying variables.Typical empirical measure based algorithms are modified with exponentialweighting and threshold adaptation to accommodate time-varying natures of the signals.Without anyinformation on signal generators,the authors establish estimation algorithms,interaction between noisereduction by averaging and signal tracking,convergence rates,and asymptotic efficiency.A thresholdadaptation algorithm is introduced.Its convergence and convergence rates are analyzed by using theODE method for stochastic approximation problems.
基金supported in part by the National Science Foundation under Grant Nos. DMS-0624849 and DMS-0907753in part by the Natural Science Foundation of China under Grant No. #70871055
文摘This work is concerned with rates of convergence of numerical methods using Markov chainapproximation for controlled diffusions with stopping (the first exit time from a bounded region).In lieuof considering the associated finite difference schemes for Hamilton-Jacobi-Bellman (HJB) equations,a purely probabilistic approach is used.There is an added difficulty due to the boundary condition,which requires the continuity of the first exit time with respect to the discrete parameter.To prove theconvergence of the algorithm by Markov chain approximation method,a tangency problem might arise.A common approach uses certain conditions to avoid the tangency problem.Here,by modifying thevalue function,it is demonstrated that the tangency problem will not arise in the sense of convergencein probability and in L^1.In addition,controlled diffusions with a discount factor is also treated.
