IEEE Transactions on Circuits & Systems II Express Briefs · 2020 · 15 citations · 11 references
EngineeringComputer EngineeringComputer ScienceDigital CommunicationHardware Description LanguagesSystem-on-chip DesignChannel CodingCoding TheoryError Control CodingError CorrectionError DetectionError-correcting CodesArea EfficiencyBinary CodesDecoding AlgorithmsLdpc CodesLow-density Parity-check CodesParity Check CodesThroughputThroughput Improvement
This brief presents a novel class of hard-decision algorithms for decoding low density parity check codes. The new algorithms, named fine-grained bit-flipping (FBF) algorithms, employ a detailed classification of each bit, by introducing the XOR value of its estimated and received value as a subdividing criterion. The fine-grained classification allows the algorithms to strengthen the information utilization during each iteration. Simulation results show that the FBF algorithms can achieve up to 5 times better decoding performance than the state-of-the-art bit-flipping algorithms over the binary symmetric channel. Additionally, a well-optimized hardware architecture is developed for implementing FBF algorithms. Compared to other decoders, implementation results demonstrate that the FBF decoders achieve higher throughput and area efficiency.
11
Low-density parity-check codes
Robert G. Gallager · IEEE Transactions on Information Theory · 1962 · 10.6K citations · Full text
Reduced-Complexity Decoding of LDPC Codes
J. Chen, Ajay Dholakia, Evangelos Eleftheriou et al. · IEEE Transactions on Communications · 2005 · 929 citations