• Title/Summary/Keyword: runlength

Search Result 19, Processing Time 0.025 seconds

Incremental-runlength distribution for Markov graphic data source (Markov 그라픽 데이타에 대한 incremental-runlength의 확률분포)

  • 김재균
    • 전기의세계
    • /
    • v.29 no.6
    • /
    • pp.389-392
    • /
    • 1980
  • For Markov graphic source, it is well known that the conditional runlength coding for the runs of correct prediction is optimum for data compression. However, because of the simplicity in counting and the stronger concentration in distrubution, the incremental run is possibly a better parameter for coding than the run itself for some cases. It is shown that the incremental-runlength is also geometrically distributed as the runlength itself. The distribution is explicitly described with the basic parameters defined for a Markov model.

  • PDF

Runlength Limited Codes based on Convolutional Codes

  • Kim, Jeong-Goo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.8A
    • /
    • pp.1437-1440
    • /
    • 2001
  • We present a modification method for runlength limited codes based on convolutional codes. This method is based on cosets of convolutional codes and can be applied to any convolutional code without degradation of error control performance of the codes. The upper bound of maximum zero and/or one runlength are provided. Some convolutional codes which have the shortest maximum runlength for given coding parameters are tabulated.

  • PDF

Simple 6-ary Runlength-Limited Code for Optical Storage Channels (광 기록 채널을 위한 간단한 6-ary Runlength-Limited Code)

  • Jhee Yoon-Kyoo
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.43 no.7 s.349
    • /
    • pp.7-12
    • /
    • 2006
  • A simple 6-ary(3, 10) runlength-limited(RLL) code for a six-level optical recording channel is presented. The proposed code can be represented by a finite state diagram with six states. The code is given achieving coding density of $3.33bits/T_{min}$, which is 96.6% efficient.

Very Efficient 6-ary Runlength-Limited Code Approaching Shannon Capacity for Optical Storage Channels (Shannon Capacity에 근접하는 고효율의 6-ary Runlength-Limited Code)

  • Jhee, Yoon-Kyoo
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.45 no.3
    • /
    • pp.29-35
    • /
    • 2008
  • Very efficient 6-ary runlength-limited codes for a six-level optical recording channel are presented when d = 3. The 6-ary(3, 15) code of rate 6/7 is given achieving coding efficiency of 98.87%. The efficiency of rate 13/15, (3, 20) code is 99.95%, which approaches the Shannon capacity. To increase the accurary of reading 6-ary signal, partial response modes are also investigated.

Feature Extraction of Handwritten Numerals using Projection Runlength (Projection Runlength를 이용한 필기체 숫자의 특징추출)

  • Park, Joong-Jo;Jung, Soon-Won;Park, Young-Hwan;Kim, Kyoung-Min
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.14 no.8
    • /
    • pp.818-823
    • /
    • 2008
  • In this paper, we propose a feature extraction method which extracts directional features of handwritten numerals by using the projection runlength. Our directional featrures are obtained from four directional images, each of which contains horizontal, vertical, right-diagonal and left-diagonal lines in entire numeral shape respectively. A conventional method which extracts directional features by using Kirsch masks generates edge-shaped double line directional images for four directions, whereas our method uses the projections and their runlengths for four directions to produces single line directional images for four directions. To obtain the directional projections for four directions from a numeral image, some preprocessing steps such as thinning and dilation are required, but the shapes of resultant directional lines are more similar to the numeral lines of input numerals. Four [$4{\times}4$] directional features of a numeral are obtained from four directional line images through a zoning method. By using a hybrid feature which is made by combining our feature with the conventional features of a mesh features, a kirsch directional feature and a concavity feature, higher recognition rates of the handwrittern numerals can be obtained. For recognition test with given features, we use a multi-layer perceptron neural network classifier which is trained with the back propagation algorithm. Through the experiments with the handwritten numeral database of Concordia University, we have achieved a recognition rate of 97.85%.

Design and Analysis of a Minimum Bandwidth Binary Line Code MB34 (최소대역폭 2진 선로부호 MB34의 설계 및 분석)

  • 김정환;김대영
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.29A no.8
    • /
    • pp.10-17
    • /
    • 1992
  • A new line code design technique based on the BUDA(Binary Unit DSV and ASV) concept is introduced. The new line code called MB34 and designed by this new technique is of the minimum bandwidth, dc-free, and runlength limited. To confirm the performance of the new code, its power spectrum and eye pattern are obtained, wherein spectral nulls at dc(f=0) and Nyguist frequency (f=1/2Ts) are clearly identified. It is also discussed how the transmission errors can be detected by monitoring the DSV, the ASV, and the runlength.

  • PDF

A Modified BCH Code with Synchronization Capability (동기 능력을 보유한 변형된 BCH 부호)

  • Shim, Yong-Geol
    • The KIPS Transactions:PartC
    • /
    • v.11C no.1
    • /
    • pp.109-114
    • /
    • 2004
  • A new code and its decoding scheme are proposed. With this code, we can correct and detect the errors in communication systems. To limit the runlength of data 0 and augment the minimum density of data 1, a (15, 7) BCH code is modified and an overall parity bit is added. The proposed code is a (16, 7) block code which has the bit clock signal regeneration capability and high error control capability. It is proved that the runlength of data 0 is less than or equal to 7, the density of data 1 is greater than or equal to 1/8, and the minimum Hamming distance is 6. The decoding error probability, the error detection probability and the correct decoding probability are presented for the proposed code. It is shown that the proposed code has better error control capability than the conventional schemes.

A Minimum-Bandwidth Line Code for Low-Pass Channels (저역 통과 선로를 위한 최소 대역폭 선로부로)

  • 김대영;김재균
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.20 no.5
    • /
    • pp.23-30
    • /
    • 1983
  • A new runlength-limited minimum-bandwidth line code is designed by modifying the duobinary code. Since the new code is runlength limited, the need for a data scrambling before transmission is eliminated. The eye width and the error probability of the new code are shown to be almost the same as those of the duobinary code. Also, the power spectral shape is scarcely changed, so that the new code is suitable for such low-pass channels as optical fibers.

  • PDF

Design and Analysis of Binary Line Code MB46 (2진 선로부호 MB46의 설계 및 분석)

  • 김정환;김대영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.9
    • /
    • pp.963-971
    • /
    • 1992
  • A (4,6) block binary line code is proposed. In addition to being de-free and runlength-limited, the new code called MB46 is strictly bandwidth-limited to the Nyquist frequency, thus achieving improved bandwidth efficiency over previously known binary line code. A technique specially employed in the design of the code is described in depth, and some performance measures including the eye pattern and the power spectrum are presented as obtained by simulation.

  • PDF

Design and Analysis of a Memoryless Minimum Bandwidth Birnary Line Code MB58 (Memoryless 최소대역폭 2진 선로부호 MB58의 설계 및 분석)

  • 김정환;김대영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.10
    • /
    • pp.1074-1080
    • /
    • 1992
  • A(5,8) block binary line code is proposed. The new line code called MB58 has the properties of being dc-free and runlength-limited, and it is strictly bandwidth-limited to the Nyquist frequency, such that bandwidth efficiency is improved. This new code is a memoryless code with a simple decoding rule and capability of error monitoring. The power spectrum and the eye pattern of the new code are obtained by simulation, wherein spectral nulls at DC(f=0) and Nyquist frequency (f=1/2Ts) are clearly identified.

  • PDF