基于公约式权重的截短线性分组码盲识别方法

针对通信信号侦察处理中的截短线性分组码的盲识别问题,提出了一种基于公约式权重最大化的识别方法。算法对侦收的码字序列进行不同长度的分段,计算分段码字与x~n+1的最大公约式并按公约式阶数进行滤除,通过高阶公约式的个数估计码字长度。同时根据公约式的出现概率定义公约式的权重,利用权重最大的公约式实现码字生成多项式的估计。仿真实验表明算法有效可行,并理论分析了算法的容错性和计算复杂度。和已有算法相比较,本文算法在相同的误码率条件下,具有更高的检测识别概率,且同时具备截短码字和非截短码字的识别能力。...

Full description

Saved in:
Bibliographic Details
Published in电信科学 Vol. 33; no. 6; pp. 114 - 120
Main Author 沈利华 章剑林
Format Journal Article
LanguageChinese
Published 中国通信学会 01.06.2017
人民邮电出版社有限公司
浙江工业大学之江学院,浙江绍兴,312030%杭州师范大学阿里巴巴商学院,浙江杭州,311121
Subjects
Online AccessGet full text
ISSN1000-0801
DOI10.11959/j.issn.1000-0801.2017194

Cover

Abstract 针对通信信号侦察处理中的截短线性分组码的盲识别问题,提出了一种基于公约式权重最大化的识别方法。算法对侦收的码字序列进行不同长度的分段,计算分段码字与x~n+1的最大公约式并按公约式阶数进行滤除,通过高阶公约式的个数估计码字长度。同时根据公约式的出现概率定义公约式的权重,利用权重最大的公约式实现码字生成多项式的估计。仿真实验表明算法有效可行,并理论分析了算法的容错性和计算复杂度。和已有算法相比较,本文算法在相同的误码率条件下,具有更高的检测识别概率,且同时具备截短码字和非截短码字的识别能力。
AbstractList 针对通信信号侦察处理中的截短线性分组码的盲识别问题,提出了一种基于公约式权重最大化的识别方法。算法对侦收的码字序列进行不同长度的分段,计算分段码字与x~n+1的最大公约式并按公约式阶数进行滤除,通过高阶公约式的个数估计码字长度。同时根据公约式的出现概率定义公约式的权重,利用权重最大的公约式实现码字生成多项式的估计。仿真实验表明算法有效可行,并理论分析了算法的容错性和计算复杂度。和已有算法相比较,本文算法在相同的误码率条件下,具有更高的检测识别概率,且同时具备截短码字和非截短码字的识别能力。
TN911.22; 针对通信信号侦察处理中的截短线性分组码的盲识别问题,提出了一种基于公约式权重最大化的识别方法.算法对侦收的码字序列进行不同长度的分段,计算分段码字与xn+1的最大公约式并按公约式阶数进行滤除,通过高阶公约式的个数估计码字长度.同时根据公约式的出现概率定义公约式的权重,利用权重最大的公约式实现码字生成多项式的估计.仿真实验表明算法有效可行,并理论分析了算法的容错性和计算复杂度.和已有算法相比较,本文算法在相同的误码率条件下,具有更高的检测识别概率,且同时具备截短码字和非截短码字的识别能力.
Abstract_FL According to the problem of a short linear block code in communication signal processing,an algorithm based on the maximal weight of common polynomial was proposed.Firstly,the received code sequence was divided with different lengths.Then the common polynomial of code words and x" + 1 was obtained and filtered.The code length was estimated by the number of common polynomials.The weight was defined according to the probability of polynomial,and the generator polynomial was recovered according to the maximal weight.The validity and the performances of the blind recognition method were illustrated by the computer simulation results.The correct recognition rate of the algorithm is higher than that of the existing algorithms under the same bit error rate,and the method is applicable for both short codes and normal codes.
Author 沈利华 章剑林
AuthorAffiliation 浙江工业大学之江学院,浙江绍兴312030 杭州师范大学阿里巴巴商学院,浙江杭州311121
AuthorAffiliation_xml – name: 浙江工业大学之江学院,浙江绍兴,312030%杭州师范大学阿里巴巴商学院,浙江杭州,311121
Author_FL SHEN Lihua
ZHANG Jianlin
Author_FL_xml – sequence: 1
  fullname: SHEN Lihua
– sequence: 2
  fullname: ZHANG Jianlin
Author_xml – sequence: 1
  fullname: 沈利华 章剑林
