2008 Information Theory and Applications Workshop最新文献_第4页

Source coding diversity and multiplexing strategies for a 2X2 MIMO system 2X2 MIMO系统的源编码分集和多路复用策略

2008 Information Theory and Applications Workshop Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601034

M. Zoffoli, J. Gibson, M. Chiani

引用次数: 3

Adaptive feedback rate control in MIMO broadcast systems with user scheduling 带用户调度的MIMO广播系统自适应反馈速率控制

2008 Information Theory and Applications Workshop Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601033

R. Zakhour, D. Gesbert

引用次数: 6

Percolation processes and wireless network resilience 渗透过程和无线网络弹性

2008 Information Theory and Applications Workshop Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601090

Z. Kong, E. Yeh

引用次数: 6

Non-binary LDPC codes vs. Reed-Solomon codes 非二进制LDPC码与Reed-Solomon码

2008 Information Theory and Applications Workshop Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601044

Bo Zhou, Li Zhang, Jingyu Kang, Qin Huang, Y. Tai, Shu Lin, Meina Xu

{"title":"Non-binary LDPC codes vs. Reed-Solomon codes","authors":"Bo Zhou, Li Zhang, Jingyu Kang, Qin Huang, Y. Tai, Shu Lin, Meina Xu","doi":"10.1109/ITA.2008.4601044","DOIUrl":"https://doi.org/10.1109/ITA.2008.4601044","url":null,"abstract":"This paper investigates the potential of non-binary LDPC codes to replace widely used Reed-Solomon (RS) codes for applications in communication and storage systems for combating mixed types of noise and interferences. The investigation begins with presentation of four algebraic constructions of RS-based non-binary quasi-cyclic (QC)-LDPC codes. Then, the performances of some codes constructed based on the proposed methods with iterative decoding are compared with those of RS codes of the same lengths and rates decoded with the hard-decision Berlekamp-Massey (BM)-algorithm and the algebraic soft-decision Kotter-Vardy (KV)-algorithm over both the AWGN and a Rayleigh fading channels. Comparison shows that the constructed non-binary QC-LDPC codes significantly outperform their corresponding RS codes decoded with either the BM-algorithm or the KV-algorithm. Most impressively, the orders of decoding computational complexity of the constructed non-binary QC-LDPC codes decoded with 5 and 50 iterations of a Fast Fourier Transform based sum-product algorithm are much smaller than those of their corresponding RS codes decoded with the KV-algorithm, while achieve 1:5 to 3 dB coding gains. The comparison shows that well designed non-binary LDPC codes have a great potential to replace RS codes for some applications in communication or storage systems, at least before a very efficient algorithm for decoding RS codes is devised.","PeriodicalId":345196,"journal":{"name":"2008 Information Theory and Applications Workshop","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133033741","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}

引用次数: 23

On power-of-choice in downlink transmission scheduling 下行传输调度中的功率选择问题

2008 Information Theory and Applications Workshop Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601013

M. Alanyali, M. Dashouk

引用次数: 8

Reduction of ML decoding complexity for MIMO Sphere Decoding, QOSTBC, and OSTBC 减少MIMO球面解码、QOSTBC和OSTBC的ML解码复杂度

2008 Information Theory and Applications Workshop Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601014

L. Azzam, E. Ayanoglu

{"title":"Reduction of ML decoding complexity for MIMO Sphere Decoding, QOSTBC, and OSTBC","authors":"L. Azzam, E. Ayanoglu","doi":"10.1109/ITA.2008.4601014","DOIUrl":"https://doi.org/10.1109/ITA.2008.4601014","url":null,"abstract":"In this paper, we discuss three applications of the QR decomposition algorithm to decoding in a number of Multi-Input Multi-Output (MIMO) systems. In the first application, we propose a new structure for MIMO Sphere Decoding (SD). We show that the new approach achieves 80% reduction in the overall complexity compared to conventional SD for a 2 times 2 system, and almost 50% reduction for the 4 times 4 and 6 times 6 cases. In the second application, we propose a low complexity Maximum Likelihood Decoding (MLD) algorithm for quasi-orthogonal space-time block codes (QOSTBCs). We show that for N = 8 transmit antennas and 16-QAM modulation scheme, the new approach achieves > 97% reduction in the overall complexity compared to conventional MLD, and > 89% reduction compared to the most competitive reported algorithms in the literature. This complexity gain becomes greater when the number of transmit antennas (N) or the constellation size (L) becomes larger. In the third application, we propose a low complexity Maximum Likelihood Decoding (MLD) algorithm for orthogonal space-time block codes (OSTBCs) based on the real-valued lattice representation and QR decomposition. For a system employing the well-known Alamouti OSTBC and 16-QAM modulation scheme, the new approach achieves > 87% reduction in the overall complexity compared to conventional MLD. Moreover, we show that for square L-QAM constellations, the proposed algorithm reduces the decoding computational complexity from O(LN/2) for conventional MLD to O(L) for systems employing QOSTBCs and from O(L) for conventional MLD to O(radicL) for those employing OSTBCs without sacrificing the performance.","PeriodicalId":345196,"journal":{"name":"2008 Information Theory and Applications Workshop","volume":"385 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125507543","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}

引用次数: 15

Nash implementation for resource allocation network problems with production 纳什实现的资源分配与生产网络问题

2008 Information Theory and Applications Workshop Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601079

T. Stoenescu, J. Ledyard

引用次数: 7

A coalitional game model for spectrum pooling in wireless data access networks 无线数据接入网频谱池的联合博弈模型

2008 Information Theory and Applications Workshop Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601066

S. Sarkar, Chanan Singh, Anurag Kumar

{"title":"A coalitional game model for spectrum pooling in wireless data access networks","authors":"S. Sarkar, Chanan Singh, Anurag Kumar","doi":"10.1109/ITA.2008.4601066","DOIUrl":"https://doi.org/10.1109/ITA.2008.4601066","url":null,"abstract":"We consider a setting in which several operators offer downlink wireless data access services in a certain geographical region. Each operator deploys several base stations or access points, and registers some subscribers. In such a situation, if operators pool their infrastructure, and permit the possibility of subscribers being served by any of the cooperating operators, then there can be overall better user satisfaction, and increased operator revenue. We use coalitional game theory to investigate such resource pooling and cooperation between operators.We use utility functions to model user satisfaction, and show that the resulting coalitional game has the property that if all operators cooperate (i.e., form a grand coalition) then there is an operating point that maximizes the sum utility over the operators while providing the operators revenues such that no subset of operators has an incentive to break away from the coalition. We investigate whether such operating points can result in utility unfairness between users of the various operators. We also study other revenue sharing concepts, namely, the nucleolus and the Shapely value. Such investigations throw light on criteria for operators to accept or reject subscribers, based on the service level agreements proposed by them. We also investigate the situation in which only certain subsets of operators may be willing to cooperate.","PeriodicalId":345196,"journal":{"name":"2008 Information Theory and Applications Workshop","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130238136","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}

引用次数: 19

Local pooling conditions for joint routing and scheduling 联合路由调度的局部池化条件

2008 Information Theory and Applications Workshop Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601094

Andrew. Brzezinski, Andrew. Brzezinski, G. Zussman, E. Modiano

引用次数: 18

Isoperimetrically Pareto-optimal shapes on the hexagonal grid 六边形网格上的等周帕累托最优形状

2008 Information Theory and Applications Workshop Pub Date : 2008-08-15 DOI: 10.1109/ITA.2008.4601018

Daniel Vainsencher, A. Bruckstein

引用次数: 0