• Journal of KIISE:Software and Applications
• /
• v.27 no.1
• /
• pp.41-49
• /
• 2000

This paper describes a method of generating MPHFs(Minimal Perfect Hash Functions) for large static search key sets. The MOS(Mapping-Ordering-Searching) approach is widely used presently in MPHF generation. In this research, the MOS approach is improved and a SOMS(Selecting-Ordering-Mapping-Searching) approach is proposed, where the Selecting step is newly introduced and the Orderng step is performed before the Mapping step to generate MPHFs more effectively. The MPHF generation algorithm proposed in this research is probabilistic and the expected processing time is linear to the number of keys. Experimental results show that MPHFs are generated fast and the space needed to represent the hash functions is small.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.112-115
• /
• 2009

PI code searching method of RDS(Radio Data System) are unique method of maintain desired channel on moving machine like vehicle. Efficient and fast PI code search method are researching on the all of RDS related systems for both find more better channel before Original channel signal go to bad and find desired good signal quickly when get out of Weak signal Area. But Embedded system has limited environment like memory size, so It is very difficult to apply many well known PI code searching method. This thesis suggests simple and effective method of searching PI code, considering a Embedded System Environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7B
• /
• pp.647-659
• /
• 2003

LPM(Longest Prefix Matching)searching in If address lookup is a major bottleneck of IP packet processing in the high speed router. In the conventional lookup table for the LPM searching in CAM(Content Addressable Memory) the complexity of fast update take 0(1). In this paper, we designed pipeline architecture for fast update of 0(1) cycle of lookup table and high throughput and low area complexity on LPM searching. Lookup-table architecture was designed by CAM(Content Addressable Memory)away that uses 1bit RAM(Random Access Memory)cell. It has three pipeline stages. Its LPM searching rate is affected by both the number of key field blocks in stage 1 and stage 2, and distribution of matching Point. The RTL(Register Transistor Level) design is carried out using Verilog-HDL. The functional verification is thoroughly done at the gate level using 0.35${\mu}{\textrm}{m}$ CMOS SEC standard cell library.

• The Journal of the Korea Contents Association
• /
• v.3 no.2
• /
• pp.11-18
• /
• 2003

In this paper, we propose a fast variable block matching algorithm for motion estimation based on bit-patterns. Motion estimation in the proposed algorithm is peformed after the representation of image sequence is transformed 8-bit pixel values into 1-bit ones by the mean pixel value of search block, which brings a short searching time by reducing the computational complexity. Moreover, adaptive searching methods according to the motion information of the block make the procedure of motion estimation efficient by eliminating unnecessary searching processes of low motion block and deepening a searching procedure in high motion block. Experimental results show that the proposed algorithm provides bettor performance - average 0.5dB PSNR improvement and about 99% savings in the number of operations - than full search Hock matching algorithm with a fixed block size.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.383-384
• /
• 2007

In this paper, we propose the new and simple method for sub-pixel block search algorithm by only using integer-pixel for motion estimation and compensation. In many papers, the fast search block match algorithms based on TSS have been proposed. However, these methods could be achieved a little reduction of the computational complexity. All of searching points by 1/4-pixel have own predicted integer-pixel SAD array. Therefor, if we know initial nine SAD values by integer, which is on the searching area of the reference frame, then we can find optimal searching point by 1/4-pixel, directly.

• Proceedings of the KAIS Fall Conference
• /
• 2010.05a
• /
• pp.261-264
• /
• 2010

Fast algorithm is proposed by using mel scale and the distribution characteristic of LSP parameters, and is to reduce the computational amount. Computational amount means the calculating times of transformation from LPC coefficients to LSP parameters. Among conventional methods, the real root method is considerably simpler than other, but neverthless, it still suffer from its indeterministic computational time. Because the root searching is processed sequentially in frequency region. In this paper, the searching interval is arranged by using mel scale but not it is uniform and searching order is arranged by the distribution characteristic of LSP parameters that is most LSP papameters are occured in specific frequency region. In experimental results, computational amount of the proposed algorithm is reduced about 48.95% in average, but the transformed LSP parameters of the proposed method were the same as those of real root method.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.552-554
• /
• 2003

Searching and enhancement of shadow area in the satellite imagery is one of growing interest because of new possible needs of application in this field. This paper proposes an algorithm to search and enhance the shadow areas caused by buildings such as apartments which are very common in Korean satellite imagery. The proposed searching algorithm makes use of characteristics of histogram of images in the spatial domain and also uses the fast Fourier transform and correlation in Frequency domain. Further, the enhancement algorithm is only applied to the shadow areas searched and preserves the areas which are naturally dark.

• Journal of Broadcast Engineering
• /
• v.26 no.4
• /
• pp.390-397
• /
• 2021

As digital twin technology is applied to various industrial fields, technologies to effectively process large amounts of data are required. In this paper, we discuss a customized service method for fast search and effective delivery of large-scale data for underground facility for public utilities management. The proposed schemes are divided into two ways: a fast search data generation method and a customized information service segmentation method to efficiently search and abbreviate vast amounts of data. In the high-speed search data generation, we discuss the configuration of the synchronization process for the time series analysis of the sensors collected in the underground facility and the additional information method according to the data reduction. In the user-customized service method, we define the types of users in normal and disaster situations, and discuss how to service them accordingly. Through this study, it is expected to be able to develop a systematic data generation and service model for the management of underground utilities that can effectively search and receive large-scale data in a disaster situation.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.3010-3023
• /
• 1998

GA has a fast convergence speed in searching the one point around optimal value. But it's convergence time increase in searching the region around optimal value because it has no regional searching mechanism. BP has the tendency to converge the local minimum because it has global searching mechanism. To overcome these problems, a method in which a genetic algorithm and a back propagation are applied in turn is proposed in this paper. By using a genetic algorithm, we compute optimal synaptic strength and offset value. And then, these values are fed to the input of the back propagation. This proposed method is superior to each above method in improving the convergence speed.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.11
• /
• pp.1209-1216
• /
• 2009

This paper presents an efficient Quantized Equal Gain Transmission(QEGT) codebook index searching technique for MISO beamforming system in a Rayleigh flat fading channel. The searching time for the optimum weight vector among the codebook vectors increases exponentially when the codebook size increases linearly, although the bit error rate decreases. So, newly defined simple metric is proposed for fast searching, which determines a few candidates. Then the conventional method combined with accurate search algorithm selects the optimal index. This strategy significantly reduces the overall search time, while maintaining almost the same bit error rate performance. Furthermore, as the codebook size increases, the search time is considerably decreased compared to that of the conventional approach.