{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:03Z","timestamp":1750220643237,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T00:00:00Z","timestamp":1603152000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,20]]},"DOI":"10.1145\/3424978.3425037","type":"proceedings-article","created":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T19:09:24Z","timestamp":1602788964000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Iterative Recovery for Interfered Scrambling Code Sequence on Factor Graph"],"prefix":"10.1145","author":[{"given":"Hongbo","family":"Hu","sequence":"first","affiliation":[{"name":"Information Engineering University, Science and Technology on Blind Signal Processing Laboratory, Zhengzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengbo","family":"Sun","sequence":"additional","affiliation":[{"name":"Science and Technology on Blind Signal Processing Laboratory Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuxiang","family":"Yang","sequence":"additional","affiliation":[{"name":"Science and Technology on Blind Signal Processing Laboratory Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing","family":"Deng","sequence":"additional","affiliation":[{"name":"Science and Technology on Blind Signal Processing Laboratory Chengdu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,10,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.optlastec.2013.05.023"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.optlastec.2018.08.011"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02252874"},{"issue":"8","key":"e_1_3_2_1_4_1","first-page":"1134","article-title":"Fast Recovery of Interfered Scrambling Code Sequence","volume":"30","author":"Wenjun W","year":"2009","unstructured":"Wenjun W , Zhiping H and Guilin T ( 2009 ). Fast Recovery of Interfered Scrambling Code Sequence . Acta Armamentarii , 30 ( 8 ), 1134 -- 1138 . Wenjun W, Zhiping H and Guilin T (2009). Fast Recovery of Interfered Scrambling Code Sequence. Acta Armamentarii, 30(8), 1134--1138.","journal-title":"Acta Armamentarii"},{"key":"e_1_3_2_1_5_1","series-title":"Lecture Notes in Computer Science.","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/3-540-48910-X_24","volume-title":"Improved fast correlation attacks on stream ciphers via convolutional codes. Advances in Cryptology EUROCRYPT'99","author":"Johansson T","year":"1999","unstructured":"Johansson T and Jonsson F ( 1999 ). Improved fast correlation attacks on stream ciphers via convolutional codes. Advances in Cryptology EUROCRYPT'99 , Lecture Notes in Computer Science. Berlin, Germany , pp. 347 -- 362 . Johansson T and Jonsson F (1999). Improved fast correlation attacks on stream ciphers via convolutional codes. Advances in Cryptology EUROCRYPT'99, Lecture Notes in Computer Science. Berlin, Germany, pp. 347--362."},{"issue":"9","key":"e_1_3_2_1_6_1","first-page":"552","article-title":"Fast Blind Restore of LFSR Sequences with High Error Tolerance","volume":"32","author":"Xiangyang L","year":"2004","unstructured":"Xiangyang L , Li S and Peizhong L ( 2004 ). Fast Blind Restore of LFSR Sequences with High Error Tolerance . Signal Processing , 32 ( 9 ), 552 -- 558 . Xiangyang L, Li S and Peizhong L (2004). Fast Blind Restore of LFSR Sequences with High Error Tolerance. Signal Processing, 32(9), 552--558.","journal-title":"Signal Processing"},{"issue":"9","key":"e_1_3_2_1_7_1","first-page":"1025","article-title":"Blind Recovery of Initial Parameters of Scrambler","volume":"32","author":"Yu M","year":"2016","unstructured":"Yu M , Limin Z and Haotong Z ( 2016 ). Blind Recovery of Initial Parameters of Scrambler . Journal of Signal Processing , 32 ( 9 ), 1025 -- 1031 . Yu M, Limin Z and Haotong Z (2016). Blind Recovery of Initial Parameters of Scrambler. Journal of Signal Processing, 32(9), 1025--1031.","journal-title":"Journal of Signal Processing"},{"issue":"17","key":"e_1_3_2_1_8_1","first-page":"129","article-title":"Fast Correlation Attack Algorithm","volume":"35","author":"Wenjun W","year":"2009","unstructured":"Wenjun W , Guilin T and Zhiping H ( 2009 ). Fast Correlation Attack Algorithm , Computer Engineering , 35 ( 17 ), 129 -- 134 . Wenjun W, Guilin T and Zhiping H (2009). Fast Correlation Attack Algorithm, Computer Engineering, 35(17), 129--134.","journal-title":"Computer Engineering"},{"key":"e_1_3_2_1_9_1","volume-title":"Detailed Explanation of WCDMA Key Technologies","author":"Bo J","year":"2012","unstructured":"Bo J ( 2012 ). Detailed Explanation of WCDMA Key Technologies . Beijing : People's Posts and Telecommunications Press , 117--122. Bo J (2012). Detailed Explanation of WCDMA Key Technologies. Beijing: People's Posts and Telecommunications Press, 117--122."},{"key":"e_1_3_2_1_10_1","first-page":"93","volume-title":"International Journal of Satallite Communications and Networking","author":"Da Silva M M","year":"2003","unstructured":"Da Silva M M and Correia A ( 2003 ). Joint multiuser detection and intersymbol interference cancellation for WCDMA satellite UMTS . International Journal of Satallite Communications and Networking , pp. 93 -- 117 . Da Silva M M and Correia A (2003). Joint multiuser detection and intersymbol interference cancellation for WCDMA satellite UMTS. International Journal of Satallite Communications and Networking, pp. 93--117."},{"key":"e_1_3_2_1_11_1","first-page":"434","volume-title":"Proc. IEEE Military Commun","author":"Zhu M","year":"2003","unstructured":"Zhu M and Chugg K M ( 2003 ). Iterative message passing techniques for rapid code acquisition . In Proc. IEEE Military Commun , Conf , pp. 434 -- 439 . Zhu M and Chugg K M (2003). Iterative message passing techniques for rapid code acquisition. In Proc. IEEE Military Commun, Conf, pp. 434--439."},{"key":"e_1_3_2_1_12_1","volume-title":"Theoretical study on Turbo code iterative decoding process","author":"Jianhua Y","year":"2005","unstructured":"Jianhua Y ( 2005 ). Theoretical study on Turbo code iterative decoding process . Harbin : Harbin Engineering University . Jianhua Y (2005). Theoretical study on Turbo code iterative decoding process. Harbin: Harbin Engineering University."},{"issue":"1","key":"e_1_3_2_1_13_1","first-page":"92","article-title":"Design of FPGA structure for iterative message passing algorithm based on PN code acquisition","volume":"37","author":"Yanling H","year":"2009","unstructured":"Yanling H , Zhixin D and Peijie Z ( 2009 ). Design of FPGA structure for iterative message passing algorithm based on PN code acquisition . J. Huazhong Univ. of Sci. & Tech. (Natural Science Edition) , 37 ( 1 ), 92 -- 95 . Yanling H, Zhixin D and Peijie Z (2009). Design of FPGA structure for iterative message passing algorithm based on PN code acquisition. J. Huazhong Univ. of Sci. & Tech. (Natural Science Edition), 37(1), 92--95.","journal-title":"J. Huazhong Univ. of Sci. & Tech. (Natural Science Edition)"},{"issue":"2","key":"e_1_3_2_1_14_1","first-page":"489","article-title":"Factor graphs and the sum-product algorithm","volume":"47","author":"Kschischang F R","year":"2001","unstructured":"Kschischang F R and Logilger H A ( 2001 ). Factor graphs and the sum-product algorithm . IEEE Transactions on Infor mation Theory , 47 ( 2 ), 489 -- 519 . Kschischang F R and Logilger H A (2001). Factor graphs and the sum-product algorithm. IEEE Transactions on Infor mation Theory, 47(2), 489--519.","journal-title":"IEEE Transactions on Infor mation Theory"},{"key":"e_1_3_2_1_15_1","volume-title":"Research and Application of PN Code Rapid Acquisition based on Iterative Detection Algorithm on Factor Graph","author":"Guoqing Z","year":"2010","unstructured":"Guoqing Z ( 2010 ). Research and Application of PN Code Rapid Acquisition based on Iterative Detection Algorithm on Factor Graph . Harbin : Harbin Engineering University . Guoqing Z (2010). Research and Application of PN Code Rapid Acquisition based on Iterative Detection Algorithm on Factor Graph. Harbin: Harbin Engineering University."},{"issue":"1","key":"e_1_3_2_1_16_1","first-page":"38","article-title":"A Gold Code Factor Graph Iterative Acquisition Method","volume":"33","author":"Yanling H","year":"2010","unstructured":"Yanling H and Zhixin D ( 2010 ). A Gold Code Factor Graph Iterative Acquisition Method . Journal of Beijing University of Posts and Telecommunications , 33 ( 1 ), 38 -- 42 . Yanling H and Zhixin D (2010). A Gold Code Factor Graph Iterative Acquisition Method. Journal of Beijing University of Posts and Telecommunications, 33(1), 38--42.","journal-title":"Journal of Beijing University of Posts and Telecommunications"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1049\/el:19961338"},{"key":"e_1_3_2_1_18_1","volume-title":"Iterative Detection Pseudo-code Acquisition Technology","author":"Wei W","year":"2014","unstructured":"Wei W and Xin L ( 2014 ). Iterative Detection Pseudo-code Acquisition Technology . National Defence Industry Press , 140--148. Wei W and Xin L (2014). Iterative Detection Pseudo-code Acquisition Technology. National Defence Industry Press, 140--148."}],"event":{"name":"CSAE 2020: The 4th International Conference on Computer Science and Application Engineering","acronym":"CSAE 2020","location":"Sanya China"},"container-title":["Proceedings of the 4th International Conference on Computer Science and Application Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3424978.3425037","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3424978.3425037","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:10Z","timestamp":1750197730000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3424978.3425037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,20]]},"references-count":18,"alternative-id":["10.1145\/3424978.3425037","10.1145\/3424978"],"URL":"https:\/\/doi.org\/10.1145\/3424978.3425037","relation":{},"subject":[],"published":{"date-parts":[[2020,10,20]]},"assertion":[{"value":"2020-10-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}