15 papers · ranked by Valyu relevance
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…
Navid Ghavi Hossein‐Zadeh, Mohsen Moradi, Hessam Mahdavifar
—Fair-density parity-check (FDPC) codes have been recently introduced demonstrating improved performance compared to low-density parity-check (LDPC) codes standardized in 5G systems particularly in high-rate regimes. In this paper, we introduce a layered normalized min-sum (LNMS) messagepassing decoding algorithm for…
Jingbo Zhou, Xinmiao Zhang
—In order to protect intellectual properties against untrusted foundry, many logic-locking schemes have been de veloped. The idea of logic locking is to insert a key-controlled block into the circuit to make the circuit function incorrectly or go through redundant states without right keys. However, in the case that…
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…
Yuqing Ren, Hassan Harb, Yifei Shen, Alexios Balatsoukas‐Stimming + 1 more
'Andreas Burg'] Abstract—5G New Radio (NR) has stringent demands on both performance and complexity for the design of low-density paritycheck (LDPC) decoding algorithms and corresponding VLSI implementations. Furthermore, decoders must fully support the wide range of all 5G NR blocklengths and code rates, which is a…
Marvin Geiselhart, Moustafa Ebada, Ahmed Elkelesh, Jannis Clausius + 1 more
'Stephan ten Brink'] Abstract—We consider automorphism ensemble decoding (AED) of quasi-cyclic (QC) low-density parity-check (LDPC) codes. Belief propagation (BP) decoding on the conventional factor graph is equivariant to the quasi-cyclic automorphisms and therefore prevents gains by AED. However, by applying small…
Lingjun Kong, Haiyang Liu, Yuezhuang Shi, Jiacheng Miao + 1 more
In modern communication systems, the concatenation of a low-density parity-check (LDPC) code with a cyclic redundancy check (CRC) code is commonly used for error correction. In this paper, we propose a low-complexity two-stage scheme for decoding these codes using their concatenation structures. In the first stage, the…
Mohammad Rowshan, Min Qiu, Yixuan Xie, Xinyi Gu + 1 more
Channel coding plays a pivotal role in ensuring reliable communication over wireless channels. With the growing need for ultra-reliable communication in emerging wireless use cases, the significance of channel coding has amplified. Furthermore, minimizing decoding latency is crucial for critical-mission applications…
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…
Rachna Srivastava, Vincent C. Gaudet, Patrick Mitran
This paper describes a field-programmable gate array (FPGA) implementation of a fixed-point low-density lattice code (LDLC) decoder where the Gaussian mixture messages that are exchanged during the iterative decoding process are approximated to a single Gaussian. A detailed quantization study is first performed to find…
Yuxuan Sun, Liangbin Zhao, Jianguo Li, Ziyi Zhang + 3 more
'Xiangyuan Bu' 'Xiaomin Ma'] The traditional LDPC encoding and decoding system is characterized by low throughput and high resource consumption, making it unsuitable for use in cost-efficient, energy-saving sensor networks. Aiming to optimize coding complexity and throughput, this paper proposes a combined design of a…
Zihui Yan, Guanjin Qu, Xin Chen, Gang Zheng + 1 more
DNA-based data storage is a promising solution to the challenges of large-scale data storage. However, the low throughput of the mainstream inkjet-based DNA synthesis method has hindered its widespread adoption. In contrast, high-throughput electrochemical synthesis provides higher throughput but with more nucleotide…
Ramy Khabbaz, Jérémy Mateos, Marc Antonini, Serge Kas Hanna
The biochemical processes underlying DNA data storage, including synthesis, amplification, and sequencing, are inherently noisy. Consequently, base-level insertion, deletion, and substitution (IDS) errors, as well as sequence-level dropouts, occur and pose major challenges for reliable data retrieval. Here we introduce…
Inbal Preuss, Ben Galili, Zohar Yakhini, Leon Anavy
This study introduces a novel model for analyzing and determining the required sequencing coverage in DNA-based data storage, focusing on combinatorial DNA encoding. We explore the application of the coupon collector model for combinatorial-letter reconstruction, post-sequencing, which ensure efficient data retrieval…
Thach V. Bui
Neural coding is an important tool to discover the inner workings of mind. In this work, we propose and consider a simple but novel self-decoding model for neural coding based on the principle that the neuron body represents ongoing stimulus while dendrites are used to store that stimulus as a memory. In particular…