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

2007 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Kraft Inequality and Zero-Error Source Coding with Decoder Side Information 卡夫不等式与解码器侧信息的零误差源编码
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557266
E. Tuncel
{"title":"Kraft Inequality and Zero-Error Source Coding with Decoder Side Information","authors":"E. Tuncel","doi":"10.1109/ISIT.2007.4557266","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557266","url":null,"abstract":"This paper tackles the problem of zero-error instantaneous coding with decoder side information in light of the Kraft inequality. Specifically, a bounded Kraft sum over all cliques in the characteristic graph of the source/side-information pair is envisioned to be a sufficient condition for the existence of a valid code with given codeword lengths. It is shown that (i) if such a sufficient condition exists for a class of graphs, it is possible to universally bound the rate redundancy in the class, (ii) there exist graph classes of interest for which such sufficient conditions can indeed be found, and finally (iii) no such condition can be found for the class of all graphs.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124099945","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
Multiple-Bases Belief-Propagation for Decoding of Short Block Codes 短分组码译码的多碱基信念传播
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557244
T. Hehn, J. Huber, Stefan Ländner, O. Milenkovic
{"title":"Multiple-Bases Belief-Propagation for Decoding of Short Block Codes","authors":"T. Hehn, J. Huber, Stefan Ländner, O. Milenkovic","doi":"10.1109/ISIT.2007.4557244","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557244","url":null,"abstract":"A novel soft-decoding method for algebraic block codes is presented. The algorithm is designed for soft-decision decoding and is based on belief-propagation (BP) decoding using multiple bases of the dual code. Compared to other approaches for high-performance BP decoding, this method is conceptually simple and does not change at each stage of the decoding process. With its multiple BP decoders the proposed scheme achieves the performance of a standard BP algorithm with a significantly lower number of iterations per decoder realization. By this means the data delay introduced by decoding is reduced. Moreover, a significant improvement in decoding performance is achieved while keeping the data delay small. It is shown that for selected codes the proposed scheme approaches near maximum likelihood (ML) performance for very small data processing delays.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124484054","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}
引用次数: 37
Analysis of PCO Raptor codes and Turbo-Fountain Codes on Noiseless Channels 无噪声信道上的PCO猛禽码和涡轮喷泉码分析
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557261
A. Tarable, S. Benedetto
{"title":"Analysis of PCO Raptor codes and Turbo-Fountain Codes on Noiseless Channels","authors":"A. Tarable, S. Benedetto","doi":"10.1109/ISIT.2007.4557261","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557261","url":null,"abstract":"This paper deals with precode-only (PCO) Raptor codes and turbo fountain codes used on a noiseless channel, as it is the case for the BEC or the AWGN channel with high SNR. The performance measure for such family of codes is the efficiency, i.e., the amount of redundancy needed to decode the information bits. Following a previous paper, we give an exact expression for the average efficiency of maximum-likelihood (ML) decoded Hamming codes and maximal-length codes. Moreover, we give an expression of the variance of the efficiency. Finally, we improve the bound on the efficiency of turbo fountain codes, which are iteratively decoded.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125837493","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
Moment Balancing Templates: Universal Constructions to Add Insertion/Deletion Correction Capability to Arbitrary Error Correcting or Constrained Codes 力矩平衡模板:为任意纠错或约束代码添加插入/删除纠正能力的通用结构
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557143
H. C. Ferreira, K. Abdel-Ghaffar, Ling Cheng, T. Swart
{"title":"Moment Balancing Templates: Universal Constructions to Add Insertion/Deletion Correction Capability to Arbitrary Error Correcting or Constrained Codes","authors":"H. C. Ferreira, K. Abdel-Ghaffar, Ling Cheng, T. Swart","doi":"10.1109/ISIT.2007.4557143","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557143","url":null,"abstract":"We investigate extending a chosen block or convolutional code which has additive error correction capability, as predetermined by the usual communication systems or coding considerations. Our extension involves constructing a template to add additional redundant bits in positions, selected to balance the moment of the code word. Using some number theoretic constructions in the literature, insertion/deletion correction can then be achieved. If the template is carefully designed, the number of additional redundant bits for the insertion/deletion correction can be kept small - in some cases of the same order as for Hamming codes. Our construction technique can also be used for the systematic encoding of number theoretic codes, and furthermore have implications for other coding techniques utilizing the moment function, such as codes correcting asymmetrical errors, spectral shaping codes, or constant weight codes.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125910959","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
Generating functional analysis of CDMA soft-decision multiuser detector CDMA软判决多用户检测器的生成功能分析
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557159
Kazushi Mimura, M. Okada
{"title":"Generating functional analysis of CDMA soft-decision multiuser detector","authors":"Kazushi Mimura, M. Okada","doi":"10.1109/ISIT.2007.4557159","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557159","url":null,"abstract":"We investigate detection dynamics of a soft parallel interference canceller (soft-PIC), which includes a hard PIC as a special case, for CDMA multiuser detection, applied to a randomly spread, fully synchronous base-band uncoded CDMA channel model with additive white Gaussian noise (AWGN) under perfect power control in the large-system limit. We analyze the detection dynamics of the soft-PIC and the belief-propagation-based detector by the generating functional analysis (GFA). The GFA allows us to study the dynamics of infinitely large disordered system in an exact way.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129425766","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
A Bound of Generalized Cutoff Rate for the Fixed-Length Lossy Coding of General Sources 一般信源定长有损编码的广义截断率界
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557288
H. Shimokawa
{"title":"A Bound of Generalized Cutoff Rate for the Fixed-Length Lossy Coding of General Sources","authors":"H. Shimokawa","doi":"10.1109/ISIT.2007.4557288","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557288","url":null,"abstract":"This paper investigate Csiszar's generalized cutoff rate for the fixed-length lossy coding of general sources. We obtain an upper bound of generalized cutoff rate and derive Renyi's entropy for the case of loss-less coding. We also derive generalized cutoff rate for memory-less sources with lossy coding. It can be considered as a lossy counterpart of Renyi's entropy.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129685147","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
Interference Channel and Compound MAC with Correlated Sources and Receiver Side Information 具有相关源端和接收端信息的干扰信道和复合MAC
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557146
Deniz Gündüz, E. Erkip
{"title":"Interference Channel and Compound MAC with Correlated Sources and Receiver Side Information","authors":"Deniz Gündüz, E. Erkip","doi":"10.1109/ISIT.2007.4557146","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557146","url":null,"abstract":"We consider discrete memoryless compound multiple access and interference channels with correlated sources and correlated side information at the receivers, and investigate necessary and sufficient conditions for lossless transmission. We first give sufficient conditions for the most general setting, and then show that these conditions are also necessary for both channels under certain assumptions on the side information and the interference. In particular, we generalize the notion of strong interference to take into account the correlation among the sources and side information. We prove the optimality of 'informational' or 'operational' source-channel separation for certain special cases. While informational separation results in independent source and channel encoding and decoding; operational separation corresponds to separation at the encoder, while decoding is done jointly. To our knowledge, these results constitute the first source-channel separation results for interference and compound multiple access channels with correlated sources and side information.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129318756","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
Structured Lattice Space-Time Trellis Coded Modulation 结构点阵时空格子编码调制
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557503
K. R. Kumar, G. Caire
{"title":"Structured Lattice Space-Time Trellis Coded Modulation","authors":"K. R. Kumar, G. Caire","doi":"10.1109/ISIT.2007.4557503","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557503","url":null,"abstract":"This paper addresses the issue of the design of Space-Time (ST) codes for long block-lengths that have good coding gain and minimal decoding complexity. A general technique to encode information onto cosets and points of a sequence of nested lattices is used to construct ST trellis coded modulation (TCM) schemes with good coding and shaping gains, and is termed as structured lattice space-time trellis coded modulation (S-LaST TCM). These codes permit low complexity minimum mean-squared error generalized decision feedback equalizer (MMSE-GDFE) lattice decoding. Code construction examples are presented, and simulation results reveal excellent performances.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"92 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129327072","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
Population estimation with performance guarantees 具有性能保证的总体估计
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557157
A. Orlitsky, N. Santhanam, K. Viswanathan
{"title":"Population estimation with performance guarantees","authors":"A. Orlitsky, N. Santhanam, K. Viswanathan","doi":"10.1109/ISIT.2007.4557157","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557157","url":null,"abstract":"We estimate the population size by sampling uniformly from the population. Given an accuracy to which we need to estimate the population with a pre-specified confidence, we provide a simple stopping rule for the sampling process.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127481173","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}
引用次数: 11
The Capacity Region of the Degraded MIMO Compound Broadcast Channel 退化MIMO复合广播信道的容量区域
2007 IEEE International Symposium on Information Theory Pub Date : 2007-06-24 DOI: 10.1109/ISIT.2007.4557317
H. Weingarten, Tie Liu, S. Shamai, Y. Steinberg, P. Viswanath
{"title":"The Capacity Region of the Degraded MIMO Compound Broadcast Channel","authors":"H. Weingarten, Tie Liu, S. Shamai, Y. Steinberg, P. Viswanath","doi":"10.1109/ISIT.2007.4557317","DOIUrl":"https://doi.org/10.1109/ISIT.2007.4557317","url":null,"abstract":"The capacity region of a compound multi- antenna broadcast channel is characterized when the users exhibit a certain degradedness order. For this purpose, we bring to bear a new extremal inequality for information theory and utilize a channel enhancement technique.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127501992","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
首页 上一页 下一页 尾页
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学术官方微信