• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1997.11a
• /
• pp.221-231
• /
• 1997

본 논문에서는 고속 멱승을 위한 모듈라 곱셈기를 시스토릭 어레이로 설계한다. Montgomery 알고리듬 및 시스토릭 어레이 구조를 분석하고 공통 피승수 곱셈 개념을 사용한 변형된 Montgomery 알고리듬에 대해 시스토릭 어레이 곱셈기를 설계한다. 제안 곱셈기는 각 처리기 내부 연산을 병렬화 할 수 있고 연산 자체도 간단화 할 수 있어 시스토릭 어레이 하드웨어 구현에 유리하며 기존의 곱셈기를 사용하는 것보다 멱승 전체의 계산을 약 0.4배내지 0.6배로 감소시킬 수 있다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.7
• /
• pp.1259-1265
• /
• 2006

In this paper, we propose a combined synthetic algorithm of the logic level for high speed FPGA design. The algorithm divides critical path to reduce delay time and generates a circuit which the divided circuits execute simultaneously. This kernel selection algorithm is made by C-langage of SUN UNIX. We compare this with the existing FlowMap algorithm. This proposed algorithm shows result on 33.3% reduction of delay time by comparison with the existing algorithm.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.64-66
• /
• 2005

본 논문에서는 GF($2^m$) 상에서 나눗셈 연산을 위한 고속 알고리듬을 제안하고, 제안한 알고리듬을 기본으로 한 나눗셈 연산기의 하드웨어 설계 및 구현에 관하여 기술한다. 나눗셈을 위한 모듈러 연산은 개선된 이진 확장 유클리드 알고리듬 (Binary Extended Euclidian algorithm) 을 기본으로 하고 있다 성능비교 결과로부터 제안한 방법은 기존 방법에 비해 지연시간이 약 $26.7\%$ 정도 개선됨을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.556-558
• /
• 2003

본 논문은 위상한정상관법을 이용하여 지문을 인식하는 알고리듬을 제안한다. 이 알고리듬은 유사도를 계산하기 위하여 고속푸리에 변환과 상관함수를 이용한다. 제안된 알고리듬은 동일인의 지문에 대하여 예리한 한 개의 피크만을 나타내므로 지문인식에 대한 명확한 결과를 보여준다. 더욱이 이 방법은 명확하게 입력되지 않은 지문에 대하여도 별도의 복잡한 전처리과정을 거치지 않고도 우수한 성능을 보여 준다. 또한 입력된 지문이 평행이동 한 경우에도 우수한 성능을 보여준다. 실험결과는 제안된 알고리듬이 지문을 인식하는데 효과적임을 보여준다.

• Journal of Broadcast Engineering
• /
• v.2 no.1
• /
• pp.45-55
• /
• 1997

In this paper, we propose a fast algorithm with adaptive thresholding for the wavelet transform (WT) based blocking artifact reduction. In the fast algorithm, all processings that are equivalent to the processing in WT domain of the first and second scale are performed in spatial domain. In the adaptive thresholding, the threshold values used to classify the block boundary are selected adaptively according to each input image by using the statistical properties of the WT of the coded signal at block boundary and at block center, which can be obtained in spatial domain. Experimental results showed that the proposed fast algorithm is about 10 times faster than the WT-based algorithm. It also was found that the postprocessing with proposed adaptive thresholding yields some PSNR improvement and better subjective quality over that with nonadaptive thresholding which has best performance at high compression ratios of a certain .image, even at low compression ratios.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.59-70
• /
• 2003

Proposed CCRSVP (Candidate Casting RSVP) algorithm is a new fast handoff method which uses advanced multicasting method and RSVP for IEEE 802.11 Wireless LAN (WLAN) environments. The proposed algorithm shows good performance in the handoff latency and the B/W efficiency aspect and guarantees QoS because it uses L2 information (BSSID) of WLAN and starts to reserve resources and multicast packets before L2 handoff completes. We also propose a Markov chain performance analysis model in which we can analyze the handoff performance of various handoff algorithms. Using the model, we compare bandwidth efficiency of the proposed algorithm with existing handoff algorithms which use RSVP by analyzing blocking probability of session, resource usage, and the average number of ongoing session in a cell. The results show that the proposed algorithm shows better performance than the existing algorithms in the above three performance aspects.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.2
• /
• pp.106-112
• /
• 2007

This paper proposes a hybrid architecture algorithm for fast computation of DCT and DFT via recursive factorization. Recursive factorization of DCT-II and DFT transform matrix leads to a similar architectural structure so that common architectural base may be used by simply adding a switching device. Linking between two transforms was derived based on matrix recursion formula. Hybrid acrchitectural design for DCT and DFT matrix decomposition were derived using the generation matrix and the trigonometric identities and relations. Data flow diagram for high-speed architecture of Cooley-Tukey type was drawn to accommodate DCT/DFT hybrid architecture. From this data flow diagram computational complexity is comparable to that of the fast DCT algorithms for moderate size of N. Further investigation is needed for multi-mode operation use of FFT architecture in other orthogonal transform computation.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2714-2716
• /
• 2001

본 논문에서는 일대일 전송에 국한되어 사용되는 전이중 패스트 이더넷 방식을 응용하여 고속 브로드 캐스팅 통신망을 구성하고 실시간 전송을 요구하는 데이터를 효율적으로 전달할 수 있는 알고리듬을 제시한다. 제안된 통신망의 세부구조와 통신망의 데이터 송수신 동작 등을 설명하고, 실시간 데이터 전송을 보장하기 위하여 실시간 메시지 스케줄링 알고리듬을 제시한다. 제시된 알고리듬을 적용하였을 때의 각종 시변수들에 대한 수학적인 분석을 통하여 실시간성 보장에 대한 성능평가를 포함한 통신망 성능 평가를 수행한다. 제안된 통신망 FER(Full-duplex Ethernet networks for Real-time communication)의 실제 구현 및 응용 대상에 대해서 언급한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12A
• /
• pp.991-1001
• /
• 2003

CCFH(Candidatecasting Fast Handoff) algorithm excels the performance of existing fast handoff schemes using multicasting in terms of handoff latency and B/W efficiency. The scheme uses L2 information(BSSID) at Wireless LAN and starts multicasting before L2 handoff. So it can reduce L3 handoff latency. At this article, we would show that Candidatecasting Fast Handoff Scheme is clearly new scheme using L2 information and has the good performance.

• 전자공학회논문지 IE
• /
• v.43 no.4
• /
• pp.43-51
• /
• 2006

Segmentation method using RSST has many advantages in extracting of accurate region boundaries and controlling the resolution of segmented result and so on. In this paper, we propose three fast RSST algorithms for image segmentation. In first method, we classify links according to weight size for fast link search. In the second method, very similar links before RSST construction are eliminated. In third method, the links of very small regions which are not important for human eye are eliminated. As a result, the total times elapsed for segmentation are reduced by about 10 $\sim$ 40 times, and reconstructed images based on the segmentation results show little degradation of PSNR and visual quality.