• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.12
• /
• pp.2555-2562
• /
• 2011

Binary CDMA is a new standard technology for wireless communication developed by our country that makes high speed communications and good quality of services. In this paper we researched the development methods and implementation of a wireless VoIP System based on the Binary-CDMA technology that makes it freely installed in any place without phone cables and laying works. We designed the structure of the Binary-CDMA Wireless VoIP System and defined messages and data structures for call control. And then we designed and implemented call control message flow between VoIP terminals for user's communication.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2B
• /
• pp.71-79
• /
• 2006

Address lookup is an essential function in the Internet routers, and it determines overall router performance. In this paper, we have thoroughly investigated the binary-search-based address lookup algorithms and proposed a new algorithm based on binary search on prefix lengths. Most of the existing binary search schemes perform binary search on prefix values, and hence the lookup speed is proportional to the length of prefixes or the log function of the number of prefixes. The previous algorithm based on binary search on prefix lengths has superior lookup performance than others. However, the algorithm requires very complicated pre-computation of markers and best matching prefixes in internal nodes since naive binary search is not possible in their scheme. This complicated pre-computation makes the composition of the routing table and incremental update very difficult. By using leaf-pushing, the proposed algorithm in this paper removes the complicated pre-computation of the Previous work in performing the binary search on prefix lengths. The performance evaluation results show that the proposed scheme has very good performance in lookup speed compared with previous works.

• Journal of Multimedia Information System
• /
• v.1 no.2
• /
• pp.119-126
• /
• 2014

We propose a bicycle detection system riding on people based on modified projected local binary pattern(PLBP) for vision based intelligent vehicles. Projection method has robustness for rotation invariant and reducing dimensionality for original image. The features of Local binary pattern(LBP) are fast to compute and simple to implement for object recognition and texture classification area. Moreover, We use uniform pattern to remove the noise. This paper suggests that modified LBP method and projection vector having different weighting values according to the local shape and area in the image. Also our system maintains the simplicity of evaluation of traditional formulation while being more discriminative. Our experimental results show that a bicycle and motorcycle riding on people detection system based on proposed PLBP features achieve higher detection accuracy rate than traditional features.

• Journal of Advanced Navigation Technology
• /
• v.6 no.4
• /
• pp.318-325
• /
• 2002

In this paper, the effects of the interference environments on the performance of the time hopping(TH) binary PPM impulse radio(IR) system are presented. Based on the monocycle pulse available within the frequency of 3.1~10.6 GHz permitted for application by FCC, a PPM-modulated TH IR system simulator was designed and followed by the analysis of the monocycle pulse characteristics as well as the system performance. Particularly for the evaluation of the system performance, the multiple access interference and the narrowband system interference signals were considered as the interference signals. Since the narrowband system interference signal has very narrow bandwidth and very large amplitude compared with those of IR system, the analysis of the IR system performance was implemented by considering the interference power and band fraction ratio of the narrowband interference signal.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.111-113
• /
• 2006

DEAS is an direct searching and optimization method that based on the binary code space. It can be classified as an direct hill climbing searching. However, because of binary code space based searching, the searching in low resolution has random property. As the resolution of code increases during the search, its property of searching changes like that of hill climbing search. This paper propose a method for improving the performance of minimum seeking ability of DEAS with history information. The cost evaluation is increased. However the minimum searching ability of DEAS is improved along the same starting resolution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.911-919
• /
• 2004

IP address lookup is one of the essential functions on internet routers, and it determines overall router performance. The most important evaluation factor for software-based IP address lookup is the number of the worst case memory accesses. Binary prefix tree (BPT) scheme gives small number of worst case memory accesses among previous software-based schemes. However the tree structure of BPT is normally unbalanced. In this paper, we propose weighted binary prefix tree (WBP) scheme which generates nearly balanced tree, through combining the concept of weight to the BPT generation process. The proposed WBPT gives very small number of worst case memory accesses compared to the previous software-based schemes. Moreover the WBPT requires comparably small size of memory which can be fit within L2 cache for about 30,000 prefixes, and it is rather simple for prefix addition and deletion. Hence the proposed WBPT can be used for software-based If address lookup in practical routers.

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2002.09a
• /
• pp.322-323
• /
• 2002

