http://iet.metastore.ingenta.com
1887

Near Shannon limit performance of low density parity check codes

Near Shannon limit performance of low density parity check codes

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The authors report the empirical performance of Gallager's low density parity check codes on Gaussian channels. It is shown 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.

References

    1. 1)
      • G. Battail , P. Camion , P. Charpin , S. Harari . (1993) We can think of good codes, and even decode them, Eurocode '92.
    2. 2)
      • Berrou, C., Glavieux, A., Thitimajshima, P.: `Near Shannon limit error-correcting codingand decoding: Turbo-codes', Proc. 1993 IEEE Int. Conf. Commun., 1993, Geneva, Switzerland, p. 1064–1070.
    3. 3)
      • Divsilar, D., Pollara, F.: `On the design of turbo codes', TDA 42-123, Technical report, November 1995.
    4. 4)
      • Forney, C.D.: `Concatenated codes', 37, Technical report, 1966.
    5. 5)
      • R.G. Gallager . Low density parity check codes. IRE Trans. Info. Theory , 21 - 28
    6. 6)
      • R.G. Gallager . (1963) Low density parity check codes.
    7. 7)
      • S.W. Golomb , R.E. Peile , R.A. Scholtz . (1994) Basic concepts in information theory andcoding: The adventures of secret agent 00111.
    8. 8)
      • MacKay, D.J.C., Neal, R.M.: `Good codes based on very sparse matrices', Cryptography and Coding. 5th IMA Conf., 1995, Springer, Berlin, p. 100–111number 1025 in Lecture Notesin Computer Science, .
    9. 9)
      • MacKay, D.J.C., and Neal, R.M.: ‘Good error correctingcodes based on very sparse matrices’.
    10. 10)
      • J. Pearl . (1988) Probabilistic reasoning in intelligent systems: Networks of plausibleinference.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19961141
Loading

Related content

content/journals/10.1049/el_19961141
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address