• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.6
• /
• pp.447-458
• /
• 2003

A high speed multiplier is essential basic building block for digital signal processors today. Typically iterative algorithms in Signal processing applications are realized which need a large number of multiply, add and accumulate operations. This paper describes a macro block of a parallel structured multiplier which has adopted a 32$\times$32-b regularly structured tree (RST). To improve the speed of the tree part, modified partial product generation method has been devised at architecture level. This reduces the 4 levels of compression stage to 3 levels, and propagation delay in Wallace tree structure by utilizing 4-2 compressor as well. Furthermore, this enables tree part to be combined with four modular block to construct a CSA tree (carry save adder tree). Therefore, combined with four modular block to construct a CSA tree (carry save adder tree). Therefore, multiplier architecture can be regularly laid out with same modules composed of Booth selectors, compressors and Modified Partial Product Generators (MPPG). At the circuit level new Booth selector with less transistors and encoder are proposed. The reduction in the number of transistors in Booth selector has a greater impact on the total transistor count. The transistor count of designed selector is 9 using PTL(Pass Transistor Logic). This reduces the transistor count by 50% as compared with that of the conventional one. The designed multiplier in 0.25${\mu}{\textrm}{m}$ technology, 2.5V, 1-poly and 5-metal CMOS process is simulated by Hspice and Epic. Delay is 4.2㎱ and average power consumes 1.81㎽/MHz. This result is far better than conventional multiplier with equal or better than the best one published.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.15 no.9
• /
• pp.809-819
• /
• 2004

In this paper, in order to exclude the expansion of M/W relay frequency or its new frequency assignment possibly, we analyzed a possibility of substituting M/W system by B-WLL or optical fiber network regarding service quality and economical points. To define the target of service quality, pre-condition and analysis method for the selected media have been derived to compare each other. E1 transmission with BER 10$^{-1}$ was chosen as a reference capacity, and service distance was calculated f3r the selected media as a function of availability. Also from the economical point we considered 3 systems such as optical fiber, M/W, and B-WLL based upon basic system structure, and analyzed them for various line configurations of fiber optic and B-WLL according to service period, system capacity, transmission distance, and data rate. It was confirmed that B-WLL can provide quality of service with 99.999 % availability within 1.6 km cell radius, and for optical fiber substitution, the leased fiber conduit on an electric pole is more economical than M/W system irrespective of service period, but in case of directly digging for underground conduit, it turned out ineffective regardless of cabling duct types.

• The KIPS Transactions:PartC
• /
• v.11C no.3
• /
• pp.319-326
• /
• 2004

To help network intrusion detection systems(NIDSs) keep up with the demands of today's networks, that we the increasing network throughput and amount of attacks, a radical new approach in hardware and software system architecture is required. In this paper, we propose a Network Processor(NP) based In-Line mode NIDS that supports the packet payload inspection detecting the malicious behaviors, as well as the packet filtering and the traffic metering. In particular, we separate the filtering and metering functions from the deep packet inspection function using two-level searching scheme, thus the complicated and time-consuming operation of the deep packet inspection function does not hinder or flop the basic operations of the In-line mode system. From a proto-type NP-based NIDS implemented at a PC platform with an x86 processor running Linux, two Gigabit Ethernet ports, and 2.5Gbps Agere PayloadPlus(APP) NP solution, the experiment results show that our proposed scheme can reliably filter and meter the full traffic of two gigabit ports at the first level even though it can inspect the packet payload up to 320 Mbps in real-time at the second level, which can be compared to the performance of general-purpose processor based Inspection. However, the simulation results show that the deep packet searching is also possible up to 2Gbps in wire speed when we adopt 10Gbps APP solution.

• Journal of Broadcast Engineering
• /
• v.7 no.1
• /
• pp.45-54
• /
• 2002

This paper proposes a video compression algorithm using characteristics of wavelet coefficients. The proposed algorithm can provide lowed bit rate and faster running time while guaranteeing the reconstructed image qualify by the human virtual system. In this approach, each video sequence is decomposed into a pyramid structure of subimages with various resolution to use multiresolution capability of discrete wavelet transform. Then similarities between two neighboring frames are obtained from a low-frequency subband which Includes an important information of an image and motion informations are extracted from the similarity criteria. Four legion selection filters are designed according to the similarity criteria and compression processes are carried out by encoding the coefficients In preservation legions and replacement regions of high-frequency subbands. Region selection filters classify the high-frequency subbands Into preservation regions and replacement regions based on the similarity criteria and the coefficients In replacement regions are replaced by that of a reference frame or reduced to zero according to block-based similarities between a reference frame and successive frames. Encoding is carried out by quantizing and arithmetic encoding the wavelet coefficients in preservation regions and replacement regions separately. A reference frame is updated at the bottom point If the curve of similarity rates looks like concave pattern. Simulation results show that the proposed algorithm provides high compression ratio with proper Image quality. It also outperforms the previous Milton's algorithm in an Image quality, compression ratio and running time, leading to compression ratio less than 0.2bpp. PSNR of 32 dB and running tome of 10ms for a standard video image of size 352${\times}$240 pixels.

