• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.586-594
• /
• 2003

X-Match algorithm is a lossless compression algorithm suitable for hardware implementation owing to its simplicity. It can compress 32 bits per clock cycle and is suitable for real time compression. However, as the bus width increases 64-bit, the compression unit also need to increase. This paper proposes the cooperative parallel X-Match (X-MatchCP) algorithm, which improves the compression speed by performing the two X-Match algorithms in parallel. It searches the all dictionary for two words, combines the compression codes of two words generated by parallel X-Match compression and outputs the combined code while the previous parallel X-Match algorithm searches an individual dictionary. The compression ratio in X-MatchCP is almost the same as in X-Match. X-MatchCP algorithm is described and simulated by Verilog hardware description language.

• Journal of KIISE:Databases
• /
• v.32 no.5
• /
• pp.558-566
• /
• 2005

The XML is the new standard fir data representation and exchange on the Internet. In this paper, we describe a new approach for evaluating a path-oriented query against XML document. In our approach, we propose the Parallel Match Indexing Fabric to speed up evaluation of path-oriented query using path signature and design the parallel match algorithm to perform a match process between a path signature of input query and path signatures of elements stored in the database. To construct a structure of the parallel match indexing, we first make the binary tie for all path signatures on an XML document and then which trie is transformed to the Parallel Match Indexing Fabric. Also we use the Parallel Match Indexing Fabric and a parallel match algorithm for executing a search operation of a path-oriented query. In our proposed approach, Time complexity of the algorithm is proportional to the logarithm of the number of path signatures in the XML document.

• Korean Journal of Remote Sensing
• /
• v.9 no.2
• /
• pp.7-19
• /
• 1993

In stereo vision, when we use two parallel axis images, small portion of object is contained and B/H(Base-line to Height) ratio is limited due to the size of object and depth information is inaccurate. To overcome these difficulities we take a non-parallel axis image which is rotated $\theta$ about y-axis and match other parallel-axis image. Epipolar lines of non-parallel axis image are not same as those of parallel-axis image and we can't match these two images directly. In this paper, we transform the non-parallel axis image geometrically with camera parameters, whose epipolar lines are alingned parallel. NCC(Normalized Cross Correlation) is used as match measure, area-based matching technique is used find correspondence and 9$\times$9 window size is used, which is chosen experimentally. Focal length which is necessary to get depth information of given object is calculated with least-squares method by CCD camera characteristics and lenz property. Finally, we select 30 test points from given object whose elevation is varied to 150 mm, calculate heights and know that height RMS error is 7.9 mm.

• 한국태양에너지학회:학술대회논문집
• /
• 2008.04a
• /
• pp.241-246
• /
• 2008

In this paper, we analyze the I-V curve and hot-spot phenomenon caused by solar cells' serial and parallel connected circuit. The mis-match loss of parallel interconnection with low Isc string decrease lower than serially interconnected one and temperature caused by hot-spot does. Also, mis-match loss of parallel interconnection with low Voc string increase more than serially interconnected one. The string having low Voc happened hot-spot phenomenon when open circuit. The bad solar cell in string gives revere bias to good solar cell and make hot-spot phenomenon. If we consider the mis-match loss, when designing PV module and array. the efficiency of PV system might increase.

• 한국전산유체공학회:학술대회논문집
• /
• 2006.05a
• /
• pp.103-106
• /
• 2006

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.6
• /
• pp.1056-1063
• /
• 1994

In this paper a content addressable memory (CAM) is designed by adopting best-match method. It has a single processing element(PE) architecture with high computational efficiency and throughput. It is composed of three main functional blocks(input MUX, best-match CAM, control part). It support fully parallel processing. Logic simulation is completed by using QUICKSIM, Circuit simulation is performanced by using HSPICE. Its layout is based on the ETRI 3 m n-well process design rules. Its maximum operating frequency is 20 MHz.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.65-71
• /
• 2005

The primary function of the Internet routers is to forward incoming packets toward their final destinations. IP address lookup is one of the most important functions in evaluating router performance since IP address lookup should be performed in wire-speed for the hundred-millions of incoming packets per second. With CIDR, the IP prefixes of routing table have arbitrary lengths, and hence address lookup by exact match is no longer valid. As a result, when packets arrive, routers compare the destination IP addresses of input packets with all prefixes in its routing table and determine the most specific entry among matching entries, and this is called the longest prefix matching. In this paper, based on parallel multiple hashing and prefix grouping, we have proposed a hardware architecture which performs an address lookup with a single memory access.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.1 no.1
• /
• pp.119-124
• /
• 2001

In this pattern recognition on the large volumes of remote sensing satellite images, the inference time is much increased. In the case of the remote sensing data [5] having 4 wavebands, the 778 training patterns are learned. Each land cover pattern is classified by using 159, 900 patterns including the trained patterns. For the fuzzy classification, the 778 fuzzy rules are generated. Each fuzzy rule has 4 fuzzy variables in the condition part. Therefore, high performance parallel fuzzy inference system is needed. In this paper, we propose a novel parallel fuzzy inference system on T3E parallel computer. In this, fuzzy rules are distributed and executed simultaneously. The ONE_To_ALL algorithm is used to broadcast the fuzzy input to the all nodes. The results of the MIN/MAX operations are transferred to the output processor by the ALL_TO_ONE algorithm. By parallel processing of the fuzzy rules, the parallel fuzzy inference algorithm extracts match parallelism and achieves a good speed factor. This system can be used in a large expert system that ha many inference variables in the condition and the consequent part.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.1
• /
• pp.27-38
• /
• 2017

Packet classification is one of the essential functionalities of Internet routers in providing quality of service. Since the arrival rate of input packets can be tens-of-millions per second, wire-speed packet classification has become one of the most challenging tasks. While traditional packet classification only reports a single matching result, new network applications require multiple matching results. Ternary content-addressable memory (TCAM) has been adopted to solve the multi-match classification problem due to its ability to perform fast parallel matching. However, TCAM has a fundamental issue: high power dissipation. Since TCAM is designed for a single match, the applicability of TCAM to multi-match classification is limited. In this paper, we propose a cost- and energy-efficient multi-match classification architecture that combines TCAM with a tuple space search algorithm. The proposed solution uses two small TCAM modules and requires a single-cycle TCAM lookup, two SRAM accesses, and several Bloom filter query cycles for multi-match classifications.

• Korean Institute of Interior Design Journal
• /
• v.19 no.1
• /
• pp.55-62
• /
• 2010

This study examines attributes and expression characteristics of 'Mix & Match' which is one of the major current trends in interior designs. The concept and background of 'Mix & Match' was ascertained through research of previous documents and studies, and its attributes were explored. In order to examine the expression characteristics to see how they are expressed in actual interior designs, case analyses were carried out centering on the expression elements such as material, light & lighting, color, furniture and objects which were regarded as important in previous studies and related articles so far. The case analyses were carried out for works where the concept of 'Mix & Match' was prominent in designs produced in 2007 and 2008, chosen from the main reports of the representative interior design journals, 'Interiors' and 'INTERNI & Decor'. As a result, it has been found that 'Mix & Match' is not limited to one attribute but the temporal, spatial and genre attributes are present all at the same time, or various expression elements exist in one attribute. This is a distinct character commonly shown in most of the cases and each expression element is expressed in variety according to spatial concept, from a simple parallel to substitution, transfer and modification (simplification, transformation of the scale, rate modification etc.) Therefore, in creating the space for 'Mix & Match' or in interpretation of it, the understanding of these expression characteristics would make it possible for clearer and more various applications of design, and furthermore will be meaningful for supply and accumulation of reference in design communication.