Cyclic redundancy check based message passing in Turbo Product Code decoding

Inactive Publication Date: 2005-09-15
SEAGATE TECH LLC
View PDF9 Cites 85 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Benefits of technology

[0005] A method of decoding a turbo product code (TPC) code word comprises performing a cyclic redundancy check (CRC) on each of a plurality of code blocks of the TPC code word. The bits of code blocks of the TPC code word which pass the CRC are assigned an artificially high probability confidence measure, such as an artifi

Problems solved by technology

However, increased iterations come at the expense of increa

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Cyclic redundancy check based message passing in Turbo Product Code decoding
  • Cyclic redundancy check based message passing in Turbo Product Code decoding
  • Cyclic redundancy check based message passing in Turbo Product Code decoding

Examples

Experimental program
Comparison scheme
Effect test

Example

[0020] Referring to FIG. 1, a perspective view of a disc drive 100 is shown. The present invention is useful in iteratively decoding turbo product code (TPC) code words in disc drive 100. In accordance with an aspect of the present invention, a Cyclic Redundancy Check (CRC) is performed on each of the plurality of code blocks of a TPC code word. For any code blocks which pass the CRC, the corresponding bits are assigned an artificially large log-likelihood ratio or other probability confidence measure. The processing requirements associated with decoding these bits are then reduced or eliminated in subsequent iterations. The number of iterations can also be reduced by aiding the iterative decoder in converging to the correct solution more quickly using the knowledge of correct bits in the code blocks (having the artificially large log-likelihood ratios). While embodiments of the present invention are illustrated, for example, with reference to disc drive 100, the present invention i...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

A method of decoding a turbo product code (TPC) code word comprises performing a cyclic redundancy check (CRC) on each of a plurality of code blocks of the TPC code word. The bits of code blocks of the TPC code word which pass the CRC are assigned an artificially high probability confidence measure, such as an artificially high log-likelihood ratio. Assigning these bits an artificially high probability confidence measure allows an iterative process, between a soft decision algorithm and a TPC decoder, to be less complex and to converge on a correct decoding solution more quickly. Apparatus for implementing the method are also provided.

Description

FIELD OF THE INVENTION [0001] The present invention relates to Turbo Product Code (TPC). More particularly, the present invention relates to TPC decoding techniques. BACKGROUND OF THE INVENTION [0002] Turbo code using iterative decoding algorithms has been shown to give a significant performance advantage over existing partial response maximum likelihood (PRML) channels. Turbo Product Code (TPC) with single parity check (TPC / SPC), which belongs to a family of turbo codes, presents the potential for less complex implementations with minimal performance losses. See for example J. Li, K. R. 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, pages 723-734, May 2002. TPC generally utilizes “square” code words (i.e., code words having the same number of rows and columns of bits), with each code word being comprised of square code blocks. An example of a 512 byte (4,096 bi...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): H03M13/00
CPCG11B20/10379H03M13/6343G11B20/1866G11B2020/1843G11B2020/1853G11B2020/1856G11B2020/1863G11B2220/2516H03M13/098H03M13/2963H03M13/2975H03M13/3994H03M13/4138H03M13/6325G11B20/1833
Inventor YEH, NAN-HSIUNGLI, YAN
Owner SEAGATE TECH LLC
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products