• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6A
• /
• pp.888-893
• /
• 1999

This paper introduces M-ary multitrack run-length (d.k) constrained codes for optical storage systems. We calculate capacities and densities of the codes. We have driven a general form of the state transition matrix for M-ary multitrack (d,k) codes. Using the largest eigenvalue of the transition matrix, we calculate the capacity and density. The capacity approaches to the limit with a small k constraint compared to single-track codes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.7
• /
• pp.1559-1565
• /
• 1997

A new multitrack RLL codes with immunity to intertrack interference (ITI) is proposed. This code takes aim at a high density storage channels by reducing the track width and/or guard bands between tracks since it prevents transition in neighboring tracks at the same time epoch. The capacities of the codes are found for each maximum and minimum constraint pair.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2000.04a
• /
• pp.49-52
• /
• 2000

멀티미디어 데이터 저장에 있어서 중요한 요소 중의 하나는 얼마나 많은 양의 정보를 주어진 공간에 기록할 수 있느냐는 것이다. 현재 많이 사용되고 있는 광저장장치(optical channel) 기록을 위하여 Squared M-ary RLL의(d, k) 제한조건을 이용하여 상태천이행렬을 일반화하고 채널용량을 구하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.744-749
• /
• 2013

We propose soft user data input on LDPC codes with parity encoded by the (1, 7) run length limited (RLL) code for perpendicular magnetic recording channel. The user data are encoded by maximum transition run (MTR) (3;11) code. In order to minimize the loss of code rate, the (1, 7) RLL code only encode the parity of LDPC. Also, to increase performance, we propose only user data part applied soft output Viterbi algorithm (SOVA). The performance using the SOVA showed good performance lower than 26 dB. In contrast, it showed worse performance high than 26 dB. This is because of incorrect soft information by high jitter noise and two different input types for LDPC decoder.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3C
• /
• pp.77-82
• /
• 2005

Partial response maximum likelihood (PRML) detection using the Viterbi algorithm involves the calculation of likelihood metrics that determine the most likely sequence of decoded data. In general, it is assumed that branches at each node in the trellis diagram have same probabilities. If modulation code with minimum and maximum run-length constraints is used, the occurrence ratio (Ro) of each particular pattern is different, and therefore the assumption is not true. We present a calculation scheme of the likelihood metrics for the PRML detection using the occurrence ratio. In simulation, we have tested the two (1,7) run-length-limited codes and calculated the occurrence ratios as the orders of PR targets are changed. We can identify that the PRML detections using the occurrence ratio provide more than about 0.5dB gain compared to conventional PRML detections at 10/sup -5/ BER in high-density magnetic recording and optical recording channels.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1C
• /
• pp.59-64
• /
• 2004

We propose a new RLL(run length limited) (2,7) PP(parity preserving) code with 4 RMTR(repeated minimum transition run) for optical recording. The proposed code has better characteristics in terms of density ratio, RMTR, DC(direct current) component suppression, BER(bit error rate) and system complexity than (2,1O) code that currently applied in storage systems and (1,7) PP code that highly recommended as the next generation optical recording system. Some characteristics of the code are described with several simulations. And the proposed code's superiorites in performance is illustrated as compared with the other codes.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.8
• /
• pp.1128-1136
• /
• 1989

The power spectral densities of run-length-limited(RLL) minimum-bandwidth(MB) line codes are obtained for some values of the zero probability of input data. They can be obtianed by implementing a computer program for the G.L. Cariolaro's algorithm. Using the program we calculate the power spectra of the known RLL MB line codes, such as VDB5, TIB5, VMDB5, RMD35, DRMD35, RMD45, and RMD33, and compare the characteristics of them. Specially, the relationship between eye widths and power spectra is analyzed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2074-2079
• /
• 1997

Much recent work has been done in the two related areas of source coding for data compression, and channel coding for data storage, respectively. We propose two (0, k) run-lengh limited(RLL) data compression codes for the storage that combine source and channel coding. It was shown that the propsoed codes approach the maximum code rate of (0, k) code as k increase. Thus, the overall code rate of storage system can be increased by using the combined source/channel coding as compared to the conventional 8/9 code which is popular in hard drive systems Functhermore, one can also reduce the complexity of modulation coding procedure by using already RLL constrained data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2C
• /
• pp.175-180
• /
• 2009

When we apply the LDPC code for high density optical storage channel, it is necessary to make an algorithm that the modulation code decoder must feed the LDPC decoder soft-valued information because LDPC decoder exploits soft values using the soft input. Therefore, we propose the soft-input soft-output run-length limited 17PP decoding algorithm and compare performance of LDPC codes. Consequently, we found that the proposed soft-input soft-output decoding algorithm using 17PP is 0.8dB better than the soft-input soft-output decoding algorithm using (1, 7) RLL.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.141-144
• /
• 2000

PRML (partial response maximum-likelihood) 과 FDTS/DF (fixed-delay tree search with decision feedback)는 기록 저장 시스템에서 준최적의 성능을 보임이 잘 알려져 있다. 그러나, 위와 같은 정보열 검출 기법은 피할 수 없는 복잡도 문제를 가지고 있다. 본 논문은 최소 run 길이 제한조건 d=2를 가진 광기록 채널을 위한 다양한 저복잡도 검출 기법을 다룬다. 우선, 결정 궤환 기법을 이용한 이산 정합 여파기 (discrete matched filter with decision feedback：DMF/DF)가 기존의 PRML로부터 유도된다. 유도된 시스템은 PRML보다 결정 궤환에 의한 성능 이득을 갖는다. 또한, 메트릭 계산을 사용하지 않는 저복잡도 FDTS/DF가 유도된다. 모의실험 결과에 의하면, 유도된 저복잡도 검출 기법들은 기록 밀도 S>=5.5에서 P(D)=1+D+D/sup 2/+D/sup 3/의 target을 갖는 PRML보다 우수한 성능을 보인다.