The detection of sparse signals against background noise is considered. Detecting signals of such kind is difficult since only a small portion of the signal carries information. Prior knowledge is usually assumed to ease detection. In this paper, we consider the general unknown and arbitrary sparse signal detection problem when no prior knowledge is available. Under a Neyman-Pearson hypothesis-testing framework, a new detection scheme is proposed by combining a generalized likelihood ratio test (GLRT)-like test statistic and convex programming methods which directly exploit sparsity in an underdetermined system of linear equations. We characterize large sample behavior of the proposed method by analyzing its asymptotic performance. Specifically, we give the condition for the Chernoff-consistent detection which shows that the proposed method is very sensitive to the 2 norm energy of the sparse signals. Both the false alarm rate and the miss rate tend to zero at vanishing signal-to-noise ratio (SNR), as long as the signal energy grows at least logarithmically with the problem dimension. Next we give a large deviation analysis to characterize the error exponent for the Neyman-Pearson detection. We derive the oracle error exponent assuming signal knowledge. Then we explicitly derive the error exponent of the proposed scheme and compare it with the oracle exponent. We complement our study with numerical experiments, showing that the proposed method performs in the vicinity of the likelihood ratio test (LRT) method in the finite sample scenario and the error probability degrades exponentially with the number of observations.
＜正＞This paper presents a control structure designed by backstepping method for nonholonomic mobile robots with...
WANG Kai~1,JIA Yingmin~(1,2),DU Junping~3,YU Fashan~4 1.The Seventh Research Division and the Department of Systems and Control,Beihang University(BUAA),Beijing 100191,P.R.China 2.Key Laboratory of Mathematics,Informatics and Behavioral Semantics(LMIB),Ministry of Education,SMSS,Beihang University (BUAA),Beijing 100191,P.R.China 3.Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia,School of Computer Science and Technology, Beijing University of Posts and Telecommunications,Beijing 100876,P.R.China 4.School of Electrical Engineering and Automation,Henan Polytechnic University,Jiaozuo 454000,Henan,P.R.China
This paper addresses the robust state estimation problem for a class of jump Markov linear systems（JMLSs）with ...
LI Wenling1,JIA Yingmin1,2,MENG Deyuan11.The Seventh Research Division and the Department of Systems and Control,Beihang University(BUAA),Beijing 100191,P.R.China2.Key Laboratory of Mathematics,Informatics and Behavioral Semantics(LMIB),Ministry of Education,SMSS,Beihang University(BUAA),Beijing 100191,P.R.China
This paper presents a novel approach for checking route oscillation of border gateway protocol(BGP) quickly,by which the privacy of routing policies of autonomous system(AS) can be respected.Firstly,route update chain tag(RUCT) is constructed to track the forwarding of update report,and local routing library is made to record the changing history of update report.Then route oscillation can be identified by analyzing correlative state of RUCT and local routing library.The characteristic of this approach is that an arbitrary AS can check route oscillation alone only by sharing its network ID,which greatly respects the pri-vacy of routing policies for each AS.This paper shows that both looping in RUCT and consecutive positive-negative report in local record are sufficient conditions for route oscillation.Comparative experiments demonstrate the availability and efficiency of the proposed approach.
To greatly increase spectral efficiency and improve network performance in wireless networks,a novel cooperative routing algorithm,namely maximum throughput cooperative routing(MTCR) algorithm,is proposed.According to cooperative link model,throughput analysis is presented to evaluate performance improvement in the process of exploiting cooperative commu-nication from physical layer to higher layer.Taking the throughput improvement as performance metric,a cooperative relay se-lection scheme is developed.Finally,based on the route constructed by adaptive forwarding cluster routing(AFCR) algorithm,each node on the route selects the optimum cooperative node from all the potential cooperative nodes to construct the coopera-tive link with maximum throughput so that cooperative route with maximum network throughput from source to destination can be set up.Simulation results show that compared with the noncooperative routing algorithm and minimum power selection de-code-and-forward(MPSDF) routing algorithm,the proposed algorithm can obviously improve network throughput in the pres-ence of low transmission power,large number of nodes and high spectral efficiency.
