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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
