articleTop 1% cited

Near Shannon limit performance of low density paritycheck codes

Electronics Letters · 1997 · Vol. 33(6) · pp. 457–458

David Mackay✉(Cavendish Hospital)Radford M. Neal(University of Toronto)

Abstract

The authors report the empirical performance of Gallager's low density parity check codes on Gaussian channels. They show that performance substantially better than that of standard convolutional and concatenated codes can be achieved; indeed the performance is almost as close to the Shannon limit as that of turbo codes.

Error Correcting Code Techniques Advanced Wireless Communication Techniques Wireless Communication Security TechniquesTurbo codeSerial concatenated convolutional codesNoisy-channel coding theoremConvolutional codeMathematicsConcatenated error correction codeAlgorithmLow-density parity-check codeComputer scienceLimit (mathematics)

Citations

2,676

FWCI

18.27

field-weighted impact

References

Percentile

99%

vs. same field & year

Citations per year

Cited by

Turbo decoding as an instance of Pearl's "belief propagation" algorithm