2005 · 68 citations · 8 references
EngineeringComputer EngineeringComputer ScienceAlgorithmsDigital CommunicationMessage PassingChannel CodingCoding TheoryError Control CodingError CorrectionError DetectionError-correcting CodesBlock CodesDecoding AlgorithmsIterative DecodingLdpc CodesLow-density Parity-check CodesMessage-passing AlgorithmsParity CheckingStopping Criteria
Low density parity check (LDPC) codes are amongst the most powerful codes known today. They are decoded iteratively by a message-passing algorithm. For this, an inherent stopping criterion exists for decodable blocks based on parity checks. For undecodable blocks, typically, a fixed number of iterations are carried out before the decoding procedure is terminated, which is a waste of energy and time. We present a stopping criterion which detects undecodable blocks in an early stage of the decoding process. The novel stopping criterion works for floating and fixed point implementations. It greatly reduces the average number of required iterations without any loss in communication performance.
8
Low-density parity-check codes
Robert G. Gallager · IEEE Transactions on Information Theory · 1962 · 10.6K citations · Full text