• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.12B
• /
• pp.1103-1111
• /
• 2008

Internet routers forward an incoming packet to an output port toward its final destination through IP address lookup. Since each incoming packet should be forwarded in wire-speed, it is essential to provide the high-speed search performance. In this paper, IP address lookup algorithms using binary search are studied. Most of the binary search algorithms do not provide a balanced search, and hence the required number of memory access is excessive so that the search performance is poor. On the other hand, binary-search-on-range algorithm provides high-speed search performance, but it requires a large amount of memory. This paper shows an optimized binary-search-on-range structure which reduces the memory requirement by deleting unnecessary entries and an entry field. By this optimization, it is shown that the binary-search-on-range can be performed in a routing table with a similar or lesser number of entries than the number of prefixes. Using real backbone routing data, the optimized structure is compared with the original binary-search-on-range algorithm in terms of search performance. The performance comparison with various binary search algorithms is also provided.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.5
• /
• pp.157-163
• /
• 2017

The binary and interpolation search algorithms are the most famous among search area algorithms, the former running in $O(log_2n)$ on average, and the latter in $O(log_2log_2n)$ on average and O(n) at worst. Also, the interpolation search use only the probability of key value location without priori information. This paper proposes another search algorithm, which I term a 'hybrid block and interpolation search'. This algorithm employs the block search, a method by which MSB index of a data is determined as a block, and the interpolation search to find the exact location of the key. The proposed algorithm reduces the search range with priori information and search the reduced range with uninformed situation. Experimental results show that the algorithm has a time complexity of $O(log_2log_2n_i)$, $n_i{\simeq}0.1n$ both on average and at worst through utilization of previously acquired information on the block search. The proposed algorithm has proved to be approximately 10 times faster than the interpolation search on average.

• Proceedings of the IEEK Conference
• /
• 2004.06a
• /
• pp.175-178
• /
• 2004

This paper describes a new IP address lookup algorithm using a binary search on multiple balanced trees stored in one memory. The proposed scheme has 3 different tables; a range table, a main table, and multiple sub-tables. The range table includes $2^8$ entries of 22 bits wide. Each of the main table and sub-table entries is composed of fields for a prefix, a prefix length, the number of sub-table entries, a sub-table pointer, and a forwarding RAM pointer. Binary searches are performed in the main table and the multiple sub-tables in sequence. Address lookups in our proposed scheme are achieved by memory access times of 11 in average, 1 in minimum, and 24 in maximum using 267 Kbytes of memory for 38.000 prefixes. Hence the forwarding table of the proposed scheme is stored into L2 cache, and the address lookup algorithm is implemented in software running on general purpose processor. Since the proposed scheme only depends on the number of prefixes not the length of prefixes, it is easily scaled to IPv6.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.2
• /
• pp.195-200
• /
• 2015

