Performance of Low-Density Parity Check Codes With Parity Encoded by (1,7) Run-Length Limited Code for Perpendicular Magnetic Recording
- Authors
- Kim, Jinyoung; Lee, Jaejin; Lee, Joohyun
- Issue Date
- Nov-2012
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- Low-density parity check (LDPC) codes; maximum transition run (MTR) codes; perpendicular magnetic channel; run-length limited (RLL) codes
- Citation
- IEEE TRANSACTIONS ON MAGNETICS, v.48, no.11, pp.4610 - 4613
- Journal Title
- IEEE TRANSACTIONS ON MAGNETICS
- Volume
- 48
- Number
- 11
- Start Page
- 4610
- End Page
- 4613
- URI
- http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/12321
- DOI
- 10.1109/TMAG.2012.2197736
- ISSN
- 0018-9464
- Abstract
- Maximum transition run (MTR) codes have recently been applied for perpendicular magnetic recording because of their high code rate. At the same time, the (1, 7) run-length limited (RLL) code, which increases the minimum distance of data transition, has not been applied due to a code rate that is lower than MTR codes. Therefore, in order to receive the advantages of both codes when low-density parity check (LDPC) codes are applied, this paper proposes an LDPC coding scheme with parity encoded by (1, 7) RLL code. This will increase the performance of LDPC codes and minimize the loss of code rate with MTR-coded user data in the perpendicular magnetic recording channel. The Viterbi trellis is easily modified by different constraints of MTR and (1, 7) RLL codes. Simulation results show that MTR-coded user data with (1, 7) RLL-coded LDPC parity performs approximately 0.3 dB better than MTR-coded user data with parity. It also performs better regardless of various user bit densities.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Information Technology > ETC > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/12321)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.