A tracking filter algorithm based on the maneuvering detection delay is presented in order to solve the fuzzy problem of target maneuver decision introduced by the measure？ment errors of active sonar. When the maneuv...A tracking filter algorithm based on the maneuvering detection delay is presented in order to solve the fuzzy problem of target maneuver decision introduced by the measure？ment errors of active sonar. When the maneuvering detection is unclear, two target moving hypotheses, the uniform and the maneuver, derived from the method of multiple hypothesis tracking, are generated to delay the final decision time. Then the hypothesis test statistics is constructed by using the residual sequence. The active sonar？s tracking ability of unknown prior information targets is improved due to the modified sequential probability ratio test and the integration of the advantages of strong tracking filter and the Kalman filter. Simulation results show that the algorithm is able to not only track the uniform targets accurately, but also track the maneuvering targets steadily. The effectiveness of the algorithm for real underwater acoustic targets is further verified by the sea trial data processing results.展开更多
For the unsorted database quantum search with the unknown fraction λ of target items, there are mainly two kinds of methods, i.e., fixed-point and trail-and-error.(i) In terms of the fixed-point method, Yoder et al. ...For the unsorted database quantum search with the unknown fraction λ of target items, there are mainly two kinds of methods, i.e., fixed-point and trail-and-error.(i) In terms of the fixed-point method, Yoder et al. [Phys. Rev. Lett.113 210501(2014)] claimed that the quadratic speedup over classical algorithms has been achieved. However, in this paper, we point out that this is not the case, because the query complexity of Yoder’s algorithm is actually in O(1/λ01/2)rather than O(1/λ1/2), where λ0 is a known lower bound of λ.(ii) In terms of the trail-and-error method, currently the algorithm without randomness has to take more than 1 times queries or iterations than the algorithm with randomly selected parameters. For the above problems, we provide the first hybrid quantum search algorithm based on the fixed-point and trail-and-error methods, where the matched multiphase Grover operations are trialed multiple times and the number of iterations increases exponentially along with the number of trials. The upper bound of expected queries as well as the optimal parameters are derived. Compared with Yoder’s algorithm, the query complexity of our algorithm indeed achieves the optimal scaling in λ for quantum search, which reconfirms the practicality of the fixed-point method. In addition, our algorithm also does not contain randomness, and compared with the existing deterministic algorithm, the query complexity can be reduced by about 1/3. Our work provides a new idea for the research on fixed-point and trial-and-error quantum search.展开更多
文摘A tracking filter algorithm based on the maneuvering detection delay is presented in order to solve the fuzzy problem of target maneuver decision introduced by the measure？ment errors of active sonar. When the maneuvering detection is unclear, two target moving hypotheses, the uniform and the maneuver, derived from the method of multiple hypothesis tracking, are generated to delay the final decision time. Then the hypothesis test statistics is constructed by using the residual sequence. The active sonar？s tracking ability of unknown prior information targets is improved due to the modified sequential probability ratio test and the integration of the advantages of strong tracking filter and the Kalman filter. Simulation results show that the algorithm is able to not only track the uniform targets accurately, but also track the maneuvering targets steadily. The effectiveness of the algorithm for real underwater acoustic targets is further verified by the sea trial data processing results.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.11504430 and 61502526)the National Basic Research Program of China(Grant No.2013CB338002)
文摘For the unsorted database quantum search with the unknown fraction λ of target items, there are mainly two kinds of methods, i.e., fixed-point and trail-and-error.(i) In terms of the fixed-point method, Yoder et al. [Phys. Rev. Lett.113 210501(2014)] claimed that the quadratic speedup over classical algorithms has been achieved. However, in this paper, we point out that this is not the case, because the query complexity of Yoder’s algorithm is actually in O(1/λ01/2)rather than O(1/λ1/2), where λ0 is a known lower bound of λ.(ii) In terms of the trail-and-error method, currently the algorithm without randomness has to take more than 1 times queries or iterations than the algorithm with randomly selected parameters. For the above problems, we provide the first hybrid quantum search algorithm based on the fixed-point and trail-and-error methods, where the matched multiphase Grover operations are trialed multiple times and the number of iterations increases exponentially along with the number of trials. The upper bound of expected queries as well as the optimal parameters are derived. Compared with Yoder’s algorithm, the query complexity of our algorithm indeed achieves the optimal scaling in λ for quantum search, which reconfirms the practicality of the fixed-point method. In addition, our algorithm also does not contain randomness, and compared with the existing deterministic algorithm, the query complexity can be reduced by about 1/3. Our work provides a new idea for the research on fixed-point and trial-and-error quantum search.
