14 papers · ranked by Valyu relevance
Luka Skoric, Dan E. Browne, Kenton M. Barnes, Neil I. Gillespie + 1 more
'Earl T. Campbell'] Large-scale quantum computers have the potential to hold computational capabilities beyond conventional computers. However, the physical qubits are prone to noise which must be corrected in order to perform fault-tolerant quantum computations. Quantum Error Correction (QEC) provides the path for…
Noam Presman, Simon Litsyn
Polar codes are recursive general concatenated codes. This property motivates a recursive formalization of the known decoding algorithms: Successive Cancellation, Successive Cancellation with Lists and Belief Propagation. Using such description allows an easy development of these algorithms for arbitrary polarizing…
Xianbin Wang, Jiajie Tong, Huazi Zhang, Shengchen Dai + 2 more
'Jun Wang'] Abstract—Recently, a parallel decoding framework of G N coset codes was proposed. High throughput is achieved by decoding the independent component polar codes in parallel . Various algorithms can be employed to decode these componen t codes, enabling a flexible throughput-performance tradeoff. In this…
Yingge Li, Haihua Hu, Jun Chen
As high-speed big-data communications impose new requirements on storage latency, low-density parity-check (LDPC) codes have become a widely used technology in flash-memory channels. However, the iterative LDPC decoding algorithm faces a high decoding latency problem due to its mechanism based on iterative message…
Hao Peng, Rongke Liu, Yi Hou, Ling Zhao
—In this paper, we propose a parallel block-based Viterbi decoder (PBVD) on the graphic processing unit (GPU) platform for the decoding of convolutional codes. The decoding procedure is simplified and parallelized, and the characteristic of the trellis is exploited to reduce the metric computation. Based on the compute…
Alireza Tasdighi, Mansoor Yousefi, Jun Chen
Weighted belief propagation (WBP) for the decoding of linear block codes is considered. In WBP, the Tanner graph of the code is unrolled with respect to the iterations of the belief propagation decoder. Then, weights are assigned to the edges of the resulting recurrent network and optimized offline using a training…
Myeongjin Kang, Daejin Park, Youfan Hu
Embedded systems typically operate in harsh environments, such as where there is external shock, insufficient power, or an obsolete sensor after the replacement cycle. Despite these harsh environments, embedded systems require data integrity for accurate operation. Unintended data changes can cause a serious error in…
Fangzheng Lin, Kasidis Arunruangsirilert, Heming Sun, Jiro Katto
Entropy coding is essential to data compression, image and video coding, etc. The Range variant of Asymmetric Numeral Systems (rANS) is a modern entropy coder, featuring superior speed and compression rate. As rANS is not designed for parallel execution, the conventional approach to parallel rANS partitions the input…
Timo Hillmann, Lucas Berent, Armanda O. Quintavalle, Jens Eisert + 2 more
'Robert Wille' 'Joschka Roffe'] Quantum low-density parity-check codes are a promising candidate for fault-tolerant quantum computing with considerably reduced overhead compared to the surface code. However, the lack of a practical decoding algorithm remains a barrier to their implementation. In this work, we introduce…
Kairui Tian, He Sun, Yukai Liu, Rongke Liu + 1 more
By exploiting the rich automorphisms of Reed-Muller (RM) codes, the recently developed automorphism ensemble (AE) successive cancellation (SC) decoder achieves a near-maximum-likelihood (ML) performance for short block lengths. However, the appealing performance of AE-SC decoding arises from the diversity gain that…
Andrea Di Giusto, Wim van Houtum, Alberto Ravagnani, Yan Wu
—Motivated by applications to digital audio broadcasting (DAB) systems, we study the a-posteriori probabilities (APPs) of the coded and information bits of the serial concatenation of multiple convolutional codewords. The main result of this paper is a proof that the APPs of the input bits do not change when…
Amir Said, Hoang Le, Farzad Farhadzadeh
—Video compression systems must support increasing bandwidth and data throughput at low cost and power, and can be limited by entropy coding bottlenecks. Efficiency can be greatly improved by parallelizing coding, which can be done at much larger scales with new neural-based codecs, but with some compression loss…
Chinnaiyan Senthilpari, Rosalind Deena, Lee Lini
Background: Low-density parity-check (LDPC) codes are more error-resistant than other forward error-correcting codes. Existing circuits give high power dissipation, less speed, and more occupying area. This work aimed to propose a better design and performance circuit, even in the presence of noise in the channel.…
David M. Benton
An unconventional encoding scheme called concurrent coding, has recently been demonstrated and shown to offer interesting features and benefits in comparison to conventional techniques, e.g. robustness against burst errors and improved efficiency of transmitted power. This concept has been demonstrated for the first…