• Journal of The Korean Society of Grassland and Forage Science
• /
• v.12 no.3
• /
• pp.64-129
• /
• 1992

최근 초지중심 사양형태의 증가와 초지면적의 확대에 따라 단순한 사료로서가 아니라 영양가치가 높고 기호성이 높은 목초생산이 요구되고 있다. 그러나, 고위생산을 위해 다량으로 사용된 질소질비료에 의하여 질산태 중독 등의 문제가 야기되고 있어 목초의 생리 및 영양에 관한 연구가 필요하게 되었다. 사료성분 혹은 영양가치에 대한 연구는 이미 일찍부터 다루어져 왔으나, 주로 야초류, 청예작물 및 농가부산물 등의 일반성분 특히, 조단백질과 조섬유함량의 연구가 주가 되었고 다년생 목초류에 대한 연구는 1975년경부터 본격화 되기 시작하였다. 그동안 한국초지학회지와 축산학회지($1972\sim1991$)에 게재된 총 151편의 생리 및 영양에 관한 연구 중에서 다년생 목초류를 취급한 것은 불과 63편에 머물고 있다. 이 분야의 연구는 각종 목초 사료작물에 대한 재배조건과 생육단계에 따른 생리생태학적 연구와 사료성분, 소화율 및 가소화양분 함량의 일반적인 변화, 경향을 검토하여 사료 가치 평가를 위한 기준으로 삼았다. 그러나 다년생 목초류는 물론 사료 작물에 있어서 육종 생리분야의 연구는 매우 미흡한 상태로써 단지 발아, 생육, 저장탄수화물 및 유독성분 등 단편적인 연구만이 행해지고 있을 뿐이다. 또한 사료 성분이 가축의 기호성에 미치는 영향을 구명하기 위한 연구는 거의 이루어지고 있지 않으므로 금후 탄수화물과 미량 요소에 대한 자세한 연구 검토가 필요하다고 생각된다. 특히 목초와 사료작물의 화학적인 조성과 가축의 생리에 관련한 여러가지 문제들도 앞으로 보다 깊이 연구되어야 할 과제라고 생각된다.권을 잡기 위해 10년지기였던 IBM과 MS사는 각각 OS/2와 윈도즈를 내세우고 양보할 수 없는 힘겨루기에 들어갔다. 또 이들 양사는 펜컴퓨터,멀티미디어등 차세대제품의 운영체제 시장을 둘러싸고 일찍부터 격전에 들어갔으며 IBM과 MS사의 혼전을 틈타 썬마이크로시스템을 필두로한 워크스테이션 업체 및 유닉스진영까지 고성능 PC시장을 겨냥한 OS를 속속 개발, 90년대의 OS 전쟁은 한치 앞을 내다볼 수 없는 안개국면으로 접어들고 있다. DOS에서 32비트시대,펜컴퓨터, 멀티미디어에 이르는 차세대제품을 둘러싼 업계의 OS 쟁탈전을 통해 OS의 발전동향과 미래를 전망해 본다. results in the large change of the objective function, the sum of squares of deviations of the observed and computed groundwater levels. 본 논문에서는 가파른 산사면에서 산사태의 발생을 예측하기 위한 수문학적 인 지하수 흐름 모델을 개발하였다. 이 모델은 물리적인 개념에 기본하였으며, Lumped-parameter를 이용하였다. 개발된 지하수 흐름 모델은 두 모델을 조합하여 구성되어 있으며, 비포화대 흐름을 위해서는 수정된 abcd 모델을, 포화대 흐름에 대해서는 시간 지체 효과를 고려할 수 있는 선형 저수지 모델을 이용하였다. 지하수 흐름 모델은 토층의 두께, 산사면의 경사각, 포화투수계수, 잠재 증발산 량과 같은 불확실한 상수들과 a, b, c, 그리고 K와 같은 자유모델변수들을 가진다. 자유모델변수들은 유입-유출 자료들로부터 평가할 수

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1A
• /
• pp.83-90
• /
• 2007

In this paper, we propose an implementation and an algorithm of 'Jitter and Glitch Removing Circuit' for UHF RFID reader system based on ISO/IEC 18000-6C standard. We analyze the response of TI(Texas Instrument) Gen2 tag with a reader using the proposed algorithm. In ISO/IEC 18000-6C standard, a bit rate accuracy(tolerance) is up to +/-22% during tag-to-interrogator communication and +/-1% during interrogator-to-tag communication. In order to solve tolerance problems, we implement the Jitter and Glitch Removing Circuit using the concept of tolerance and tolerance-accumulation instead of PLL(DPLL, ADPLL). The main clock is 19.2MHz and the LF(Link Frequency) is determined as 40kHz to meet the local radio regulation in korea. As a result of simulations, the error-rate is zero within 15% tolerance of tag responses. And in the case of using the adaptive LF generation circuit, the error-rate varies from 0.000589 to zero between 15% and 22% tolerance of tag responses. In conclusion, the error-rate is zero between 0%-22% tolerance of tag response specified in ISO/IEC 18000-6C standard.

