• Title/Summary/Keyword: Bit-Pattern

Search Result 293, Processing Time 0.03 seconds

Target bit allocation algorithm for generation of high quality static test stream (고화질 정지화 테스트 스트림의 생성을 위한 목표비트 할당 알고리즘)

  • Lee Gwang soon;Han Chan ho;Jang Soo wook;Kim Eun su;Sohng Kyu ik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3C
    • /
    • pp.147-152
    • /
    • 2005
  • In this paper, we proposed a method for compressing the static video test patterns in high quality to test the picture quality in DTV. In our method, we use the fact that the generated bits and average quantization value have almost identical distribution characteristics per each GOP and we propose a new target bit allocation method suitable for compressing the static test pattern while the target bit allocation method in MPEG-2 TM5 is suitable for the moving picture. The proposed target bit allocation method is to maintain the high quality video continuously by using the normalized complexities which are updated or maintained by means of picture qualities at each GOP. Experiment result showed that the test pattern stream encoded by MPEG-2 software with the proposed algorithm had a stable bit rate and good video quality during the decoding process.

Design of Data Retention Test Circuit for Large Capacity DRAMs (대용량 Dynamic RAM의 Data Retention 테스트 회로 설계)

  • 설병수;김대환;유영갑
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.30A no.9
    • /
    • pp.59-70
    • /
    • 1993
  • An efficient test method based on march test is presented to cover line leakage failures associated with bit and word lines or mega bit DRAM chips. A modified column march (Y-march) pattern is derived to improve fault coverage against the data retention failure. Time delay concept is introduced to develop a new column march test algorithm detecting various data retention failures. A built-in test circuit based on the column march pattern is designed and verified using logic simulation, confirming correct test operations.

  • PDF

Fast Variable-size Block Matching Algorithm for Motion Estimation Based on Bit-pattern (비트패턴을 기반으로 한 고속의 적응적 가변 블록 움직임 예측 알고리즘)

  • 신동식;안재형
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.4
    • /
    • pp.372-379
    • /
    • 2000
  • In this paper, we propose a fast variable-size block matching algorithm for motion estimation based on bit-pattern. Motion estimation in the proposed algorithm is performed after the representation of image sequence is transformed 8bit pixel values into 1bit ones depending on the mean value of search block, which brings a short searching time by reducing the computational complexity. Moreover, adaptive searching methods according to the motion information of the block make the procedure of motion estimation efficient by eliminating an unnecessary searching of low motion block and deepening a searching procedure in high motion block. Experimental results show that the proposed algorithm provides better performance-0.5dB PSNR improvement-than full search block matching algorithm with a fixed block size.

  • PDF

An Efficient Continuous Range Query Processing Through Grid based Query Indexing (그리드 기반의 질의 색인을 통한 효율적인 연속 영역 질의 처리)

  • Park, Yong-Hun;Bok, Kyoung-Soo;Yoo, Jae-Soo
    • The KIPS Transactions:PartD
    • /
    • v.14D no.5
    • /
    • pp.471-482
    • /
    • 2007
  • In this paper, we propose an efficient continuous range query processing scheme using a modified grid based query indexing to reduce storage spaces and to accelerate processing time. The proposed method has two major features. First, each query has a bit identifier and each cell in a grid has a bit pattern that consists of the bit identifiers of the queries. The bit patterns present the relationship between cells and queries. Using the bit patterns, we can compute quickly what queries overlap a cell in a grid and reduce the number of unnecessary operations by comparing the bit patterns without comparing the query identifiers when we compute the relation between cells and queries. Second, the management of cells in the grid by groups prevents from wasting the storage space through the increase of the length of the bit pattern and increasing the comparison costs of bit patterns. We show through the performance evaluation that the proposed method outperforms the existing methods.

Edge Detection Using the Co-occurrence Matrix (co-occurrence 행렬을 이용한 에지 검출)

  • 박덕준;남권문;박래홍
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.11
    • /
    • pp.111-119
    • /
    • 1992
  • In this paper, we propose an edge detection scheme for noisy images based on the co-occurrence matrix. In the proposed scheme based on the step edge model, the gray level information is simply converted into a bit-map, i.e., the uniform and boundary regions of an image are transformed into a binary pattern by using the local mean. In this binary bit-map pattern, 0 and 1 densely distributed near the boundary region while they are randomly distributed in the uniform region. To detect the boundary region, the co-occurrence matrix on the bit-map is introduced. The effectiveness of the proposed scheme is shown via a quantitative performance comparison to the conventional edge detection methods and the simulation results for noisy images are also presented.

  • PDF

