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

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

筛选
英文 中文
Improved Length Term Calculation and MMSE Extension for LISS MIMO Detection LISS MIMO检测的改进长度项计算和MMSE扩展
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323728
E. Zimmermann, G. Fettweis
{"title":"Improved Length Term Calculation and MMSE Extension for LISS MIMO Detection","authors":"E. Zimmermann, G. Fettweis","doi":"10.1109/ITW2.2006.323728","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323728","url":null,"abstract":"List sequential (LISS) detection is an effective means of achieving near-capacity performance in iterative detection-decoding for MIMO systems. Using a length bias term calculated via an auxiliary stack has been shown to substantially narrow the tree search and thus reduce detection complexity. We present a novel approach to determine an approximation of the bias term, based on information available during the tree search in the main stack of the LISS detector. We also extend the LISS MIMO detector from ZF to MMSE based detection and show that by following this approach, a far better performance-complexity trade-off can be achieved","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"27 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":"132893334","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
Large proper codes for error detection 用于错误检测的大适当代码
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323781
Irina Naydenova, T. Kløve
{"title":"Large proper codes for error detection","authors":"Irina Naydenova, T. Kløve","doi":"10.1109/ITW2.2006.323781","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323781","url":null,"abstract":"Large codes are proper for error detection. In this paper we discuss how large is large. Using some known lemmas and theorems for proper codes we give a lower bound for the size of the code to be proper for error detection","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"375 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":"133131033","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
Combined Source Coding and Watermarking 组合源编码和水印
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323813
E. Yang, Wei Sun
{"title":"Combined Source Coding and Watermarking","authors":"E. Yang, Wei Sun","doi":"10.1109/ITW2.2006.323813","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323813","url":null,"abstract":"A new problem termed as combined source coding and watermarking is investigated, where an independently and identically distributed (iid) source M correlated with an iid host signal S is to be transmitted by embedding M into S. A necessary and sufficient condition is derived under which the source M can be recovered with high probability from a watermarked signal disturbed by a fixed memoryless attack channel p(y|x). Specifically, it is shown that M can be recovered with high probability if and only if H(M) is less than or equal to max{I(U;Y) - I(U;M,S) + I(M;U,Y) : U,X}, where the maximization is taken over all auxiliary random variables U and X such that the distortion between S and X is less than or equal to a prescribed distortion level D. In particular, the result implies that the Shannon separation theorem can not be extended to this case, that is, it is still possible to transmit M reliably even when H(M) is strictly greater than the watermarking capacity. A similar result is also established in the case of combined source coding and Gelfand-Pinsker channel coding","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":"133257190","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}
引用次数: 1
Dissections and Constant Weight Codes 解剖和定重规范
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323743
V. Vaishampayan, N. Sloane
{"title":"Dissections and Constant Weight Codes","authors":"V. Vaishampayan, N. Sloane","doi":"10.1109/ITW2.2006.323743","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323743","url":null,"abstract":"The problem of encoding and decoding binary block codes of length n and constant Hamming weight w is formulated as a polytope dissection problem. This is done by working with a w-dimensional Euclidean space representation for the information and code vectors. Novel algorithms based on two new dissections are presented. The first is a dissection of a subset of the codebook, and has time-complexity o(w). The second is a dissection of the entire codebook, and has time-complexity o(w log w). Implementation issues associated with the second algorithm are discussed in detail","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"9 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":"132079337","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
Type II code over F2 + uF2 + u2F2 II型代码通过F2 + uF2 + u2F2
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323744
Jia Qian, Lina Zhang, Zhixiang Yin
{"title":"Type II code over F2 + uF2 + u2F2","authors":"Jia Qian, Lina Zhang, Zhixiang Yin","doi":"10.1109/ITW2.2006.323744","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323744","url":null,"abstract":"Motivated by the work of Dougherty, Ling and Betsumiya, we define type II codes over R = F<sub>2</sub> + uF<sub>2</sub> + u<sup>2</sup>F <sub>2</sub> as self-dual codes with Lee weights a multiple of 4. A new Gray map between codes over R and codes over F<sub>2</sub> is defined. The existence of self-dual code over R is examined. Properties of the Gray map which take self-dual codes over R to self-dual codes over F<sub>2</sub> are studied","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"6 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113932817","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}
引用次数: 9
An Efficient Signal Reception Algorithm for Multicarrier DS CDMA 一种有效的多载波DS CDMA信号接收算法
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323737
Feng Yang, Jian Yang, H. Xi
{"title":"An Efficient Signal Reception Algorithm for Multicarrier DS CDMA","authors":"Feng Yang, Jian Yang, H. Xi","doi":"10.1109/ITW2.2006.323737","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323737","url":null,"abstract":"This paper shows that blind the maximum signal-to-interference-plus-noise ratio (MSINR) signal reception is possible by constructing a modified MSINR performance criterion which directly utilizes input and output signals of correlators of the MC-DS-CDMA systems. Constructing a novel cost function and making use of an approximation of Hessian matrix, we derive a robust quasi-Newton algorithm to estimate the optimum combining weight vector. The simulation results show that the proposed algorithm has fast convergence and excellent tracking capability which are important for practical time-varying communication environment.","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"27 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":"127711525","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
Iterative Differential Unitary Space-Frequency Decoding for Multiband-OFDM UWB Communication Systems 多频带ofdm超宽带通信系统的迭代差分酉空频译码
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323686
Xiufeng Jin, G. Bi, Haiyong Xiao
{"title":"Iterative Differential Unitary Space-Frequency Decoding for Multiband-OFDM UWB Communication Systems","authors":"Xiufeng Jin, G. Bi, Haiyong Xiao","doi":"10.1109/ITW2.2006.323686","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323686","url":null,"abstract":"Recently, noncoherent UWB radios have generated increasing interest among researchers due to the advantage of not requiring channel state information (CSI) at both transmitter and receiver. However, the trade-off is a penalty of approximately 3 dB in the required SNR compare to the coherent case. In order to overcome the gap, in this paper, we propose a differential encoding and decoding scheme for multiband UWB systems. The proposed scheme employs the parallel concatenation of two differential unitary space-frequency encoders at the transmitter and performs a simple soft decision iterative decoding at the receiver. Simulation results show that the proposed scheme can outperform the conventional differential and coherent detection at high SNR with few number of iterations","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"28 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":"121443682","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
Performance of Very Efficient Wireless Frequency Usage System Using Kronecker Product with Rows of DFT Matrix 基于行DFT矩阵的Kronecker积的高效无线频率利用系统性能研究
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323688
N. Suehiro, Rongzhen Jin, Chenggao Han, T. Hashimoto
{"title":"Performance of Very Efficient Wireless Frequency Usage System Using Kronecker Product with Rows of DFT Matrix","authors":"N. Suehiro, Rongzhen Jin, Chenggao Han, T. Hashimoto","doi":"10.1109/ITW2.2006.323688","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323688","url":null,"abstract":"Suehiro, et al. have proposed a new information transmission method (Suehiro's DFT method, or SD-method) using the Kronecker product between the rows of DFT matrix and the data sequences. In this paper, the authors shows the SD-method has far better error probability property than OFDM method under the heavy multipath environment by a simulation under the stable multi-path environment.","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"65 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":"129198612","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}
引用次数: 19
A Low-Complexity Symbol Timing Recovery Algorithm for Burst Modem Applications 一种用于突发调制解调器的低复杂度符号时序恢复算法
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323729
Luo Wu, B. Liu
{"title":"A Low-Complexity Symbol Timing Recovery Algorithm for Burst Modem Applications","authors":"Luo Wu, B. Liu","doi":"10.1109/ITW2.2006.323729","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323729","url":null,"abstract":"In this paper, we describe and analyze an efficient non-date-aided (NDA) symbol timing recovery algorithm named the quadratic approximation (QA) algorithm. Compared with the tone filtering (TF) algorithm, the algorithm presented here is low-complexity. It requires only one multiplication per burst. Its performance is better than that of the TF algorithm in terms of the estimated standard deviation and sensitivity to frequency offsets","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"15 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":"116712422","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}
引用次数: 1
CAZAC sequence and its application in LTE random access CAZAC序列及其在LTE随机接入中的应用
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323692
Yang Wen, Wei Huang, Zhong-pei Zhang
{"title":"CAZAC sequence and its application in LTE random access","authors":"Yang Wen, Wei Huang, Zhong-pei Zhang","doi":"10.1109/ITW2.2006.323692","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323692","url":null,"abstract":"Constant amplitude zero autocorrelation (CAZAC) sequence, which is one type of polyphase codes, has many applications in channel estimation and time synchronization, since it has good periodic correlation properties. Now it is also introduced to long-term evolution (LTE) of 3rd Generation Partnership Project (3GPP) random access procedure as preamble signature. Based on the introduction of CAZAC sequences good periodic correlation, this paper gives a simple detection structure of random access preambles. Simulation results indicate that the proposed detector performs as well as detectors that other companies provided, but has simpler structure","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"71 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":"116237857","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}
引用次数: 73
首页 上一页 下一页 尾页
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学术官方微信