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

2010 IEEE International Symposium on Information Theory最新文献

筛选
英文 中文
Toward computing the capacity region of degraded broadcast channel 对退化广播信道容量区域计算的探讨
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513525
Kensuke Yasui, T. Matsushima
{"title":"Toward computing the capacity region of degraded broadcast channel","authors":"Kensuke Yasui, T. Matsushima","doi":"10.1109/ISIT.2010.5513525","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513525","url":null,"abstract":"Recently, computing the capacity region of the degraded broadcast channel (DBC) was showed as a nonconvex optimization problem by Calvo et al [6]. There seems to be no efficient method to solve in polynomial time due to the lack of convexity. In other nonconvex optimization problem, however, Kumar et al showed that Arimoto-Blahut type algorithm converges to the global optimum when some conditions hold [12]. In this paper, we present Arimoto-Blahut type algorithm toward computing the capacity region of the DBC. By using Kumar's method, we prove the global convergence of the algorithm when some conditions hold and derive an expression for its convergence rate.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132372700","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
Interference mitigation with joint beamforming and common message decoding in multicell systems 多小区系统中联合波束形成和公共报文解码的干扰抑制
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513389
H. Dahrouj, Wei Yu
{"title":"Interference mitigation with joint beamforming and common message decoding in multicell systems","authors":"H. Dahrouj, Wei Yu","doi":"10.1109/ISIT.2010.5513389","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513389","url":null,"abstract":"Conventional multicell wireless systems operate with out-of-cell interference treated as noise—interference detection is infeasible as intercell interference is typically weak. This paper considers the benefit of designing decodable interference signals by allowing common-private message splitting at the transmitter and common message decoding by users in adjacent cells. In particular, we consider a downlink scenario, where base-stations are equipped with multiple transmit antennas, the remote users are equipped with a single antenna, and multiple remote users are active simultaneously via spatial division multiplexing. We solve a network optimization problem of jointly determining the appropriate users in adjacent cells for rate splitting, the optimal beamforming vectors for both common and private messages, and the optimal common-private rates to minimize the total transmit power across the base-stations subject to service rate requirements for remote users. We observe that for fixed user selection and fixed common-private rate splitting, the optimization of beamforming vectors can be performed using a semidefinite programming approach. Further, this paper proposes a heuristic user-selection and rate splitting strategy to maximize the benefit of common message decoding. Simulation results show that common message decoding can significantly improve both the total transmit power and the feasibility region for cell-edge users.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132392496","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}
引用次数: 12
On the equivalence between the B-Code constructions and perfect one-factorizations 论b码结构与完全一分解的等价性
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513748
Mingqiang Li, J. Shu
{"title":"On the equivalence between the B-Code constructions and perfect one-factorizations","authors":"Mingqiang Li, J. Shu","doi":"10.1109/ISIT.2010.5513748","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513748","url":null,"abstract":"The B-Code is a class of MDS array code with optimal properties for RAID 6. Xu et al. proposed an open problem in 1999: Are the B-Code constructions strongly equivalent to perfect one-factorizations of a graph? In this paper, we show that the constructions of the B-Code of length l are equivalent to perfect one-factorizations of a l-regular graph on l + r vertices, where l is an integer not smaller than 4, and r is equal to 1 for an odd l or 2 for an even l.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132097797","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
Rate-compatible non-binary LDPC codes concatenated with multiplicative repetition codes 速率兼容的非二进制LDPC码与乘法重复码连接
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513615
K. Kasai, D. Declercq, C. Poulliat, K. Sakaniwa
{"title":"Rate-compatible non-binary LDPC codes concatenated with multiplicative repetition codes","authors":"K. Kasai, D. Declercq, C. Poulliat, K. Sakaniwa","doi":"10.1109/ISIT.2010.5513615","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513615","url":null,"abstract":"We propose non-binary LDPC codes concatenated with multiplicative repetition codes. To the best of the authors' knowledge, for the transmissions over the memoryless binary-input output-symmetric channels, 2m-ary the (2,dc)-regular LDPC code for m ∼ 8 and dc ≥ 3 is the best code so far among codes with moderate code length. By multiplicatively repeating the 2m-ary (2,3)-regular LDPC code of rate ⅓, we construct rate-compatible codes of lower rates 1/6,1/9,1/12,…. Surprisingly, such simple low-rate codes outperform the best low-rate binary codes so far.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134512765","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}
引用次数: 13
Unequal error protection rateless coding design for multimedia multicasting 多媒体多播的不等错保护无速率编码设计
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513792
Yu Cao, S. Blostein, W. Chan
{"title":"Unequal error protection rateless coding design for multimedia multicasting","authors":"Yu Cao, S. Blostein, W. Chan","doi":"10.1109/ISIT.2010.5513792","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513792","url":null,"abstract":"We study the design and optimization of unequal error protection (UEP) rateless codes for scalable multimedia multicasting. We formulate two general problems of optimizing UEP rateless code for multimedia multicasting to heterogenous users: one focusing on providing guaranteed quality of service (QoS) and the other focusing on providing best-effort QoS. A random interleaved rateless encoder design is proposed. Unlike previous designs, existing standardized raptor codes can be directly applied to this design without degrading performance. For each problem, optimal layer selection parameters are obtained either analytically or numerically. Numerical results demonstrate that the proposed optimized random interleaved UEP rateless code outperforms non-optimized rateless codes and recently proposed UEP rateless codes.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134546666","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
Data movement and aggregation in flash memories 闪存中的数据移动和聚合
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513391
Anxiao Jiang, M. Langberg, R. Mateescu, Jehoshua Bruck
{"title":"Data movement and aggregation in flash memories","authors":"Anxiao Jiang, M. Langberg, R. Mateescu, Jehoshua Bruck","doi":"10.1109/ISIT.2010.5513391","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513391","url":null,"abstract":"NAND flash memories have become the most widely used type of non-volatile memories. In a NAND flash memory, every block of memory cells consists of numerous pages, and rewriting a single page requires the whole block to be erased. As block erasures significantly reduce the longevity, speed and power efficiency of flash memories, it is critical to minimize the number of erasures when data are reorganized. This leads to the data movement problem, where data need to be switched in blocks, and the objective is to minimize the number of block erasures. It has been shown that optimal solutions can be obtained by coding. However, coding-based algorithms with the minimum coding complexity still remain an important topic to study. In this paper, we present a very efficient data movement algorithm with coding over GF(2) and with the minimum storage requirement. We also study data movement with more auxiliary blocks and present its corresponding solution. Furthermore, we extend the study to the data aggregation problem, where data can not only be moved but also aggregated. We present both non-coding and coding-based solutions, and rigorously prove the performance gain by using coding.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132045580","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
Decoding of LDPC convolutional codes with rational parity-check matrices from a new graphical perspective 从一个新的图形角度看具有有理奇偶校验矩阵的LDPC卷积码解码
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513631
Jian-Jia Weng, Chih-Chieh Lai, Chung-hsuan Wang
{"title":"Decoding of LDPC convolutional codes with rational parity-check matrices from a new graphical perspective","authors":"Jian-Jia Weng, Chih-Chieh Lai, Chung-hsuan Wang","doi":"10.1109/ISIT.2010.5513631","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513631","url":null,"abstract":"Previous studies on low-density parity-check convolutional codes (LDPC-CC) reveal that LDPC-CC with rational parity-check matrices (RPCM) suffer from the unaffordable decoding latency/complexity due to the infinite memory order and the poor bit-error-rate performance due to the existence of length-4 cycles in the Tanner graph. However, in this paper, we show that every LDPC-CC with RPCM can be associated with an equivalent Tanner graph which can avoid the infinite memory order and undesired short length cycles but still implements the same constraints specified by the RPCM. Together with the iterative decoding based on belief propagation with proper scheduling, simulation results indicate that LDPC-CC with RPCM can also provide satisfactory decoding performance.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124310352","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
The capacity of the uniform noise rewritable channel with average cost 平均成本下均匀噪声可重写信道的容量
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513251
L. A. Lastras-Montaño, M. Franceschini, T. Mittelholzer
{"title":"The capacity of the uniform noise rewritable channel with average cost","authors":"L. A. Lastras-Montaño, M. Franceschini, T. Mittelholzer","doi":"10.1109/ISIT.2010.5513251","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513251","url":null,"abstract":"We present a closed form expression for the capacity of the uniform noise rewritable channel with average write cost and a constraint on the input range. We show the existence of a critical cost κ<inf>0</inf> such that for all costs κ ≥ κ<inf>0</inf>, the capacity/cost tradeoff is given by an offset added to the logarithm of the cost. Assuming κ<inf>0</inf> > 1, for 1 ≤ κ < κ<inf>0</inf> the capacity/cost tradeoff grows faster than a logarithm.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122563405","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
Reconstruction of a turbo-code interleaver from noisy observation 基于噪声观测的涡轮码交织器重构
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513364
M. Côte, N. Sendrier
{"title":"Reconstruction of a turbo-code interleaver from noisy observation","authors":"M. Côte, N. Sendrier","doi":"10.1109/ISIT.2010.5513364","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513364","url":null,"abstract":"We propose in this paper an algorithm to recover the interleaver of an unknown turbo encoder by observing noisy codewords. Our technique is practical but is limited to rate 1/3 turbo-code using two unpunctured rate 1/2 systematic convolutional encoders.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127860398","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}
引用次数: 20
Performance analysis of an asynchronous multi-user communication system for optical networks 光网络异步多用户通信系统的性能分析
2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513374
L. Venturino, V. Vaishampayan, M. Feuer, Xiaodong Wang
{"title":"Performance analysis of an asynchronous multi-user communication system for optical networks","authors":"L. Venturino, V. Vaishampayan, M. Feuer, Xiaodong Wang","doi":"10.1109/ISIT.2010.5513374","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513374","url":null,"abstract":"In optically routed networks, information for verifying network configuration is not readily available in electronic form. To address this problem, a low-cost all-digital system was developed in [1], [2] for overlaying a low-rate management data channel on a high-rate payload data channel. In this work, we analyze the performance of this novel multi-user communication system under chip-level asynchronism, extending a previous analysis under chip-level synchronism. Two decoding strategies are investigated: a zero-forcing and a minimum mean-squared error detector. Fundamental tradeoffs among several system parameters are identified.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116387746","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学术官方微信