A new LDPC decoding algorithm aided by segmented cyclic redundancy checks for magnetic recording channels

Cited 7 time in webofscience Cited 0 time in scopus
  • Hit : 159
  • Download : 0
We introduce a new low-density parity-check (LDPC) decoding algorithm that exploits the cyclic redundancy check (CRC) information of data segments. By using the error detection property of the CRC, we can successively decode data segments of a codeword corrupted by random errors and erasures. The key idea is that the messages from the variable nodes with correct checksum are fixed to deterministic log likelihood ratio values during LDPC iterative decoding. This approach improves the decoding speed and codeword error rate without significant modification of the LDPC decoding structure. Moreover, the CRC is also used for an early stopping criterion of LDPC decoding. Simulation results verify our claims.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2005-07
Language
English
Article Type
Letter
Keywords

CODES; PERFORMANCE; ERROR

Citation

IEEE TRANSACTIONS ON MAGNETICS, v.41, no.7, pp.2318 - 2320

ISSN
0018-9464
DOI
10.1109/TMAG.2005.851861
URI
http://hdl.handle.net/10203/89716
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 7 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0