Abstract
A simplified scheme for the blind phase search (BPS) algorithm is proposed. By comparing the loss function with a threshold value, the number of test phases is reduced. Simulation and experimental results show that compared with the traditional BPS algorithm, this algorithm only needs half of the test phases under the same performance.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
