20 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…
Pavel Rybin, Kirill Andreev, Victor Zyablov, Balazs Matuz + 2 more
'Alexey Frolov' 'Aaron Gulliver'] This paper deals with the specific construction of binary low-density parity-check (LDPC) codes. We derive lower bounds on the error exponents for these codes transmitted over the memoryless binary symmetric channel (BSC) for both the well-known maximum-likelihood (ML) and proposed…
Jingjing Li, Rodrigo C. de Lamare, Henk Wymeersch
—In practice, LDPC codes are decoded using message passing methods. These methods offer good performance but tend to converge slowly and sometimes fail to converge and to decode the desired codewords correctly. Recently, tree-reweighted message passing methods have been modified to improve the convergence speed at…
Beomkyu Shin, Seokbeom Hong, Hosung Park, Jong‐Seon No + 1 more
'Dong‐Joon Shin'] In this paper, a new decoding scheme for low-density parity-check (LDPC) codes using the concept of simple product code structure is proposed based on combining two independently received soft-decision data for the same codeword. LDPC codes act as horizontal codes of the product codes and simple…
Hassan Khodaiemehr, Mohammad‐Reza Sadeghi, Amin Sakzad
LDPC lattices were the first family of lattices that equipped with iterative decoding algorithms under which they perform very well in high dimensions. In this paper, we introduce quasi cyclic low density parity check (QC-LDPC) lattices as a special case of LDPC lattices with one binary QC-LDPC code as their underlying…
M. Revathy, R. Saravanan
Low-density parity-check (LDPC) codes have been implemented in latest digital video broadcasting, broadband wireless access (WiMax), and fourth generation of wireless standards. In this paper, we have proposed a high efficient low-density parity-check code (LDPC) decoder architecture for low power applications. This…
Haoqiang Liu, Hongbo Zhao, Xiaowen Chen, Wenquan Feng + 1 more
Modern navigation satellite communication has the characteristic of high transmitting rate. To avoid bit errors in data transmission, low density parity check (LDPC) codes are widely recognized as efficient ways for navigation communication. Conventionally, the LDPC decoding is applied for additive white Gaussian noise…
Zhiqiang Cui, Zhongfeng Wang, Xinmiao Zhang
Layered decoding is well appreciated in Low-Density Parity-Check (LDPC) decoder implementation since it can achieve effectively high decoding throughput with low computation complexity. This work, for the first time, addresses low complexity column-layered decoding schemes and VLSI architectures for multi-Gb/s…
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…
Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Laurent Schmalen + 1 more
'Stephan ten Brink'] Abstract—LDPC code design tools typically rely on asymptotic code behavior and are affected by an unavoidable performance degradation due to model imperfections in the short length regime. We propose an LDPC code design scheme based on an evolutionary algorithm, the Genetic Algorithm (GenAlg)…
Peng Kang, Yixuan Xie, Lei Yang, Zheng Chen + 2 more
'Yuejun Wei'] Abstract—In this paper, we propose an enhanced quasimaximum likelihood (EQML) decoder for LDPC codes with short block lengths. After the failure of the conventional belief propagation (BP) decoding, the proposed EQML decoder selects unreliable variable nodes (VNs) and saturates their associated channel…
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…
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…
Shubham Chandak, Kedar Tatwawadi, Billy Lau, Jay Mardia + 6 more
With the amount of data being stored increasing rapidly, there is significant interest in exploring alternative storage technologies. In this context, DNA-based storage systems can offer significantly higher storage densities (petabytes/gram) and durability (thousands of years) than current technologies. Specifically…
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…
Kechao Huang, David G. M. Mitchell, Lai Wei, Xiao Ma + 1 more
'Daniel J. Costello'] In this paper, we compare the finite-length performance of protograph-based spatially coupled lowdensity parity-check (SC-LDPC) codes and LDPC block codes (LDPC-BCs) over GF(q). In order to reduce computational complexity and latency, a sliding window decoder with a stopping rule based on a soft…
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…
Jingcheng Zhang, Lei Chen, Jinlin Sun, Shumin Li + 5 more
DNA has emerged as a compelling archival storage medium, offering unprecedented information density and millennia-scale durability. Despite its promise, DNA-based data storage faces critical challenges due to error-prone processes during DNA synthesis, storage, and sequencing. In this study, we introduce Gungnir, a…