Skip to main content
SpringerLink
Log in

Iterative Codes in Magnetic Storage Systems

  • Chapter
Turbo Code Applications

  • 802 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W.W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes. MIT Press: Cambridge, Mass., 1972.

    Google Scholar 

  2. K. Immink, P. Siegel, and J. Wolf, “Codes for digital recorders,” IEEE Trans. Inform. Theory, vol. 44, no. 6, pp. 2260–2299, 1998.

    MathSciNet  Google Scholar 

  3. T. Conway, “A new target with parity coding for high density magnetic recording channels,” IEEE Trans. on Magnetics, vol. 34, no. 4, pp. 2382–2386, July 1998.

    Article  Google Scholar 

  4. Z. Wu, P. A. McEwen, K. K. Fitzpatrick, and J. M. Cioffi, “Interleaved parity check codes and reduced complexity detection,” in Proc. ICC’1999, pp. 1648–1652, June 1999.

    Google Scholar 

  5. H. K. Thapar and A. M. Patel, “A class of partial response system for increasing storage density in magnetic recording,” IEEE Trans. Magn., vol. Mag-25, pp 3666–3668, Sep. 1987.

    Google Scholar 

  6. A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.

    Google Scholar 

  7. G. D. Forney, “Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference,” IEEE Trans. Inform. Theory, vol. IT-18, no. 3, pp. 363–378, May 1972.

    MathSciNet  Google Scholar 

  8. P. Chevillat, E. Eleftheriou, and D. Maiwald, “Noise predictive partial-response equalizers and applications,” in Proc. ICC1992, pp. 942–947. June 1992.

    Google Scholar 

  9. C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: Turbo codes,” in Proc. ICC’1993, pp. 1064–1070, 1993.

    Google Scholar 

  10. R. G. Gallager, Low-Density Parity Check Codes. MIT Press, Cambridge, MA, 1963.

    Google Scholar 

  11. D. J. C. Mackay and R. M. Neal, “Good codes based on very sparse matrices”, Cryptography and Coding. 5th IMA Conference, 1995. Available from http://wol.ra.phy.cam.ac.uk.

    Google Scholar 

  12. C. Douillard, M. Jezequel, C. Berrou, A. Picart, P. Didier and A. Glavieux, “Iterative correction of intersymbol interference: Turbo-equalization,” European Transaction on Telecommunications, vol. 6, pp. 507–511, Sep. 1995.

    Google Scholar 

  13. L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 284–287, Mar. 1974.

    MathSciNet  Google Scholar 

  14. J. Hagenauer and P. Hoeher, “A Viterbi algorithm with soft-decision outputs and its applications,” in Proc. IEEE Globecom. Conf., pp. 1680–1686, Nov. 1989.

    Google Scholar 

  15. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, “Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding,” IEEE Trans. on Inform. Theory, vol. IT-44, no. 3, pp. 909–926, May 1998.

    MathSciNet  Google Scholar 

  16. T. Souvignier, A. Friedmann, M. Oberg, P. Siegel, R. E. Swanson, and J. K. Wolf, “Turbo codes for PR4: parallel Versus serial concatenation,” in Proc. ICC’1999, pp. 1638–1642, June 1999.

    Google Scholar 

  17. F. Kschischang, B. Frey, and H. Loeliger, “Factor graphs and the sum-product algorithm”, IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 498–519, Feb. 2001.

    Article  MathSciNet  Google Scholar 

  18. S. Ten Brink, “Convergence of iterative decoding,” Electronics Letters, vol. 35, no. 10, pp. 806–808, May 1999.

    Google Scholar 

  19. H. El Gamal and A. R. Hammons Jr., “Analyzing the turbo decoder using the Gaussian approximation,” IEEE Trans. Inform. Theory, vol. 47, pp. 671–686, Feb., 2001.

    Article  MathSciNet  Google Scholar 

  20. T. J. Richardson, and R. Urbanke, “The capacity of low-density parity-check codes under message-passing decoding,” IEEE Trans. Inform. Theory, vol. 47, No.2, pp. 599–618, Feb. 2001.

    MathSciNet  Google Scholar 

  21. S. Y. Chung, “On the construction of some capacity-approaching coding schemes,” Ph.D. dissertation, Massachusetts Institute Technology, Sep. 2000.

    Google Scholar 

  22. J. Fan, E. Kurtas, A. Friedmann, S.W. McLaughlin, “LDPC codes for magnetic recording,” Proc. of 36th Allerton Conf., Monticello, Illinois, pp. 1314–1323, Sept. 1999.

    Google Scholar 

  23. H. Song, J. Liu and B. V. K. Vijaya Kumar, “Low complexity LDPC codes for partial response channels,” in Proc. IEEE Globecom. Conf., pp. 1294–1299, Taipei, Nov. 2002.

    Google Scholar 

  24. J. Li, K. Narayanan, E. Kurtas, and C. N. Georghiades, “On the performance of high-rate TPC/SPC Codes and LDPC codes over partial response channels,” IEEE Trans. Commun., vol. 50, no. 5, May 2002, pp. 723–734.

    Google Scholar 

  25. T. J. Richardson, “Error floors of LDPC codes,” Proc. of 41th Allerton Conf., 2003.

    Google Scholar 

  26. V. Guruswami and M. Sudan, “Improved decoding of Reed-Solomon and algebraic-geometric codes,” IEEE Trans. Inform. Theory, vol. 45, no. 6, pp. 1757–1767, September 1999.

    Article  MathSciNet  Google Scholar 

  27. R. Koetter and A. Vardy, “Algebraic soft-decision decoding of Reed-Solomon codes,” IEEE Trans. Inform. Theory, vol. 49, no.11, pp. 2809–2825, Nov. 2003.

    Article  MathSciNet  Google Scholar 

  28. Y. Kou, S. Lin and M. Fossorier, “Low density parity check codes based on finite geometries: a rediscovery,” Proc. IEEE International Symposium on Information Theory, Italy, June 2000.

    Google Scholar 

  29. H. Song, “Iterative soft detection and decoding for data storage channels,” Ph.D. dissertation, Dept. of ECE, Carnegie Mellon University, Pittsburgh, PA, 2002.

    Google Scholar 

  30. TC. Laot, A. Glavieux, and J. Labat, “Turbo equalization: adaptive equalization and channel decoding jointly optimized,” IEEE Journal on Sel. Areas in Comm., vol 19, pp. 1744–1752, September 2001.

    Google Scholar 

  31. M. Tuchler, R. Koetter and A. C. Singer, “Turbo equalization: principles and new results,” IEEE Trans. Comm., vol. 50, no. 5, pp. 754–767, May 2002.

    Article  Google Scholar 

  32. J. Fan, Constrained coding and soft iterative decoding, Kluwer Academic Publishers, July 2001.

    Google Scholar 

  33. D. Arnold and H. Loeliger, “On the information rate of binary-input channels with memory,” in Proc. ICC2001, Helsinki, Finland, pp. 2692–2695, June 2001.

    Google Scholar 

  34. K. R. Narayanan, “Effect of precoding on the convergence of turbo equlization for partial response channels,” IEEE Journal on Sel. Area. Commun., vol 19, pp.686–698, April 2002.

    Google Scholar 

  35. S. Lin, H. Song and B.V.K. Vijaya Kumar, “Performance evaluation of nearshannon limit performance code using reconfigurable computing,” submitted to 2005 ACM/SIGDA 13th international Symposium on FPGA, Aug. 2004.

    Google Scholar 

  36. J.L. Fan, “Array codes as Low-Density Parity Check Codes” 2nd International Symposium on Turbo Codes and Related Topics (Brest, France), September 2000.

    Google Scholar 

  37. A. Kavcic and J. M. Moura, “The Viterbi algorithm and Markov noise memory,” IEEE Trans. Inform. Theory, vol. 46, pp. 291–301, Jan. 2000.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Agere Systems, USA

    Hongwei Song

  2. Carnegie Mellon University, USA

    B. V. K. Vijaya Kumar

Authors
  1. Hongwei Song
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. V. K. Vijaya Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. National Electronics and Computer Technology Center (NECTEC), Pathumthani, Thailand

    Keattisak Sripimanwat

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer

About this chapter

Cite this chapter

Song, H., Vijaya Kumar, B.V.K. (2005). Iterative Codes in Magnetic Storage Systems. In: Sripimanwat, K. (eds) Turbo Code Applications. Springer, Dordrecht. https://doi.org/10.1007/1-4020-3685-X_2

Download citation

  • DOI: https://doi.org/10.1007/1-4020-3685-X_2

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-1-4020-3686-6

  • Online ISBN: 978-1-4020-3685-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation