English
Related papers

Related papers: Low-Power Cooling Codes with Efficient Encoding an…

200 papers

This paper has been withdrawn by the authors. In this paper, we propose a new low power coding technique by decreasing the number of switching activities on the buses which use transition signaling to transmit data. This approach dedicates…

Other Computer Science · Computer Science 2013-02-12 Mehdi Taassori , Meysam Taassori , Sener Uysal

In this paper, we propose new coupled codes constructed by overlapping circular spatially-coupled low-density parity-check (SC-LDPC) codes, which show better asymptotic and finite-length decoding performance compared to the conventional…

Information Theory · Computer Science 2018-03-28 Heeyoul Kwak , Bohwan Jun , Pilwoong Yang , Jong-Seon No , Dong-Joon Shin

Polar codes are a class of capacity achieving error correcting codes that has been recently selected for the next generation of wireless communication standards (5G). Polar code decoding algorithms have evolved in various directions,…

Information Theory · Computer Science 2017-10-16 Furkan Ercan , Carlo Condo , Seyyed Ali Hashemi , Warren J. Gross

A heuristic construction of polar codes for successive cancellation list (SCL) decoding with a given list size is proposed to balance the trade-off between performance measured in frame error rate (FER) and decoding complexity. Furthermore,…

Information Theory · Computer Science 2018-08-03 Peihong Yuan , Tobias Prinz , Georg Böcherer , Onurcan İşcan , Ronald Böhnke , Wen Xu

Polar codes are capacity-achieving error-correcting codes with an explicit construction that can be decoded with low-complexity algorithms. In this work, we show how the state-of-the-art low-complexity decoding algorithm can be improved to…

Information Theory · Computer Science 2016-08-29 Pascal Giard , Alexios Balatsoukas-Stimming , Gabi Sarkis , Claude Thibeault , Warren J. Gross

Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern…

Information Theory · Computer Science 2015-12-25 Gabi Sarkis , Pascal Giard , Alexander Vardy , Claude Thibeault , Warren J. Gross

In this paper, we introduce a novel class of pre-transformed polar codes, termed as deep polar codes. We first present a deep polar encoder that harnesses a series of multi-layered polar transformations with varying sizes. Our approach to…

Information Theory · Computer Science 2023-08-08 Geon Choi , Namyoon Lee

Overfitted image codecs like Cool-chic achieve strong compression by tailoring lightweight models to individual images, but their encoding is slow and computationally expensive. To accelerate encoding, Non-Overfitted (N-O) Cool-chic…

Image and Video Processing · Electrical Eng. & Systems 2025-09-24 Pep Borrell-Tatché , Till Aczel , Théo Ladune , Roger Wattenhofer

Low Density Parity Check (LDPC) codes are linear error correcting codes used in communication systems for Forward Error Correction (FEC). But, intensive computation is required for encoding and decoding of LDPC codes, making it difficult…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-01-13 Bhargav Gokalgandhi , Ivan Seskar

The subblock energy-constrained codes (SECCs) and sliding window-constrained codes (SWCCs) have recently attracted attention due to various applications in communcation systems such as simultaneous energy and information transfer. In a…

Information Theory · Computer Science 2020-09-22 Tuan Thanh Nguyen , Kui Cai , Kees A. Schouhamer Immink

Two methods for constructing quantum LDPC codes are presented. We explain how to overcome the difficulty of finding a set of low weight generators for the stabilizer group of the code. Both approaches are based on some graph representation…

Quantum Physics · Physics 2007-05-23 T. Camara , H. Ollivier , J. -P. Tillich

A method for construction of polar subcodes is presented, which aims on minimization of the number of low-weight codewords in the obtained codes, as well as on improved performance under list or sequential decoding. Simulation results are…

Information Theory · Computer Science 2017-05-04 Peter Trifonov , Grigorii Trofimiuk

We address noisy message-passing decoding of lowdensity parity-check (LDPC) codes over additive white Gaussian noise channels. Message-passing decoders in which certain processing units iteratively exchange messages are common for decoding…

Information Theory · Computer Science 2015-06-02 Alla Tarighati , Hamed Farhadi , Farshad Lahouti

In this paper, we investigate a coupled polar code architecture that supports both local and global decoding. This local-global construction is motivated by practical applications in data storage and transmission where reduced-latency…

Information Theory · Computer Science 2023-01-09 Ziyuan Zhu , Wei Wu , Paul H. Siegel

This paper focuses on the encoding and decoding of Construction D' coding lattices that can be used with shaping lattices for power-constrained channels. Two encoding methods and a decoding algorithm for Construction D' lattices are given.…

Information Theory · Computer Science 2021-09-14 Fan Zhou , Arini Fitri , Khoirul Anwar , Brian M. Kurkoski

Visible light communication (VLC) could provide short-range optical wireless communication together with illumination using LED lighting. However, conventional forward error correction (FEC) codes for reliable communication do not have the…

Information Theory · Computer Science 2018-10-18 Junbin Fang , Zhen Che , Xiaolong Yu , Zhe Chen , Zoe L. Jiang , Siu-Ming Yiu , Kui Ren , Xiaoqing Tan

We present a method of constructing rate-compatible polar codes that are capacity-achieving with low-complexity sequential decoders. The proposed code construction allows for incremental retransmissions at different rates in order to adapt…

Information Theory · Computer Science 2016-01-29 Song-Nam Hong , Dennis Hui , Ivana Marić

Product codes are widespread in optical communications, thanks to their high throughput and good error-correction performance. Systematic polar codes have been recently considered as component codes for product codes. In this paper, we…

Information Theory · Computer Science 2019-01-23 Valerio Bioglio , Carlo Condo , Ingmar Land

Spatially-Coupled (SC)-LDPC codes are known to have outstanding error-correction performance and low decoding latency. Whereas previous works on LDPC and SC-LDPC codes mostly take either an asymptotic or a finite-length design approach, in…

Information Theory · Computer Science 2022-09-02 Homa Esfahanizadeh , Eshed Ram , Yuval Cassuto , Lara Dolecek

While linear programming (LP) decoding provides more flexibility for finite-length performance analysis than iterative message-passing (IMP) decoding, it is computationally more complex to implement in its original form, due to both the…

Information Theory · Computer Science 2009-02-05 Mohammad H. Taghavi , Amin Shokrollahi , Paul H. Siegel