A technique for combining Marker codes and RS codes for insertion, deletion and substitution channels

Main Article Content

Santi Koonkarnkhai
Piya Kovintavewat

Abstract

        Insertion, deletion and substitution errors are crucial problems in a digital communication system, especially in a bit-patterned media recording (BPMR) system because they can cause an error burst in data detection process. This paper proposes a technique for combining a Marker code and a Reed-Solomon (RS) codes at a high code rate to reduce insertion, deletion and substitution errors. Specifically, the Marker code is used to detect and correct errors from insertion and deletion based on the estimated insertion/deletion locations, whereas the RS code is employed to correct the substitution errors and the remaining errors resulted from Marker code. Simulation results (in terms of bit-error rate (BER) at various probabilities of insertion, deletion and substitution) indicate that the proposed technique performs better than using only the Marker code or the RS code alone. In addition, we found that for the partial response channel, the optimal length of a Marker code is 60 bits at a code rate of 0.8329.

Article Details

How to Cite
Koonkarnkhai, S., & Kovintavewat, P. (2017). A technique for combining Marker codes and RS codes for insertion, deletion and substitution channels. Asia-Pacific Journal of Science and Technology, 18(1), 100–111. Retrieved from https://so01.tci-thaijo.org/index.php/APST/article/view/82819
Section
Research Articles

References

[1] Mori T, Imai H. Viterbi decoding considering synchronization errors. IEJCE Transactions Fundamentals. 1996;E79-A(9): 1324-1329.
[2] Shiroishi Y, Fukuda K, et al. Future options for HDD storage. IEEE Transactions on Magnetics. 2009;45(10): 3816-3822.
[3] Iyenger AR, Siegel PH, Wolf JK. Write channel model for bit-patterned media recording. IEEE Transactions on Magnetics. 2011;47(1): 35-45. หนวยเดซิเบล (dB: Decibel) [7]
[4] Ng Y, Kumar BVKV, Cai K, Nabavi S, Chong TC. Picket-shift codes for bit-patterned media recording with insertion/deletion errors. IEEE Transactions on Magnetics. 2010;46(6): 2268-2271.
[5] Sellers FF. Bit loss and gain correction code. IRE Transactions on Information Theory. 1962;1: 35-38.
[6] Chen J, Ng C, Varnica N. Concatenated codes for deletion channels. In Proceedings of the 2003 IEEE International Symposium on Information Theory. 2003 June 29-July 4; Yokohama, Japan; 2003. P. 218.
[7] Kuznetsov AV, Erden MF. inventor; Seagate Technology LLC, Assignee. Detecting and correcting insertion and deletion of bits for bit patterned media storage systems. United States patent US 7787208 B2. 2010 Aug 31.
[8] Inoue M, Keneko H. Deletion/insertion/reversal error correcting codes for bit-patterned media recording. In Proceeding of 2011 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology System. 2011 October 3-5; Vancouver, BC, Canada. 2011. P. 286-293.
[9] Krishnan RK, Vasic B. Coding for correcting insertions and deletions in bit-patterned media recording. In Proceeding of IEEE Global Telecommunications Conference 2011. 2011 December 5-9; Houston, Texas, USA. 2011. P. 1-5.
[10] Paluncic F, Abdel-Ghaffar AS, Ferreira HC, Clarke WA. A multiple insertion/deletioncorrecting code for run-length limited sequence. IEEE Transactions on Magnetics. 2012; 58(3): 1809-1824.
[11] Buttigieg V. Using variable-length codes to correct insertion, deletion and substitution errors. 12th Canadian Workshop on Information Theory. 2011 May 17-20; Kelowna, BC, Canada; 2011. P.143-146.
[12] Cheng MK, Siegel PH. List-decoding of parity-sharing Reed-Solomon codes in magnetic recording systems. In Proceeding of International Conference on Communications 2004. 2004 June 20-24; Paris, France. 2004. P.640-644.[13] Sklar B. Digital communications fundamentals and applications. Englewood Cliffs, 2nd- edition, Prentice Hall, 2000.