2006 IEEE Information Theory Workshop - ITW '06 Chengdu最新文献_第10页

Estimation of FWA MIMO Channels FWA MIMO信道估计

2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323713

P. Xiao, R. Carrasco, I. Wassell

引用次数: 11

A Framework for Determining Realistic Capacity Bounds for Distributed Antenna Systems 分布式天线系统实际容量边界的确定框架

2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323698

P. Marsch, S. Khattak, G. Fettweis

{"title":"A Framework for Determining Realistic Capacity Bounds for Distributed Antenna Systems","authors":"P. Marsch, S. Khattak, G. Fettweis","doi":"10.1109/ITW2.2006.323698","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323698","url":null,"abstract":"In the current research on future cellular networks, both classical MIMO concepts, such as schemes achieving spatial diversity or spatial multiplexing, and also virtual MIMO concepts are observed. In the latter, multiple base stations serving different cells are grouped to form distributed antenna systems that can be exploited as large MIMO systems. For example, concepts such as joint detection in the uplink and joint transmission in the downlink can be applied in order to cancel or suppress inter-cell interference. In this paper, we focus on the uplink and introduce a framework to investigate capacity bounds in cellular networks that use conventional single-cell links or employ multi-cell joint detection. We observe both an ideal hexagonal cell setup and also the existing GSM cell setup in downtown Dresden, while initially computing the capacities based on idealistic assumptions, and then successively introducing more and more non-idealistic aspects, to finally obtain a good estimate of performance bounds in a real-world system. The paper illustrates capacity bounds and thus the benefits of distributed antenna systems, as well as the methodology of efficiently and realistically modelling the physical layer of future cellular networks","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132820884","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}

引用次数: 56

Some New Results on Recursive Convolutional Codes and Their Applications 递归卷积码的一些新结果及其应用

2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323795

Qingchun Chen, W. Mow, P. Fan

{"title":"Some New Results on Recursive Convolutional Codes and Their Applications","authors":"Qingchun Chen, W. Mow, P. Fan","doi":"10.1109/ITW2.2006.323795","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323795","url":null,"abstract":"In this paper, a novel decomposition representation is firstly proposed to transform a recursive convolutional code into the serial concatenation of a unit-recursive-convolutional (URC) code with unit nominator polynomial and a non-recursive convolutional (NRC) code. Since the recursive convolutional (RC) code can be regarded as a linear system if all-zero initial state is assumed, the impulse response analysis (IRA) can be applied to reveal the characteristics of the URC code, as well as the RC code. Then, a linear-algebra-like analysis method is developed to enable the computation of the impulse response via the finite field matrix manipulation. It is shown that the equivalent block generation matrix can be used to characterize an RC code completely. Moreover, there is a certain cycle (or period) in the impulse response of any RC code, which corresponds to the state transition cycle of its constituent URC code. It is disclosed that the Hamming weight in every cycle equals half of the cycle length plus one if the denominator polynomial is primitive. Furthermore, the generation matrix of its constituent URC code could be utilized to determine the ending state of an RC code for any input. Finally, it is revealed that the minimum Hamming weight of an RC code can be calculated from the generation matrix of the reverse RC code under some input constraints, thus providing an alternative algorithm for the modified Viterbi algorithm proposed for the weight spectrum calculation of turbo codes","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131405375","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

Asymptotic Mean-Square Optimality of Belief Propagation for Sparse Linear Systems 稀疏线性系统信念传播的渐近均方最优性

2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323786

Dongning Guo, Chih-Chun Wang

引用次数: 75

On Error Rate in Hypothesis Testing based on Universal Compression Algorithms 基于通用压缩算法的假设检验错误率研究

2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323819

A.K. Gopalan, R. Bansal

引用次数: 0

A Generalization of the Parallel Error Correcting Codes 并行纠错码的一种推广

2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323793

H. Yagi, T. Matsushima, S. Hirasawa

引用次数: 2

Outage Performance Analysis of Correlated MIMO Optimum Combining Systems with and without Co-Channel Interference 有无同信道干扰相关MIMO最优组合系统的中断性能分析

2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323801

Dianwu Yue, Q.T. Zhang

引用次数: 11

Application of the Low Density Parity-Check Codes in the MBC System 低密度校验码在MBC系统中的应用

2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323771

Rong Sun, Jingwei Liu, A. Fukuda, K. Mukumoto, Xinmei Wang

引用次数: 0

LDPC-Based Secure Wireless Communication with Imperfect Knowledge of the Eavesdropper's Channel 不完全了解窃听者信道的ldpc安全无线通信

2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323778

M. Bloch, J. Barros, M. Rodrigues, S. McLaughlin

引用次数: 5

Outsourcing the Complexity of Detection in MIMO Channels MIMO信道中检测复杂性的外包

2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323709

R. de Miguel, O. Shental, R. Muller, I. Kanter

引用次数: 1