• Title/Summary/Keyword: BitMap

Search Result 189, Processing Time 0.028 seconds

Butterfly Log-MAP Decoding Algorithm

  • Hou, Jia;Lee, Moon Ho;Kim, Chang Joo
    • Journal of Communications and Networks
    • /
    • v.6 no.3
    • /
    • pp.209-215
    • /
    • 2004
  • In this paper, a butterfly Log-MAP decoding algorithm for turbo code is proposed. Different from the conventional turbo decoder, we derived a generalized formula to calculate the log-likelihood ratio (LLR) and drew a modified butterfly states diagram in 8-states systematic turbo coded system. By comparing the complexity of conventional implementations, the proposed algorithm can efficiently reduce both the computations and work units without bit error ratio (BER) performance degradation.

Improved Contour Region Coding Method based on Scalable Depth Map for 3DVC (계층적 깊이 영상 기반의 3DVC에서 윤곽 부분 화질 개선 기법)

  • Kang, Jin-Mi;Jeong, Hye-Jeong;Chung, Ki-Dong
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.4
    • /
    • pp.492-500
    • /
    • 2012
  • In this paper, improved contour region coding method is proposed to accomplish better depth map coding performance. First of all, in order to use correlation between color video and depth map, a structure in SVC is applied to 3DVC. This can reduce bit-rate of the depth map while supporting the video to be transferred via various collection of network. As the depth map is mainly used to synthesize videos from different views, corrupted contour region can damage the overall quality of video. We hereby adapt a new differential quantization method when separating the contour region. The experimental results show that the proposed method can improve video quality by 0.06~0.5dB which translate the bit rate saving by 0.1~1.15%, when compared to the reference software.

Chaotic Block Encryption Using a PLCM (PLCM을 이용한 카오스 블록 암호화)

  • Shin Jae-Ho;Lee Sung-Woo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.43 no.3 s.309
    • /
    • pp.10-19
    • /
    • 2006
  • In this paper, we propose 128-bit chaotic block encryption scheme using a PLCM(Piecewise Linear Chaotic Map) having a good dynamical property. The proposed scheme has a block size of 12n-bit and a key size of 125-bit. The encrypted code is generated from the output of PLCM. We show the proposed scheme is very secure against statistical attacks and have very good avalanche effect and randomness properties.

On the Performance of CDT/DPCM Hybrid Coding (DCT/CPCM복합 감축방식의 성능에 관한 연구)

  • An, Jae-Hyeong;Kim, Nam-Cheol;Kim, Jae-Gyun
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.20 no.4
    • /
    • pp.47-54
    • /
    • 1983
  • The performance of an intra-frame DCT/DPCM hybrid coding is investigated with the criteria of normalized mean square error and subjective test for various system parameters. It includes the prediction coefficient in transform domain, normalization factor and bit-map in block quantizer, and adaptive coding. It is shown that the generalized covariance model of image is a convenient tool for bit-map and adaptive coding, and for a fast low bit-rate coding.

  • PDF

Design and Implementation of Hangul Graphic Board to Speed up the Generation of High Resolution Fonts used in Electric Public System (전자 출판 시스템에 사용되는 고해상도 문자의 발생을 가속시키기 위한 한글 그래픽 보드의 설게 및 제작)

  • 황규철;경종민
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.5
    • /
    • pp.802-807
    • /
    • 1990
  • In this thesis, we represent the study on the design and implementation of the hangul graphic board which generate bit map font data from the boundary information of korean or chines fonts. The implemented graphic board consists of a TMS34010 Graphic System Processor (GSP) and two TMS320C25 Digital Signal Processor (DSP), and there is shared memory which consists of two memory blocks with same address for which is possible parallel processing between two processors. And in using DSP, we propose an efficient algorithm for calculation of Bezier curve which require much times to calculate bit map data font from the boundary information.

  • PDF

Adaptive Coding Mode Decision Algorithm using Motion Vector Map in H.264/AVC Video Coding (H.264/AVC 부호기에서 움직임 벡터 맵을 이용한 적응적인 부호화 모드 결정 방법)

  • Kim, Tae-Jung;Ko, Man-Geun;Suh, Jae-Won
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.2
    • /
    • pp.48-56
    • /
    • 2009
  • We propose a fast intra mode skip decision algorithm for H.264/AVC video encoding. Although newly added MB encoding algorithms based on various prediction methods increase compression ratio, they require a significant increase in the computational complexity because we calculate rate-distortion(RD) cost for all possible MB coding modes and then choose the best one. In this paper, we propose a fast mode decision algorithm based on an adaptive motion vector map(AMVM) method for H.264/AVC video encoding to reduce the processing time for the inter frame. We verify that the proposed algorithm generates generally good performances in PSNR, bit rates, and processing time.

A Memory-Efficient Block-wise MAP Decoder Architecture

  • Kim, Sik;Hwang, Sun-Young;Kang, Moon-Jun
    • ETRI Journal
    • /
    • v.26 no.6
    • /
    • pp.615-621
    • /
    • 2004
  • Next generation mobile communication system, such as IMT-2000, adopts Turbo codes due to their powerful error correction capability. This paper presents a block-wise maximum a posteriori (MAP) Turbo decoding structure with a low memory requirement. During this research, it has been observed that the training size and block size determine the amount of required memory and bit-error rate (BER) performance of the block-wise MAP decoder, and that comparable BER performance can be obtained with much shorter blocks when the training size is sufficient. Based on this observation, a new decoding structure is proposed and presented in this paper. The proposed block-wise decoder employs a decoding scheme for reducing the memory requirement by setting the training size to be N times the block size. The memory requirement for storing the branch and state metrics can be reduced 30% to 45%, and synthesis results show that the overall memory area can be reduced by 5.27% to 7.29%, when compared to previous MAP decoders. The decoder throughput can be maintained in the proposed scheme without degrading the BER performance.

  • PDF

128-Bit Chaotic Block Encryption Scheme Using a PLCM (PLCM을 이용한 128비트 카오스 블록 암호화 기법)

  • Lee, Sung-Woo;Lee, Min-Goo;Park, Jeong-Yeol;Shin, Jae-Ho
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.4 no.2
    • /
    • pp.19-27
    • /
    • 2005
  • In this paper, we propose 128-bit chaotic block encryption scheme using a PLCM (Piecewise Linear Chaotic Map) having a good dynamical property. The proposed scheme has a block size of 128- bit and a key size of 128-bit. The encrypted code is generated from the output of PLCM. We show the proposed scheme is very secure against statistical attacks and have very good avalanche effect and randomness properties.

  • PDF

Noise Elimination of Speckle Fringe Phasemap (반점 간섭무늬 위상단면도의 잡음제거)

  • 조재완;홍석경;백성훈;김철중
    • Korean Journal of Optics and Photonics
    • /
    • v.5 no.2
    • /
    • pp.217-224
    • /
    • 1994
  • The combination of both phase-shifting convolution and 2-bit quantization smoothing filter was used to reduce speckle noise from saw-tooth speckle fringes phase map, obtained in phase-shifting speckle interferometer. The phase-shifting convolution showed the noise reduction capability of speckle fringe without destroying edge information across 271 jump. Also, it was shown that the 2-bit quantization smoothing filter was superior to average, low-pass filter and median filter in speeding up smoothing process and enhancing SIN ratio. Finally, a path dependent unwrapping algorithm was used to unwrap a noise reduced 271 modulo speckle phasemap. semap.

  • PDF