Two-bit marker boosts product code decoding with low cost
Iterative Bounded Distance Decoding With 2-Bit Reliability Marker For Product-Like Codes
Information Theory
Summary
Decoding errors in data transmission is a challenge, especially when trying to balance accuracy and speed. The paper presents a way to improve error correction for product codes using just two bits of extra information per data bit. One bit helps check if the decoder made a mistake, while the other guides corrections when errors happen. This method enhances decoding performance without needing much extra memory or computation, making it efficient and effective.
What this means in practice
- •For communication system engineers: Improve error correction in coded communication links with efficient two-bit reliability markers.
- •For storage device designers: Enhance reliability of data storage error correction with low-overhead soft-aided decoding techniques.
Authors
Xiaowei Wu, Min Qiu, Yueying Zhan, Lei Yang
Abstract
We propose a novel soft-aided hard-decision decoding scheme for product codes based on two-bit quantized reliability markers. In particular, one bit is used for a two-level tolerance miscorrection check to validate the bounded distance decoding (BDD) result, while the other identifies bits to be randomly flipped upon BDD failure and miscorrection. List decoding is incorporated to further facilitate the error performance. Density evolution is performed for the design of the quantization thresholds. Compared to iterative BDD, the proposed scheme requires only moderate increases in memory and computational overhead. Simulation results verify that our scheme outperforms several unquantized soft-aided decoders, while maintaining small memory costs and low BDD attempts.