Partial volume averaging effect of PET data influences on the accuracy of quantitative measurements of regional brain metabolism because spatial resolution of PET is limited. The purpose of this study was to evaluate the accuracy of partial volume correction carried out on $^{18}$ F-PET images using Hoffman brain phantom. $^{18}$ F-PET Hoffman phantom images were co-registered to MR slices of the same phantom. All the MR slices of the phantom were then segmented to be binary images. Each of these binary images was convolved in 2 dimensions with the spatial resolution of the PET. The original PET images were then divided by the smoothed binary images in slice-by-slice, voxel-by-voxel basis resulting in larger PET image volume in size. This enlarged partial volume corrected PET image volume was multiplied by original binary image volume to exclude extracortical region. The evaluation of partial volume corrected PET image volume was performed by region of interests (ROI) analysis applying ROIs, which were drawn on cortical regions of the original MR image slices, to corrected and original PET image volume. From the ROI analysis, range of regional mean values increases of partial volume corrected PET images was 4 to 14%, and average increase for all the ROIs was about 10% in this phantom study. Hoffman brain phantom study was useful for the objective evaluation of the partial volume correction method. This MR-based correction method would be applicable to patients in the. quantitative analysis of FDG-PET studies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1B
• /
• pp.18-28
• /
• 2004

Efficient hardware implementation of address lookup is one of the most important design issues of internet routers. Address lookup significantly impacts router performance since routers need to process tens-to-hundred millions of packets per second in real time. In this paper, we propose a practical IP address lookup structure based on the binary tree of prefixes of different lengths. The proposed structure produces multiple balanced trees, and hence it solve the issues due to the unbalanced binary prefix tree of the existing scheme. The proposed structure is implemented using pipelined binary search combined with a small size TCAM. Performance evaluation results show that the proposed architecture requires a 2000-entry TCAM and total 245 kbyte SRAMs to store about 30,000 prefix samples from MAE-WEST router, and an address lookup is achieved by a single memory access. The proposed scheme scales very well with both of large databases and longer addresses as in IPv6.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2304-2308
• /
• 2003

Ocean thermal energy conversion (OTEC) is an effective method of power generation, which has a small impact on the environment and can be utilized semi-permanently. This paper describes a dynamic model for a pilot OTEC plant built by the Institute of Ocean Energy, Saga University, Japan. This plant is based on Uehara cycle, in which binary mixtures of ammonia and water is used as the working fluid. Some simulation results attained by this model and the analysis of the results are presented. The developed computer simulation can be used to actual practice effectively, such as stable control in a steady operation, optimal determination of the plant specifications for a higher thermal efficiency and evaluation of the economic prospects and off-line training for the operators of OTEC plant.

• ETRI Journal
• /
• v.36 no.5
• /
• pp.772-782
• /
• 2014

Two-microphone binary mask speech enhancement (2mBMSE) has been of particular interest in recent literature and has shown promising results. Current 2mBMSE systems rely on spatial cues of speech and noise sources. Although these cues are helpful for directional noise sources, they lose their efficiency in diffuse noise fields. We propose a new system that is effective in both directional and diffuse noise conditions. The system exploits two features. The first determines whether a given time-frequency (T-F) unit of the input spectrum is dominated by a diffuse or directional source. A diffuse signal is certainly a noise signal, but a directional signal could correspond to a noise or speech source. The second feature discriminates between T-F units dominated by speech or directional noise signals. Speech enhancement is performed using a binary mask, calculated based on the proposed features. In both directional and diffuse noise fields, the proposed system segregates speech T-F units with hit rates above 85%. It outperforms previous solutions in terms of signal-to-noise ratio and perceptual evaluation of speech quality improvement, especially in diffuse noise conditions.