2010 IEEE International Symposium on Information Theory最新文献_第9页

Fractal compression rate curves in lossless compression of balanced trees 平衡树无损压缩中的分形压缩率曲线

2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513277

Sang-youn Oh, J. Kieffer

{"title":"Fractal compression rate curves in lossless compression of balanced trees","authors":"Sang-youn Oh, J. Kieffer","doi":"10.1109/ISIT.2010.5513277","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513277","url":null,"abstract":"Let α be an integer ≥ 2. We define a finite rooted oriented tree to be α-balanced if (1) there is no vertex with > α children, (2) for each vertex having exactly α children, the subtrees rooted at these children have numbers of leaves differing by at most 1, and (3) each child of each internal vertex with < α children is a leaf. For each n ≥ 1, let H<inf>α</inf>(n) be logarithm to base two of the number of α-balanced trees having n leaves, which is roughly the codeword length needed to losslessly compress these trees via fixed-length binary codewords. Let {{x}} denote the fractional part of x. The compression rate curve C<inf>α</inf> is defined to be the set of limit points of the set of points of form ({{log<inf>α</inf> n}}, H<inf>α</inf>(n)/n). Two results about C<inf>α</inf> are presented. The first result is that C<inf>α</inf> is the graph of a unique realvalued nonconstant continuous function defined on [0, 1]. The second result is that C<inf>α</inf> is a 2-D fractal which is the attractor of an iterated function system S(α) consisting of α piecewise contractive 2-D mappings. For α = 2, 3, 4, we illustrate how a large number of points on C<inf>α</inf> can be rapidly generated via S(α).","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"7 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":"125643222","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

Robust approximate lattice alignment design for K-pairs quasi-static MIMO interference channels with imperfect CSI 具有不完全CSI的k对准静态MIMO干涉信道鲁棒近似点阵对准设计

2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513781

Huang Huang, V. Lau, Yinggang Du, Sheng Liu

{"title":"Robust approximate lattice alignment design for K-pairs quasi-static MIMO interference channels with imperfect CSI","authors":"Huang Huang, V. Lau, Yinggang Du, Sheng Liu","doi":"10.1109/ISIT.2010.5513781","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513781","url":null,"abstract":"In this paper, we consider a robust approximate lattice alignment design for K-pairs quasi-static MIMO interference channels. The traditional interference alignment on the signal space is infeasible for K > 3 and perfect channel state information (CSI) is required for all the alignment schemes in the literature, which is impractical in practice. Furthermore, the structured lattice, widely used in the practical communications, can create a structured interference space compared with random Gaussian symbols. However, the existing alignment schemes on the lattice codes either require infinite SNR or require symmetric interference channel coefficients. Furthermore, they all assume perfect CSI knowledge. In this paper, we propose an approximate lattice alignment scheme for general complex interference channels in the general SNR regimes as well as a two-stage decoding algorithm to decode the desired signal from the approximated structured interference space. We derive the achievable data rate based on the approximate lattice alignment scheme and formulated the precoder, equalizer as well as the interference quantization design as a mixed integer and continuous optimization problem. By exploiting specific problem structures and incorporating CSI errors in the design, we derive low complexity robust solutions. We show that the proposed scheme has significant gain compared with the existing baselines.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"42 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":"116014921","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

Diversity-multiplexing tradeoff in MIMO Gaussian interference channels MIMO高斯干扰信道中的分集-复用权衡

2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513470

Hsiao-feng Lu

引用次数: 1

Multiuser switched scheduling systems with per-user threshold and post-user selection 具有每个用户阈值和用户后选择的多用户交换调度系统

2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513467

Haewoon Nam, Mohamed-Slim Alouini

引用次数: 2

Patterns and exchangeability 模式和互换性

2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513581

N. Santhanam, M. Madiman

引用次数: 2

Diversity-multiplexing-tradeoff-optimal 2-user scheduling in an M-user Gaussian multiple-access channel m用户高斯多址信道中分集-复用-权衡-最优2用户调度

2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513478

Manav Garg, M. Varanasi

{"title":"Diversity-multiplexing-tradeoff-optimal 2-user scheduling in an M-user Gaussian multiple-access channel","authors":"Manav Garg, M. Varanasi","doi":"10.1109/ISIT.2010.5513478","DOIUrl":"https://doi.org/10.1109/ISIT.2010.5513478","url":null,"abstract":"The problem of user scheduling in a Gaussian i.i.d. Rayleigh faded multiple-access channel (MAC) is considered, whereby the receiver uses perfect knowledge of the channels of all the transmitters to select and schedule two-out-of-M users. The transmitters are assumed to have one antenna each and the two selected users are allocated equal rates. The receiver is equipped with Nr antennas. For user selection that is based on minimizing outage probability (say via an exhaustive search over (M over 2)possibilities), the diversity-multiplexing tradeoff (DMT) of the corresponding outage probability is computed. Moreover, a novel user-selection algorithmis proposed that achieves the same DMT as does the minimum outage probability method, but with only a O(M) complexity instead of O(M2) required for an exhaustive search to minimize outage probability. The DMT optimality of the proposed algorithm is also proved for 2-user scheduling in the dual M-user Gaussian broadcast channel assuming availability of global channel state information. Simulation results are presented which demonstrate that the proposed algorithm achieves an outage probability close to that of the exhaustive search.","PeriodicalId":147055,"journal":{"name":"2010 IEEE International Symposium on Information Theory","volume":"46 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":"124103464","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

Algorithms for memories with stuck cells 记忆细胞被卡住的算法

2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513786

L. A. Lastras-Montaño, A. Jagmohan, M. Franceschini

引用次数: 18

Non-parametric estimation of integral probability metrics 积分概率度量的非参数估计

2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513626

Bharath K. Sriperumbudur, K. Fukumizu, A. Gretton, B. Scholkopf, Gert R. G. Lanckriet

引用次数: 40

Rate-of-decay of probability of isolation in dense sensor networks with bounding constraints 具有边界约束的密集传感器网络中隔离概率的衰减率

2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513315

A. Singh, P. Elia, D. Slock

引用次数: 0

New Restricted Isometry results for noisy low-rank recovery 噪声低秩恢复的新约束等距结果

2010 IEEE International Symposium on Information Theory Pub Date : 2010-06-13 DOI: 10.1109/ISIT.2010.5513471

Karthika Mohan, Maryam Fazel

引用次数: 50