BookMark eNpNj81Kw0AcxPdQwVr7At4UPCbuf7O7ScCLFL-g4KX3sE22NVW32kWsN8Vae1FPelCknhT8QNCTUfBlTKJvYaRFPA3M_JhhxlBONZVEaBKwCeAyd6ZhhlorEzDGBnYwmASDDS7NofyfN4qKWodVTCxOOXYhj2bjfvQZncSHD2l0E7-fJlcH30fH6UUn6d2l_cc0-kj2buNeN33rpNf76eXz11M37t0n56_Jy9k4GqmJdS2LQy2gysJ8pbRklFcWl0tzZcO3OTHAJsyxJOUM_Crh0qIupySQVQiYsKkIfOYQx7L9zPO55FIQZjPAlBAHAupYBTQ9qN0RqiZU3Ws0t1sqG_SC9lr79ybmGEjGTQw4X2jtKa0Dj2fbYGHuZuHUMFxtqvpWmNVstsIN0dr9B_0ABbBz9A
ClassificationCodes TN911.22
ContentType Journal Article
Copyright Copyright © Wanfang Data Co. Ltd. All Rights Reserved.
Copyright_xml – notice: Copyright © Wanfang Data Co. Ltd. All Rights Reserved.
DBID 2RA
92L
CQIGP
W92
~WA
NSCOK
2B.
4A8
92I
93N
PSX
TCJ
DOI 10.11959/j.issn.1000-0801.2017194
DatabaseName 维普期刊资源整合服务平台
中文科技期刊数据库-CALIS站点
维普中文期刊数据库
中文科技期刊数据库-工程技术
中文科技期刊数据库- 镜像站点
国家哲学社会科学文献中心 (National Center for Philosophy and Social Sciences Documentation)
Wanfang Data Journals - Hong Kong
WANFANG Data Centre
Wanfang Data Journals
万方数据期刊 - 香港版
China Online Journals (COJ)
China Online Journals (COJ)
DatabaseTitleList


DeliveryMethod fulltext_linktorsrc
DocumentTitleAlternate Blind recognition of short linear block code based on the weight of common polynomial
DocumentTitle_FL Blind recognition of short linear block code based on the weight of common polynomial
EndPage 120
ExternalDocumentID dxkx201706012
672513069
GroupedDBID -0Y
2RA
5XA
5XJ
92L
ALMA_UNASSIGNED_HOLDINGS
CCEZO
CQIGP
CUBFJ
GROUPED_DOAJ
U1G
U5S
W92
~WA
NSCOK
2B.
4A8
92I
93N
PSX
TCJ
ID FETCH-LOGICAL-c762-172583e4651cb26e349642deb1d5a74adc582837c2dec6e6ea25751042281d483
ISSN 1000-0801
IngestDate Thu May 29 04:00:33 EDT 2025
Tue Jan 21 20:52:42 EST 2025
Wed Feb 14 10:00:38 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Issue 6
Keywords 盲识别
欧几里得算法
公约式
线性分组码
权重
common polynomial
blind recognition
Euclidean algorithm
linear block code
weight
Language Chinese
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c762-172583e4651cb26e349642deb1d5a74adc582837c2dec6e6ea25751042281d483
Notes SHEN Lihua1, ZHANG Jianlin2 ( 1. Zhijiang College of Zhejiang University of Technology, Shaoxing 312030, China; 2. Alibaba Business School of Hangzhou Normal University, Hangzhou 311121, China)
blind recognition, linear block code, Euclidean algorithm, common polynomial, weight
According to the problem of a short linear block code in communication signal processing, an algorithm based on the maximal weight of common polynomial was proposed. Firstly, the received code sequence was divided with different lengths. Then the common polynomial of code words and x^n+ 1 was obtained and filtered. The code length was estimated by the number of common polynomials. The weight was defined according to the probability of polynomial, and the generator polynomial was recovered according to the maximal weight. The validity and the per- formances of the blind recognition method were illustrated by the computer simulation results. The correct recogni- tion rate of the algorithm is higher than that of the existing algorithms unde
OpenAccessLink http://dx.doi.org/10.11959/j.issn.1000-0801.2017194
PageCount 7
ParticipantIDs wanfang_journals_dxkx201706012
cass_nssd_672513069
chongqing_primary_672513069
PublicationCentury 2000
PublicationDate 2017-06-01
PublicationDateYYYYMMDD 2017-06-01
PublicationDate_xml – month: 06
  year: 2017
  text: 2017-06-01
  day: 01
