International Telemetering Conference Proceedings / October 29-November 02, 1990 / Riviera Hotel and Convention Center, Las Vegas, Nevada / As the code length is increasing, the search of optimum group sync codes will be more and more difficult, even impossible. This paper gives the searching method of quasi-optimum group sync codes on the small subset of PN sequences -- CVT-TAIL SEARCHING METHOD and PREFIX-SUFFIX SEARCHING METHOD. We have searched out quasi-optimum group sync codes for their lengths N=32-63 by this method and compared them with corresponding optimum group sync codes for their lengths N=32-54. They are very approximative. The total searching time is only several seconds. This method may solves the problems among error sync probability, code length and searching time. So, it is a good and practicable searching method for long code.
| Identifer | oai:union.ndltd.org:arizona.edu/oai:arizona.openrepository.com:10150/613438 |
| Date | 11 1900 |
| Creators | Jie, Cao, Qiu-cheng, Xie |
| Contributors | Nanjing Aeronautical Institute, China |
| Publisher | International Foundation for Telemetering |
| Source Sets | University of Arizona |
| Language | en_US |
| Detected Language | English |
| Type | text, Proceedings |
| Rights | Copyright © International Foundation for Telemetering |
| Relation | http://www.telemetry.org/ |
Page generated in 0.0025 seconds