2007 3rd International Workshop on Signal Design and Its Applications in Communications最新文献

筛选
英文 中文
Quotient Subcode Set and Inverse Relative Dimension/Length Profile 商子码集和逆相对尺寸/长度轮廓
Peisheng Wang, Yuan Luo, A. Vinck
{"title":"Quotient Subcode Set and Inverse Relative Dimension/Length Profile","authors":"Peisheng Wang, Yuan Luo, A. Vinck","doi":"10.1109/IWSDA.2007.4408340","DOIUrl":"https://doi.org/10.1109/IWSDA.2007.4408340","url":null,"abstract":"The generalized hamming weight played an important role in coding theory. In the study of the wiretap channel of type II, the generalized hamming weight was extended to a two-code format. Two equivalent concepts of the generalized hamming weight hierarchy and its two-code format, are the inverse dimension/length profile (IDLP) and the inverse relative dimension/length profile (IRDLP), respectively. In this paper, the relations between the IDLP and the IRDLP are investigated. By using a quotient subcode set, the singleton bound on the IRDLP is improved by different methods. The new bounds are useful for the study of a coordinated two-party wiretap channel of type II.","PeriodicalId":303512,"journal":{"name":"2007 3rd International Workshop on Signal Design and Its Applications in Communications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121979980","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Remote Sensing Image Compression Based on the Improvement of SPECK Algorithm
Kan Hong, Y. An, Sheng Hong, Qing Chang, Qian Hong
{"title":"Remote Sensing Image Compression Based on the Improvement of SPECK Algorithm","authors":"Kan Hong, Y. An, Sheng Hong, Qing Chang, Qian Hong","doi":"10.1109/IWSDA.2007.4408360","DOIUrl":"https://doi.org/10.1109/IWSDA.2007.4408360","url":null,"abstract":"We conduct MS-TAWCP algorithm to promote the effectiveness of encoding. Although the SPECK algorithm has introduced an embedded block method, the algorithm itself ignores the relationship between wavelet coefficients in every level of coefficients, such as the characteristics of the coefficient correlation. The MS-TAWCP algorithm makes full use of the characteristics of coefficient correlation and employs double threshold to optimize the distribution of coefficient. Moreover, MS-TAWCP algorithm splits the wavelet coefficients into three frequency space, where employ different threshold for different frequency space, to avoid coefficient double search and duplication of judgment in the same threshold plane caused by double threshold. The experiment shows MS-TAWCP algorithm outperforms the SPECK about 3 db in PSNR, without comprising remote sensing image information and reducing algorithm speed.","PeriodicalId":303512,"journal":{"name":"2007 3rd International Workshop on Signal Design and Its Applications in Communications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129933843","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Optimal Algorithm for "Out-of-Sequence" Estimates with Arbitrary Communication Delays 具有任意通信延迟的“乱序”估计的最优算法
Chenglin Wen, Quanbo Ge
{"title":"Optimal Algorithm for \"Out-of-Sequence\" Estimates with Arbitrary Communication Delays","authors":"Chenglin Wen, Quanbo Ge","doi":"10.1109/IWSDA.2007.4408389","DOIUrl":"https://doi.org/10.1109/IWSDA.2007.4408389","url":null,"abstract":"Sensor data, which are transmitted from local sensors to the central processor, often appear various communication delays because of the uncertain communication channel and various disturbances. Thereby, optimal \"Out-of-sequence\" Measurements (OOSM) fusion has been presented and attracts plenty of attentions. The OOSM scenario can deal with the delayed fusion problem, but it inevitably comes forth many problems which have influenced its application ability, for example, high computational complexity, the complex algorithm structure, low computational efficiency, and bad real-time performance and so forth. In order to overcome above problems, the concept for the \"Out-of-sequence\" Estimates (OOSE) fusion has been also presented and it has shown excellent performance to solve the delayed fusion. In this paper, the optimal fusion for single sensor OOSE is researched and the corresponding algorithm is also proposed including its integrated and recursive forms, which are optimal in minimum mean square error (MMSE). Performance analysis and simulation example show that the proposed OOSE method is valid and has many advantages compared with the current OOSM methods and just the estimate accuracy is reduced after a sort.","PeriodicalId":303512,"journal":{"name":"2007 3rd International Workshop on Signal Design and Its Applications in Communications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114249813","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q) 周期为2pn / GF(q)序列的k误差线性复杂度算法
Jianqin Zhou, Xirong Xu
{"title":"An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)","authors":"Jianqin Zhou, Xirong Xu","doi":"10.1109/IWSDA.2007.4408335","DOIUrl":"https://doi.org/10.1109/IWSDA.2007.4408335","url":null,"abstract":"We first optimize the structure of the Wei-Xiao-Chen algorithm for the linear complexity of sequences over GF(q) with period N = 2pn, where p and q are odd primes, and q is a primitive root ( mod p2). Then the union cost is used, so that an efficient algorithm for computing k-error linear complexity of a sequence with period 2pn over GF(q) is derived, where p and q are odd primes, and q is a primitive root of modulo p2. We also give a validity proof of the proposed algorithm. Finally, a numerical example is presented to illustrate the algorithm.","PeriodicalId":303512,"journal":{"name":"2007 3rd International Workshop on Signal Design and Its Applications in Communications","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114937106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信