首页 | 本学科首页   官方微博 | 高级检索  
     

(n,n-1,m)卷积码的盲识别
引用本文:周亚建,刘健.(n,n-1,m)卷积码的盲识别[J].北京邮电大学学报,2010,33(3):135-138.
作者姓名:周亚建  刘健
作者单位:北京邮电大学,网络与交换技术国家重点实验室,北京,100876;西安电子科技大学,综合业务网理论及关键技术国家重点实验室,西安,710071
基金项目:国家高技术研究发展计划项目(2009AA01Z430); 北京市自然科学基金项目(9092009); 国家重大科技专项项目(2009ZX03004-003-03)
摘    要:针对信道编码的盲识别问题,提出了码率为(n-1)/n卷积码的盲识别算法. 首先建立了盲识别的数 学模型,然后对截获码序列所构造的矩阵进行分解求解校验矩阵,通过对校验矩阵进行初等变换,最 终辨识编码参数. 仿真实验表明,该算法可对卷积码进行有效识别. 

关 键 词:盲识别  信道编码  卷积码  误码率  矩阵分解
收稿时间:2009-11-27
修稿时间:2009-12-23

A Blind Recognition of the(n,n-1,m)Convolution Code
ZHOU Ya-jian,LIU Jian.A Blind Recognition of the(n,n-1,m)Convolution Code[J].Journal of Beijing University of Posts and Telecommunications,2010,33(3):135-138.
Authors:ZHOU Ya-jian  LIU Jian
Affiliation:ZHOU Ya-jian1,LIU Jian2(1.State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications,Beijing 100876,China,2.State Key Laboratory of Integrated Service Networks,Xidian University,Xi'an 710071,China)
Abstract:The security and query effectiveness must be considered in the extensible markup language (XML) encryption. To address these problems, an approach based on curve interpolation is presented. Firstly, more flexible encryption granularity can be obtained through a XML node-hide mechanism; secondly, more efficiency to resist various kinds of database attack due to the changing of ciphertext distribution and data size. A XMLQuery (XQuery) is established. The proposed model offers greater security, and the ciphertext query performance can amount to 65% of the plaintext query based on the result of experimental simulation.
Keywords:curve interpolation  extensible markup language database  ciphertext query  encryption granularity
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《北京邮电大学学报》浏览原始摘要信息
点击此处可从《北京邮电大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号