Correlation Between Drilling Parameter and Tunnel Support Pattern Using Jumbo Drill (도로터널에서 지보패턴별 굴착지수 상관관계 고찰)

  • Kim, Nag-Young;Kim, Sung-Hwan;Chung, Hyung-Sik
    • Journal of Korean Tunnelling and Underground Space Association
    • /
    • v.3 no.4
    • /
    • pp.17-24
    • /
    • 2001
  • Four road tunnels of which the construction conditions were similar were selected in the paper, and laboratory tests and rockmass classification for the tunnels were carried out. And the analysis was performed to find out the correlation between ratio of bit abrasion or drilling parameter and support pattern of tunnel using jumbo drill machine. It was analyzed that there was average abrasion of bit from 11.85% to 3.25% per support patterns of tunnel in four tunnels. Drilling parameter happens to fluctuate according to extent of fracture zone.

  • PDF

An Antenna Shuffling Scheme for DSTTD System Based on Post-processing Signal to Noise Ratio (수신 신호 대 잡음비에 기반한 안테나 셔플링을 적용 DSTTD 시스템)

  • Jung Sunghun;Shim Seijoon;Lee Chungyong;Youn Dae Hee
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.1
    • /
    • pp.75-80
    • /
    • 2005
  • A new antenna shuffling scheme for double space time transmit diversity is proposed. The proposed method obtains the shuffling pattern directly from the estimated channel by maximizing minimum post-processing signal to noise ratio(SNR), while the conventional method minimizes channel correlation. Since the minimum post-processing SNR is directly related with error performance, the proposed method shows better bit error rate performance than the conventional method. Monte Carlo simulations showed that the proposed scheme has more 3 dB SNR gain than the conventional scheme for 10/sup -3/ bit error rate in spatially correlated fadingcaused by a single cluster model.

Fast Warping Prediction using Bit-Pattern for Motion Estimation (비트패턴을 이용한 고속 워핑 예측)

  • 강봉구;안재형
    • Journal of Korea Multimedia Society
    • /
    • v.4 no.5
    • /
    • pp.390-395
    • /
    • 2001
  • In this paper, we propose a fast warping prediction using bit-pattern for motion estimation. Because of the spatial dependency between motion vectors of neighboring node points carrying motion information, the optimization of motion search requires an iterative search. The computational load stemming from the iterative search is one of the major obstacles for practical usage of warping prediction. The motion estimation in the proposed algorithm measures whether the motion content of the area is or not, using bit-pattern. Warping prediction using the motion content of the area make the procedure of motion estimation efficient by eliminating an unnecessary searching. Experimental results show that the proposed algorithm can reduce more 75% iterative search while maintaining performances as close as the conventional warping prediction.

  • PDF

A Study on 1-D Bit-Serial Array Processor Design for Code-String Matching Using a MWLD Algorithm (MWLD 알고리즘을 이용한 문자열정합 1차원 Bit-Serial 어레이 프로세서의 설계)

  • 박종진;김은원;조원경
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.2
    • /
    • pp.1-8
    • /
    • 1992
  • This paper is proposed a Modified WLD (Weighted Levenshtein Distance) algorithm for processor desihn of code-string matching. A proposed MWLD (Modified Weighted Levenshtein Distance) algorithm is consist of 1-dimension bit-serial array processor to pattern matching using a Hamming Distance. The proposed processor is applied to recognition of character with real time input. The recognition rate of Hangul strokes is resulted to 98.65$\%$

  • PDF

A 512 Bit Mask Programmable ROM using PMOS Technology (PMOS 기술을 이용한 512 Bit Mask Programmable ROM의 설계 및 제작)

  • 신현종;김충기
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.18 no.4
    • /
    • pp.34-42
    • /
    • 1981
  • A 512-bit Task Programmable ROM has been designed and fabricated using PMOS technology. The content of the memory was written through the gate pattern during the fabrication process, and was checked by displaying the output of the chip on an oscilloscope with 512(32$\times$16) matrix points. The operation of the chip was surcessful with operating voltage from -6V to -l2V, The power consumption and propagation delay time have been measured to be 3mW and 13 $\mu$sec, respectively at -6 Volt. The power consunption increased to 27mW and propagation delay time decreased to 3$\mu$sec at -12V. The output of the chip was capable of driving the input of a TTL gate directly and retained a high impedence state when the chip solect function disabled the output.

  • PDF