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

2012 IEEE International Symposium on Information Theory Proceedings最新文献

筛选
英文 中文
Bipartite index coding 二部索引编码
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283853
A. Tehrani, A. Dimakis, M. Neely
{"title":"Bipartite index coding","authors":"A. Tehrani, A. Dimakis, M. Neely","doi":"10.1109/ISIT.2012.6283853","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283853","url":null,"abstract":"We analyze a generalized index coding problem that allows multiple users to request the same packet. For this problem we introduce a novel coding scheme called partition multicast. Our scheme can be seen as a natural generalization of clique cover for directed index coding problems. Further, partition multicast corresponds to an achievable scheme for the generalized bipartite index coding problem that we introduce in this paper. Our scheme partitions the nodes into groups and solves a multicasting problem within each group. We show that Partition Multicast is optimal for a few families of graphs and generalizes previous achievable schemes, namely directed cycle covers. We also show that finding the best partition is computationally intractable to compute in general.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115152847","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}
引用次数: 75
Number of compressed measurements needed for noisy distributed compressed sensing 噪声分布式压缩感知所需的压缩测量数
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283555
Sangjun Park, Heung-no Lee
{"title":"Number of compressed measurements needed for noisy distributed compressed sensing","authors":"Sangjun Park, Heung-no Lee","doi":"10.1109/ISIT.2012.6283555","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283555","url":null,"abstract":"In this paper, we consider a data collection network (DCN) system where sensors take samples and transmit them to a Fusion Center (FC). Signal correlation is modeled with signal sparseness. The number of compressed measurements which allows correct signal recovery at FC is investigated. This is done by studying the probability of signal recovery failure. The joint typical decoder (JT decoder) similar to the one proposed by Akcakaya and Tarokh is used to avoid dependence on particular choice of recovery routines. The following interesting results have been obtained: 1) The detection failure probability linearly converges to zero as the number of sensors increases. 2) The number of compressed measurements per sensor (PSM) needed for successful recovery converges to sparsity as the number of sensors increases.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128095237","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
Wireless MIMO switching with MMSE relaying 无线MIMO切换与MMSE中继
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283029
Fanggang Wang, S. Liew, Dongning Guo
{"title":"Wireless MIMO switching with MMSE relaying","authors":"Fanggang Wang, S. Liew, Dongning Guo","doi":"10.1109/ISIT.2012.6283029","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283029","url":null,"abstract":"A wireless relay which forms a one-to-one mapping from the inputs (uplinks) to the outputs (downlinks) is called a multiple-input-multiple-output (MIMO) switch. The MIMO switch carries out precode-and-forward, where all users send their signals in the uplink and then the MIMO switch precodes the received vector signal for broadcasting in the downlink. Ideally, each user employs a receive filter to recover its desired signal from one other user with no or little interference from other users. We propose a joint design of the precoder and the receive filters to achieve the minimum-mean-square-error (MMSE), assuming full channel state information is available at the relay. Our results indicate that the proposed MMSE relaying scheme outperforms the existing ZF/MMSE schemes.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"48 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132657984","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
Distance spectrum estimation of LDPC convolutional codes LDPC卷积码的距离谱估计
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284234
Hua Zhou, David G. M. Mitchell, N. Goertz, D. Costello
{"title":"Distance spectrum estimation of LDPC convolutional codes","authors":"Hua Zhou, David G. M. Mitchell, N. Goertz, D. Costello","doi":"10.1109/ISIT.2012.6284234","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6284234","url":null,"abstract":"Time-invariant low-density parity-check convolutional codes (LDPC-CCs) derived from corresponding quasi-cyclic (QC) LDPC block codes (LDPC-BCs) can be described by a polynomial syndrome former matrix (polynomial-domain transposed parity-check matrix). In this paper, an estimation of the distance spectrum of time-invariant LDPC-CCs is obtained by splitting the polynomial syndrome former matrix into submatrices representing “super codes” and then evaluating the linear dependence between codewords of the corresponding super codes. This estimation results in an upper bound on the minimum free distance of the original code and, additionally, a lower bound on the number of codewords Aw with Hamming weight w.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"14 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132732828","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
On the net DoF comparison between ZF and MAT over time-varying MISO broadcast channels 时变MISO广播信道中ZF和MAT的净自由度比较
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283919
M. Kobayashi, G. Caire
{"title":"On the net DoF comparison between ZF and MAT over time-varying MISO broadcast channels","authors":"M. Kobayashi, G. Caire","doi":"10.1109/ISIT.2012.6283919","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283919","url":null,"abstract":"We compare two classes of linear precoding strategies, zero-forcing (ZF) beamforming and the “MAT” scheme recently proposed by Maddah-Ali and Tse, over time-varying MISO broadcast channels. For a temporally correlated fading process with band-limited Doppler spectrum in [-F, F], with 0 ≤ F <; 1/2, it has been shown that ZF achieves a fraction 1-2F of the optimal degrees of freedom (DoF). On the other hand, MAT exploits delayed channel state information at transmitter (CSIT) and guarantees a constant DoF irrespectively of the fading Doppler bandwidth. In this work, we compare the net DoFs of both schemes by accounting for the correlation between fading blocks and for the resource required for downlink channel estimation. It is found that the downlink training for each receiver to learn the CSI of the others might be detrimental for the performance of MAT especially when the system size (number of users and transmit antennas) is not much smaller than the channel block length.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132738897","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}
引用次数: 26
Mismatched shaping schemes for bit-interleaved coded modulation 位交错编码调制的不匹配整形方案
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283948
Li Peng, A. G. Fàbregas, Alfonso Martinez
{"title":"Mismatched shaping schemes for bit-interleaved coded modulation","authors":"Li Peng, A. G. Fàbregas, Alfonso Martinez","doi":"10.1109/ISIT.2012.6283948","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283948","url":null,"abstract":"We consider bit-interleaved coded modulation (BICM) schemes where, instead of the true bit or symbol probabilities and the constellation used at the transmitter, the decoder uses arbitrary probabilities or reference constellations. We study the corresponding low- and high- signal-to-noise-ratio regimes and show that even in the presence of this extra sources of mismatch, BICM has a negligible penalty with respect to coded modulation.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133981470","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
Combinatorial message sharing and random binning for multiple description coding 多描述编码的组合消息共享和随机分组
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283485
E. Akyol, Kumar Viswanatha, K. Rose
{"title":"Combinatorial message sharing and random binning for multiple description coding","authors":"E. Akyol, Kumar Viswanatha, K. Rose","doi":"10.1109/ISIT.2012.6283485","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283485","url":null,"abstract":"This paper proposes a new multiple description (MD) coding method and an associated achievable rate-distortion region for L ≥ 2 channels. The proposed scheme randomly bins codebooks chosen from the codebook structure, similar to that of the recently proposed combinatorial message sharing (CMS) scheme designed for conditional codebook encoding. The proposed scheme effectively performs multilayer random binning for each subset of the description, which hence enables to utilize the symmetry of a “subset” of the description rates wherever it exists. The new scheme specializes in to the conventional multilayer random binning as an extreme special case.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"33 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134533325","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
Lossy common information of two dependent random variables 两个相关随机变量的有损公共信息
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284246
Kumar Viswanatha, E. Akyol, K. Rose
{"title":"Lossy common information of two dependent random variables","authors":"Kumar Viswanatha, E. Akyol, K. Rose","doi":"10.1109/ISIT.2012.6284246","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6284246","url":null,"abstract":"The two most prevalent notions of common information are due to Wyner and Gács-Körner and both the notions can be stated as two different characteristic points in the lossless Gray-Wyner region. Although these quantities can be easily evaluated for random variables with infinite entropy (eg. continuous random variables), the operational significance underlying their definition is applicable only to the lossless framework. The primary objective of this paper is to generalize these two notions of common information to the lossy Gray-Wyner network, which extends the theoretical intuition underlying their definitions for general sources and distortion measures. We begin with the lossy generalization of Wyner's common information, defined as the minimum rate on the shared branch of the Gray-Wyner network at minimum sum rate when the two decoders reconstruct the sources subject to individual distortion constraints. We derive a complete single letter information theoretic characterization for this quantity and use it to compute the common information of symmetric bivariate Gaussian random variables. We then derive similar results to generalize Gács-Körner's definition to the lossy framework. These two characterizations allow us to carry the practical insight underlying the two notions of common information to general sources and distortion measures.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125204592","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
The dispersion of Slepian-Wolf coding 睡狼编码的分散
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284695
V. Tan, O. Kosut
{"title":"The dispersion of Slepian-Wolf coding","authors":"V. Tan, O. Kosut","doi":"10.1109/ISIT.2012.6284695","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6284695","url":null,"abstract":"We characterize second-order coding rates (or dispersions) for distributed lossless source coding (the Slepian-Wolf problem). We introduce a fundamental quantity known as the entropy dispersion matrix, which is analogous to scalar dispersion quantities. We show that if this matrix is positive-definite, the optimal rate region under the constraint of a fixed blocklength and non-zero error probability has a curved boundary compared to being polyhedral for the Slepian-Wolf case. In addition, the entropy dispersion matrix governs the rate of convergence of the non-asymptotic region to the asymptotic one. As a by-product of our analyses, we develop a general universal achievability procedure for dispersion analysis of some other network information theory problems such as the multiple-access channel. Numerical examples show how the region given by Gaussian approximations compares to the Slepian-Wolf region.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131512545","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
Random access in wireless X network: A deterministic view 无线X网络中的随机接入:确定性观点
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283632
Seyyed Hassan Mahboubi, Ehsan Ebrahimzadeh, A. Khandani
{"title":"Random access in wireless X network: A deterministic view","authors":"Seyyed Hassan Mahboubi, Ehsan Ebrahimzadeh, A. Khandani","doi":"10.1109/ISIT.2012.6283632","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283632","url":null,"abstract":"We study a 2-user symmetric X channel with random access capability for transmitters from a deterministic point of view. Transmitters can work in two modes of operation independent of each other, either active or inactive. There is an independent message from each transmitter to each receiver. It is aimed in this study at maximizing the throughput of this network over the set of rates which can be reliably communicated. To characterize this rate region, an information theoretic outer-bound is derived. Achievability is based on opportunistic signal transmission along with a linear pre-coding scheme. Once the rate region is exactly determined, throughput maximization can be solved as a linear programming problem.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133960223","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学术官方微信
小红书