• Title/Summary/Keyword: variable-length data

Search Result 318, Processing Time 0.029 seconds

Variable length Chromosomes in Genetic Algorithms for Modeling the Class Boundaries

  • Bandyopadhyay, Sanghamitra;Pal, Sankar K.;Murthy, C.A.
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.634-639
    • /
    • 1998
  • A methodology based on the concept of variable string length GA(VGA) is developed for determining automatically the number of hyperplanes and their appropriate arrangement for modeling the class boundaries of a given training data set in RN. The genetic operators and fitness functionare newly defined to take care of the variability in chromosome length. Experimental results on different artificial and real life data sets are provided.

  • PDF

An Implementation on the High Speed VLD using Shift Buffer (시프트 버퍼를 이용한 고속 가변길이 디코더 구현)

  • Noh, Jin-Soo;Baek, Hui-Chang;Rhee, Kang-Hyeon
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.759-760
    • /
    • 2006
  • In this paper, The author designed on high speed VLD(Variable Length Decoder) using shift buffer. Variable Length Decoder is received N bit data from input block and decode the input signal using Shifting Buffer, Length Decoder and Symbol Decoder blocks. The inner part of shifting buffer in proposed Variable Length Decoder is filled input data and then operating therefore, the proposed structure can improve the decoded speed. And in this paper we applying pipeline structure therefore data is decoded in every clock.

  • PDF

Partially Decodable and Reversible Variable Length Code for Efficient Image Transmission

  • Nishida, Susumu;Muling, Guo;Hasegawa, Madoka;Kato, Shigeo
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.458-461
    • /
    • 2000
  • Variable length codes are often used in entropy coding, but are very vulnerable in noisy environments. Reversible variable length codes, however, muse possible to decode instantaneously in both forward and backward directions, so that more usable data can be retrieved when bit errors occur via transmission. Furthermore, partial decodability is desirable to introduce in the reversible variable length code because ROI (Region Of Interest) decoding function is sometimes required in recent image information systems such as the medical imaging, the digital museum and so on. In this paper, we propose a partially decodable and reversible variable length code by modifying Golomb-Rice code.

  • PDF

High-Performance Variable-Length Reed-Solomon Decoder Architecture for Gigabit WPAN Applications (기가비트 WPAN용 고성능 가변길이 리드-솔로몬 복호기 구조)

  • Choi, Chang-Seok;Lee, Han-Ho
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.49 no.1
    • /
    • pp.25-34
    • /
    • 2012
  • This paper presents a universal architecture for variable-length eight-parallel Reed-Solomon (RS) decoder for high-rate WPAN systems. The proposed architecture can support not only RS(255,239) code but various shortened RS codes. Moreover, variable-length architecture provides variable low latency for various shortened RS codes and the eight-parallel design also provides high data processing rate. Using 90-$nm$ CMOS standard cell technology, the proposed RS decoder has been synthesized and measured for performance. The proposed RS decoder can provide a maximum 19-$Gbps$ data rate at clock frequency 300 $MHz$.

An optimization method for variable length information messages (가변 길이 정보 메시지 최적화 방법)

  • Kim, Jingyu;Kang, Sungwon;Jung, Pilsu;Kim, Jungmin;Baek, Haeun;Kwon, Koo Hyung;Kim, Sang Soo
    • Journal of Software Engineering Society
    • /
    • v.26 no.1
    • /
    • pp.1-16
    • /
    • 2013
  • Variable length information message is a communication protocol standard in order for computer network systems to provide efficient delivery of information. The variable length information messages were developed for varying and controlling details of information in accordance with message receiver's required information level or information access level. In the previous studies, data compressing techniques have been in use for information message optimization technologies in order to reduce physical sizes of information messages. In optimization technologies for information messages, accuracy of information is considered as the most important factor; therefore, only non-loss compression techniques are applied to the optimization technologies. However, the non-loss compression based information message optimization methods are not efficient in data compression, and these are limited to efficient delivery of information in wireless network environments that have constraint bandwidth. In this paper, we attempt to optimize information in the variable length information messages at message fields in order to reduce physical sizes of messages more efficiently. To demonstrate the efficiency of our approach, we conduct optimization experiments for variable length information messages.

  • PDF

