15 papers · ranked by Valyu relevance
Luka Skorić, 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 for certain problems. However, the physical qubits within a quantum computer are prone to noise and decoherence, which must be corrected in order to perform reliable, fault-tolerant…
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…
Cody Rivera, Sheng Di, Jiannan Tian, Xiaodong Yu + 2 more
'Franck Cappello'] Cody Rivera? , Sheng Di‡ , Jiannan Tian† , Xiaodong Yu‡ , Dingwen Tao†? , Franck Cappello‡ ?Department of Computer Science, University of Alabama, Tuscaloosa, AL, USA †School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA, USA ‡Mathematics and Computer…
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…
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…
Li Deng, Kai Tao, Zhiping Shi, You Zhang + 5 more
In this paper, some optimized encoding and decoding schemes are proposed for the generalized LDPC convolutional codes (GLDPC-CCs). In terms of the encoding scheme, a flexible doping method is proposed, which replaces multiple single parity check (SPC) nodes with one generalized check (GC) node. Different types of BCH…
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.…
Mohammed Mensouri, Mustapha Eddahibi
In this paper, we introduce a new coding and decoding structure for enhancing the reliability and performance of polar codes, specifically at low error rates. We achieve this by concatenating two polar codes in series to create robust error-correcting codes. The primary objective here is to optimize the behavior of…
Hamid Saber, Homayoon Hatami, Jung Hyun Bae
—Polar codes are the first class of structured channel codes that achieve the symmetric capacity of binary channels with efficient encoding and decoding. In 2019, Arikan proposed a new polar coding scheme referred to as polarization-adjusted convolutional (PAC) codes. In contrast to polar codes, PAC codes precode the…
Mohammed Abutaha, Islam Amar, Salman AlQahtani, Xiaowei Li + 2 more
Encrypting pictures quickly and securely is required to secure image transmission over the internet and local networks. This may be accomplished by employing a chaotic scheme with ideal properties such as unpredictability and non-periodicity. However, practically every modern-day system is a real-time system, for which…