This paper presents SVBS-TDC (Semi-Vernier Binary-Search Time-to-Digital Converter) for the noise improvement of ADPLL (All-Digital Phase Locked Loop. We used a Semi-Vernier BS-TDC (Binary-Search TDC) architecture to improve the operation speed more then 10 times compared with the previous conventional BS-TDC and ensured a 510ps wide input range. The proposed Semi-Vernier BS-TDC was designed in a 65ns CMOS process and the simulation results showed 200MHz speed and 4ps resolution with a 1.2V supply voltage, and considerable noise improvement of ADPLL.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.5
• /
• pp.2142-2148
• /
• 2015

This paper proposes novel real-time footstep planning and following methods for the navigation of humanoid robots. A footstep command is defined by a walking direction and step lengths for footstep planning. The walking direction is determined by a uni-vector field navigation method, and the allowable yawing range caused by hardware limitation is considered. The lateral step length is determined to avoid collisions between the two legs while walking. The sagittal step length is modified by a binary search algorithm when collision occurs between the robot body and obstacles in a narrow space. If the robot body still collides with obstacles despite the modification of the sagittal step length, the lateral step length is shifted at the next footstep. For footstep following, a walking pattern generator based on a 3-D linear inverted pendulum model is utilized, which can generate modifiable walking patterns using the zero-moment point variation scheme. Therefore, it enables a humanoid robot to follow the footstep command planned for each footstep. The effectiveness of the proposed method is verified through simulation and experiment.

• Journal of Korea Multimedia Society
• /
• v.14 no.11
• /
• pp.1420-1430
• /
• 2011

This paper proposes a new method to optimize energy consumption in a wireless modem by setting up a transmission power value according to the distance between nodes and circumstance in the MAC layer of IEEE 802.15.4. The proposed method can dynamically find an optimal transmission power range using the binary search scheme and minimize overhead caused by multiple message transmissions when determining the optimal transmission power. The determined transmission power is used for transmitting data packets and can be modified dynamically depending on the changes in a network environment when exchanging data packets and acknowledgement signals. The results of the simulations show 30% reduction in energy consumption while 2.5 times increase in data transmission rate per unit of energy comparing with IEEE 802.15.4 standard.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.2
• /
• pp.355-358
• /
• 2010

As CMOS technology continues to scale down, signal processing is favorably done in the digital domain, which requires Analog-to-Digital (A/D) Converter to be integrated on-chip. This paper presents a design methodology of 12-bit 1-MS/s Rail-to-Rail fully differential SAR ADC using Deep N-well Switch based on binary search algorithm. Proposed A/D Converter has the following architecture and techniques. Firstly, chip size and power consumption is reduced due to split capacitor array architecture and charge recycling method. Secondly, fully differential architecture is used to reduce noise between the digital part and converters. Finally, to reduce the mismatch effect and noise error, the circuit is designed to be available for Rail-to-Rail input range using simple Deep N-well switch. The A/D Converter fabricated in a TSMC 0.18um 1P6M CMOS technology and has a Signal-to-Noise-and-Distortion-Ratio(SNDR) of 69 dB and Free-Dynamic-Range (SFDR) of 73 dB. The occupied active area is $0.6mm^2$.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.1 s.307
• /
• pp.53-66
• /
• 2006

This paper proposes the combined image retrieval system that gives the same relevance as exhaustive search method while its performance can be considerably improved. This system is combined with two different retrieval methods and each gives the same results that full exhaustive search method does. Both of them are two-stage method. One uses condensation of feature vectors, and the other uses binary-tree clustering. These two methods extract the candidate images that always include correct answers at the first stage, and then filter out the incorrect images at the second stage. Inasmuch as these methods use equal algorithm, they can get the same result as full exhaustive search. The first method condenses the dimension of feature vectors, and it uses these condensed feature vectors to compute similarity of query and images in database. It can be found that there is an optimal condensation ratio which minimizes the overall retrieval time. The optimal ratio is applied to first stage of this method. Binary-tree clustering method, searching with recursive 2-means clustering, classifies each cluster dynamically with the same radius. For preserving relevance, its range of query has to be compensated at first stage. After candidate clusters were selected, final results are retrieved by computing similarities again at second stage. The proposed method is combined with above two methods. Because they are not dependent on each other, combined retrieval system can make a remarkable progress in performance.

• The Bulletin of The Korean Astronomical Society
• /
• v.46 no.1
• /
• pp.35.2-35.2
• /
• 2021

Blue straggler stars (BSs) are "rejuvenated" main sequence stars first recognized by Allan Sandage from his observation of the prominent northern globular cluster M3 in the year of 1953. BSs are now known to be present in diverse stellar environments including open clusters, globular clusters, dwarf galaxies, and even the field populations of the Milky Way. This makes them a very useful tool in a wide range of astrophysical applications: Particularly BSs are considered to have a crucial role in the evolution of stellar clusters because they affect on the dynamics, the binary population, and the history of the stellar evolution of the cluster they belong to. Here we report a part of the preliminary results from our ongoing research on the BSs in the two metal-poor globular clusters (GCs) in the Large Magellanic Cloud (LMC), Hodge 11 and NGC1466. Using the high precision multi-band images obtained with the Advanced Camera for Survey (ACS) onboard the Hubble Space Telescope (HST), we extract time-series photometry to search for the signal of periodic variations in the luminosity of the BSs. Our preliminary results confirm that several BSs are intrinsic "short period (0.05 < P < 0.25 days)" variable stars with either pulsating or eclipsing types. We will discuss our investigation on the properties of those variable BS candidates in the context of the formation channels of these exotic main sequence stars, and their roles in the dynamical evolution of the host star clusters.

• 한국신재생에너지학회:학술대회논문집
• /
• 2007.11a
• /
• pp.270-273
• /
• 2007

In this report, Indium-free and Indium-reduced thin film materials for solar absorber were studied in order to search alternative materials for thin film solar cell. The films of $Cu_2ZnSnSe_4$ and $Cu_2ZnSnSe_2$ were deposited using mixed binary chalcogenides powders. From the film bulk analysis result, it is observed that Cu concentration is a function of substrate temperature as well as CuSe mole ratio in the target. Under optimized conditions, $Cu_2ZnSnSe_4$ and $Cu_2ZnSnSe_2$ thin films grow with strong (112), (220/204) and (312/116) reflections. Films are found to exhibit a high absorption coefficient of $10^4$ $cm^{-1}$. $Cu_2ZnSnSe_4$ film shows a 1.5 eV band gap. On the other side, an increasing of optical band gap from 1.0 eV to 1.25 eV ($CuInSnSe_2$) is found to be proportional with an increasing of Zn concentration. All films have a p-type semiconductor characteristic with a carrier concentration in the order of $10^{14}$ $cm^{-3}$, a mobility about $10^1$ $cm^{2{\cdot}-1.}S^{-1}$ and a resistivity at the range of $10^2-10^6$ ${\Omega}{\cdot}m$.