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

2006 IEEE Information Theory Workshop - ITW '06 Chengdu最新文献

筛选
英文 中文
Turbo Equalization For Space-Time Block Coded FWA Systems 时空分组编码FWA系统的Turbo均衡
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW.2006.322894
P. Xiao, R. Carrasco, I. Wassell
{"title":"Turbo Equalization For Space-Time Block Coded FWA Systems","authors":"P. Xiao, R. Carrasco, I. Wassell","doi":"10.1109/ITW.2006.322894","DOIUrl":"https://doi.org/10.1109/ITW.2006.322894","url":null,"abstract":"The use of multiple antennas in combination with advanced detection techniques, such as turbo equalization is an effective means for a Fixed Wireless Access (FWA) system to provide high quality and high data rate services. Alamouti's space-time block code (STBC) with two transmit antennas and one or two receive antennas over frquency selective FWA SUI-3 channels is considered in this paper. We propose a turbo equalization algorithm that aims at exploiting the multipath diversity and reducing the effect of intersymbol iterference (ISI), and in the meantime, keeping the desired feature of the original Alamouti detection algorithm, i.e, achieving spatial diversity with simple linear processing.","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"21 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":"114496471","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
Non-Coherent LDPC Decoding on Graphs 图上的非相干LDPC解码
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323770
A. Scherb, K. Kammeyer
{"title":"Non-Coherent LDPC Decoding on Graphs","authors":"A. Scherb, K. Kammeyer","doi":"10.1109/ITW2.2006.323770","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323770","url":null,"abstract":"Within this paper graph based non-coherent decoding algorithms for LDPC encoded systems are proposed. We study a class of LDPC codes suitable for non-coherent detection. On the basis of the related graphs a non-coherent decoding algorithm with variable trade-off between computational complexity and BER performance is derived. The proposed scheme is also capable to deal with pilot symbols if available. Finally, the excellent performance of the proposed methods is verified by simulations","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"34 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":"123436384","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}
引用次数: 3
Can Punctured Rate-1/2 Turbo Codes Achieve a Lower Error Floor than their Rate-1/3 Parent Codes? 被刺破的速率为1/2的Turbo码能比它们的速率为1/3的父码实现更低的错误层吗?
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323763
Ioannis Chatzigeorgiou, M. Rodrigues, I. Wassell, R. Carrasco
{"title":"Can Punctured Rate-1/2 Turbo Codes Achieve a Lower Error Floor than their Rate-1/3 Parent Codes?","authors":"Ioannis Chatzigeorgiou, M. Rodrigues, I. Wassell, R. Carrasco","doi":"10.1109/ITW2.2006.323763","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323763","url":null,"abstract":"In this paper we concentrate on rate-1/3 systematic parallel concatenated convolutional codes and their rate-1/2 punctured child codes. Assuming maximum-likelihood decoding over an additive white Gaussian channel, we demonstrate that a rate-1/2 non-systematic child code can exhibit a lower error floor than that of its rate-1/3 parent code, if a particular condition is met. However, assuming iterative decoding, convergence of the non-systematic code towards low bit-error rates is problematic. To alleviate this problem, we propose rate-1/2 partially-systematic codes that can still achieve a lower error floor than that of their rate-1/3 parent codes. Results obtained from extrinsic information transfer charts and simulations support our conclusion","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"16 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":"126442265","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}
引用次数: 11
Robust Resource Allocation 稳健的资源分配
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323695
M. Schubert, H. Boche
{"title":"Robust Resource Allocation","authors":"M. Schubert, H. Boche","doi":"10.1109/ITW2.2006.323695","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323695","url":null,"abstract":"We propose a framework for robust power allocation based on worst-case interference functions, which are determined by a parameter-dependent coupling matrix. The power allocation is optimized with respect to the worst-case interference. One main contribution of this paper is to show that these worst-case interference functions have useful properties, which can be exploited for the design of an efficient iterative algorithm. The proposed iteration minimizes the total transmit power while the worst-case SINR of each user achieves a given target value. By analyzing the properties of the interference functions, we show monotonicity and super-linear global convergence, even though the original problem is non-convex. The iteration always requires less steps than an alternative fixed-point iteration, which has only linear convergence.","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"1 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":"130224334","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}
引用次数: 11
Code Design for Combined Space Time Trellis Codes and Beamforming on Slow Fading Channels 慢衰落信道中空时格码与波束形成相结合的编码设计
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323844
Yonghui Li, B. Vucetic
{"title":"Code Design for Combined Space Time Trellis Codes and Beamforming on Slow Fading Channels","authors":"Yonghui Li, B. Vucetic","doi":"10.1109/ITW2.2006.323844","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323844","url":null,"abstract":"The performance of space-time codes can be dramatically improved by weighting transmitted signals. In this paper, we present the performance analysis of the combined space time trellis codes and beamforming, referred to as weighted space time trellis codes (WSTTCs). Contrary to the standard STTC, WSTTCs can achieve a full diversity order regardless of STTCs adopted at the transmitter. A new design criterion for WSTTCs has been proposed and the good codes based on this criterion have been found by computer search. Simulation results show that the proposed 4, 16, and 64-state WSTTCs not only outperform the standard STTCs with the same number of state by more than 2 dB, but are also superior by about 0.3 dB, 1.1 dB and 2 dB to the conventional beamforming scheme, which allocates full power in the direction of the eigenvector corresponding to the maximum singular value of the channel matrix","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"104 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":"116116860","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
Performance Evaluation of Spatial Multiplexing Systems over Finite Scattering Channel 有限散射信道下空间复用系统性能评价
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323730
Li X. Zhang, A. Burr, M. Darnell, Ling-Zhen Song
{"title":"Performance Evaluation of Spatial Multiplexing Systems over Finite Scattering Channel","authors":"Li X. Zhang, A. Burr, M. Darnell, Ling-Zhen Song","doi":"10.1109/ITW2.2006.323730","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323730","url":null,"abstract":"This paper evaluates the BER performance of a spatial multiplexing system over finite scattering channel. We employ a `DBLAST-like' space-time convolutional code, which directly maps a convolutional code frame to a space-time code word. The finite scatterers channel model is used to account for the limited multipath scattering which occurs in practical channels. In the receiver, iterative joint MMSE detection, decoding and interference cancellation is applied to improve the system performance. Numerical results are presented to illustrate the performance of this spatial multiplexing system over this channel. We analyse the impact of this channel model on the system performance and examine the performance improvement obtained by the use of the iterative receiver","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"42 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121001647","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}
引用次数: 1
Adaptive TF-domain Spread MC-CDMA System in Frequency-Selective Rayleigh Fading Channels 频率选择瑞利衰落信道中自适应tf域扩展MC-CDMA系统
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323736
Li Hao, P. Fan
{"title":"Adaptive TF-domain Spread MC-CDMA System in Frequency-Selective Rayleigh Fading Channels","authors":"Li Hao, P. Fan","doi":"10.1109/ITW2.2006.323736","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323736","url":null,"abstract":"In this paper, an adaptive time-frequency domain (TF-domain) spread multicarrier code-division multiple-access (MC-CDMA) system is considered for application in downlink of cellular radio network over frequency selective fading channels. In the proposed system, the overall system spreading factor (SF), defined as the product of the T-domain SF and F-domain SF, is fixed but can be dynamically allocated to F-domain and T-domain according to the number of active users. It is shown in this paper that one can achieve a tradeoff between the multiple access interference (MAI) level and frequency diversity gain by adaptively adjusting the T-and F-domain SFs, thus resulting optimum bit error rate (BER) performance.","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"109 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":"121439845","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
Pilot Frequency Nulling based Channel Estimation for Multiple QR-Decompositions with Transposed Channel Matrix SDM/OFDM 基于导频零化的转置信道矩阵SDM/OFDM多重qr分解信道估计
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323712
C. Ahn, M. Taromaru
{"title":"Pilot Frequency Nulling based Channel Estimation for Multiple QR-Decompositions with Transposed Channel Matrix SDM/OFDM","authors":"C. Ahn, M. Taromaru","doi":"10.1109/ITW2.2006.323712","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323712","url":null,"abstract":"In MIMO systems, MLD/SDM provides the best BER performance. However, the complexity of MLD increases exponentially according to the modulation level and number of transmit antenna branches. Moreover, the preamble structure is also a serious problem. With increasing the number of transmit antenna branches, more pilot symbol is required to estimate the accurate channel state information (CSI). In this case, the effective transmission rate is degraded and a different packet structure is also required. To reduce these problems, in this paper, we propose the pilot frequency nulling based channel estimation scheme for multiple QR-decompositions with transposed channel matrix SDM/OFDM","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"101 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":"132292933","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
On Decoding Failure Probabilities for Linear Block Codes on the Binary Erasure Channel 二进制擦除信道上线性分组码解码失败概率的研究
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323746
J. Weber, K. Abdel-Ghaffar
{"title":"On Decoding Failure Probabilities for Linear Block Codes on the Binary Erasure Channel","authors":"J. Weber, K. Abdel-Ghaffar","doi":"10.1109/ITW2.2006.323746","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323746","url":null,"abstract":"It has been claimed that the performance of a linear block code under iterative decoding on the binary erasure channel is determined by the stopping distance, i.e., the size of the smallest non-empty stopping set in the associated Tanner graph. Indeed, this is true from the perspective of code word retrieval. However, we show that with respect to the retrieval of just the information bits within the code word, the stopping distance may not be the main performance indicator since the smallest non-empty stopping sets might not hit the information set. We present expressions for decoding failure probabilities for code/information words/bits under optimal or iterative decoding and demonstrate the importance of the choice of the set of bits carrying the information for a fixed code with a fixed decoder","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"76 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":"130430281","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
A Graph-Based Iterative Gaussian Detector for Frequency-Selective MIMO Channels 频率选择MIMO信道中基于图的迭代高斯检测器
2006 IEEE Information Theory Workshop - ITW '06 Chengdu Pub Date : 2006-10-01 DOI: 10.1109/ITW2.2006.323701
T. Wo, J. C. Fricke, P. Hoeher
{"title":"A Graph-Based Iterative Gaussian Detector for Frequency-Selective MIMO Channels","authors":"T. Wo, J. C. Fricke, P. Hoeher","doi":"10.1109/ITW2.2006.323701","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323701","url":null,"abstract":"In this paper, we propose a high-performance low-complexity data detector for frequency-selective multi-input multi-output (MIMO) channels. This detector applies the principles of factor graph and Gaussian approximation in modeling interference. Compared to the available algorithms based on Gaussian approximation, the proposed detector goes one step further by applying an independence approximation, which reduces the complexity significantly while incurring only a marginal performance loss. The amount of operations needed is polynomial in the number of receive antennas, the number of transmit antennas, and the channel memory length","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"115 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":"132874293","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}
引用次数: 17
首页 上一页 下一页 尾页
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学术官方微信