English
Related papers

Related papers: Iterative Threshold Decoding of Spatially Coupled,…

200 papers

We introduce successive cancellation (SC) decoding of product codes (PCs) with single parity-check (SPC) component codes. Recursive formulas are derived, which resemble the SC decoding algorithm of polar codes. We analyze the error…

Information Theory · Computer Science 2017-06-19 Mustafa Cemil Coşkun , Gianluigi Liva , Alexandre Graell i Amat , Michael Lentmaier

The recently-discovered polar codes are seen as a major breakthrough in coding theory; they provably achieve the theoretical capacity of discrete memoryless channels using the low complexity successive cancellation (SC) decoding algorithm.…

Hardware Architecture · Computer Science 2015-03-19 Camille Leroux , Alexandre J. Raymond , Gabi Sarkis , Ido Tal , Alexander Vardy , Warren J. Gross

Since the discovery of turbo codes 20 years ago and the subsequent re-discovery of low-density parity-check codes a few years later, the field of channel coding has experienced a number of major advances. Up until that time, code designers…

Information Theory · Computer Science 2016-11-17 Daniel J. Costello, , Lara Dolecek , Thomas E. Fuja , Joerg Kliewer , David G. M. Mitchell , Roxana Smarandache

This paper presents an efficient hardware design approach for list successive cancellation (LSC) decoding of polar codes. By applying path-overlapping scheme, the l instances of (l > 1) successive cancellation (SC) decoder for LSC with list…

Information Theory · Computer Science 2015-11-03 Tiben Che , Jingwei Xu , Gwan Choi

Polar codes are a class of linear block codes that provably achieves channel capacity. They have been selected as a coding scheme for the control channel of enhanced mobile broadband (eMBB) scenario for $5^{\text{th}}$ generation wireless…

Hardware Architecture · Computer Science 2020-06-04 Furkan Ercan , Thibaud Tonnellier , Carlo Condo , Warren J. Gross

Spatially coupled low-density parity-check (SC-LDPC) codes are sparse graph codes that have recently become of interest due to their capacity-approaching performance on memoryless binary input channels. In this paper, we unify all existing…

Information Theory · Computer Science 2017-10-11 Allison Beemer , Salman Habib , Christine A. Kelley , Joerg Kliewer

This paper characterizes the latency of the simplified successive-cancellation (SSC) decoding scheme for polar codes under hardware resource constraints. In particular, when the number of processing elements $P$ that can perform SSC…

Information Theory · Computer Science 2020-12-25 Seyyed Ali Hashemi , Marco Mondelli , Arman Fazeli , Alexander Vardy , John Cioffi , Andrea Goldsmith

Spatial coupling was proved to improve the belief-propagation (BP) performance up to the maximum-a-posteriori (MAP) performance. This paper addresses an extended class of spatially coupled (SC) systems. A potential function is derived for…

Information Theory · Computer Science 2014-04-21 Keigo Takeuchi

Spatially-coupled (SC) codes is a class of convolutional LDPC codes that has been well investigated in classical coding theory thanks to their high performance and compatibility with low-latency decoders. We describe toric codes as quantum…

Quantum Physics · Physics 2025-04-09 Siyi Yang , Robert Calderbank

A circulant-based spatially-coupled (SC) code is constructed by partitioning the circulants of an underlying block code into a number of components, and then coupling copies of these components together. By connecting (coupling) several SC…

Information Theory · Computer Science 2018-09-14 Homa Esfahanizadeh , Ahmed Hareedy , Lara Dolecek

Spatially-coupled (SC) codes are a class of low-density parity-check (LDPC) codes that is gaining increasing attention. Multi-dimensional (MD) SC codes are constructed by connecting copies of an SC code via relocations in order to mitigate…

Information Theory · Computer Science 2026-03-30 Ata Tanrıkulu , Mete Yıldırım , Ahmed Hareedy

We use density evolution to optimize the parameters of binary product codes (PCs) decoded based on the recently introduced iterative bounded distance decoding with scaled reliability. We show that binary PCs with component codes of 3-bit…

Information Theory · Computer Science 2019-08-27 Alireza Sheikh , Alexandre Graell i Amat , Gianluigi Liva , Alex Alvarado

Data center networks (DCNs) require a low-cost, low-power optical transceiver to handle increased traffic from generative artificial intelligence, video streaming services, and more. Improving the required signal-to-noise ratio (RSNR) by…

Signal Processing · Electrical Eng. & Systems 2025-09-09 Takeshi Kakizaki , Masanori Nakamura , Fukutaro Hamaoka , Shuto Yamamoto , Etsushi Yamazaki

Row-merged polar codes are a family of pre-transformed polar codes (PTPCs) with little precoding overhead. Providing an improved distance spectrum over plain polar codes, they are capable to perform close to the finite-length capacity…

Information Theory · Computer Science 2023-12-25 Andreas Zunker , Marvin Geiselhart , Lucas Johannsen , Claus Kestel , Stephan ten Brink , Timo Vogt , Norbert Wehn

A novel SC decoding method of polar codes is proposed in $d$-deletion channels, where a new pruning strategy is designed to reduce decoding complexity. Considering the difference of the scenario weight distributions, pruning thresholds for…

Information Theory · Computer Science 2024-05-22 He Sun , Rongke Liu , Bin Dai

Polar codes represent one of the major recent breakthroughs in coding theory and, because of their attractive features, they have been selected for the incoming 5G standard. As such, a lot of attention has been devoted to the development of…

Information Theory · Computer Science 2017-08-31 Seyyed Ali Hashemi , Marco Mondelli , S. Hamed Hassani , Rudiger Urbanke , Warren J. Gross

Stochastic computing (SC) is an emerging computing technique that promises high density, low power, and error tolerant solutions. In SC, values are encoded as unary bitstreams and SC arithmetic circuits operate on one or more bitstreams. In…

Signal Processing · Electrical Eng. & Systems 2018-03-14 Vincent T. Lee , Armin Alaghi , Luis Ceze

Spatially coupled low-density parity-check (SC-LDPC) codes can achieve the channel capacity under low-complexity belief propagation (BP) decoding, however, there is a non-negligible rate-loss because of termination effects for practical…

Information Theory · Computer Science 2015-12-16 Sebastian Cammerer , Vahid Aref , Laurent Schmalen , Stephan ten Brink

Product codes (PCs) protect a two-dimensional array of bits using short component codes. Assuming transmission over the binary symmetric channel, the decoding is commonly performed by iteratively applying bounded-distance decoding to the…

Information Theory · Computer Science 2017-11-22 Christian Häger , Henry D. Pfister

As the first error correction codes provably achieving the symmetric capacity of binary-input discrete memory-less channels (B-DMCs), polar codes have been recently chosen by 3GPP for eMBB control channel. Among existing algorithms,…

Signal Processing · Electrical Eng. & Systems 2018-03-19 Huayi Zhou , Xiao Liang , Liping Li , Zaichen Zhang , Xiaohu You , Chuan Zhang
‹ Prev 1 3 4 5 6 7 10 Next ›