Abstract
After the first switched on or after a prolonged signal-fade, the receiver of Radio Data System (RDS) must achieve synchronization quickly. The standard algorithm, which calculates the product (modulo-two) of the received binary sequence multiplied by the parity-check matrix to check whether the receiver has achieved synchronization, is very slow. A data frame synchronous fast algorithm based on look-up table was proposed in this paper. The standard algorithm was simplified into the problem of solving three bytes remainder for the received binary sequence. Whether the receiver is synchronized can be determined by checking the remainder table. The fast algorithm improved the operating speed and reduced the demanding memory space. Simulation result indicated the validity and efficiency of the proposed algorithm.
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.
