发布求助
文献互助 智能选刊 最新文献

2006 IEEE Information Theory Workshop - ITW '06 Chengdu最新文献

筛选
英文 中文
Exceptionality of the Variational Distance 变分距离的异常性
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323802
M. Khosravifard, D. Fooladivanda, T. Gulliver
{"title":"Exceptionality of the Variational Distance","authors":"M. Khosravifard, D. Fooladivanda, T. Gulliver","doi":"10.1109/ITW2.2006.323802","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323802","url":null,"abstract":"Csiszar f-divergences are an important class of distances for probability distributions. In particular, a well-known Csiszar f-divergence is the variational distance which is also a metric. Here, we prove that the variational distance is actually the unique Csiszar f-divergence which satisfies all metric conditions","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130882523","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}
引用次数: 2
Bidirectional Viterbi Decoding using the Levenshtein Distance Metric for Deletion Channels 使用Levenshtein距离度量的删除信道双向Viterbi解码
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323798
Ling Cheng, H. C. Ferreira, T. Swart
{"title":"Bidirectional Viterbi Decoding using the Levenshtein Distance Metric for Deletion Channels","authors":"Ling Cheng, H. C. Ferreira, T. Swart","doi":"10.1109/ITW2.2006.323798","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323798","url":null,"abstract":"In this paper, we present a bidirectional Viterbi decoding algorithm using the Levenshtein distance metric for a regular convolutional encoding system. For a deletion channel, this decoding algorithm can correct an average of 30 deletion errors within a 6000 bit frame, when using an r = 0.67 regular convolutional code; and it can correct an average of 80 deletion errors within a 4000 bit frame, when using an r = 0.25 regular convolutional code","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131146765","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}
引用次数: 7
A New Detection Scheme for Differential Unitary Space-Time Modulation 差分酉空时调制的一种新的检测方案
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323727
Z. Du, Xiqi Gao
{"title":"A New Detection Scheme for Differential Unitary Space-Time Modulation","authors":"Z. Du, Xiqi Gao","doi":"10.1109/ITW2.2006.323727","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323727","url":null,"abstract":"The performance loss of approximately 3 dB signal to noise ratio is always paid with conventional differential unitary space-time demodulation (DUSTD) compared to the related coherent detection. In this paper, a new detection scheme consisting of two steps is proposed for differential unitary space-time modulation (DUSTM) system. In the first step, the data sequence is estimated by conventional DUSTD and receded to produce an initial estimate of the transmitted symbol stream. In the second step, the initial estimate of the symbol stream is utilized to estimate the channel, which is then used to implement coherent sequence detection. Simulation results show that the proposed detection scheme performs much better than conventional DUSTD","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126701126","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
Joint Error Correction and PAPR Reduction of OFDM Signals OFDM信号的联合纠错与PAPR降低
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323707
I. Shakeel, A. Grant
{"title":"Joint Error Correction and PAPR Reduction of OFDM Signals","authors":"I. Shakeel, A. Grant","doi":"10.1109/ITW2.2006.323707","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323707","url":null,"abstract":"In this paper, we describe a coding technique for joint error correction and peak-to-average power ratio (PAPR) reduction of orthogonal frequency division multiplexing (OFDM) signals. This technique uses a standard block code for error correction and achieves PAPR reduction at the expense of lower error correcting capability. The technique is first expressed as an optimisation problem and an efficient suboptimal algorithm for solving this problem is then proposed. The PAPR reduction and bit error rate (BER) performance of the proposed algorithm are investigated. The results show that the proposed algorithm significantly improves the system performance and also give PAPR reductions comparable with other PAPR reduction techniques","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114634800","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}
引用次数: 10
Stopping Set Distributions of Some Linear Codes 若干线性码的停止集分布
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323751
Yong Jiang, Shutao Xia, Fang-Wei Fu
{"title":"Stopping Set Distributions of Some Linear Codes","authors":"Yong Jiang, Shutao Xia, Fang-Wei Fu","doi":"10.1109/ITW2.2006.323751","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323751","url":null,"abstract":"In this paper, the stopping set distributions (SSD) of some well-known binary linear codes are determined by using finite geometry theory. Similar to the weight distribution of a binary linear code, the SSD {Ti(H)}n i=0 enumerates the number of stopping sets with size i of a linear code with parity-check matrix H. First, we deal with the simplex codes and Hamming codes. With parity-check matrix formed by all the weight 3 codewords of the Hamming code, the SSD of the simplex code is completely determined with explicit formula. With parity-check matrix formed by all the nonzero codewords of the simplex code, the SSD of the Hamming code is completely determined with two recursive equations. Then, the first order Reed-Muller codes and the extended Hamming codes are discussed. With parity-check matrix formed by all the weight 4 codewords of the extended Hamming code, the SSD of the first order Reed-Muller code is completely determined with explicit formula. With parity-check matrix formed by all the minimum codewords of the first order Reed-Muller code, the SSD of the extended Hamming code is completely determined with two recursive equations","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"284 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116095267","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}
引用次数: 7
On Joint Compression and Information Embedding When Watermarks and Covertexts Are Correlated 水印与文本相关时的联合压缩与信息嵌入
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323808
Wei Sun, E. Yang
{"title":"On Joint Compression and Information Embedding When Watermarks and Covertexts Are Correlated","authors":"Wei Sun, E. Yang","doi":"10.1109/ITW2.2006.323808","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323808","url":null,"abstract":"A joint compression and public digital watermarking system with correlated watermark source and covertext source (M, S) is investigated in this paper. More specifically, for a given distortion level D between S and a watermarked signal X and a given compression rate Rc for X, the watermark source M can be fully recovered with high probability at the end of a public watermark decoder after the watermarked signal is disturbed by a fixed memoryless attack channel p(yx) if and only if H(M) les maxp(x,um,s) min{Rc - I(M, S; U, X) + I(M; U, Y), I(U; Y) - I(U; M, S) + I(M; U, Y)}, where the maximization is taken over all auxiliary random variables U (with finite alphabet U) and X jointly distributed with (M, S, X, Y) according to p(m, s, u, x, y) = p(m, s)p(u, xm, s)p(yx) such that Ed(S, X) les D","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116780742","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
The signal subspace decomposition method for extracting harmonic signal 采用信号子空间分解法提取谐波信号
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323755
Dengwei Wang, Yinghua Lu
{"title":"The signal subspace decomposition method for extracting harmonic signal","authors":"Dengwei Wang, Yinghua Lu","doi":"10.1109/ITW2.2006.323755","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323755","url":null,"abstract":"The subspace decomposition method for extracting harmonic character is discussed. The theory of the cross-correlation matrix based MUSIC method in Gaussian white noise is analysed. A method of subspace decomposition is proposed for the purpose of suppressing noise interference and increasing the ability of recognizing targets and multiple signal classification, an algorithm of harmonic retrieval, was introduced to extract harmonic frequencies. Then the frequency of harmonics is estimated by setting threshold in MUSIC power spectrum curve. The simulation proves the method is correct and feasible","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128311087","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
Improved and Smoothened Upper Bounds on the Redundancy of the Optimal Fix-Free Code 改进并平滑了最优无固定码冗余的上界
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323797
M. Khosravifard, R. Rashtchi
{"title":"Improved and Smoothened Upper Bounds on the Redundancy of the Optimal Fix-Free Code","authors":"M. Khosravifard, R. Rashtchi","doi":"10.1109/ITW2.2006.323797","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323797","url":null,"abstract":"Recently, Yekhanin guaranteed the existence of fix-free codes with codeword lengths (l<sub>1</sub>, l<sub>2</sub>, ..., l<sub>n</sub>) satisfying Sigma<sup>n</sup> <sub>i=1</sub> 2<sup>-li</sup> les 5/8 or Sigma<sup>n</sup> <sub>i=1</sub> 2<sup>-li</sup>) les 3/4 and min <sub>i</sub>l<sub>i</sub> = 1. In this paper, Ye-Yeung approach in deriving upper bound on the redundancy of optimal fix-free code in terms of a known symbol probability q is extended and applied to the new theorems due to Yekhanin. Also, it is shown that for some values of q, assigning a lfloor-log1/2qrfloor bits codeword to the symbol with probability q is preferable to a lceil-log1/2qrceil bits codeword. Noting this point, we remove the discontinuities in the upper bound curves","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128618289","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}
引用次数: 5
Conjugate Codes for Secure and Reliable Information Transmission 安全可靠信息传输的共轭码
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323776
M. Hamada
{"title":"Conjugate Codes for Secure and Reliable Information Transmission","authors":"M. Hamada","doi":"10.1109/ITW2.2006.323776","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323776","url":null,"abstract":"A conjugate code pair is defined as a pair of linear codes either of which contains the dual of the other. A conjugate code pair represents the essential structure of the corresponding Calderbank-Shor-Steane (CSS) quantum code. It is known that conjugate code pairs are applicable to (quantum) cryptography. In this work, polynomially constructible and efficiently decodable conjugate code pairs are presented. The constructed pairs achieve the highest known achievable rate on additive channels.","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126908574","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}
引用次数: 14
A Novel Near Maximum Likelihood Detection Scheme for Wireless MIMO Systems 一种新的无线MIMO系统近最大似然检测方案
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323699
Jiming Chen, W. Mow, Shaoqian Li
{"title":"A Novel Near Maximum Likelihood Detection Scheme for Wireless MIMO Systems","authors":"Jiming Chen, W. Mow, Shaoqian Li","doi":"10.1109/ITW2.2006.323699","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323699","url":null,"abstract":"In this paper, we propose a novel near maximum likelihood detection (MLD) scheme for wireless multiple-input multiple-output (MIMO) systems. The scheme is to reduce the dimension by first using the minimum mean square error (MMSE) detection to fix symbols with high signal to interference plus noise ratio (SINR), and then calculate the bit log-likelihood ratio (LLR) for the initial MMSE estimate, construct a list of reliability-based candidate vectors using the corresponding LLR, and return the most likely bit vector among all visited options. Simulation results show that the proposed method can approach identical performance to that of MLD but with a significant reduction in complexity","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125831289","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学术文献互助群
群 号：604180095
Book学术官方微信