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

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

筛选
英文 中文
A Reduced-Complexity Decoding Algorithm for Turbo Codes with Odd-Even Interleavers 一种奇偶交织Turbo码的低复杂度译码算法
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323765
Xiao Ma, Xiuni Wang, Lin Zhang
{"title":"A Reduced-Complexity Decoding Algorithm for Turbo Codes with Odd-Even Interleavers","authors":"Xiao Ma, Xiuni Wang, Lin Zhang","doi":"10.1109/ITW2.2006.323765","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323765","url":null,"abstract":"In this paper, we propose a novel decoding schedule for turbo codes with odd-even interleavers. The proposed schedule has lower complexity and the same performance as the standard one","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":"124362358","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
Fixed-Slope Universal Lossy Coding for Individual Sequences 单个序列的固定斜率通用有损编码
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1093/ietfec/e91-a.3.836
S. Kuzuoka, T. Uyematsu
{"title":"Fixed-Slope Universal Lossy Coding for Individual Sequences","authors":"S. Kuzuoka, T. Uyematsu","doi":"10.1093/ietfec/e91-a.3.836","DOIUrl":"https://doi.org/10.1093/ietfec/e91-a.3.836","url":null,"abstract":"In a theory of lossy coding of individual sequences, two kinds of coding schemes, the fixed-rate coding and the fixed-distortion coding, have been studied. This paper investigates another kind of lossy coding scheme of individual sequences, which is called fixed-slope lossy coding. We show that the optimal cost attainable by the blockwise fixed-slope lossy encoder is equal to the optimal average cost with respect to the overlapping empirical distribution of the given sequence. Moreover, we clarify that the fixed-slope universal lossy block encoder based on the complexity function achieves the optimal cost. As an application of the result, we show that for any ergodic source the sample average of the cost achieved by the lossy block encoder based on the complexity function is asymptotically equal to the optimal cost with probability one","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"32 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":"115026898","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
Blind Orthogonal Multiuser Detector 盲正交多用户检测器
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323752
Liang Han, Xiao-yu Chen
{"title":"Blind Orthogonal Multiuser Detector","authors":"Liang Han, Xiao-yu Chen","doi":"10.1109/ITW2.2006.323752","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323752","url":null,"abstract":"Multiuser detectors for the detection of CDMA signals try to mitigate the effect of multiple access interference (MAI) and background noise, the linear decorrelating multiuser detector is one of them. However, it can reject the MAI optimally but enhances the noise level. There is the same problem in blind linear decorrelating (BLD) detector. We in this paper propose a new blind orthogonal multiuser (BOMU) detector, which try to mitigate both the effect of the MAI and the noise component. We also provide simulation results suggesting that in many cases the BOMU detector outperforms the BLD detector","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"83 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":"128423455","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
Comparison of Concatenated Reed-Solomon Coding with Hard-decision to Soft-decision LDPC Coding for the Rayleigh Fading Channel 瑞利衰落信道硬判决级联Reed-Solomon编码与软判决LDPC编码的比较
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323773
J. Cai, M. Tomlinson, C. Tjhai, M. Ambroze, M. Ahmed
{"title":"Comparison of Concatenated Reed-Solomon Coding with Hard-decision to Soft-decision LDPC Coding for the Rayleigh Fading Channel","authors":"J. Cai, M. Tomlinson, C. Tjhai, M. Ambroze, M. Ahmed","doi":"10.1109/ITW2.2006.323773","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323773","url":null,"abstract":"Reed-Solomon (RS) codes C(n, k, n - k + 1) are commonly used error-control codes, because they are Maximum Distance Separable (MDS) codes. Over a Binary Erasure Channel, RS codes perform with optimal results and approach the maximum channel capacity. In this paper, we apply RS codes to packet wireless transmission over the uncorrelated flat Rayleigh fading channel. It is shown that by using an RS code concatenated with BCH codes and using hard decisions, better results are obtained than using bit interleaved LDPC codes, with soft-decision decoding. The BCH code is used to correct small numbers of errors due to noise and also to detect the presence of deep fades, in which case the entire packet is erased. Erased packets are corrected by the RS code. We also discuss the effect of overall code rate on the net performance.","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"6 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":"128522584","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
Detecting the Same Text in Different Languages 在不同语言中检测相同的文本
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323816
K. Koroutchev, Manuel Cebrián
{"title":"Detecting the Same Text in Different Languages","authors":"K. Koroutchev, Manuel Cebrián","doi":"10.1109/ITW2.2006.323816","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323816","url":null,"abstract":"Compression based similarity distances have the main drawback of needing the same coding scheme for the objects to be compared. When two texts are translated, there exists significant similarity with no literal coincidence. In this article, we present an algorithm that compares the redundancy structure of the data extracted by means of a Lempel- Ziv compression scheme. Each text is presented as a graph and two texts are considered similar with our measure if they have the same referential topology when compressed. We give empirical evidence that this measure detects similarity between data coded in different languages.","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"23 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":"125734855","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
Effects of noisy side information at the decoder in dirty-paper and dirty-tape coding 脏纸和脏带编码中解码器处噪声侧信息的影响
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323827
Matteo Mazzotti, Zixiang Xiong
{"title":"Effects of noisy side information at the decoder in dirty-paper and dirty-tape coding","authors":"Matteo Mazzotti, Zixiang Xiong","doi":"10.1109/ITW2.2006.323827","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323827","url":null,"abstract":"This paper examines the problems of dirty-paper and dirty-tape coding with some additional side information (SI) at the decoder. In particular we focus on the situation in which the decoder SI is a noisy version of the SI at the encoder. We show that noisy SI at the decoder is advantageous for many channels in terms of capacity and, in general, the optimal coding strategy needs to take it into account. In particular, the capacities of the binary dirty-paper and dirty-tape channels are computed when the decoder SI is modeled as the output of a binary symmetric channel with the encoder SI as input. Moreover, the advantage offered by the decoder SI on the minimum achievable Eb /NO in the dirty-tape scenario with Gaussian interference is demonstrated","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"24 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":"123772392","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
An Upper and a Lower Bound on the Probability of an Undetected Error for Binary Expansions of Generalized Reed-Solomon Codes 广义Reed-Solomon码二进制展开式的未检测错误概率的上界和下界
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323749
T. Nishijima
{"title":"An Upper and a Lower Bound on the Probability of an Undetected Error for Binary Expansions of Generalized Reed-Solomon Codes","authors":"T. Nishijima","doi":"10.1109/ITW2.2006.323749","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323749","url":null,"abstract":"By utilizing certain characteristic structure of the Hamming weight distribution of maximum distance separable codes, we can get weight enumerators to compute an upper and a lower bound on the probability of an undetected error for binary expansions of generalized Reed-Solomon (GRS) codes. Also, values of the average probability of an undetected error are computed by using the average binary weight distribution for an ensemble of binary expansions of all GRS codes for some given concrete code parameters. By comparing these values with values of the upper and the lower bound computed by using the proposed weight enumerators, the effectiveness of those weight enumerators is shown in this paper.","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":"131164127","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
Gallager Bounds for Space-Time Codes in Quasi-Static Fading Channels 准静态衰落信道中空时码的Gallager界
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323842
Cong Ling
{"title":"Gallager Bounds for Space-Time Codes in Quasi-Static Fading Channels","authors":"Cong Ling","doi":"10.1109/ITW2.2006.323842","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323842","url":null,"abstract":"Gallager's bounding techniques are employed to derive tight upper bounds on the decoding error probability of space-time codes in quasi-static Rayleigh fading channels. The bounds converge rapidly and are within a few decibels from simulation results. Moreover, they permit efficient numerical computation, which represents a major advantage over the existing limit-before-average technique. Therefore, the proposed bounds are a meaningful and practical tool for performance analysis and computer search of good space-time codes","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"58 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":"131442879","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
High-Speed Adaptive Turbo Decoding Algorithm and Its Implementation 高速自适应Turbo译码算法及其实现
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323766
M. Kim, J. Jeong, Ji-Won Jung
{"title":"High-Speed Adaptive Turbo Decoding Algorithm and Its Implementation","authors":"M. Kim, J. Jeong, Ji-Won Jung","doi":"10.1109/ITW2.2006.323766","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323766","url":null,"abstract":"In this paper, we propose an adaptive turbo decoding algorithm for high order modulation scheme combined with originally design for a standard rate-1/2 turbo decoder for B/QPSK modulation. A transformation applied to the incoming I-channel and Q-channel symbols allows the use of an off-the-shelf B/QPSK turbo decoder without any modifications. .The source of the latency and power consumption reduction is from the combination of the radix-4, dual-path processing, parallel decoding, and early-stop algorithms. We implemented the proposed scheme on a field-programmable gate array (FPGA) and compared its decoding speed with that of a conventional decoder","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"100 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":"130328414","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
An Enhanced Covering Lemma for Multiterminal Source Coding 一种改进的多终端信源编码覆盖引理
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323809
Shengtian Yang, Peiliang Qiu
{"title":"An Enhanced Covering Lemma for Multiterminal Source Coding","authors":"Shengtian Yang, Peiliang Qiu","doi":"10.1109/ITW2.2006.323809","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323809","url":null,"abstract":"An enhanced covering lemma for a Markov chain is proved in this paper, and then the distributed source coding problem of correlated general sources with one average distortion criterion under fixed-length coding is investigated. Based on the enhanced lemma, a sufficient and necessary condition for determining the achievability of rate-distortion triples is given","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"22 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":"115372499","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
首页 上一页 下一页 尾页
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学术官方微信