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

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

筛选
英文 中文
Optimal Multicast with Erasure Correction Coding 具有Erasure纠错编码的最优组播
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323833
N. Sarshar, Xiaolin Wu, Zhe Wang
{"title":"Optimal Multicast with Erasure Correction Coding","authors":"N. Sarshar, Xiaolin Wu, Zhe Wang","doi":"10.1109/ITW2.2006.323833","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323833","url":null,"abstract":"We propose a network information flow strategy of optimal multicast with erasure correction coding (OMEC), in which erasure correction is a means of utilizing diversities rather than combating packet losses. An information source is first encoded by an erasure correction code and then optimally multicast by a server to sinks. The OMEC scheme has the following characteristics: (1) It is at least as good as optimal routing and, for some cases, can realize a network throughput arbitrarily larger than that achievable by pure routing. (2) For most scenarios, the approach yields a throughput comparable with the optimal throughput achievable with network coding. In fact, for most examples in the literature for which network coding makes high throughput gains compared to pure routing, OMEC performs close to the optimal. (3) Unlike general network coding, intermediate nodes are only required to route information. This makes OMEC compatible with currently deployed network structures. (4) Surprisingly, unlike pure optimal routing, OMEC can be efficiently computed in polynomial time. While OMEC is, in general, suboptimal compared to full fledged network coding, it enjoys most of the computational and throughput benefits associated with network coding over pure routing, without requiring any changes to existing hardware infrastructures or protocol stacks","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":"125473140","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
Combining Sphere Decoding with M-Algorithm 球解码与m算法的结合
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323782
Jianping Zheng, B. Bai, Xinmei Wang
{"title":"Combining Sphere Decoding with M-Algorithm","authors":"Jianping Zheng, B. Bai, Xinmei Wang","doi":"10.1109/ITW2.2006.323782","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323782","url":null,"abstract":"The sequence detection problem for fading channels in multiple-input multiple-output (MIMO) wireless systems is investigated. The sphere decoding (SD) algorithm provides an exact maximum-likelihood (ML) solution, while has expected worst-case complexity which is exponential in the number of symbols jointly detected. On the other hand, the M-algorithm (MA) is a suboptimal solution. Its complexity is linear in the product of the list number and the number of symbols jointly detected. We combined the sphere-constrained search strategy of SD with the M-constrained search principle of the MA. The resulting algorithms can achieve good performance in term of bit error rate (BER) while lower complexity","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"4 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":"133594215","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
A Fountain Code Approach towards Priority Encoding Transmission 优先编码传输的喷泉码方法
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323745
M. Nekoui, N. Ranjkesh, F. Lahouti
{"title":"A Fountain Code Approach towards Priority Encoding Transmission","authors":"M. Nekoui, N. Ranjkesh, F. Lahouti","doi":"10.1109/ITW2.2006.323745","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323745","url":null,"abstract":"We introduce a new method of engaging Limited Randomness LT codes [5], a practical realization of the original LT codes by Luby [3] to transmit prioritized data-which is of great importance for multimedia applications-over lossy packet-based networks. We obtained increased number of decoded packets for higher priorities and also the total number of decoded packets-over all priorities-was augmented.","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"90 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":"133704464","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}
引用次数: 6
Gaussian Interference Channel Capacity to Within One Bit: the Symmetric Case 高斯干扰信道容量到1位以内:对称情况
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323705
R. Etkin, David Tse, Hua Wang
{"title":"Gaussian Interference Channel Capacity to Within One Bit: the Symmetric Case","authors":"R. Etkin, David Tse, Hua Wang","doi":"10.1109/ITW2.2006.323705","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323705","url":null,"abstract":"The capacity of the two-user Gaussian interference channel has been open for thirty years. The understanding on this problem has been limited. The best known achievable region is due to Han-Kobayashi but its characterization is very complicated. It is also not known how tight the existing outer bounds are. In this work, we show that the existing outer bounds can in fact be arbitrarily loose in some parameter ranges, and by deriving new outer bounds, we show that a simplified Han-Kobayashi type scheme can achieve to within a single bit the capacity for all values of the channel parameters. We also show that the scheme is asymptotically optimal at certain high SNR regimes. Using our results, we provide a natural generalization of the point-to-point classical notion of degrees of freedom to interference-limited scenarios","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"7 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131455776","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}
引用次数: 30
Joint Source/Channel Coding for JPEG2000 Codestream Transmission over Fading Channels JPEG2000码流在衰落信道上传输的联合源信道编码
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323822
Xiaona Lu, Rongke Liu, Xiaolin Zhang
{"title":"Joint Source/Channel Coding for JPEG2000 Codestream Transmission over Fading Channels","authors":"Xiaona Lu, Rongke Liu, Xiaolin Zhang","doi":"10.1109/ITW2.2006.323822","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323822","url":null,"abstract":"The embedded codestream structures and a variety of progressive image compression methods provided by JPEG2000 make it attractive for image transmission purposes. A three-level, hybrid optimization scheme is proposed for JPEG2000 compressed images over a correlated block fading channel with a cyclic redundancy check code (CRC) and a rate-compatible punctured convolution (RCPC) code. It combines forward error correction (FEC) and JPEG2000 error resilience (ER) mechanisms to minimize the end-to-end image distortion according to channel conditions. The proposed scheme employed a finite-state Markov channel model to simulate the channel. It has the complexity less than O (R2) for a special JPEG2000 codestream, where R is the number of available channel code rates. Simulation results show a significant improvement about 0.7-1.3 dB over the based two-level scheme in quality of received images","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"39 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":"132660714","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
Heuristic Algorithms for Small Field Multicast Encoding 小域组播编码的启发式算法
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323835
A. Barbero, O. Ytrehus
{"title":"Heuristic Algorithms for Small Field Multicast Encoding","authors":"A. Barbero, O. Ytrehus","doi":"10.1109/ITW2.2006.323835","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323835","url":null,"abstract":"We explore and present heuristic algorithms that, for a given network, attempt to minimize the field size required for encoding","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"43 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":"115886221","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}
引用次数: 8
Space-Time Coding with Feedback 带反馈的空时编码
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323837
Haiquan Wang, E. Yang
{"title":"Space-Time Coding with Feedback","authors":"Haiquan Wang, E. Yang","doi":"10.1109/ITW2.2006.323837","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323837","url":null,"abstract":"Space-time coding for a multiple-input, multiple-output (MIMO) system with feedback and maximum-likelihood (ML)-decoding is considered. In the case that complete feedback from the receiver to the transmitter is available, the optimal structure of the codes is shown to have the form cudagger, where c is a T-dimensional complex vector (T is a time delay), and u is a unit-norm eigenvector corresponding to the largest eigenvalue of matrix HHdagger (H is the channel matrix and dagger means the transpose and conjugate). Moreover, criterion for designing vector c is obtained. In the case that only finite-bit feedback is available, the optimal structure of the codes is proved to have the form cpdagger, where c is also a T-dimensional complex vector and p is a M-dimensional vector with unit-norm (M is the transmit number of the system). Furthermore, criteria for designing vectors c and p are given. A Lloyd-like algorithm to approach p is introduced","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":"125804260","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
Fountain Codes and Applications to Reliable Wireless Broadcast System 喷泉码及其在可靠无线广播系统中的应用
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323758
Yuanyuan Ma, D. Yuan, Haixia Zhang
{"title":"Fountain Codes and Applications to Reliable Wireless Broadcast System","authors":"Yuanyuan Ma, D. Yuan, Haixia Zhang","doi":"10.1109/ITW2.2006.323758","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323758","url":null,"abstract":"This paper investigates fountain codes and applications to wireless broadcast. In this paper, we extend fountain codes on erasure channels to arbitrary channel types by first taking into account the symbol information and belief propagation (BP) algorithm. We propose a rateless-coding framework based on fountain codes, which allow reliable wireless broadcast communications and asynchronous data access simultaneously. Considering the flexible code rate characteristic, we find a new measurement to evaluate the performance of fountain codes in the wireless environment. Via comparing the performance of two types of fountain codes: Luby transform (LT) codes and Raptor codes within this framework, we get the conclusion that fountain codes will be sufficient to fulfill both requirements in a wireless system. We also demonstrate such a framework has advantages in efficiency, reliability, and robustness","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"36 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":"121545904","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}
引用次数: 32
A Non-orthogonal Distributed Space-Time Coded Protocol Part I: Signal Model and Design Criteria 一种非正交分布空时编码协议。第一部分:信号模型和设计准则
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323826
G. S. Rajan, B. S. Rajan
{"title":"A Non-orthogonal Distributed Space-Time Coded Protocol Part I: Signal Model and Design Criteria","authors":"G. S. Rajan, B. S. Rajan","doi":"10.1109/ITW2.2006.323826","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323826","url":null,"abstract":"In this- two-part series of papers, a generalized non-orthogonal amplify and forward (GNAF) protocol which generalizes several known cooperative diversity protocols is proposed. Transmission in the GNAF protocol comprises of two phases - the broadcast phase and the cooperation phase. In the broadcast phase, the source broadcasts its information to the relays as well as the destination. In the cooperation phase, the source and the relays together transmit a space-time code in a distributed fashion. The GNAF protocol relaxes the constraints imposed by the protocol of Jing and Hassibi on the code structure. In part-I of this paper, a code design criteria is obtained and it is shown that the GNAF protocol is delay efficient and coding gain efficient as well. Moreover the GNAF protocol enables the use of sphere decoders at the destination with a non-exponential maximum likelihood (ML) decoding complexity. In part-II, several low decoding complexity code constructions are studied and a lower bound on the diversity-multiplexing gain tradeoff of the GNAF protocol is obtained","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"88 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":"127022653","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}
引用次数: 42
Novel SNR Estimation for Turbo Decoding over Rayleigh Fading Channels 瑞利衰落信道下Turbo译码新信噪比估计
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323783
H. Zhao, P. Fan, P. K. Mathiopoulos
{"title":"Novel SNR Estimation for Turbo Decoding over Rayleigh Fading Channels","authors":"H. Zhao, P. Fan, P. K. Mathiopoulos","doi":"10.1109/ITW2.2006.323783","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323783","url":null,"abstract":"It is known that the signal to noise ratio (SNR) mismatch may cause degradation in error correction performance of turbo decoding. In order to obtain desired coding gain, a turbo decoder can perform online SNR estimation from the received data in each code block. This paper presents a novel SNR estimation method for turbo decoding over Rayleigh fading channels by utilizing the estimate ratio of the fourth moment to the fourth power of mean absolute value over the received data. Analysis demonstrates that the proposed method is superior to the previous method in the estimation accuracy, especially when code block length is small. Furthermore, simulation shows that nearly optimal bit error rate (BER) can be achieved even when the code block length is reduced to 400 bits (200 information bits, half code rate), while the previous method results in noticeable BER degradation","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"118 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":"128107646","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
首页 上一页 下一页 尾页
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学术官方微信