Synchronization technology is crucial in wireless communication. The Communication proceeds effectively depending on the availability of good synchronization system. The probability of missing synchronization and false synchron1zation, and frame synchronization time are the main factors to influence the performance of synchronization. In the paper, the properties and combinatorial admissibility conditions about the almost perfect punctured binary sequence pairs are studied. In order to compare with the length of Barker code in synchronization performance, the application model is established. The simulation results show that the perfect punctured binary sequence pairs' performance of synchronization is better than Barker codes. |
full paper (pdf, 272 Kb)