15 papers · ranked by Valyu relevance
Jiahui Meng, Danfeng Zhao, Hai Tian, Liang Zhang
In order to improve the performance of non-binary low-density parity check codes (LDPC) hard decision decoding algorithm and to reduce the complexity of decoding, a sum of the magnitude for hard decision decoding algorithm based on loop update detection is proposed. This will also ensure the reliability, stability and…
Hayato Goto
Standard approaches to quantum error correction for fault-tolerant quantum computing are based on encoding a single logical qubit into many physical ones, resulting in asymptotically zero encoding rates and therefore huge resource overheads. To overcome this issue, high-rate quantum codes, such as quantum low-density…
Wenbo Shi, Wenlong Xie, Jiashen Hu, Lishan Liu + 1 more
Future wireless networks require channel coding schemes that can provide high reliability, low latency, and strong adaptability under finite-blocklength and structurally heterogeneous transmission scenarios. Globally coupled low-density parity-check (GC-LDPC) codes are promising for such systems because their coupled…
Wen Cao, Meng Hui, Qisheng Wu
Methods dealing with the problem of Joint Tracking and Classification (JTC) are abundant, among which Simultaneous Tracking and Classification (STC) provides a modularized scheme solving tracking and classification subproblems simultaneously. However, there is no explicit hard decision on the class label but only soft…
Guoming Song, Dongming Pi, Shancheng Zhao, Chi Wan Sung
Product codes (PCs) are widely used in high-speed communication systems due to their attractive trade-off between error-correction performance and complexity. To further meet the rapidly growing demand for higher data rates, soft-aided hard-decision decoders (SA-HDDs) have been developed. In this paper, we present a…
Predrag Ivaniš, Srdjan Brkić, Bane Vasić, Syed A. Jafar
We propose a novel variant of the gradient descent bit-flipping (GDBF) algorithm for decoding low-density parity-check (LDPC) codes over the binary symmetric channel. The new bit-flipping rule is based on the reliability information passed from neighboring nodes in the corresponding Tanner graph. The name…
Yaping Xu, Lulu Ding, Shigang Wu, Jue Ruan
Composite DNA letters, by merging all four DNA nucleotides in specified ratios, offer a pathway to substantially increase the logical density of DNA digital storage (DDS) systems. However, these letters are susceptible to nucleotide errors and sampling bias, leading to a high letter error rate, which complicates…
Lulu Ding, Shigang Wu, Zhihao Hou, Alun Li + 4 more
'Weihua Pan' 'Jue Ruan'] Title: ABSTRACT Error-correcting codes (ECCs) employed in the state-of-the-art DNA digital storage (DDS) systems suffer from a trade-off between error-correcting capability and the proportion of redundancy. To address this issue, in this study, we introduce soft-decision decoding approach into…
Basel Solaiman, Didier Guériot, Shaban Almouahed, Bassem Alsahwa + 1 more
'Éloi Bossé'] Uncertainty is at the heart of decision-making processes in most real-world applications. Uncertainty can be broadly categorized into two types: aleatory and epistemic. Aleatory uncertainty describes the variability in the physical system where sensors provide information (hard) of a probabilistic type.…
Nicholas Chancellor, Szilard Szoke, Walter Vinci, Gabriel Aeppli + 1 more
'Paul A. Warburton'] Optimisation problems typically involve finding the ground state (i.e. the minimum energy configuration) of a cost function with respect to many variables. If the variables are corrupted by noise then this maximises the likelihood that the solution is correct. The maximum entropy solution on the…
Hasnain Raza, Syed Azhar Ali Zaidi, Aamir Rashid, Shafiq Haider + 1 more
'Saeed Mian Qaisar'] Area efficient and high speed forward error correcting codes decoder are the demand of many high speed next generation communication standards. This paper explores a low complexity decoding algorithm of low density parity check codes, called the min-sum iterative construction a posteriori…
Kevin D Volkel, Paul W Hook, Albert Keung, Winston Timp + 2 more
HEDGES was originally described with hard decoding, so we extend it to support soft decoding. Since it is a convolutional code, we construct a full trellis to represent its decoding steps. A trellis for HEDGES must have a width of at least $2H$ states for H history bits. Traditionally, each state has two outgoing edges…
Shaojing Su, Jing Zhou, Zhiping Huang, Chunwu Liu + 1 more
This paper gives a solution to the blind parameter identification of a convolutional encoder. The problem can be addressed in the context of the noncooperative communications or adaptive coding and modulations (ACM) for cognitive radio networks. We consider an intelligent communication receiver which can blindly…
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…
Joshua I. Glaser, Ari S. Benjamin, Raeed H. Chowdhury, Matthew G. Perich + 2 more
'Matthew G. Perich' 'Lee E. Miller' 'Konrad P. Kording'] Title: Abstract Despite rapid advances in machine learning tools, the majority of neural decoding approaches still use traditional methods. Modern machine learning tools, which are versatile and easy to use, have the potential to significantly improve decoding…