Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
43 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

An Optimal Unequal Error Protection LDPC Coded Recording System (2310.04923v2)

Published 7 Oct 2023 in cs.IT and math.IT

Abstract: For efficient modulation and error control coding, the deliberate flipping approach imposes the run-length-limited(RLL) constraint by bit error before recording. From the read side, a high coding rate limits the correcting capability of RLL bit error. In this paper, we study the low-density parity-check (LDPC) coding for RLL constrained recording system based on the Unequal Error Protection (UEP) coding scheme design. The UEP capability of irregular LDPC codes is used for recovering flipped bits. We provide an allocation technique to limit the occurrence of flipped bits on the bit with robust correction capability. In addition, we consider the signal labeling design to decrease the number of nearest neighbors to enhance the robust bit. We also apply the density evolution technique to the proposed system for evaluating the code performances. In addition, we utilize the EXIT characteristic to reveal the decoding behavior of the recommended code distribution. Finally, the optimization approach for the best distribution is proven by differential evolution for the proposed system.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (54)
  1. The power spectrum of run-length-limited codes. IEEE Trans. Commun., 37(9):906–917, September 1989.
  2. Partial-response decoding of rate l/2 modulation codes for digital storage. IEEE Trans. Commun., 39(11):1569–1581, November 1991.
  3. Coded modulation and precoding for electron-trapping optical memories. IEEE Trans. Commun., 46(8):1011–1019, August 1998.
  4. Finite-state modulation codes for data storage. IEEE J. Select. Areas Commun., 10(1):5–37, January 1992.
  5. Design techniques for weakly constrained codes. IEEE Trans. Commun., 51(5):709–714, May 2003.
  6. Construction of maximum run-length limited codes using sequence replacement techniques. IEEE J. Select. Areas Commun., 28(2):200–207, February 2010.
  7. J. Moon and L. R. Carley. Efficient sequence detection for intersymbol interference channels with run-length constraints. IEEE Trans. Commun., 42(9):2654–2660, September 1994.
  8. Prefix-synchronized run-length-limited sequences. IEEE J. Select. Areas Commun., 10(1):214–212, January 1992.
  9. 4-level run-length limited optical storage on photo-chromic materials. In Proc. of SPIE 5966, International Symposium on Optical Storage, pages Y1–Y4, April 2005.
  10. Study of multi-level run-length limited photo-chromic storage. Acta Physica Sinica, 55:1759–1763, April 2006.
  11. Modulation codes for multi-wavelength and multi-level photochromic optical recording channel. Jpn. J. Appl. Phys., 45(2):1090–1096, February 2006.
  12. New efficient run-length limited code for multilevel read-only optical disc. Jpn. J. Appl. Phys., 46(6):3782–3786, June 2007.
  13. Modeling and realization of a multilevel readonly disk. Optics Express, 14:1199–1207, February 2006.
  14. Analysis of the differential phase detection signal in multi-level run-length limited read-only disk driver. Jpn. J. Appl. Phys., 45:5764–5768, 2006.
  15. H. Hu and L. Pan. Prml detection of multi-level dvd channels with run-length-limited modulation. In Proc. ICC, pages 6238–6242, 2007.
  16. Constrained coding techniques for soft iterative decoders. In Proc. IEEE Global Telecommun. Conf., pages 723–727, 1999.
  17. Joint message-passing decoding of ldpc codes and partial-response channels. IEEE Trans. Inform. Theory, 48(6):1410–1422, June 2002.
  18. B. Vasic and K. Pedagani. Run-length-limited low-density parity check codes based on deliberate error insertion. IEEE Trans. Magn., 40(3):1738–1743, May 2004.
  19. J. Lu and K. G. Boyer. Novel rll-ecc concatenation scheme for high-density magnetic recording. IEEE Trans. Magn., 43(6):2271–2273, June 2007.
  20. Z. Li and B.V.K. Vijaya Kumar. An improved bit-flipping scheme to achieve run length control in coded systems. IEEE Trans. Magn., 41:2980–2982, October 2005.
  21. Z. Li and B. V. Kumar. Low-density parity-check codes with run length limited (rll) constraints. IEEE Trans. Magn., 42:344–349, February 2006.
  22. Low-density parity-check codes with run length limited (rll) constraints. IEEE Trans. Magn., 44:2235–2242, September 2008.
  23. R. G. Gallager. Low-density parity-check codes. MA: MIT Press, 1963.
  24. D. J. C. MacKay. Good error-correcting codes based on very sparse matrices. IEEE Trans. Inform. Theory, 5(2):399–431, March 1997.
  25. Codes for digital recorders. IEEE Trans. Inform. Theory, 44(6):2260–2300, October 1998.
  26. Channel modeling and signal processing for probe storage channels. IEEE J. Select. Areas Commun., 2(2):143–157, February 2010.
  27. Iterative correction of intersymbol interference: Turbo equalization. Europ. Trans. Telecommun., 6:507–511, September 1995.
  28. A modified concatenated coding scheme with applications to magnetic storage. IEEE Trans. Inform. Theory, 44(4):1565–1574, July 1998.
  29. K. Sakaniwa K. Kasai, T. Shibuya. Detailed representation of irregular ldpc code ensembles and density evolution. Proc. ISIT, June 2003.
  30. Optimization of ldpc codes for uep channels. In Proc. ISIT, June 2004.
  31. Nonuniform error correction using low-density parity-check codes. IEEE Trans. Inform. Theory, 51(7):2702–2714, 2005.
  32. Unequal error protection using partially regular ldpc codes. IEEE Trans. on Commun., 55(3):387–391, 2007.
  33. N. Rahnavard and F. Fekri. New results on unequal error protection using ldpc codes. IEEE Trans. on Commun. letter, 10(1):43–45, January 2006.
  34. N. Deetzen and S. Sandberg. Design of unequal error protection ldpc codes for higher order constellations. In Proc. ICC, 2007.
  35. Iterative decoding for partial response (pr), equalized, magneto-optical (mo) data storage channels. IEEE J. Select. Areas Commun., 19(4):774–782, April 2001.
  36. An rll-constrained ldpc coded recording system using deliberate flipping and flipped-bit detection. IEEE Trans. Communications, 60(12):3587–3596, December 2012.
  37. Capacity approaching run-length-limited codes for multilevel recording systems. IEEE Trans. Magn., 46(1):95–104, January 2010.
  38. Optimal decoding of linear codes for minimizing symbol error rate. IEEE Trans. Inform. Theory, 20(2):284–287, March 1974.
  39. B. Masnick and J.K. Wolf. On linear unequal error protection codes. IEEE Trans. Inform. Theory,, 13(4):600–607, October 1967.
  40. Coded modulation or satellite digital video broadcasting. IEICE Trans. Fund. Electron. Commun. Comput. Sci.,, (9):1355–1360, 1996.
  41. Multilevel coded modulation for unequal error protection and multistage decoding¡xpart i: Symmetric constellations. IEEE Trans. on Commun., 48(2):204–213, February 2000.
  42. Bit error probability for maximum likelihood decoding of linear block codes and related soft-decision decoding methods. IEEE Trans. Inform. Theory, 44(9):3083–3090, November 1998.
  43. R. M. Tanner. A recursive approach to low complexity. IEEE Trans. Inform. Theory, 27(5):533–547, September 1981.
  44. Design of capacity-approaching low-density parity-check codes. IEEE Trans. Inform. Theory, 47:619–637, February 2001.
  45. Regular and irregular progressive edge-growth tanner graphs. IEEE Trans. Communications, 51(1):386–392, January 2005.
  46. The capacity of low-density parity-check codes under message-passing decoding. IEEE Trans. Inform. Theory, 47(2):599–618, February 2001.
  47. Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds. IEEE Trans. Inform. Theory, 49(7):1636–1652, 2003.
  48. Design of efficiently encodable moderate-length high-rate irregular ldpc codes. IEEE Trans. Communications, 49(4):564–571, April 2004.
  49. On the design of low-density parity-check codes within 0.0045 db of the shannon limit. IEEE Commun. Lett., 5(4):58–60, February 2001.
  50. J. Chen and M. P. C. Fossorier. Density evolution for two improved bp-based decoding algorithms of ldpc codes. IEEE Trans. on Commun. Letter, 6(5):208–210, May 2002.
  51. S. Y. Chung. On the Construction of Some Capacity-Approaching Coding Schemes. PhD Thesis of Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science, 2000.
  52. S. T. Brink. Convergence behavior of iteratively decoded parallel concatenated codes. IEEE Trans. Commun., 40:1727–1737, October 2001.
  53. Joint message-passing decoding of ldpc codes and partial-response channels. IEEE Trans. Commun., 48(6):1410–1422, June 2002.
  54. R. Storn and X. Price. Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds. Journal of Global Optimization, 11(7):341–359, November 1997.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now