• 한국음향학회:학술대회논문집
• /
• 한국음향학회 1994년도 제11회 음성통신 및 신호처리 워크샵 논문집 (SCAS 11권 1호)
• /
• pp.199-204
• /
• 1994

In this paper, we researched abut CELP speech coding algorithm using efficlent pseudo-stochastic block codes, adaptive-codebook and improved fixed-gain codebook. The pseudo-stochastic block codes refer to stochastically populated block codes in which the adjacent codewords in an innovation codebook are non-independent. The adaptive-codebook was made with previous prediction speech data by storage-shift register. This CELP coding algorithm enables the coding of toll quality speech at bit rates from 4.8kbits/s to 9.6 kbits/s. This algorithm was realized TMS320C30 microprocessor in realtime.

• 전자공학회논문지S
• /
• 제35S권2호
• /
• pp.97-105
• /
• 1998

Subband/DCT coding has been introduced in order to transmit images of various resultions using one given image-codec, for nowadays there are various grades of quality in visual communication services. However, subband/DCT results in the increawse of multiplication number and memory size. In order to resolve this problem, we propose block-based subband/DCT coding in this paper. In block-based subband/DCT, the number of multiplications is not only reduced because we combine subband decomposistion with DCT, but the size of memory is also reduced because images can be parallel-processed block by block. We show that the number of multiplications is reduced, by analyzing the property ofblock-based subband/DCT matrix mathematically, and examine the performance of proposed coder, which adopts JPEG as backhand-coder after block-based subband/DCT.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2011년도 정기총회 및 추계학술대회 논문집
• /
• pp.2745-2754
• /
• 2011

In this paper, we propose a Peak to Average power Ratio(PAR) reduction algorithm by using the Adaptive Block Coding(ABC). The problem of a PAR due to each sub-carrier overlap phenomenon in the OFDM (Orthogonal Frequency Division Multiplexing) system causes the an increasing in the complexity of the A/D converter in the transmitter and a reduction in the efficiency of the amplifier. The proposed ABC algorithm selects the block coding which provides the lowest PAR value based on the various check bit position. It is shown that a PAR of the ABC algorithm can be reduced from 8.35dB to 6.02dB in 16 sub-carriers compared to theconventional block coding scheme. We also extended the ABC algorithm to a larger number of sub-carriers and estimated their PAR values.

• 전기학회논문지P
• /
• 제65권2호
• /
• pp.136-141
• /
• 2016

This paper proposes an alternate time-switched multiplexed space-time block coding technique for orthogonal frequency division modulation systems. The traditional multiplexed space-time block coding technique can provide more data rate owing to multiple transmit and receive technique, which causes a lot of hardware burden. Alternate time-switched scheme of transmitting time-domain zeros can reduce this hardware burden by half with time-domain switches only. Simulation results show that alternate time-switched scheme has almost same performance with half of baseband and RF modules in comparison with a multiplexed space-time block coding for orthogonal frequency division modulation systems with twice repetitive transmission.

• 전기학회논문지P
• /
• 제66권1호
• /
• pp.48-52
• /
• 2017

This paper proposes a hybrid algorithm of space-time block coding and space-frequency block coding using alternate time switch. The traditional alternate time-switched space-time or space-frequency block coding technique for orthogonal frequency division multiplexing system does not provide a good performance with a variety of communication environments. This hybrid algorithm has searched good performance ranges in various environments in view points of mobile speed and doppler frequency. In this paper, we investigate better performance ranges for two algorithms, suggest a hybrid algorithm for dynamically changing communication environments, propose a structure for transmitter and receiver, and show that its performance is better than the traditional algorithm by simulations.

• 전자공학회논문지B
• /
• 제31B권2호
• /
• pp.45-55
• /
• 1994

In this paper, a block based image approximation technique using the Self Affine System(SAS) from the fractal theory is suggested. Each block of an image is divided into 4 tiles and 4 affine mapping coefficients are found for each tile. To find the affine mapping cefficients that minimize the error between the affine transformed image block and the reconstructed image block, the matrix euation is solved by setting each partial differential coefficients to aero. And to ensure the convergence of coding block. 4 uniformly partitioned affine transformation is applied. Variable block size technique is employed in order to applynatural image reconstruction property of fractal image coding. Large blocks are used for encoding smooth backgrounds to yield high compression efficiency and texture and edge blocks are divided into smaller blocks to preserve the block detail. Affine mapping coefficinets are found for each block having 16$\times$16, 8$\times$8 or 4$\times$4 size. Each block is classified as shade, texture or edge. Average gray level is transmitted for shade bolcks, and coefficients are found for texture and edge blocks. Coefficients are quantized and only 16 bytes per block are transmitted. Using the proposed algorithm, the computational load increases linearly in proportion to image size. PSNR of 31.58dB is obtained as the result using 512$\times$512, 8 bits per pixel Lena image.

