• Journal of the Korea Society of Computer and Information
• /
• v.15 no.4
• /
• pp.27-36
• /
• 2010

The paper proposes RFB(Record Filtering using Bit-vector) join algorithm, an in-network strategy that uses bit-vector to drastically reduce the size of data and hence the communication cost. In addition, by eliminating data not involved in join result prior to actual join, communication cost can be minimized since not all data need to be moved to the join nodes. The simulation result shows that the proposed RFB algorithm significantly reduces the number of bytes to be moved to join nodes compared to the popular synopsis join(SNJ) algorithm.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.5
• /
• pp.10-16
• /
• 2010

XML is increasingly important in data exchange and information management. A large amount of efforts have been spent in developing efficient techniques for accessing, querying, and storing XML documents. In this paper, we propose a new method to cluster XML documents efficiently. A bit vector which represents a XML document is proposed to cluster the XML documents. The similarity between two XML documents is measured by a bit-wise AND operation between two corresponding bit vectors. The experiment shows that the clusters are formed well and efficiently when a bit vector is used for the feature of a XML document.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.652-654
• /
• 2015

최근 ICT융합 기술의 비약적인 발전에 따라 소형 휴대가 가능한 다양한 종류의 생체신호 측정센서의 출현으로 유헬스케어 관련 기술이 비약적으로 발전하게 되면서, 실시간으로 발생하는 생체데이터에 대한 효율적인 처리가 중요하게 되었다. 따라서 본 논문에서는 M2M기반에서 발생되는 생체데이터의 효율적인 전송을 위해 LZW(Lempel-Ziv-Welch) 압축 알고리즘과, BitVector압축 알고리즘을 결합한 LZW-BitVector 압축 알고리즘을 제안한다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.4
• /
• pp.14-23
• /
• 2011

In this paper, a 7-bit 2GSPS folding/interpolation A/D Converter(ADC) with a Self-Calibrated Vector Generator is proposed. The ADC structure is based on a folding/interpolation architecture whose folding/interpolation rate is 4 and 8, respectively. A cascaded preprocessing block is not only used in order to drive the high input signal frequency, but the resistive interpolation is also used to reduce the power consumption. Based on a novel self-calibrated vector generator, further, offset errors due to device mismatch, parasitic resistors. and parasitic capacitance can be reduced. The chip has been fabricated with a 1.2V 0.13um 1-poly 7-metal CMOS technology. The effective chip area including the calibration circuit is 2.5$mm^2$. SNDR is about 39.49dB when the input frequency is 9MHz at 2GHz sampling frequency. The SNDR is improved by 3dB with the calibration circuit.

• Proceedings of the KIEE Conference
• /
• 1999.11c
• /
• pp.745-747
• /
• 1999

디지털 TV의 동영상 표준인 MPEG2는 방대한 양의 디지털 데이터를 발생한다. 그러나 현재 사용하고 있는 디지털 저장 매체의 수용 능력에는 한계가 있으므로 저장을 위해 전송된 high bit rate의 MPEG2 bitstream을 더욱 낮은 bit rate의 bitstream으로 전환하는 transcoding 기법이 반드시 필요하다. 기존의 encoder와 decoder를 이용하여 구현 가능한 장점이 있는 cascade transcoder는 reencoding시 motion estimation에 많은 수행 시간이 소요되므로, motion estimation 과정을 최소화하면서 optimal motion vector를 구할 수 있는 motion vector refinement 기법을 MPEG2 cascade transcoder에 적용하였다. 결과 처리 속도는 3-5배 향상되었고 화질은 기존의 72 transcoder에 비해 평균 0.1dB 이상의 FSNR 향상이 있었다. 또한 1Mbps와 같은 low bit rate에서 더욱 큰 화질 향상이 있었다.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.677-680
• /
• 1998

