{"title":"Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms Based on Cloud Model","authors":"C. Dai, Y.F. Zhu, W.R. Chen","doi":"10.1109/ITW2.2006.323754","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323754","url":null,"abstract":"Traditional genetic algorithms (GAs) easily get stuck at a local optimum, and often have slow convergent speed. A novel adaptive genetic algorithm (AGA) called cloud-model-based AGA (CAGA) is proposed in this paper. Unlike conventional genetic algorithms, CAGA presents the use of cloud model to adaptively tune the probabilities of crossover pc and mutation pm depending on the fitness values of solutions. Because normal cloud models have the properties of randomness and stable tendency, CAGA is expected to realize the twin goals of maintaining diversity in the population and sustaining the convergence capacity of the GA. We compared the performance of the CAGA with that of the standard GA (SGA) and AGA in optimizing several typical functions with varying degrees of complexity and solving travelling salesman problems. In all cases studied, CAGA is greatly superior to SGA and AGA in terms of robustness and efficiency. The CAGA converges to the global optimum in far fewer generations, and gets stuck at a local optimum fewer times than SGA and AGA","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"13 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":"125799910","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":"Error Floor and Decoding with Message Scaling for Accumulator-Based and LDPC Codes","authors":"M. Isaka","doi":"10.1109/ITW2.2006.323769","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323769","url":null,"abstract":"In this paper, we study the error floor of accumulator-based codes under iterative decoding and attempt to improve the performance. It is shown that the associated error events are often due to detectable errors, and proper design of an interleaver is effective for such weakness of the code. Subsequently, a simple modification of iterative decoding by scaling messages is shown to effectively achieve lower error probabilities in the error floor region, with an extension to LDPC codes.","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"11 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":"125807294","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":"Fast Weighted Bit-Flipping Decoding of Finite-Geometry LDPC Codes","authors":"Xiaofu Wu, Ming Jiang, Chunming Zhao, X. You","doi":"10.1109/ITW2.2006.323772","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323772","url":null,"abstract":"In this letter, we establish a natural relationship between the improved modified-weighted-bit-flipping (IMWBF) decoding and min-sum decoding. This insight helps us to develop a fast weighted bit-flipping (FWBF) decoding algorithm. For decoding of finite-geometry low-density parity-check codes, we demonstrate through examples that the FWBF decoding can provide a further improvement to the IMWBF decoding on both convergence and performance","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":"125267837","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":"Efficiency of Precode-Only Raptor codes and Turbo-Fountain Codes","authors":"A. Tarable, S. Benedetto","doi":"10.1109/ITW2.2006.323757","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323757","url":null,"abstract":"This paper deals with precode-only (PCO) Raptor and turbo fountain codes used on a noiseless channel, as it is the case for the BEC or the AWGN channel with high SNR. We find an expression for the performance of an ML-decoded PCO Raptor code. The performance parameter is the inefficiency of the code, i.e., the average amount of redundancy needed to decode the information bits. The inefficiency is expressed in terms of a generalized weight enumerating function. Also, we characterize the behavior of the Shannon ensemble in the same conditions. Finally, we extend the analysis to turbo fountain codes, which are iteratively decoded. We obtain an upper bound to the turbo code inefficiency when the deterministic interleaver is replaced by a uniform interleaver","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"38 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":"115984581","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":"Performance of OFDM Systems with Residual Carrier Frequency Offset over Time-varying Rayleigh Channels","authors":"Guangfa Dai, Hongwen Tang, Shaoping Chen","doi":"10.1109/ITW2.2006.323687","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323687","url":null,"abstract":"In this paper, the performance of orthogonal frequency division multiplexing (OFDM) systems with residual carrier frequency offset over time-varying Rayleigh channels is investigated. The power of different received signal components (the desired signal, the ICI signals caused by frequency offset and channel variations, and noise signals) are first calculated and analyzed, and the SINR (signal to interference plus noise ratio) and BER (bit error rates) calculations for 16-QAM OFDM systems are then investigated. Analytical analysis and computer simulations show the following important results: (1) residual frequency offset and channels' time variations greatly degraded the performance of OFDM systems; (2) the intercarrier interference (ICI) energy caused by channel variations or frequency offset is concentrated in cyclically adjacent subcarriers, which is important for developing low complexity ICI cancellation techniques; (3) the influence of residual carrier frequency offset on OFDM system performance can be modeled as the effects of equivalent channels' time variations, and a time-varying channel model including the residual carrier frequency offset effect is proposed","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"32 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":"116136419","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":"Fast Antenna Subset Selection for MIMO Wireless Systems","authors":"Guowei Zhang, Lan Tian, Lan Peng","doi":"10.1109/ITW2.2006.323848","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323848","url":null,"abstract":"Along with the multiple-input multiple-output (MIMO) system gains, comes a price in hardware complexity and cost due to multiple RF chains. It is possible to alleviate this cost and at the same time maintain many advantages of MIMO systems by a technique known as antenna selection. In this paper, we propose a new receive antenna selection algorithm which is based on the analysis of the channel capacity. It can achieve very nearly outage capacity with the optimal selection method while keeping low computational complexity. Besides, the bit error rate (BER) performance under space-time block coding (STBC) transmit scheme demonstrates the significant performance of the proposed selection algorithm","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"351 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":"116465153","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":"New Recursive Space-Time Trellis Codes From General Differential Encoding","authors":"Shengli Fu, Haiquan Wang, X. Xia","doi":"10.1109/ITW2.2006.323706","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323706","url":null,"abstract":"In this paper, a recursive space-time trellis coding (RSTTC) from general differential encoding is proposed for multiple antenna systems, where general differential encoding is implemented separately from the space-time matrix modulation. The general differential encoding is achieved by introducing a new multiplication on a set of symbols (called trellis codewords) such that the corresponding RSTTC has its minimum error event length 3 or above and in the meantime it has the minimum number of states. The space-time matrix modulation is the mapping of the differentially encoded symbols to a set of space-time matrices (called modulation codewords). Due to the separation of differential encoding and space-time matrix modulation, more freedom on the design of modulation codewords (or a space-time code) exists, which may result in a larger diversity product (or determinant distance or product distance or coding advantage) than that the existing combined differential encoding and space-time matrix modulation can achieve in the concatenation with an outer binary channel encoder proposed by Schlegel and Grant. A new design of modulation codewords is then proposed for the RSTTC with larger diversity products than the existing schemes. Simulation results are finally presented to show that our new design significantly outperforms the existing schemes","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":"128756200","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":"Decoder Error Probability of MRD Codes","authors":"M. Gadouleau, Zhiyuan Yan","doi":"10.1109/ITW2.2006.323800","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323800","url":null,"abstract":"In this paper, we first introduce the concept of elementary linear subspace, which has similar properties to those of a set of coordinates. Using this new concept, we derive properties of maximum rank distance (MRD) codes that parallel those of maximum distance separable (MDS) codes. Using these properties, we show that the decoder error probability of MRD codes with error correction capability t decreases exponentially with t2 based on the assumption that all errors with the same rank are equally likely. We argue that the channel based on this assumption is an approximation of a channel corrupted by crisscross errors.","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"8 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":"123926912","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":"Adaptive JSCC using Trellis Quantization based on Punctured Ring Convolutional Codes","authors":"Zihuai Lin, T. Aulin","doi":"10.1109/ITW2.2006.323811","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323811","url":null,"abstract":"A new trellis quantization scheme based on punctured ring convolutional codes is proposed. It is demonstrated that the new trellis source encoding scheme is superior to conventional trellis coded vector quantization (TCVQ) scheme of the same complexity. Furthermore, an adaptive joint source channel coding (JSCC) scheme using the combined new trellis quantization scheme with continuous phase modulation (CPM) is investigated. The decoding algorithm is based on the BCJR, algorithm for punctured ring convolutional coded CPM","PeriodicalId":299513,"journal":{"name":"2006 IEEE Information Theory Workshop - ITW '06 Chengdu","volume":"91 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":"124022718","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":"Adaptive Incremental Redundancy Coding and Decoding Schemes using Feedback Information","authors":"T. Matsushima","doi":"10.1109/ITW2.2006.323785","DOIUrl":"https://doi.org/10.1109/ITW2.2006.323785","url":null,"abstract":"If we can use a high capacity feedback channel, the receiver may transmit the indices of unreliable bits in a received sequence instead of ACK/NAK signals. We consider the error correction schemes using the indices of unreliable bits. The suitable parity symbols are incrementally transmitted using the feedback information. The bitwise reliability can be calculated by message passing algorithms on the variable graph constructed by adding the new nodes and arcs corresponding to the received parity bits to a former graph at each stage","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":"123626607","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}