C. Winstead, Tasnuva Tithi, E. Boutillon, Ghaffari Fakhreddine
{"title":"Recent Advances on Stochastic and Noise Enhanced Methods in Error Correction Decoders","authors":"C. Winstead, Tasnuva Tithi, E. Boutillon, Ghaffari Fakhreddine","doi":"10.1109/ISTC.2018.8625277","DOIUrl":"https://doi.org/10.1109/ISTC.2018.8625277","url":null,"abstract":"This paper offers a review of recent developments in non-deterministic error correction decoding methods, which can be described in two broad classes. The first class uses stochastic computation to emulate the arithmetic operations of conventional decoding algorithms. The second class achieves noise enhancement by randomly perturbing the calculations of a standard decoder. Stochastic decoders inherit analysis techniques from the conventional algorithms they emulate, but the noise-enhanced algorithms are newer, more difficult to explain, and not yet fully understood. We describe a Markov chain analysis technique to both explain and optimize noise enhancement in these algorithms. Circuit implementation is also discussed, including both conventional hardware architectures and circuits based on memristor threshold logic, where memristor non-determinism can be exploited for noise enhancement.","PeriodicalId":441111,"journal":{"name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115115247","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":"Multilevel capacities for the codon mutation channel","authors":"Dawit Nigatu, W. Henkel","doi":"10.1109/ISTC.2018.8625354","DOIUrl":"https://doi.org/10.1109/ISTC.2018.8625354","url":null,"abstract":"We used the so-called empirical codon mutation (ECM) matrix to get some insights into the error protection mechanisms in the genetic code. First, using a dimension reduction technique, the codon substitution frequencies and the physicochemical properties of the encoded amino acids are compared. Then, the different levels of error protection in the genetic code are investigated by employing a 4-ary set partitioning scheme. The channel capacities of the set partitions and the level capacities were determined using the ECM channel model. One of the most interesting result which emanated from the capacity analysis is that the capacities of the first two partition levels were found to be identical. This implies that, in a multilevel coding sense, codes of equal code rates would have to be used to encode the two positions. The last codon position carries very little information and can be transmitted without coding.","PeriodicalId":441111,"journal":{"name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117100692","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 Marginalization of Polarizing Kernels","authors":"Valerio Bioglio, I. Land","doi":"10.1109/ISTC.2018.8625378","DOIUrl":"https://doi.org/10.1109/ISTC.2018.8625378","url":null,"abstract":"In this paper, we analyze the decoding complexity of polarizing kernels of size larger than p = 2, proposing a general procedure which can be used to marginalize kernels of any size. We use this method to evaluate the decoding equations for optimal binary kernels up to size p = 8. Finally, we experimentally show that, even if T2 and T8 share the same polarization exponent, their performance may vary under list decoding, making large kernels of interest for long polar codes.","PeriodicalId":441111,"journal":{"name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129267770","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":"Increasing Robustness to Synchronisation Errors in Molecular Communications","authors":"Tze-Yang Tung, U. Mitra","doi":"10.1109/ISTC.2018.8625364","DOIUrl":"https://doi.org/10.1109/ISTC.2018.8625364","url":null,"abstract":"Achieving precise synchronisation between transmitters and receivers is particularly challenging in diffusive molecular communication environments. To this end, pointto-point molecular communication system design is examined wherein synchronisation errors are explicitly considered. Two transceiver design questions are considered: the development of a sequential probability ratio test-based detector which allows for additional observations in the presence of uncertainty due to miss-ynchronisation at the receiver, and a modulation design which is optimised for this receiver strategy. The modulation is based on optimising an approximation for the probability of error for the detection strategy and directly exploits the structure of the probability of molecules hitting a receiver within a particular time slot. The proposed receiver and modulation designs achieve strongly improved asynchronous detection performance for the same data rate as a decision feedback based receiver by a factor of 1/2.","PeriodicalId":441111,"journal":{"name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114638390","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 Construction of Rate-Compatible Raptor-Like QC-LDPC Code for Enhanced IDMA in 5G and Beyond","authors":"Jian Song, Yushu Zhang","doi":"10.1109/ISTC.2018.8625306","DOIUrl":"https://doi.org/10.1109/ISTC.2018.8625306","url":null,"abstract":"Recently, rate-compatible raptor-like quasi-cyclic low-density parity-check (RL-QC-LDPC) codes have been adopted in 5G new radio technical specification. This paper is focused on the construction of rate-compatible RL-QC-LDPC codes for enhanced interleave-division multiple-access (IDMA), while taking the good features of 5G new radio LDPC codes into consideration. Firstly, a rate-compatible RL-QC-LDPC code family is optimized for point-to-point transmission via progressive matrix growth algorithm. Enhanced IDMA with this code family shows good performance at relatively low sum spectral efficiency. Secondly, this code family is optimized for enhanced IDMA via row-by-row extension for different spectrum efficiency requirements. With the optimized code families, enhanced IDMA is capable of supporting much higher sum spectral efficiency and user loads. Finally, the finite-length performance of enhanced IDMA with these code families are verified by bit error rate simulations.","PeriodicalId":441111,"journal":{"name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","volume":"279 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128935290","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":"An Interactive Algorithm for Synchronizing from Burst Deletions","authors":"Shuyang Jiang, Clayton Schoeny, L. Dolecek","doi":"10.1109/ISTC.2018.8625363","DOIUrl":"https://doi.org/10.1109/ISTC.2018.8625363","url":null,"abstract":"We study the efficient synchronization between two distant nodes, A and B, that are connected through a lossless bidirectional communication channel. In our setup, Node A contains file X, and node B contains file Y that is generated through burst deletions from X. The burst deletion pattern is modeled by a stationary two-state Markov chain. Inspired by the previously proposed synchronization protocol of Yazdi and Dolecek that is specifically designed to handle i.i.d. deletions, we create a new synchronization algorithm that is efficient for the case of burst deletions. Utilizing the previous overall framework from Yazdi and Dolecek, we first prove that the matching module still works well in our scenario. We then invent two new schemes for the implementation of the burst deletion recovery module. The remaining errors created in the first two modules are eliminated by the final LDPC decoder. Lastly, we provide experimental results of the proposed synchronization algorithm for both i.i.d. and realistic sources.","PeriodicalId":441111,"journal":{"name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133013113","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":"Stepped List Decoding for Polar Codes","authors":"M. Rowshan, E. Viterbo","doi":"10.1109/ISTC.2018.8625267","DOIUrl":"https://doi.org/10.1109/ISTC.2018.8625267","url":null,"abstract":"In the successive cancellation list (SCL) decoding of polar codes, as the list size increases, the error correction performance improves. However, a large list size results in high computational complexity and large memory requirement.In this paper, we investigate the list decoding process by introducing a new parameter named path metric range (PMR) to elucidate the properties of the evolution of the path metrics (PMs) within the list throughout the decoding process. Then, we advocate that the list size can change stepwise depending on PMR. As a result, we propose a stepped list decoding scheme in which the error correction performance of the conventional list decoding is preserved while the path memory may reduce by 75%, the size of the internal LLR memory and partial sums memory can drop by 50%, and the computational complexity may halve. The reduction in complexity is SNR-independent and achieved without introducing any computational overhead.","PeriodicalId":441111,"journal":{"name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129250201","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}
Ronald Garzon Bohorquez, Rami Klaimi, C. A. Nour, C. Douillard
{"title":"Mitigating Correlation Problems in Turbo Decoders","authors":"Ronald Garzon Bohorquez, Rami Klaimi, C. A. Nour, C. Douillard","doi":"10.1109/ISTC.2018.8625316","DOIUrl":"https://doi.org/10.1109/ISTC.2018.8625316","url":null,"abstract":"In this paper, new interleaver design criteria for turbo codes are proposed, targeting the reduction of the correlation between component decoders. To go beyond the already known correlation girth maximization, we propose several additional criteria that limit the impact of short correlation cycles and increase code diversity. Two application examples are elaborated, targeting an 8-state binary turbo code and a non-binary turbo code defined over GF(64). The proposed design criteria are shown to improve the error correcting performance of the code, especially in the error floor region.","PeriodicalId":441111,"journal":{"name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122180134","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":"Efficient beamforming scheme in distributed massive MIMO system","authors":"M. N. Boroujerdi, A. Abbasfar, M. Ghanbari","doi":"10.1109/ISTC.2018.8625334","DOIUrl":"https://doi.org/10.1109/ISTC.2018.8625334","url":null,"abstract":"Massive MIMO is a multi-user MIMO where the number of antennas and the number of scheduled users can be very large. Effective transmission strategies in such systems is of great importance as the complexity burden over the shoulder of the system can be too high to take due to the large dimensions of the system. In a distributed massive MIMO system, where antennas’ links are capacity constrained, calculating the precoding vector and compression separately can be a waste of calculating hardwares. We propose a simple beamforming-compression scheme based on an iterative algorithm which can efficiently achieve the performance of the well-known linear precoders with much less complexity.","PeriodicalId":441111,"journal":{"name":"2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124475085","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}