Advanced SearchSearch Tips
Finite Soft Decision Data Combining for Decoding of Product Codes With Convolutional Codes as Horizontal Codes
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Finite Soft Decision Data Combining for Decoding of Product Codes With Convolutional Codes as Horizontal Codes
Yang, Pil-Woong; Park, Ho-Sung; Hong, Seok-Beom; Jun, Bo-Hwan; No, Jong-Seon; Shin, Dong-Joon;
  PDF(new window)
In this paper, we propose feasible combining rules for a decoding scheme of product codes to apply finite soft decision. Since the decoding scheme of product codes are based on complex tanh calculation with infinite soft decision, it requires high decoding complexity and is hard to practically implement. Thus, simple methods to construct look-up tables for finite soft decision are derived by analyzing the operations of the scheme. Moreover, we focus on using convolutional codes, which is popular for easy application of finite soft decision, as the horizontal codes of product codes so that the proposed decoding scheme can be properly implemented. Numerical results show that the performance of the product codes with convolutional codes using 4-bit soft decision approaches to that of same codes using infinite soft decision.
channel coding;convolutional codes;product codes;soft decision data;Viterbi algorithm;
 Cited by
C. Yang, Y. Emre, and C. Chakrabarti, "Product code schemes for error correction in MLC NAND flash memories," IEEE Trans. VLSI Systems, accepted for publication.

C. Yi and J. H Lee, "Interleaving and decoding scheme for a product code for a mobile data communication," IEEE Trans. Comm., vol. 45, no. 2, pp. 144-147, Feb. 1997 crossref(new window)

B. Shin, S. Hong, H. Park, J. No, D. Shin, "New Decoding Scheme for LDPC Codes Based on Simple Product Code Structure," [Online]

J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans. Inform. Theory, vol. 42, no. 2, pp. 429-445, Mar. 1996. crossref(new window)

R.Y. Shao, S. Lin, and M. P. C Fossorier, "Two decoding algorithms for tailbiting codes," IEEE Trans. Comm. vol. 51, no. 10, pp. 1658-1665, Oct. 2003 crossref(new window)

F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: NorthHolland, 1978.

P. Elias, "Error-free coding," IRE Trans. Inform. Theory, vol. IT-4, pp. 29-37, Sep. 1954.

R. V. Cox and C. E. W. Sundberg, "An efficient adaptive circular Viterbi algorithm for decoding generalized tailbiting convolutional codes," IEEE Trans. Veh. Technol., vol. 43, no. 11, pp. 57-68, Feb. 1994. crossref(new window)

H. H. Ma and J. K. Wolf, "On tail biting convolutional codes," IEEE Trans. Comm., vol. 34, no. 2, pp. 104-111, Feb. 1986. crossref(new window)

Y. Yasuda, K. Kashiki, and Y. Hirata, "High-rate punctured convolutional codes for soft decision Viterbi decoding," IEEE Trans. Comm., vol. 32, no. 3, pp. 315-319, Mar. 1984. crossref(new window)

T. 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. crossref(new window)

R. Johannesson and K. S. Zigangirov, Fundamentals of Convolutional Coding. NJ: IEEE Press, 1999.

S. Lin and D. J. Costello, Jr., Error Control Coding, 2nd Ed. NJ: Prentice Hall, 2004.