In this paper, we proposed a lwo bit rate subband coding with adaptive vector quantization using the correlation between motion vector and block energy in subband. In this method, the difference between the input signal and the motion compensated interframe prediction signal is decomposed into several narrow bands using quadrature mirror filter (QMF) structure. The subband signals are then quantized by adaptive vector quantizers. In the codebook generating process, each classified region closer to the block value in the same region after the classification of region by the magnitude of motion vector and the variance values of subband block. Because codebook is genrated considering energy distribution of each region classified by motion vector and variance of subband block, this technique gives a very good visual quality at low bit rate coding.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12B
• /
• pp.2391-2400
• /
• 1999

Vector quantizer (VQ) is an efficient data compression technique for low bit rate applications. However, the major disadvantage of VQ is its encoding complexity which increases dramatically as the vector dimension and bit rate increase. Even though one can use a modified VQ to reduce the encoding complexity, it is nearly impossible to implement such a VQ at a high bit rate or for a large vector dimension because of the enormously large memory requirement for the codebook and the very large training sequence (TS) size. To overcome this difficulty, in this paper we propose a novel structurally constrained VQ for the high bit rate and the large vector dimension cases in order to obtain VQ-level performance. Furthermore, this VQ can be extended to the low bit rate applications. The proposed quantization scheme has a form of feed-forward adaptive quantizer with a short adaptation period. Hence, we call this quantization scheme sample-adaptive product quantizer (SAPQ). SAPQ can provide a 2 ~3dB improvement over the Lloyd-Max scalar quantizers.

• Journal of KIISE:Databases
• /
• v.35 no.4
• /
• pp.297-306
• /
• 2008

MJoin is proposed as an algorithm to join multiple data streams efficiently, whose characteristics are unpredictably changed. It extends a symmetric hash join to handle multiple data streams. Whenever a tuple arrives from a remote stream source, MJoin checks whether all of hash tables have matching tuples. However, when a join involves many data streams with low join selectivity, the performance of this checking process is significantly influenced by the checking order of hash tables. In this paper, we propose a BiHT-Join algorithm which extends MJoin to conduct this checking in a constant time regardless of a join order. BiHT-Join maintains a bit-vector which represents the existence of tuples in streams and decides a successful/unsuccessful join through comparing a bit-vector. Based on the bit-vector comparison, BiHT-Join can conduct a hash join only for successful joining tuples based on this decision. Our experimental results show that the proposed BiHT-Join provides better performance than MJoin in the processing of multiple streams.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.5
• /
• pp.767-774
• /
• 1990

Successive images can be reconstructed without great degradation by using one codebook in vector quantization, because statistics of successive images are sinilar. In this paper, we propose a method to update vector centroids in one slot of an image sequence and reconstruct images with the codebook replenished with the updated vector centroids. To remove the overhead required to transmit the updated vector centroids, we catagorize image blocks into changing blocks and nonchanging blocks, and then transmit only the labels of the changing blocks. Therefore, we can assign the remaining bits to the replenishment of a codebook. By the proposed method, almost the same image as the same image as the one reconstructed by LBG algorithm can be obtained and the bit rate can be reduced to below 0.5 bit/pixel.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.64-72
• /
• 1995

We propose a new image coding method which takes into account both statistical redundancy and perceptual irrelevancy of the DCT coefficients so as to provide a high quality of the reconstructed images with a reduced transmission bit rate First, a block of DCT coefficients are decomposed into 16 subvectors so as for a subvector to convey key information about one of the low-pass or the dirctional filtered images. Then, the most significant subvector is selected as the principal edge of the block and then vector quantized. After that, the residuals of the block are computed and then sequentially quantized through aforementioned procedure until the quantization distortion is smaller than the target distortion. The proposed scheme is good at encoding images with a variety of transmission bit rates, especially at very low bit rate coding. In addition, it is another benifit of the proposed scheme that an image can be quantized with a wide range of the transmission bit rates by simply adapting the stopping criterion of the sequential vector quantizer according to the target distortion of the reconstructed image.