{"title":"Differential Turbo Bell-Lab Layered Space-Time Architectures","authors":"Lingyang Song, A. Burr","doi":"10.1109/ITW2.2006.323846","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323846","url":null,"abstract":"Most research on differential MIMO is based on space-time block codes, aiming to achieve maximum transmit diversity and thus make the transmission more robust. However, spatial multiplexing schemes such as the Bell-Labs layered space time (BLAST) wireless architectures are more suitable for achieving high link capacity. To this end, in this paper, we derive a simple differential modulation scheme based on BLAST for any number of transmit antennas and receive antennas to realize high bandwidth efficiency. Further still, motivated by the principle of turbo BLAST, we report a differential turbo-BLAST scheme by a serially concatenated outer code. Much better performance can be observed","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"9 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":"114528251","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":"Non-binary Hybrid LDPC Codes: structure, decoding and optimization","authors":"L. Sassatelli, D. Declercq","doi":"10.1109/ITW2.2006.323759","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323759","url":null,"abstract":"In this paper, we propose to study and optimize a very general class of LDPC codes whose variable nodes belong to finite sets with different orders. We named this class of codes hybrid LDPC codes. Although efficient optimization techniques exist for binary LDPC codes and more recently for non-binary LDFC codes, they both exhibit drawbacks due to different reasons. Our goal is to capitalize on the advantages of both families by building codes with binary (or small finite set order) and non-binary parts of their factor graph representation. The class of hybrid LDPC codes is obviously larger than existing types of codes, which gives more degrees of freedom to find good codes where the existing codes show their limits. We gave two examples where hybrid LDPC codes show their interest","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"3 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":"125695366","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":"Cooperative Coding Using Parallel Concatenated LDPC Codes","authors":"H. Wen, Liang Zhou, Zhongpei Zhang","doi":"10.1109/ITW2.2006.323828","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323828","url":null,"abstract":"When mobiles cannot support multiple antennas due to size or other constraints, cooperative diversity is an efficient way to provide uplink transmit diversity. This paper presents a novel cooperative coding scheme in use of rate-compatible parallel concatenated LDPC codes. We evaluate its performance in terms of bit error rate. Simulation results show our scheme provides significant performance gains for a variety of channel conditions. By allowing different code rates and partitions, parallel concatenated LDPC coded cooperation provides a great degree of flexibility to adapt to channel conditions","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"15 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":"132306166","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":"Particle Filtering for Tracking Time-Varying Dispersion Channels in OFDM Systems","authors":"Wen Qin, Q. Peng","doi":"10.1109/ITW2.2006.323735","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323735","url":null,"abstract":"Orthogonal frequency-division multiplexing (OFDM) is robust against frequency selective fading due to the increase of the symbol duration. However, for mobile applications, channel time-variations in one OFDM symbol introduce inter-carrier interference (ICI) which degrades the performance. This becomes more severe as mobile speed, carrier frequency or OFDM symbol duration increases. Therefore, the performance of coherent OFDM systems greatly depends on the ability to accurately estimate the effective dynamic channel. In this paper, we analyze the ICI in OFDM systems when it operates over time-varying dispersion channels, and build an auto-regressive (AR) model of the channel dynamics based on the Jakes' model. A pilot symbol aided particle filter method is presented for the estimation and tracking of the channel. Finally, simulation result shows how the proposed method would improve the performance of OFDM systems","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"14 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":"132368818","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":"A Blind SNR Estimator Based on Iterative Subspace Tracking Algorithm for Digital Modulated Signals","authors":"Dan Sui, L. Ge, Qing Wang, Hui Zhang","doi":"10.1109/ITW2.2006.323708","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323708","url":null,"abstract":"Signal-to-noise ratio (SNR) is an important parameter in turbo soft decoding. In this paper a blind SNR estimator for digital modulated signals in the complex additive white Gaussian noise (AWGN) channel is proposed. The algorithm uses the eigenvalues of the covariance of the received signal. And the eigenvalues are estimated via an iterative subspace tracking algorithm, known as the projection approximation subspace tracking (PASTd) algorithm. The orthonormality of the estimated eigenvectors is guaranteed by the use of the Gram-Schmidt method. Computer simulations are performed for 2/4/8 PSK signals when the true SNR is in the range from 3 dB to 25 dB. Compared with the eigenvalue decomposition (ED)-based method, the proposed algorithm can achieve a comparable estimation but with a significantly reduced computational complexity","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":"130137434","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":"Stability Region of an Efficient Bidirectional Regenerative Half-duplex Relaying Protocol","authors":"T. Oechtering, H. Boche","doi":"10.1109/ITW2.2006.323825","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323825","url":null,"abstract":"In this work, a stability optimal rate allocation policy for two M/G/1-infin queues in a three node scenario with peak power constraints is characterized in closed form. Between two nodes, bidirectional communication is realized by a half-duplex decode-and-forward relay node. A centralized controller adapts slotwise the optimal discrete-time resource allocation according to the block-fading channel and queue state. In the memoryless Gaussian multiple access mode, the two nodes transmit their information to the relay node. In the memoryless Gaussian broadcast mode, the relay node forwards both information to their destinations. Since each destination node knows its own interference, efficient re-encoding increases the achievable broadcast rates. It results from \"standard\" Lyapunov drift technique that the stability region facilitated by the proposed rate allocation policy is equal to the ergodic achievable rate region","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":"131086304","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":"EXIT Chart Analysis of Space-Time Turbo Equalizer","authors":"P. Xiao, R. Carrasco, I. Wassell","doi":"10.1109/ITW2.2006.323711","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323711","url":null,"abstract":"In this paper, we study the performance of the turbo equalization schemes for systems with space-time block code (STBC) using the extrinsic information transfer (EXIT) chart, which is shown to be very useful for analyzing the convergence behavior of turbo equalizers, predicting the expected BER performance of the STBC coded systems, determining the SNR threshold for a target BER, as well as facilitating the proper choice of equalizers and channel codes for specific channel conditions","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":"132826343","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":"Improved Iterative Decoding with Analysis for Generalized Low-Density Codes","authors":"He Zheng, Huaying Zhou, Hanying Hu","doi":"10.1109/ITW2.2006.323787","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323787","url":null,"abstract":"In this paper, we propose an improved graph-based Chase-MP algorithm for iterative decoding of generalized low-density (GLD) codes, and also present analysis of the iterative decoding by using the Gaussian approximation. The simulation results on the additive white Gaussian noise (AWGN) channel show that the proposed algorithm can achieve good performance. During the iterative decoding analysis, we get a dynamic mathematical model of the Gaussian mean on iterations. As an application of the model derived, we compute decoding thresholds for several extended Bose-Chaudhuri-Hocquengnem (eBCH)-component GLD codes","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"09 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":"115377759","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":"Intrinsic Capacity of Random Scattered Spatial Communication","authors":"Leif Hanlen, Roy Timo","doi":"10.1109/ITW2.2006.323804","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323804","url":null,"abstract":"We consider information transfer under spatially constrained wireless communication through a scattered random environment. We show that the capacity of the channel is dominated by the free-space separation of the transmit and receive regions from the scattering environment. We show that the free-space separation produces a compact random channel operator whose information rate may be estimated via a water-pouring result. We apply our results to the dense-scattered spatial channel, to provide a novel upper-bound on the capacity of information transfer in a scattered environment","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"15 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":"124202252","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":"Self-Synchronization Strings in Huffman Equivalent Codes","authors":"Lei Cao","doi":"10.1109/ITW2.2006.323818","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323818","url":null,"abstract":"Possession of self-synchronization strings (SSSs) is a favorable feature of Huffman equivalent codes. In this paper, first, we show that SSSs in a Huffman equivalent code are in fact codewords or concatenation of codewords and then give a method to find those short SSSs without exhaustive search. Second, we present a closed-form solution to show how often the SSSs can be encountered in a coded sequence","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"192 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":"124271926","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}