PublicationDecade 2010
PublicationTitle 电信科学
PublicationTitleAlternate Telecommunications Science
PublicationTitle_FL Telecommunications Science
PublicationYear 2017
Publisher 中国通信学会
人民邮电出版社有限公司
浙江工业大学之江学院,浙江绍兴,312030%杭州师范大学阿里巴巴商学院,浙江杭州,311121
Publisher_xml – name: 人民邮电出版社有限公司
– name: 中国通信学会
– name: 浙江工业大学之江学院,浙江绍兴,312030%杭州师范大学阿里巴巴商学院,浙江杭州,311121
SSID ssib023646091
ssj0002912124
ssib001102832
ssib000459930
ssib051374496
ssib036437025
ssib017479463
ssib058759007
Score 1.6963862
Snippet ...
TN911.22;...
SourceID wanfang
cass
chongqing
SourceType Aggregation Database
Publisher
StartPage 114
SubjectTerms 公约式
权重
欧几里得算法
盲识别
线性分组码
Title 基于公约式权重的截短线性分组码盲识别方法
URI http://lib.cqvip.com/qk/90580X/201706/672513069.html
https://www.ncpssd.cn/Literature/articleinfo?id=672513069&type=journalArticle
https://d.wanfangdata.com.cn/periodical/dxkx201706012
Volume 33
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NaxQxFA-1gngRP7FWSwVznLozk0wS8DKzO0sR6qlCb8vszLQFYau2hdKDKNbai3rSgyL1pOAHgp5cBf8Zd0f_C997k52dQwX1EoaX5L2XvJD8Msl7YeyScN1s2UsSR2kpHJGl0jG5mzpe5pvU97u5TNDBeeFaMH9dXF2SSxMTg9qtpc2N7ly6faBfyf9YFWhgV_SS_QfLVkyBAN9gX0jBwpD-lY15LLlp8yjkscBUx0jRkodNHiukhAFSoibXbR4H3LS49nlsuFZct7CMgVoCs7TmYUiUNg9btnpEtXSDh4o4a64DyoqoluJhA6Ao1Yp45PEYmLSpDBUOIxIa8MjgR-Tz8qnLERqmiqC5JP1BLrECWcZFDqBGWP04JAYecrW8DX1Ag-JxEYUiQSfMMcQFxMe8vJs7-rnhqvElLBqOJF1TqyU1pEVd1MDOGStm9SFKE7Jq0zn5zWvL0c73ZeANO67rk7dburNaHOCSk94BS4yRhtYYlDBXScBbgso1YryuVrcdAwUgErZm5hA77ClV3iawO3-Lqo2pH24S6KtQJ4b4DxrjkEY-nrXWDoeBtxLCRk1EAOIZFwAJ3acYaXeEXRzpfvlPmgMoSWHDhkFGVtd6K7cAOpEnW2856a3UQNficXbM7pZmw3Lon2AT26un2JXBfv9H__Hgwfui_3rw7cnw5f1fDx8Vz3eGe2-L_Q9F__vw7pvB3m7xdad4da948ennx93B3rvhsy_Dz09Ps8V2vNicd-wjIE4K67QD-FpqPxeBdNOuF-T4voHwMkAYmUyUSGBy0RjAKQVaGuRBnnh4kkiR7dxMaP8Mm-yt9fKzbBZfEoDlHQ-qMSRn0pW5uyxUHqQS991iip3E9nd66-tZp7LZFJuuuqNzs4wAU8-dsR3UsfPCeifburHllWGpXO_cgUyn2dHxaD_PJjdub-YXANxudGdoaEC6cCf-DSFjfZM
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=%E5%9F%BA%E4%BA%8E%E5%85%AC%E7%BA%A6%E5%BC%8F%E6%9D%83%E9%87%8D%E7%9A%84%E6%88%AA%E7%9F%AD%E7%BA%BF%E6%80%A7%E5%88%86%E7%BB%84%E7%A0%81%E7%9B%B2%E8%AF%86%E5%88%AB%E6%96%B9%E6%B3%95&rft.jtitle=%E7%94%B5%E4%BF%A1%E7%A7%91%E5%AD%A6&rft.au=%E6%B2%88%E5%88%A9%E5%8D%8E&rft.au=%E7%AB%A0%E5%89%91%E6%9E%97&rft.date=2017-06-01&rft.pub=%E4%B8%AD%E5%9B%BD%E9%80%9A%E4%BF%A1%E5%AD%A6%E4%BC%9A&rft.issn=1000-0801&rft.volume=33&rft.issue=6&rft.spage=114&rft.epage=120&rft_id=info:doi/10.11959%2Fj.issn.1000-0801.2017194&rft.externalDocID=672513069
thumbnail_s http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fimage.cqvip.com%2Fvip1000%2Fqk%2F90580X%2F90580X.jpg
http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=http%3A%2F%2Fwww.wanfangdata.com.cn%2Fimages%2FPeriodicalImages%2Fdxkx%2Fdxkx.jpg