• 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.

• Proceedings of the IEEK Conference
• /
• 2002.06e
• /
• pp.99-102
• /
• 2002

In this work, we evaluated the performance of soft iterative decoder with soft block decoder in optical storage system. Because optical storage system requires run- length limited code in general, adaptation of the soft decoders such as turbo code or LDPC(low density parity check code) is difficult without soft block decoders. The performance of the overall optical detection system is evaluated and the simplified channel detection is also proposed.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.17 no.2
• /
• pp.15-22
• /
• 1980

For efficient coding of graphic image data, the statistical characteristics for both Korean lettered images and English lettered images are measurpd and co mpared. Also, the measured run length distribution is compared with the run length distribution hased on Markov model. It is shown that the measured white run length distribution is more Bike a negative - power distribution than an exponential distribution . This fact is stronger in the Korean lettered images than is the English lettered images, The performances of four typical run length codes are compared for the same set of graphic data files,, and it is shown that the codes perform better in the Korean ]entered images :hart In Eng]isle lettered images.

• 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.

• Journal of KIISE:Software and Applications
• /
• v.28 no.11
• /
• pp.813-821
• /
• 2001

While recognition of isolated units of writing, such as a character or a word, has been extensively studied, emphasis on the segmentation itself has been lacking. In this paper we propose an active segmentation method for handwritten Hangul address strings based on the Run-length code. A slant correction algorithm, which is considered as an important preprocessing step for the segmentation, is presented. Three fundamental candidate estimation functions are introduced to detect the clues on touching points, and the classification of touching types is attempted depending on the structural peculiarity of Hangul. Our experiments show segmentation performance of 88.2% on touching characters with minimal over-segmentation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.1
• /
• pp.111-119
• /
• 1994

In this paper we propose a reversible image coding methods with progressive build-up function by bit-plane of multi-lavel image. Firstly, the differencial conversion is applied to reduce the entropy of source images. Then the bit-plane sequences of converted images are coded by means of the newly designed VFRL(Variable to Fixed Run-Llength) code and the RDHC(Run-length Dynamic Huffman Coding). We aim to the simple construction to reduce the complexity. The computer simulated results show that the proposed methods are very effective to the multi-level digital images. For "GIRL" and "COUPLE" of 1EEE monochromatic standard images, the compressibility are superior to the results obtained by the well-known universal codes.own universal codes.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.7
• /
• pp.23-33
• /
• 1996

This paper deals with the design of a recursively-indexed binary code for facsimile soruces and its performance. Sources used here are run-lengths of white pixels form higher-resolution facsimile. The modified huffman code used for G.3 facsimile is chosen for the performance comparison. Experiments confirm the fact that recursive indexing preserves the entropy of a memoryless geometric source: the entropy of recursively-indexed physical surce iwth roughly geometric distributin remains within 2% of the empirical source entropy. The designed recursively-indexed binary codes consist of a code applied to text-type documents and to graphics - type documents is compared iwth that of the modified huffman code. Numerical resutls show that the modified huffman code performs well for text-type documents and not equally well for graphics-tyep documents. On the other hand, recursively-indexed binary codes have shown a better performance for graphics-type documents whose distribution are similar to a geometric distribution. Specifically, the code rates of recursively-indexed binary codes with 60 codewords are from 8% to 20% of the empirical source entropy smaller than that of th emodified huffman code with 91 codewords.

• 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.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.9
• /
• pp.85-95
• /
• 2004

As the design complexity increases, it is a major problem that the size of test pattern is large and power consumption is high in scan, especially system-on-a-chip(SoC), with the automatic test equipment(ATE). Because static compaction of test patterns heads to higher power for testing, it is very hard to reduce the test pattern volume for low power testing. This paper proposes an efficient compression/decompression algorithm based on run-length coding for reducing the amount of test data for low power testing that must be stored on a tester and be transferred to SoC. The experimental results show that the new algorithm is very efficient by reducing the memory space for test patterns and the hardware overhead for the decoder.

• 전자공학회논문지 IE
• /
• v.45 no.3
• /
• pp.5-12
• /
• 2008

We propose efficient scan testing method capable of reducing the test data and power dissipation for digital logic circuits. The proposed testing method is based on a hybrid run-length encoding which reduces test data storage on the tester. We also introduce modified Bus-invert coding method and scan cell design in scan cell reordering, thus providing increased power saving in scan in operation. Experimental results for ISCAS'89 benchmark circuits show that average power of 96.7% and peak power of 84% are reduced on the average without fault coverage degrading. We have obtained a high reduction of 78.2% on the test data compared the existing compression methods.