http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
새로운 연산 공유 승산기를 이용한 1차원 DCT 프로세서의 설계
이태욱,조상복,Lee, Tae-Wook,Cho, Sang-Bock 한국정보처리학회 2003 정보처리학회논문지 A Vol.10 No.4
DCT 알고리즘은 내적을 효율적으로 처리할 수 있는 하드웨어 구조가 필수적이다. 내적 연산을 위한 기존의 방법들은 하드웨어 복잡도가 높기 때문에, 이론 줄이기 위한 방법으로 연산 공유 승산기가 제안되었다. 하지만 기존의 연산 공유 승산기는 전처리기 및 선택기의 비효율적 구조로 인한 성능저하의 문제점을 가지고 있다. 본 논문에서는 새로운 연산 공유 승산기를 제안하고 이를 1차원 DCT 프로세서에 적용하여 구현하였다. 연산 공유 승산기의 구조 및 논리 합성 비교 시 새로운 승산기는 기존에 비해 효율적인 하드웨어 구성이 가능함을 확인하였고, 1차원 DCT 프로세서 설계 시 기존 구현 방식들에 비해 우수한 성능을 나타내었다. The OCT algorithm needs efficient hardware architecture to compute inner product. The conventional methods have large hardware complexity. Because of this reason. a computation sharing multiplier was proposed for implementing inner product. However, the existing multiplier has inefficient hardware architecture in precomputer and select units. Therefore it degrades the performance of the multiplier. In this paper, we proposed a new efficient computation sharing multiplier and applied it to implementation of 1-D DCT processor. The comparison results show that the new multiplier is more efficient than an old one when hardware architectures and logic synthesis results were compared. The designed 1-D DCT processor by using the proposed multiplier is more high performance than typical design methods.
이태욱(Tae Wook Lee) 산업기술교육훈련학회 2018 산업기술연구논문지 (JITR) Vol.23 No.3
Sorting arbitrarily ordered data is one of the most important and widely used task in digital signal and data processing applications. The conventional sorting algorithms used in such applications are mostly based on word-level sorting. As such, the area-time complexity increasesnon linearly with increase in the number of inputs, and the performance of the sorting machine deteriorates correspondingly. In this paper, we propose a new and efficient sorting algorithm based on bit-level sorting method. The hardware implementation of this algorithm results in a compact and modular sorting engine architecture capable of processing large number of inputs in linear time. The algorithm was created using Very High Speed Integrated Circuit Hard ware Description Language and graphical environment in MAX+PlusII of Altera. The simulation results, obtained using 970 logic cells, indicate that the operating frequency of the proposed circuit is 24.21MHz.
아파트의 설계 방향에 따른 건물부착형 태양광발전시스템(BAPV) 발전 성능 분석
이태욱(Tae-Wook Lee),이주철(Ju-Cheeol LEE),유홍국(Hong-Guk Yoo),남아영(Ah-Young Nam) 한국조명·전기설비학회 2021 한국조명·전기설비학회 학술대회논문집 Vol.2021 No.11
In this paper, the tilt angle of PV module of roof BAPV is adjusted according to the direction of apartment facilities by using PVsyst, PV module and inverter, and the tilt angle of PV module with maximum output point is studied.
《諺解 胎産集要(언해 태산집요)》에 나타난 17세기 국어 부정법 고찰
이태욱(Tae Wook Lee) 언어과학회 2003 언어과학연구 Vol.24 No.-
The purpose of this article is to examine the types and characteristics of negations shown in ≪Eonhae Taesangjibyo≫, a text of the early of the 17th century, in order to formulate the types of negations of the 17th century and modern Korean language. In ≪Eonhae Taesanjibyo≫, the short forms of `ani` negations are shown as `ani stem`, `Chinese characters etymon ani hΛ(??)/ani`, `stem+ge ani hΛ`, `stem+eo ani h(ㅎ)`, and `adverb ani`. The form of `ani stem` is used with adjectives as well as intransitive verbs and transitive verbs. The long forms of `ani` negations are shown as `stem+di anihΛ/anih/ani`, `Chinese characters etymon+ti arhΛ/ani`. According to the suffix next to `anihΛ` in the `ani` negations, the alternation into `h` and apocope of `hΛ` are shown more than the keeping of `hΛ`. The representative form of `ani`negations is `stem+di anilΛ`. The short forms of `mod` negations are shown as `mod stem`, `Chinese characters etymon mod hΛ`, `pure Korean etymon mod hΛ`, and `noun+auxiliary mod hΛ`. The form of `mod stem` is used with intransitive verb and transitive verb but not adjective. The long forms of `mod` negations are shown as `stem+di modhΛ` and `Chinese characters etymon+ti modhΛ`. The representative form of `mod` negations is `stem+di modhΛ`. The `mod` negations are shown in only `modhΛ` keeping `hΛ` no matter which suffixes appear next to `modhΛ`. This is the most different point between `ani` negations and `mod` negations and it does not appear in the literary works of the 15th and 16th centuries.