• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.197-206
• /
• 2002

Many researchers have been interested in the optimization of parallel programs through the latency hiding by overlapping the communication with the computation. We ana1yzed overlapping effects in the circular shift communication which is one of the collective communications being frequently used In many data parallel programs. We measured the time which can be possibly overlapped and the time which cannot be overlapped in over all circular shift communication period on an Ethernet switch-based clustered system. The result from each platform nay be used for the input of optimizing compilers. The previous performance models usually have two kinds of drawbacks one is only based on point-to-point communication, so it is not appropriate for analyzing the overall effects of collective communications. The other provides the performance of collective communication, but no overlapping effect. In this paper we extended the previous models and analyzed the experimental results of the extended model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.6
• /
• pp.773-778
• /
• 1993

A new approach is proposed for the DCT which is widely utilized in the image processing, The approach replaces mutiplications with shift and additions, In the image restored by the proposed DCT and IDCT, no visible degration is observed and PSNR(Peak to Peak Signal to Noise Ratio) is greater than 35 dB for all cases, proving the usefulness of the proposal.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.786-787
• /
• 2010

본 논문은 산술 쉬프트 레지스트(ASR)를 이용한 32비트 출력의 고속 스트림 암호를 제안한다. 제안한 스트림 암호는 소프트웨어 및 하드웨어 구현이 쉽게 디자인되었으며, 무선 통신 장비와 같이 제한적인 환경에서 빠르게 수행할 수 있도록 개발되었다. 제안한 스트림 암호는 SSC2, Salsa20과 수행속도 비교에서 좋은 결과를 보여주고 있으며, 좋은 통계적 분산 특성과 안전성 또한 현대 스트림 암호 알고리즘이 필요로 하는 안전성을 만족하고 있다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.4 no.3
• /
• pp.90-94
• /
• 1999

To prevent the congruent output of the digital psuedo-random transformation from giving the same randomness, a transformation of seemingly random deterministic process, called Chaotic transformation, is introduced. Passing through a Chaotic transformation, each event(descriptor) will produce chaotic random sequences. haotic transformation is designed on the basis of deterministic chaos function and also can be realized by simple hardware like shift registers. The circuit of chaotic transformation implemented with the shift registers is presented and the chaotic behavior of suggested circuit is explained with the characteristics of saw-tooth function with the chaotic behavior.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.911-914
• /
• 2000

본 논문에서는 화상을 정방블록으로 분할하여, 블록의 휘도 평균값으로부터 교류성분을 예측하는 정수 연산 알고리즘을 검토한다. 본 방식은 정수의 가감산과 비트 쉬프트 조작만으로 실현되고, 종래 방식과 비교하여 예측성능의 열화 없이 계산단가를 대폭으로 저감시킬 수 있다.

• Journal of Korea Multimedia Society
• /
• v.14 no.6
• /
• pp.759-765
• /
• 2011

In this paper, we proposed fast stream cipher MS64 for use mobile that it is secure, fast, and easy to implement software. The proposed algorithm use the fast operating 213-bit arithmetic shift register(ASR) to generate a binary sequence and produce 64-bit stream cipher by using simple logical operation in non linear transform. MS64 supports 128-bit key in encryption algorithm and satisfy with the safety requirement in modern encryption algorithm. In simulation result shows that MS64 is faster than a 32-bit stream cipher SSC2 in the speed of operation with small usage of memory thus MS64 can be used for mobile devices with fast ciphering.

• The KIPS Transactions:PartB
• /
• v.11B no.7 s.96
• /
• pp.779-784
• /
• 2004

In this paper, we have proposed an image contrast control method using brightness preserving on the FPD(Flat Panel Display). The proposed method can be easily applied to the FPD required real-time processing, since hardware complexity is greatly reduced using linear approximation method of CDF(Cumulative Density Function). For effective processing of the proposed algorithm, we have utilized the sample value of CDF and Barrel Shift. Visual test and standard deviation of their histogram have been introduced to evaluate the resultant output images of the pro-posed method and the original ones.

• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.233-240
• /
• 2003

In this paper, an improved architecture of turbo codec for IMT-2000 is proposed. The encoder consists of an interleaver using an on-the-fly type address generator and a modified shift register instead of an external RAM, and the decoder uses a decreased number of RAM. The proposed architecture is simulated with C/VHDL languages, where BER (bit-error-rate) performances are generally in agreement with previous data by varying interaction numbers, interleaver block sizes and code rates.

• The KIPS Transactions:PartC
• /
• v.8C no.1
• /
• pp.12-15
• /
• 2001

A summation generator creates sequence from addition with carry of LFSR (Linear Feedback Shift Register) sequences. Similarly, it is possible to generate keystream by bitwise exclusive-oring on two FCSR sequences. In this paper, we described the cryptographic properties of a sequence generated by the FCSRs.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.731-734
• /
• 2004

본 논문은 입력영상의 화질 향상을 위하여 기존의 스트레칭 알고리즘을 이용하여 개선된 콘트라스트 알고리즘을 제안하였다. 입력영상의 픽셀(pixel)을 DR(Difference Range)의 범위에 따라 정해진 가중치를 적용하여 새로운 픽셀을 출력한다. 특별한 사용자 정의(User Define)없이 실시간적으로 화질을 개선할 수 있는 장점이 있다. 또한, 하드웨어 적인 측면에서 곱셈 과 나눗셈 연산을 배럴쉬프트(Barrel Shift)를 이용하여 하드웨어 복잡도를 감소 시켰다. 제안한 방식의 알고리즘의 검증을 위하여 C를 이용한 시각적 검증과 하드웨어 측면에서의 검증을 VHDL을 이용한 컴퓨터 시뮬레이션을 통해 확인하였다.