THE SEARCHING METHOD OF QUASI-OPTIMUM GROUP SYNC CODES ON THE SUBSET OF PN SEQUENCES
| dc.contributor.author | Jie, Cao | |
| dc.contributor.author | Qiu-cheng, Xie | |
| dc.date.accessioned | 2016-06-16T18:31:46Z | |
| dc.date.available | 2016-06-16T18:31:46Z | |
| dc.date.issued | 1990-11 | |
| dc.identifier.issn | 0884-5123 | |
| dc.identifier.issn | 0074-9079 | |
| dc.identifier.uri | http://hdl.handle.net/10150/613438 | |
| dc.description | International Telemetering Conference Proceedings / October 29-November 02, 1990 / Riviera Hotel and Convention Center, Las Vegas, Nevada | en_US |
| dc.description.abstract | 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. | |
| dc.description.sponsorship | International Foundation for Telemetering | en |
| dc.language.iso | en_US | en |
| dc.publisher | International Foundation for Telemetering | en |
| dc.relation.url | http://www.telemetry.org/ | en |
| dc.rights | Copyright © International Foundation for Telemetering | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
| dc.subject | OPTIMUM GROUP SYNC CODES | en |
| dc.subject | CODE | en |
| dc.subject | SYNCHRONIZATION | en |
| dc.subject | QUASI-OPTIMUM GROUP CODE | en |
| dc.title | THE SEARCHING METHOD OF QUASI-OPTIMUM GROUP SYNC CODES ON THE SUBSET OF PN SEQUENCES | en_US |
| dc.type | text | en |
| dc.type | Proceedings | en |
| dc.contributor.department | Nanjing Aeronautical Institute, China | en |
| dc.identifier.journal | International Telemetering Conference Proceedings | en |
| dc.description.collectioninformation | Proceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection. | en |
| refterms.dateFOA | 2018-06-23T15:35:53Z | |
| html.description.abstract | 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. |