• Journal of Broadcast Engineering
• /
• v.12 no.6
• /
• pp.611-623
• /
• 2007

The H.264|AVC standard incorporates an intra prediction tool into inter frame coding. However, this leads to excessive amount of increase in encoding time, thus resulting in the difficulty in real-time implementation of software encoders. In this paper, we first propose an early decision on intra prediction coding and a fast intra prediction method using the characteristics of block contents and the context of neighboring block modes for the intra prediction in the inter frame coding of H.264/AVC. Basically, the proposed methods determine a skip condition on whether the $4{\times}4$ intra prediction is to be used in the inter frame coding by considering the content characteristics of each block to be encoded and the context of its neighboring blocks. The performance of our proposed methods is compared with the Joint Model reference software version 11.0 of H.264|AVC. The experimental results show that our proposed methods allow for 41.63% reduction in the total encoding time with negligible amounts of PSNR drops and bitrate increases, compared to the original Joint Model reference software version 11.0.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.7 no.2
• /
• pp.73-92
• /
• 1997

A modular exponentiation( E$M^{$=varepsilon$}$mod N) is one of the most important operations in Public-key cryptography. However, it takes much time because the modular exponentiation deals with very large operands as 512-bit integers. Modular exponentiation is composed of repetition of modular multiplications, and the number of repetition is the same as the length of the addition-chain of the exponent(E). Therefore, we can reduce the execution time of modular exponentiation by finding shorter addition-chain(i.e. reducing the number of repetitions) or by reducing the execution time of each modular multiplication. In this paper, we propose an addition-chain heuristics and two fast modular multiplication algorithms. Of two modular multiplication algorithms, one is for modular multiplication between different integers, and the other is for modular squaring. The proposed addition-chain heuristics finds the shortest addition-chain among exisiting algorithms. Two proposed modular multiplication algorithms require single-precision multiplications fewer than 1/2 times of those required for previous algorithms. Implementing on PC, proposed algorithms reduce execution times by 30-50% compared with the Montgomery algorithm, which is the best among previous algorithms.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.1 s.11
• /
• pp.73-85
• /
• 2004

Recently, as the growth of the wireless Internet, PDA and HPC, the focus of research and development related with GIS(Geographic Information System) has been changed to the Real-Time Mobile GIS to service LBS. To offer LBS efficiently, there must be the Real-Time GIS platform that can deal with dynamic status of moving objects and a location index which can deal with the characteristics of location data. Location data can use the same data type(e.g., point) of GIS, but the management of location data is very different. Therefore, in this paper, we studied the Real-Time Mobile GIS using the HBR-tree to manage mass of location data efficiently. The Real-Time Mobile GIS which is developed in this paper consists of the HBR-tree and the Real-Time GIS Platform HBR-tree. we proposed in this paper, is a combined index type of the R-tree and the spatial hash Although location data are updated frequently, update operations are done within the same hash table in the HBR-tree, so it costs less than other tree-based indexes Since the HBR-tree uses the same search mechanism of the R-tree, it is possible to search location data quickly. The Real-Time GIS platform consists of a Real-Time GIS engine that is extended from a main memory database system. a middleware which can transfer spatial, aspatial data to clients and receive location data from clients, and a mobile client which operates on the mobile devices. Especially, this paper described the performance evaluation conducted with practical tests if the HBR-tree and the Real-Time GIS engine respectively.

• Journal of Korea Spatial Information System Society
• /
• v.5 no.1 s.9
• /
• pp.49-63
• /
• 2003

Recently, two international standard organizations, ISO and OGC, have done the work of standardization for GIS. Current standardization work for providing interoperability among GIS DB focuses on the design of open interfaces. But, this work has not considered procedures and methods for designing GIS DB. Eventually, GIS DB has its own model. When we share the data by open interface among heterogeneous GIS DB, differences between models result in the loss of information. Our aim in this paper is to revise the design guidelines for geographic information databases in order to make consistent spatial data models, logical structures, and semantic structure of populated geographical databases. In details, we propose standard guidelines which convert ISO abstract schema into relation model, object-relation model, object-centered model, and geometry-centered model. Furthermore, we provide sample models for applying these guidelines in commercial GIS S/Ws. Building GIS DB based on design guidelines proposed in the paper has the following advantages: the interoperability among databases, the standardization of schema definitions, and the catalogue of GIS databases through.