{"title":"On the diversity, multiplexing, and array gain tradeoff in MIMO channels","authors":"L. G. Ordóñez, D. Palomar, J. Fonollosa","doi":"10.1109/ISIT.2010.5513472","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513472","url":null,"abstract":"Following the seminal work of Zheng and Tse on the diversity and multiplexing tradeoff (DMT) of MIMO channels, in this paper we introduce the array gain to further investigate the fundamental relation between transmission rate and reliability in MIMO systems. The array gain gives information on the power offset that results from exploiting channel state information at the transmitter or, simply, because of the channel model. Hence, the diversity, multiplexing, and array gain (DMA) tradeoff is able to cope with the limitations of the original DMT and provide with operational meaning in the sense that the DMA tradeoff of a particular system can be directly translated into a parameterized characterization of its associated outage probability performance. As a first step towards this objective, we present in this paper the fundamental DMA tradeoff achievable by any scheme in uncorrelated Rayleigh block-fading MIMO channels.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"49 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":"132396548","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}
{"title":"Linear estimate-based look-ahead path metric for efficient soft-input soft-output tree detection","authors":"J. Choi, B. Shim, A. Singer","doi":"10.1109/ISIT.2010.5513641","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513641","url":null,"abstract":"In this paper, we propose a new path metric, which improves performance of soft-input soft-output tree detection for iterative detection and decoding (IDD) systems. While the conventional path metric accounts for the contribution of symbols on a visited path due to the causal nature of tree search, the new path metric reflect the contribution of unvisited paths using an unconstrained soft estimate of undecided symbols. This path metric, referred to as a linear estimate-based look-ahead (LE-LA) path metric is applied to a soft-input soft-output M-algorithm that finds a list of promising symbol candidates and computes a posteriori probability of each entry of the symbol vector using the candidate list found. Through the analysis of a probability of correct path loss (CPL) and computer simulations, we show performance gain of the LE-LA path metric over the conventional path metric.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"101 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":"131943247","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}
Kittipong Kittichokechai, T. Oechtering, M. Skoglund, R. Thobaben
{"title":"Source and channel coding with action-dependent partially known two-sided state information","authors":"Kittipong Kittichokechai, T. Oechtering, M. Skoglund, R. Thobaben","doi":"10.1109/ISIT.2010.5513554","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513554","url":null,"abstract":"We consider a source coding problem where the encoder can take actions that influence the availability and/or quality of the side information which is available partially and noncausally at the encoder and the decoder. We then characterize the associated achievable tradeoffs between rate, distortion, and cost. In addition, we state and discuss a capacity result for the channel coding dual problem where the formula duality of special cases is recognized.","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":"125496112","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}
{"title":"Randomized lattice decoding: Bridging the gap between lattice reduction and sphere decoding","authors":"Shuiyin Liu, Cong Ling, D. Stehlé","doi":"10.1109/ISIT.2010.5513543","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513543","url":null,"abstract":"Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided decoding significantly reduces the decoding complexity, but exhibits a widening gap to ML performance as the dimension increases. To bridge the gap between them, this paper presents randomized lattice decoding based on Klein's randomized algorithm, which is a randomized version of Babai's nearest plane algorithm. The technical contribution of this paper is two-fold: we analyze and optimize the performance of randomized lattice decoding resulting in reduced decoding complexity, and propose a very efficient implementation of random rounding. Simulation results demonstrate near-ML performance achieved by a moderate number of calls, when the dimension is not too large.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"26 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":"126794626","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}
{"title":"Universal source coding for multiple decoders with side information","authors":"S. Kuzuoka, Akisato Kimura, T. Uyematsu","doi":"10.1109/ISIT.2010.5513306","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513306","url":null,"abstract":"A multiterminal lossy source coding problem, which includes various problems such as the Wyner-Ziv problem and the complementary delivery problem as special cases, is considered. It is shown that any point in the achievable rate-distortion region can be attained even if the source statistics are not known.","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":"121438394","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}
{"title":"On the excess distortion exponent of the quadratic-Gaussian Wyner-Ziv problem","authors":"Y. Kochman, G. Wornell","doi":"10.1109/ISIT.2010.5513294","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513294","url":null,"abstract":"An achievable excess distortion exponent for compression of a white Gaussian source by dithered lattice quantization is derived. We show that for a required distortion level close enough to the rate-distortion function, and in the high-rate limit, the exponent equals the optimal quadratic-Gaussian excess distortion exponent. Using this approach, no further loss is incurred by the presence of any source interference known at the decoder (“Wyner-Ziv side-information”). The derivation of this achievable exponent involves finding the exponent of the probability that a combination of a spherically-bounded vector and a Gaussian vector leaves the Voronoi cell of a good lattice.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"77 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":"126262273","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}
{"title":"Cross correlation of nonbinary niho-type sequences","authors":"Jinquan Luo","doi":"10.1109/ISIT.2010.5513722","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513722","url":null,"abstract":"In this paper the correlation distribution of a p-ary m-sequence s and its decimated sequence s(dt + l) with d = (p<sup>m</sup>+1 over 2) <sup>2</sup> and 0 ≤ l ≤ d − 1 is determined.","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":"121018109","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}
{"title":"Relay-aided interference alignment: Feasibility conditions and algorithm","authors":"Haishi Ning, Cong Ling, K. Leung","doi":"10.1109/ISIT.2010.5513346","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513346","url":null,"abstract":"Consider a (1 × 1, )K symmetric wireless interference network where K single-antenna user-pairs want to achieve degrees of freedom each. It has been proved that it is almost surely infeasible to achieve interference alignment without symbol extension. While it was proved relays can not increase the degree of freedom of wireless interference networks, we show this does not preclude the usefulness of using relays to construct practical solutions to approach interference alignment with finite symbol extensions. Feasibility conditions for relay-aided interference alignment are analyzed and an example about how to design the relaying functions to approach interference alignment is given. Simulation results also justify the use of relays as a practical means to do interference alignment with finite symbol extensions.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"77 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":"116698961","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}
{"title":"On group network codes: Ingleton-bound violations and independent sources","authors":"W. Mao, Matthew Thill, B. Hassibi","doi":"10.1109/ISIT.2010.5513749","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513749","url":null,"abstract":"In principle, network codes derived from non-Abelian groups can be used to attain every point in the capacity region of wired acyclic networks. However, group codes derived from a particular group, and its subgroups, is useful only if it can model independent sources, as well as violate the Ingleton bound which restricts the capacity region obtainable by linear network codes. We study both the independent source and the Ingleton-violating requirement for subgroups of the groups PGL(2, ρ) and GL(2, ρ) with primes ρ ≥ 5. For both these groups we demonstrate that the requirements can be met, which suggests that PGL(2, ρ) and GL(2, ρ) are rich enough groups to construct network codes superior to linear ones. We also construct a model for independent sources using the direct product of the aforementioned groups.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"61 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":"121811646","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}
{"title":"On the capacity region of fading Z-interference channels without CSIT","authors":"Yan Zhu, Dongning Guo","doi":"10.1109/ISIT.2010.5513340","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513340","url":null,"abstract":"This work studies the capacity region of ergodic fading Gaussian interference channels, where only one of the users is subject to interference from the other user, and that channel state information is not available at transmitters (no CSIT). In particular, inner and outer bounds of the capacity region are obtained. The inner bound is achieved by artificially creating layers in the signaling of the interference-free user. The outer bound is developed by characterizing the trade-off between the rate gain of the interference-free user and the rate loss of the other user due to interference. Furthermore, the gap between the inner and outer bounds is no more than 12.772 bits per channel use per user, regardless of the signal-to-noise ratios and fading statistics.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"843 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":"121824983","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}