{"title":"Improved Hybrid RM-Polar Codes and Decoding on Stable Permuted Factor Graphs","authors":"W. Wu, Zhen Zhai, P. Siegel","doi":"10.1109/ISTC49272.2021.9594172","DOIUrl":"https://doi.org/10.1109/ISTC49272.2021.9594172","url":null,"abstract":"A new family of modified polar codes and a new permutation selection scheme for belief propagation list (BPL) decoding are presented. We first propose a new code construction methodology to interpolate between Reed-Muller (RM) codes and polar codes. By taking advantage of an existing partial order on bit-channels whose corresponding indices share the same Hamming weight, we analyze the complexity of the new construction method. It is shown that we need to compute the reliability of roughly a fraction 1/log3/2N of all the bit-channels contained in the subset. Then, we explore a special family of factor-graph layer permutations called stable permutations (SPs) that preserve a specified information set when the corresponding bit permutations are applied to message bit indices. Simulation results show that the error-rate performance of the new family of codes is better than that of 5G polar codes under successive cancellation list (SCL) decoding. In addition, the SP selection scheme stands out as a preferred one for BPL decoding in terms of error-rate performance, while the average number of iterations per belief propagation (BP) decoder on the permuted factor graph is close to that of the original BP decoder when an early stopping condition is applied.","PeriodicalId":387725,"journal":{"name":"2021 11th International Symposium on Topics in Coding (ISTC","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121707812","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":"[ISTC 2021 Front cover]","authors":"","doi":"10.1109/istc49272.2021.9594143","DOIUrl":"https://doi.org/10.1109/istc49272.2021.9594143","url":null,"abstract":"","PeriodicalId":387725,"journal":{"name":"2021 11th International Symposium on Topics in Coding (ISTC","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115915370","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 Equivalence between Pre-transformed and Parity-check Monomial Codes","authors":"Yuanxin Guo, Zihan Tang, Bin Li","doi":"10.1109/ISTC49272.2021.9594246","DOIUrl":"https://doi.org/10.1109/ISTC49272.2021.9594246","url":null,"abstract":"Polar codes and Reed-Muller codes belong to a family of codes called monomial codes. In this work, we study pre-transformed monomial codes, which cover several constructions including parity-check (PC) codes and PAC codes. We show that any pre-transformed monomial code can be transformed into a parity-check monomial code with the same codewords, and give an explicit algorithm for this transformation. We further prove that for certain monomial codes, the minimum weight is invariant under pre-transformation, but specific pre-transformation matrices can be constructed to reduce the number of minimum-weight codewords. These results offer theoretical support for the success of various heuristics, e.g., PAC codes attain dispersion bound, and provide guidance for designing short codes.","PeriodicalId":387725,"journal":{"name":"2021 11th International Symposium on Topics in Coding (ISTC","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130427784","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 Dimming Scheme based on Non-DC Free RLL Codes for VLC","authors":"E. N. Mambou, Thibaud Tonnellier, W. Gross","doi":"10.1109/ISTC49272.2021.9594211","DOIUrl":"https://doi.org/10.1109/ISTC49272.2021.9594211","url":null,"abstract":"The dimming control is crucial for visible light communication (VLC) channels to maintain data transmission at different levels of lighting brightness. However, ensuring the dimming control while keeping a flicker-free channel remains a challenging task in VLC. Conventional techniques use the interleaving of compensation symbols (CS) applied on balanced codewords, usually obtained via run-length limited (RLL) codes. However, CS increases the redundancy used and are just thrown away during the decoding. Moreover, the interleaving step may increase the latency of the system. In this letter, new families of non-DC free RLL codes with variable weights are proposed. The dimming control can therefore be achieved without CS. Simulations stipulate that the proposed 4B7B code in FEC-coded channels achieve dimming ratios of 29% and 71% while improving on redundancy and error correction performance. For a 29% and 71% dimming ratios, at a BER of 10−4, gains in dB of 0.8 and 0.6 versus 3 and 2.6 are reported between the coded proposed RLL against the coded 1B2B and 4B6B with CS respectively.","PeriodicalId":387725,"journal":{"name":"2021 11th International Symposium on Topics in Coding (ISTC","volume":"314 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131656222","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}
Belaid Hamoum, Elsa Dupraz, L. Conde-Canencia, D. Lavenier
{"title":"Channel Model with Memory for DNA Data Storage with Nanopore Sequencing","authors":"Belaid Hamoum, Elsa Dupraz, L. Conde-Canencia, D. Lavenier","doi":"10.1109/ISTC49272.2021.9594243","DOIUrl":"https://doi.org/10.1109/ISTC49272.2021.9594243","url":null,"abstract":"This paper is dedicated to channel modeling and error-correction coding for DNA data storage with nanopore sequencing. We first propose a novel statistical model for DNA storage, which takes into account the memory within DNA storage error events, and follows the way nanopore sequencing works. Compared to existing channel models, the proposed model represents more accurate experimental datasets. We also propose a full error-correction scheme for DNA storage, based on a consensus algorithm and non-binary LDPC codes. Especially, we introduce a novel synchronization method which allows to eliminate remaining deletion errors after the consensus, before applying a belief-propagation LDPC decoding algorithm to correct substitution errors. This method exploits the LDPC code structure to correct deletions, and does not require adding any extra redundancy.","PeriodicalId":387725,"journal":{"name":"2021 11th International Symposium on Topics in Coding (ISTC","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134632897","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 Two-stage Decoding Algorithm for Spatially Coupled Algebraic LDPC Codes","authors":"Juewei Wang, Xiao Ma","doi":"10.1109/ISTC49272.2021.9594252","DOIUrl":"https://doi.org/10.1109/ISTC49272.2021.9594252","url":null,"abstract":"In this paper, we propose a two-stage decoding algorithm for spatially-coupled algebraic low-density paritycheck (LDPC) codes with linear computational complexity, which consists of a sliding-window belief propagation (BP) decoding algorithm and a majority logic decoding algorithm. Simulation results are presented, showing that the error rate performance of SC-LDPC codes can be further improved by the majority logic decoding algorithm.","PeriodicalId":387725,"journal":{"name":"2021 11th International Symposium on Topics in Coding (ISTC","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124439637","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}
Andrew D. Cummins, David G. M. Mitchell, D. Costello
{"title":"Iterative Threshold Decoding of Spatially Coupled, Parallel-Concatenated Codes","authors":"Andrew D. Cummins, David G. M. Mitchell, D. Costello","doi":"10.1109/ISTC49272.2021.9594231","DOIUrl":"https://doi.org/10.1109/ISTC49272.2021.9594231","url":null,"abstract":"Spatially coupled, parallel concatenated codes (SC-PCCs) have been shown to approach channel capacity when decoded using optimal iterative methods. However, under complexity constraints such decoding strategies can result in unacceptable power and latency costs. In this work, we employ convolutional self-orthogonal component codes along with low-complexity, suboptimal a posteriori probability (APP) threshold decoders with SC-PCCs to reduce decoding complexity. The proposed code design is faster, more energy efficient, and easier to implement than optimal methods, while offering significant coding gain over existing threshold decodable, turbo-like constructions of similar latency and complexity. The design also serves to further illustrate the advantages spatial coupling can provide to existing code constructions and decoder implementations.","PeriodicalId":387725,"journal":{"name":"2021 11th International Symposium on Topics in Coding (ISTC","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125587073","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":"Forward-Error-Correction for Beyond-5G Ultra-High Throughput Communications","authors":"N. Wehn, O. Sahin, M. Herrmann","doi":"10.1109/ISTC49272.2021.9594126","DOIUrl":"https://doi.org/10.1109/ISTC49272.2021.9594126","url":null,"abstract":"Forward-Error-Correction (FEC) constitutes a dominant power consuming and throughput limiting component in the end-to-end digital baseband chain for wireless systems. With the progress in THz and Tbit/s link-level technologies towards practical solutions and deployments arguably in beyond-5G and 6G era, the performance and implementation bottleneck due to FEC in these systems becomes increasingly clear. In this paper, we explore FEC performance requirements for various beyond-5G wireless use-cases from a practical implementation perspective. We then provide some recent designs in Low Density Parity Check (LDPC) and Polar Codes, and their decoder architectures that demonstrate significant potential towards achieving throughputs approaching 1 Tbit/s.","PeriodicalId":387725,"journal":{"name":"2021 11th International Symposium on Topics in Coding (ISTC","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132077899","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}
Aomar Bourenane, M. Arzel, F. Guilloud, Alain Thomas
{"title":"Shuffled Decoding of Serial Concatenated Convolutional Codes","authors":"Aomar Bourenane, M. Arzel, F. Guilloud, Alain Thomas","doi":"10.1109/ISTC49272.2021.9594068","DOIUrl":"https://doi.org/10.1109/ISTC49272.2021.9594068","url":null,"abstract":"Shuffled decoding enables to accelerate the extrinsic information exchange during iterative decoding of concatenated codes. It has already been applied to parallel convolutional codes or low-density parity-check codes. In this article, we propose to apply shuffled decoding to serial concatenation convolutional codes. We take advantage of their systematic encoding to propose an efficient shuffled decoding scheme. Compared to a standard iterative decoding scheme, the convergence of our shuffled implementation is obtained within fewer iterations, each one requiring also less time to be completed. This convergence acceleration yields doubling the throughput. We finally show that doubling the throughput comes at a lower cost than doubling the hardware resources, making this shuffled scheme efficient in term of implementation. For instance, the memory usage is 29% more efficient thanks to our proposal than a baseline scheme, which significantly reduces the power consumption of hardware decoders.","PeriodicalId":387725,"journal":{"name":"2021 11th International Symposium on Topics in Coding (ISTC","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132250915","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":"Gradient Descent Bit-Flipping Decoding with Momentum","authors":"V. Savin","doi":"10.1109/ISTC49272.2021.9594128","DOIUrl":"https://doi.org/10.1109/ISTC49272.2021.9594128","url":null,"abstract":"In this paper, we propose a Gradient Descent Bit-Flipping (GDBF) decoding with momentum, which considers past updates to provide inertia to the decoding process. We show that GDBF or randomized GDBF decoders with momentum may closely approach the floating-point Belief-Propagation decoding performance, and even outperform it in the error-floor region, especially for graphs with high connectivity degree.","PeriodicalId":387725,"journal":{"name":"2021 11th International Symposium on Topics in Coding (ISTC","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128762930","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}