Symbol-level synchronization and LDPC code design for insertion/deletion channels

IEEE Transactions on Communications

Volumn 59, Issue 5, 2011, Pages 1287-1297

  Wang, Feng ^a   Fertonani, Dario ^a   Duman, Tolga M ^a  

^a Arizona State University   (United States)

Author keywords

Insertion deletion channel; LDPC code design; marker codes; synchronization

Indexed keywords

ACHIEVABLE RATE; ADDITIVE WHITE GAUSSIAN NOISE CHANNEL; CODING SCHEME; CONVERGENCE BEHAVIORS; DECODING ALGORITHM; DEGREE DISTRIBUTIONS; ERROR RATE PERFORMANCE; EXTRINSIC INFORMATION TRANSFER CHARTS; INFORMATION EXCHANGES; INSERTION/DELETION CHANNEL; LDPC CODE DESIGN; LDPC CODE DESIGNS; LDPC CODES; LOW-DENSITY PARITY-CHECK CODES; MARKER CODES; NUMERICAL EVALUATIONS; RATE LOSS; SIMULATION RESULT; SYNCHRONIZATION ALGORITHM; SYNCHRONIZATION PROBLEM;

ALGORITHMS; CHANNEL CODING; CODES (SYMBOLS); CODING ERRORS; COMPUTER SIMULATION; DESIGN; ERROR CORRECTION; GAUSSIAN NOISE (ELECTRONIC); ITERATIVE DECODING; WHITE NOISE;

SYNCHRONIZATION;

EID: 79956260270     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2011.030411.100546     Document Type: Article

References (38)