File Modification Pattern Detection Mechanism Using File Similarity Information

  • Jung, Ho-Min;Ko, Yong-Woong
    • International journal of advanced smart convergence
    • /
    • v.1 no.1
    • /
    • pp.34-37
    • /
    • 2012
  • In a storage system, the performance of data deduplication can be increased if we consider the file modification pattern. For example, if a file is modified at the end of file region then fixed-length chunking algorithm superior to variable-length chunking. Therefore, it is important to predict in which location of a file is modified between files. In this paper, the essential idea is to exploit an efficient file pattern checking scheme that can be used for data deduplication system. The file modification pattern can be used for elaborating data deduplication system for selecting deduplication algorithm. Experiment result shows that the proposed system can predict file modification region with high probability.

Throughput of Coded DS CDMA/Unslotted ALOHA Networks with Variable Length Data Traffic and Two User Classes in Rayleigh Fading FSMC Model

  • Tseng, Shu-Ming;Chiang, Li-Hsin;Wang, Yung-Chung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.12
    • /
    • pp.4324-4342
    • /
    • 2014
  • Previous papers analyzed the throughput performance of the CDMA ALOHA system in Rayleigh fading channel, but they assume that the channel coefficient of Rayleigh fading was the same in the whole packet, which is not realistic. We recently proposed the finite-state Markov channel (FSMC) model to the throughput analysis of DS uncoded CDMA/unslotted ALOHA networks for fixed length data traffic in the mobile environment. We now propose the FSMC model to the throughput analysis of coded DS CDMA/unslotted ALOHA networks with variable length data traffic and one or two user classes in the mobile environment. The proposed DS CDMA/unslotted ALOHA wireless networks for two user classes with access control can maintain maximum throughput for the high priority user class under high message arrival per packet duration.

Host Anomaly Detection of Neural Networks and Neural-fuzzy Techniques with Soundex Algorithm (사운덱스 알고리즘을 적용한 신경망라 뉴로-처지 기법의 호스트 이상 탐지)

  • Cha, Byung-Rae;Kim, Hyung-Jong;Park, Bong-Gu;Cho, Hyug-Hyun
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.15 no.2
    • /
    • pp.13-22
    • /
    • 2005
  • To improve the anomaly IDS using system calls, this study focuses on Neural Networks Learning using the Soundex algorithm which is designed to change feature selection and variable length data into a fixed length learning pattern. That is, by changing variable length sequential system call data into a fixed length behavior pattern using the Soundex algorithm, this study conducted neural networks learning by using a backpropagation algorithm with fuzzy membership function. The back-propagation neural networks and Neuro-Fuzzy technique are applied for anomaly intrusion detection of system calls using Sendmail Data of UNM to demonstrate its aspect of he complexity of time, space and MDL performance.

Construction of Symmetrical Reversible Variable-Length Codes from the Huffman Code (Huffman 부호에 기초한 대칭적 양방향 가변길이 부호의 설계 방법)

  • Jeong Wook-Hyun;Ho Yo-Sung
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.41 no.1
    • /
    • pp.57-68
    • /
    • 2004
  • Although variable-length codes (VLCs) increase coding efficiency using the statistical characteristics of the source data, they have catastrophic effects from bit errors in noisy transmission environments. In order to overcome this problem with VLCs, reversible variable-length codes (RVLCS) have recently been proposed owing to their data recovering capability. RVLCS can be divided into two categories: symmetrical and asymmetrical RVLCs. Although the symmetrical RVLC has generally more overheads than the asymmetrical RVLC, it has some advantages of simpler design and more efficient memory usage. However, existing symmetrical RVLCs still have high complexity in their code design and some room for improvement in coding efficiency. In this paper, we propose a new algorithm for constructing a symmetrical RVLC from the optimal Huffman code table. The proposed algorithm has a simpler design process and also demonstrates improved performance in terms of the average codeword length relative to the existing symmetrical RVLC algorithms.

A Multiple Access Scheme for Wireless Data Communications in Local Area (근거리 무선 데이터통신을 위한 다중 액세스 기법)

  • 정동근;최종호;전화숙
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.29A no.10
    • /
    • pp.1-7
    • /
    • 1992
  • This paper proposes reservation-based multiple access with variable frame length (RMAV) which is a new multiple access scheme for indoor and outdoor wireless data communications. RMAV is based on the slot reservation scheme and adopts a frame structure with variable frame length. The frame length increases as the number of active terminals and/or the system load increases. As a result, RMAV is adapted to the changes in the traffic pattern, and it offers short delay in light load conditions and high throughput in heavy load conditions. The performance of RMAV is evaluated by simulations. In addition, it is compared with the performance of PRMA(packet reservation multiple access).

  • PDF