{"title":"采样间隔非2i的高速伪随机码发生器研究","authors":"Zhanfeng Zhao, Wenlian Yu, Zhiquan Zhou, Haiyan Yu","doi":"10.1109/ICDMA.2012.189","DOIUrl":null,"url":null,"abstract":"This paper presents a new method for high-speed generation of pseudo-random code, which is based on sampling and parallel-to-serial conversion. This method can be used in situation that the sampling interval does not equal to , which increases the sampling selectivity and system adaptability. Finally, we verify the algorithm based on FPGA and the result is consistent with our prediction.","PeriodicalId":393655,"journal":{"name":"International Conference on Digital Manufacturing and Automation","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Study of High-Speed Pseudo-random Code Generator Whose Sampling Interval is Not 2i\",\"authors\":\"Zhanfeng Zhao, Wenlian Yu, Zhiquan Zhou, Haiyan Yu\",\"doi\":\"10.1109/ICDMA.2012.189\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new method for high-speed generation of pseudo-random code, which is based on sampling and parallel-to-serial conversion. This method can be used in situation that the sampling interval does not equal to , which increases the sampling selectivity and system adaptability. Finally, we verify the algorithm based on FPGA and the result is consistent with our prediction.\",\"PeriodicalId\":393655,\"journal\":{\"name\":\"International Conference on Digital Manufacturing and Automation\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Digital Manufacturing and Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDMA.2012.189\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Digital Manufacturing and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDMA.2012.189","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Study of High-Speed Pseudo-random Code Generator Whose Sampling Interval is Not 2i
This paper presents a new method for high-speed generation of pseudo-random code, which is based on sampling and parallel-to-serial conversion. This method can be used in situation that the sampling interval does not equal to , which increases the sampling selectivity and system adaptability. Finally, we verify the algorithm based on FPGA and the result is consistent with our prediction.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
