{"title":"A Modified Iterative Joint Source-Channel Decoding Algorithm Based on LDPC Codes and HMMs","authors":"Rongke Liu, Jie Ying Gao, Xiaolin Zhang","doi":"10.1109/ITW2.2006.323823","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323823","url":null,"abstract":"A modified joint source-channel decoding (JSCD) algorithm based on low-density parity-check (LDPC) codes and hidden Markov estimation has been presented and extended to applying over Rayleigh fading channels. The proposed algorithm utilizes the source residual redundancy lack of any priori information of the source parameters, and the modifications employ the self-checking and convergence mechanisms of LDPC codes in adjusting the error probability of the hidden Markov model (HMM). To show the validation of the proposed JSCD methods, we also give a framework for the density evolution analysis for JSCD. Simulation results show that the joint decoding scheme on Rayleigh fading channels greatly reduces the number of iterations and improves the system performance more than 0.7 dB. Moreover, the modified JSCD algorithm leads to the joint decoder to converge at least 10% faster than the unmodified method without any degradation in the decoding performance","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"51 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":"114892283","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":"On Separation for Multiple Access Channels","authors":"S. Ray, M. Médard, M. Effros, R. Koetter","doi":"10.1109/ITW2.2006.323829","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323829","url":null,"abstract":"We examine the issue of separation for multiple access channels. We demonstrate that source-channel separation holds for noisy multiple access channels, when the channel operates over a common finite field. This robustness of separation is predicated on the fact that noise and inputs are independent, and we examine the loss from failure of separation when noise is input dependent.","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"80 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":"125418659","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}
Chuan-Gang Zhao, Jin-Sheng Yuan, Xue-Hong Lin, Jia-ru Lin
{"title":"Improvement of Shuffled Iterative Decoding","authors":"Chuan-Gang Zhao, Jin-Sheng Yuan, Xue-Hong Lin, Jia-ru Lin","doi":"10.1109/ITW2.2006.323768","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323768","url":null,"abstract":"An improved version of shuffled belief propagation of iterative decoding of LDPC codes is proposed. The proposed scheme can speed up the convergence of iterative decoding. Simulation results verified our conclusions","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"25 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":"126775745","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":"Power Allocation for Practically Coded IDMA Systems over Broadcast Channels","authors":"Peng Wang, Qi Chen, L. Ping, Lihai Liu","doi":"10.1109/ITW2.2006.323733","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323733","url":null,"abstract":"This paper presents a power allocation technique based on an interior-point method (IPM) for practically coded interleave-division multiple-access (IDMA) systems over broadcast channels. Numerical results show that the proposed technique is efficient and significant performance improvements (compared with orthogonal systems such as TDMA and FDMA) are achievable by applying iterative multi-user detection (MUD) to IDMA in fading channels, even with a fairly small number of simultaneous users. This finding has useful practical implications for broadcast systems","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"78 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":"121744305","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":"On the Relation between Linear Dispersion and Generic Network Code","authors":"Pui-Wing Kwok, Raymond W. Yeung","doi":"10.1109/ITW2.2006.323832","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323832","url":null,"abstract":"Four classes of linear network codes have been introduced in the recent work of Yeung et al., namely linear multicast, linear broadcast, linear dispersion and generic linear network code, where each of these four classes of codes is strictly stronger than the preceding one. In this paper, we establish a nontrivial relation between linear dispersion and generic linear network code","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"102 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":"121832416","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 Simple Semipublic Hiding Scheme Applied for IP Trace Back in Noisy Channel","authors":"Jia Hou, M. Lee, Jin-Gyun Chung","doi":"10.1109/ITW2.2006.323738","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323738","url":null,"abstract":"Defending against distributed denial-of-service (DDoS) attacks is one of the hardest security problems on the Internet. In this paper, we propose a simple semipublic hiding algorithm applied for the IP trace back over a noisy networking channel. This approach is capable of tracking back the attacks as quickly as possible. Our techniques feature low network and router overhead, and support incremental deployment","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"2 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":"122062042","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":"Full-Diversity Finite-Constellation 4 x 4 Differential STBC Based on Finite Quaternion Groups","authors":"A. Radulescu, R. Calderbank, S. Schwartz","doi":"10.1109/ITW2.2006.323838","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323838","url":null,"abstract":"This paper presents a novel way to construct unitary space-time block codes suitable for differential modulation. The new codes rely on quaternionic algebra to achieve finite constellation. Among these, a particular code with a codebook of size 48 is studied and shown to be differentially decodable by means of two symbol-by-symbol decoders (each symbol having 2 bits) and one larger decoder for a size 16 constellation. Simulations in a realistic WiMAX environment show the proposed code to outperform an optimized size 48 diagonal MPSK code by 1 dB. Ways to counter reduced performance in highly mobile environments are also suggested","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"303 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":"131899243","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":"On the Synchronization of Physical-Layer Network Coding","authors":"Shengli Zhang, S. Liew, P. P. Lam","doi":"10.1109/ITW2.2006.323830","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323830","url":null,"abstract":"When data are transmitted in a wireless network, they reach the target receiver as well as other receivers in the neighborhood. Rather than a blessing, this attribute is treated as an interference-inducing nuisance in most wireless networks today (e.g., IEEE 802.11). Physical-layer network coding (PNC), however, has been proposed to take advantage of this attribute. Unlike \"conventional\" network coding which performs arithmetic coding on digital bit streams after they are decoded, PNC makes use of the additive nature of simultaneously arriving electromagnetic (EM) waves and applies the network coding arithmetic at the physical layer. As a result, the destructive effect of interference is eliminated and the capacity of networks is boosted significantly. A key requirement of PNC is synchronization among nodes, which has not been addressed previously. This is the focus of this paper. Specifically, we investigate the impact of imperfect synchronization (i.e., finite synchronization errors) on PNC. We show that with BPSK modulation, PNC still yields significantly higher capacity than straightforward network coding when there are synchronization errors. And interestingly, this remains to be so even in the extreme case where synchronization is not performed at all","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":"130558835","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":"Interleave-Division Multiple-Access Based Broadband Wireless Networks","authors":"Qian Huang, K. Ko, Peng Wang, L. Ping, S. Chan","doi":"10.1109/ITW2.2006.323850","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323850","url":null,"abstract":"This paper studies the interleave-division multiple-access (IDMA) based broadband wireless network and its MAC protocol for supporting high data rates. The performance is evaluated by evolution and simulation. It is demonstrated that the IDMA technology can efficiently mitigate the interference among users and support high data rates without compromising the required quality of service. The results also demonstrate that multi-user gain can be achieved in IDMA systems where each user has a rate constraint. This means that given the same sum-rate, the more number of users in a system is, the less average transmitted power per user is required","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"51 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":"115076534","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 adaptive LDPC codes for frequency selective channels: code construction and iterative decoding","authors":"J. Boutros, A. Ghaith, Y. Yi","doi":"10.1109/ITW2.2006.323784","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323784","url":null,"abstract":"We propose a new type of non-binary LDPC codes defined over multiple Galois fields. The so called multi-Galois LDPC code can adapt to the profile of a frequency selective channel and is suitable for multi-carrier transmissions with quadrature amplitude modulations","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"60 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":"129878120","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}