1. 2 and up for magnetic recording?" IEEE Trans. Magnetics, vol. 33, no. 1, pp. 990-995, Jan. 1997. (Pubitemid 127762018)
2. R. L. Dobrushin, "Shannon's theorems for channels with synchronization errors," Problems of Inf. Transmiss., vol. 3, no. 4, pp. 11-26, 1967.
3. M. Mitzenmacher, "A survey of results for deletion channels and related synchronization channels," Probability Surveys, pp. 1-33, June 2009.
4. D. Fertonani and T. M. Duman, "Novel bounds on the capacity of the binary deletion channel," IEEE Trans. Inf. Theory, vol. 56, no. 6, pp. 2753-2765, June 2010.
5. D. Fertonani, T. M. Duman, and M. F. Erden, "Bounds on the capacity of channels with insertions, deletions and substitutions," IEEE Trans. Commun., vol. 59, no. 1, pp. 2-6, Jan. 2011.
6. F. F. Sellers Jr., "Bit loss and gain correction code," IRE Trans. Inf. Theory, vol. 8, no. 1, pp. 35-38, Jan. 1962.
7. N. J. A. Sloane, "On single-deletion-correcting codes," in Codes and Designs: Proc. Conf. Honoring Professor Dijen K. Ray-Chaudhuri on the Occasion of his 65th Birthday, May 2000, pp. 273-291.
8. Z. Liu and M. Mitzenmacher, "Codes for deletions and insertion channels with segmented errors," IEEE Trans. Inf. Theory, vol. 56, no. 1, pp. 224-232, Jan. 2010.
9. A. S. Helberg and H. C. Ferreira, "On multiple insertion/deletion correcting codes," IEEE Trans. Inf. Theory, vol. 48, no. 1, pp. 305- 308, Jan. 2002. (Pubitemid 34125331)
10. L. McAven and R. Safavi-Naini, "Classification of the deletion correcting capabilities of Reed-Solomon codes of dimension 2 over prime fields," IEEE Trans. Inf. Theory, vol. 53, no. 6, pp. 2280-2294, June 2007. (Pubitemid 46852037)
11. S. E. Tavares and M. Fukada, "Matrix approach to synchronization recovery for binary cyclic codes," IEEE Trans. Inf. Theory, vol. 15, no. 1, pp. 93-101, Jan. 1969.
12. G. Seguin, "On synchronizable binary cyclic codes," IEEE Trans. Inf. Theory, vol. 21, no. 5, pp. 589-592, Sep. 1975.
13. L. Cheng and H. Ferreira, "Rate-compatible path-pruned convolutional codes and their applications on channels with insertion, deletion and substitution errors," in Proc. IEEE Information Theory Workshop 2005, Aug. 2005, pp. 20-25. (Pubitemid 44461684)
14. T. G. Swart and H. C. Ferreira, "Insertion/deletion correcting coding schemes based on convolution coding," Electron. Lett., vol. 38, no. 16, pp. 871-873, Aug. 2002.
15. M. F. Mansour and A. H. Tewfik, "Convolutional codes for channels with substitutions, insertions, and deletions," in Proc. IEEE Global Telecommun. Conf., vol. 2, Nov. 2002, pp. 1051-1055.
16. V. I. Levenshtein, "Binary codes capable of correcting deletions, insertions and reversals," Dokl. Akad. Nauk SSSR, vol. 163, no. 4, pp. 845-848, 1965.
17. H. C. Ferreira, T. G. Swart, and M. P. dos Santos, "Using parallelinterconnected Viterbi decoders to correct insertion/deletion errors," in Proc. IEEE 7th AFRICON Conference, vol. 1, 2004, pp. 341-344. (Pubitemid 40851552)
18. L. Schulman and D. Zuckerman, "Asymptotically good codes correcting insertions, deletions, and transpositions," IEEE Trans. Inf. Theory, vol. 45, no. 7, pp. 2552-2557, Nov. 1999. (Pubitemid 30514225)
19. M. C. Davey and D. J. Mackay, "Reliable communication over channels with insertions, deletions and substitutions," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 687-698, Feb. 2001. (Pubitemid 32318097)
20. E. A. Ratzer, "Error-correction on non-standard communication channels," Ph.D. dissertation, University of Cambridge, Sep. 2003.
21. -, "Marker codes for channels with insertions and deletions," Annals of Telecommun., vol. 60, pp. 29-44, Jan. 2003.
22. L. R. Bahl and F. Jelinek, "Decoding for channels with insertions, deletions, and substitutions with applications to speech recognition," IEEE Trans. Inf. Theory, vol. 21, pp. 404-411, July 1975.
23. J. Chen, M. Mitzenmacher, C. Ng, and N. Varnica, "Concatenated codes for deletion channels," in Proc. IEEE International Symposium on Information Theory, 2003, p. 218.
24. R. G. Gallager, "Sequential decoding for binary channels with noise and synchronization errors," MIT Lincoln Lab. Group, Tech. Rep., Oct. 1961.
25. T. M. Cover and J. A. Thomas, Elements of Information Theory. John Wiley & Sons, Inc., 1991.
26. S. ten Brink, G. Kramer, and A. Ashikhmin, "Design of low-density parity-check codes for modulation and detection," IEEE Trans. Commun., vol. 52, no. 4, pp. 670-678, Apr. 2004.
27. M. Franceschini, G. Ferrari, and R. Raheli, "Does the performance of LDPC codes depend on the channel?" IEEE Trans. Commun., vol. 54, no. 12, pp. 2129-2132, Dec. 2006. (Pubitemid 46002154)
28. N. Varnica and A. Kavćić, "Optimized low-density parity-check codes for partial response channels," IEEE Commun. Lett., vol. 7, no. 4, pp. 168-170, Apr. 2003.
29. M. Franceschini, G. Ferrari, and R. Raheli, "EXIT chart-based design of LDPC codes for inter-symbol interference channels," in Proc. IST Summit, June 2005.
30. M. Mitzenmacher, "Capacity bounds for sticky channels," IEEE Trans. Inf. Theory, vol. 54, no. 1, pp. 72-77, Jan. 2008.
31. J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans. Inf. Theory, vol. 42, pp. 429-445, Mar. 1996. (Pubitemid 126770498)
32. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, pp. 498-519, Feb. 2001. (Pubitemid 32318087)
33. A. Kavćić, X. Mao, and M. Mitzenmacher, "Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds," IEEE Trans. Inf. Theory, vol. 40, no. 7, pp. 1636-1652, July 2003.
34. D. Arnold, H. Loeliger, P. Vontobel, A. Kavćić, and W. Zeng, "Simulation-based computation of information rates for channels with memory," IEEE Trans. Inf. Theory, vol. 52, no. 8, pp. 3498-3508, Aug. 2006. (Pubitemid 44145112)
35. E. Drinea and A. Kirsch, "Directly lower bounding the information capacity for channels with i.i.d. deletions and duplications," IEEE Trans. Inf. Theory, vol. 56, no. 1, pp. 86-102, Jan. 2010.
36. J. Hu, T. M. Duman, M. F. Erden, and A. Kavćić, "Achievable information rates for channels with insertions, deletions and intersymbol interference with i.i.d. inputs," IEEE Trans. Commun., vol. 58, no. 4, pp. 1102-1111, Apr. 2010.
37. X. Li and J. A. Ritcey, "Bit-interleaved coded modulation with iterative decoding," IEEE Commun. Lett., vol. 1, no. 6, pp. 169-171, Nov. 1997. (Pubitemid 127553321)
38. D. J. Mackay, "Good error correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, pp. 399-431, Mar. 1999.