• 전자공학회논문지B
• /
• 제29B권7호
• /
• pp.62-69
• /
• 1992

The conventional BMA is performed with the fixed block size. For better performance at low bitrate, the block size is required to be large in relatively stationary area, while small in moving area. Thus, in this paper, a video coding technique using variable block size model is proposed. It decides the block size based on the degree of local motion defined by the local mean and variance of blocks. Computer simulation shows that the proposed method gives comparable performance to the conventional one with less bits required for motion vector coding.

• 대한지구과학교육학회지
• /
• 제12권2호
• /
• pp.131-140
• /
• 2019

이 연구에서는 창의교육의 일환으로 컴퓨팅 사고력을 개발할 수 있는 블록형 코딩프로그램을 활용해 지구과학 교수 학습에 적용하여 컴퓨팅 사고력에 대한 인식과 과학적 태도가 어떻게 변화되는지를 알아보고자 하였다. 연구 결과를 바탕으로 결론을 정리하면 다음과 같다. 첫째, 초등학생들에게 적용할 수 있는 블록형 코딩프로그램을 활용한 지구과학 교육프로그램을 개발하였다. 총 12차시로 구성된 프로그램은 학생 활동중심의 문제를 제공하여 다양한 사고를 학생들이 유도할 수 있도록 탐구활동을 설계하였다. 둘째, 블록형 코딩프로그램을 활용한 지구과학 교육프로그램을 통해 컴퓨터 프로그램 활용에 대한 자신감, 컴퓨터 활용통합학습, 컴퓨팅 사고력에 대한 자신감 및 컴퓨팅 사고력을 활용한 문제해결 요인에서 유의미한 결과를 나타냈다. 셋째, 블록형 코딩프로그램을 활용한 지구과학 교육프로그램은 호기심, 비판성, 협동성, 끈기, 창의성 항목에서 유의미한 차이를 나타내었다. 이것은 학생들이 문제를 접했을 때 의문을 갖고 이를 해결하는 과정에서 효과를 나타낸 것이라고 판단할 수 있다.

• 대한전자공학회논문지SP
• /
• 제40권5호
• /
• pp.417-425
• /
• 2003

ITU-T(International Telecommunication Union-Telecommunication standardization sector)와 MPEG(Moving Picture Experts Group)에 의해서 최근 표준화가 완성된 H.264는 가변 블록 크기 움직임 추정, 복수참조영상, 1/4화소 움직임 예측/보상, 4×4 정수 DCT(Integer Discrete Cosine Transform), 율-왜곡 최적화(Rate-Distortion Optimization) 등의 새로운 부호화 기술로 H.263, MPEG-4 등 기존 비디오 표준에 비해 더 좋은 부호화 효율을 제공하고 있다. 그러나 새로운 부호화 기술들은 H.264 의 전반적인 복잡도를 심화시키는 주된 요인이기도 하다. 따라서, H.254 의 실제 응용을 용이하게 하기 위해서는 이러한 기술에 대한 고속 알고리즘이 요구된다. 본 논문에서는 율-왜곡 최적화를 통한 부호화 모드 결정시 부호화기의 복잡도에서 가장 큰 비중을 차지하는 가변 블록 크기 움직임 추정 및 공간예측 부호화를 효율적으로 생략하여 부호화 모드 결정을 빠르게 수행하는 고속 모드 결정법을 제안한다. 실험결과, 제안된 방법은 부호화 효율의 손실이 거의 없으면서도 계산법을 약 4배 향상시킨다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.190-192
• /
• 2004

In this paper, we propose a low bit-rate embedded video compression scheme with 3-D block partition coding in the wavelet domain. The proposed video compression scheme includes multi-level 3-dimensional dyadic wavelet decomposition, raster scanning within each subband, formation of block, 3-D partitioning of block, and adaptive arithmetic entropy coding. Although the proposed video compression scheme is quit simple, it produces bit-stream with good features, including SNR scalability from the embedded nature. Experimental results demonstrate that the proposed video compression scheme is quit competitive to other good wavelet-based video coders in the literature.