• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.2
• /
• pp.285-290
• /
• 2023

Compressors are widely used in high-speed electronic systems and are used to reduce the number of operands in multiplier. The proposed compressor is constructed based on the m-GDI(: modified gate diffusion input) to reduce the propagation delay time. This paper is compared the performance of compressors by applying 4-2, 5-2 and 6-2 m-GDI compressors to the multiplier, respectively. As a simulation results, compared to the 8-bit Dadda multiplier using the 4-2 and 6-2 compressor, the multiplier using the 5-2 compressor is reduced propagation delay time 13.99% and 16.26%, respectively. Also, the multiplier using the 5-2 compressor is reduced PDP(: Power Delay Product) 4.99%, 28.95% compared to 4-2 and 6-2 compressor, respectively. However, the multiplier using the 5-2 compression circuit is increased power consumption by 10.46% compared to the multiplier using the 4-2 compression circuit. In conclusion, the 8-bit Dadda multiplier using the 5-2 compressor is superior to the multipliers using the 4-2 and 6-2 compressors. The proposed circuit is implemented using TSMC 65nm CMOS process and its feasibility is verified through SPECTRE simulation.

• The Journal of the Acoustical Society of Korea
• /
• v.29 no.3
• /
• pp.191-199
• /
• 2010

Physical modeling is a synthesis method of high quality sound which is similar to real sound for musical instruments. However, since physical modeling requires a lot of parameters to synthesize sound of a musical instrument, it prevents real-time processing for the musical instrument which supports a large number of sounds simultaneously. To solve this problem, this paper proposes a single instruction multiple data (SIMD) parallel processor that supports real-time processing of sound synthesis of guitar, a representative plucked string musical instrument. To control six strings of guitar, we used a SIMD parallel processor which consists of six processing elements (PEs). Each PE supports modeling of the corresponding string. The proposed SIMD processor can generate synthesized sounds of six strings simultaneously when a parallel synthesis algorithm receives excitation signals and parameters of each string as an input. Experimental results using a sampling rate 44.1 kHz and 16 bits quantization indicate that synthesis sounds using the proposed parallel processor were very similar to original sound. In addition, the proposed parallel processor outperforms commercial TI's TMS320C6416 in terms of execution time (8.9x better) and energy efficiency (39.8x better).

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.4
• /
• pp.392-400
• /
• 2009

In this paper, we propose an effective speech reinforcement technique base on ITU-T G.729A CS-ACELP codec under the near-end background noise environments. In general, since the intelligibility of the far-end speech for the near-end listener is significantly reduced under near-end noise environments, we require a far-end speech reinforcement approach to avoid this phenomena. In contrast to the conventional speech reinforcement algorithm, we reinforce the excitation signal of the codec's parameters received from the far-end speech signal based on the G.729A speech codec under various background noise environments. Specifically, we first estimate the excitation signal of ambient noise at the near-end through the encoder of the G.729A speech codec, reinforcing the excitation signal of the far-end speech transmitted from the far-end. we specially propose a novel approach to directly reinforce the excitation signal of far-end speech signal based on the decoder of the G.729A. The performance of the proposed algorithm is evaluated by the CCR (Comparison Category Rating) test of the method for subjective determination of transmission quality in ITU-T P.800 under various noise environments and shows better performances compared with conventional SNR Recovery methods.

• 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.

• Journal of Korean Society for Geospatial Information Science
• /
• v.8 no.1 s.15
• /
• pp.51-63
• /
• 2000

Dynamic traffic assignment(DTA) has been a topic of substantial research during the past decade. While DTA is gradually maturing, many aspects of DTA still need improvement, especially regarding its formulation and solution algerian Recently, with its promise for In(Intelligent Transportation System) and GIS(Geographic Information System) applications, DTA have received increasing attention. This potential also implies higher requirement for DTA modeling, especially regarding its solution efficiency for real-time implementation. But DTA have many mathematical difficulties in searching process due to the complexity of spatial and temporal variables. Although many solution algorithms have been studied, conventional methods cannot iud the solution in case that objective function or constraints is not convex. In this paper, the genetic algorithm to find the solution of DTA is applied and the Merchant-Nemhauser model is used as DTA model because it has a nonconvex constraint set. To handle the nonconvex constraint set the GENOCOP III system which is a kind of the genetic algorithm is used in this study. Results for the sample network have been compared with the results of conventional method.

• Radiation Oncology Journal
• /
• v.20 no.3
• /
• pp.283-293
• /
• 2002

Purpose : A PC based brachytherapy planning system was developed to display dose distributions on simulation images by 2D isodose curve including the dose profiles, dose-volume histogram and 30 dose distributions. Materials and Methods : Brachytherapy dose planning software was developed especially for the Ir-192 source, which had been developed by KAERI as a substitute for the Co-60 source. The dose computation was achieved by searching for a pre-computed dose matrix which was tabulated as a function of radial and axial distance from a source. In the computation process, the effects of the tissue scattering correction factor and anisotropic dose distributions were included. The computed dose distributions were displayed in 2D film image including the profile dose, 3D isodose curves with wire frame forms and dosevolume histogram. Results : The brachytherapy dose plan was initiated by obtaining source positions on the principal plane of the source axis. The dose distributions in tissue were computed on a $200\times200\;(mm^2)$ plane on which the source axis was located at the center of the plane. The point doses along the longitudinal axis of the source were $4.5\~9.0\%$ smaller than those on the radial axis of the plane, due to the anisotropy created by the cylindrical shape of the source. When compared to manual calculation, the point doses showed $1\~5\%$ discrepancies from the benchmarking plan. The 2D dose distributions of different planes were matched to the same administered isodose level in order to analyze the shape of the optimized dose level. The accumulated dose-volume histogram, displayed as a function of the percentage volume of administered minimum dose level, was used to guide the volume analysis. Conclusion : This study evaluated the developed computerized dose planning system of brachytherapy. The dose distribution was displayed on the coronal, sagittal and axial planes with the dose histogram. The accumulated DVH and 3D dose distributions provided by the developed system may be useful tools for dose analysis in comparison with orthogonal dose planning.

• Journal of Environmental Impact Assessment
• /
• v.26 no.2
• /
• pp.127-139
• /
• 2017

Measurements of net ecosystem exchange (NEE) of $CO_2$ based on the eddy covariance technique provide reasonable carbon balance estimates in response to local environmental conditions. In South Korea, the forest ecosystems cover approximately 64% of the total area, thereby strongly affecting regional carbon balances. Cultivated croplands that cover about 17% of the total area should also be considered when calculating the carbon balance of the country. In this study, our objectives were (a) to quantify the range and seasonal variation of NEE at forest ecosystems, including deciduous, coniferous, and mixed forests, and agricultural ecosystems, including rice paddies and a potato field, in South Korea and (b) to compare NEE at ten Fluxnet sites that have the same or similar ecosystems as found in South Korea. The results showed that the forest and agricultural ecosystems were carbon sinks. In Korea, NEE at the forest ecosystems varied between -31 and $-362gC/m^2/yr$, and NEE at the croplands ranged from -210 to $-248gC/m^2/growing$ season. At the deciduous forest, NEE reached low values in late spring, early summer, and early autumn, while at the coniferous forest, it reached low values in spring, early summer, and mid autumn. The young mixed forest was a much stronger carbon sink than the old-growth deciduous and coniferous forests. During each crop growing season, beet had the lowest NEE value within six crops, followed by wither wheat, maize, rice, potato, and soybean. These results will be useful for designing and applying management strategies for the reduction of $CO_2$ emissions.

• The KIPS Transactions:PartC
• /
• v.10C no.6
• /
• pp.683-694
• /
• 2003

We present X-tree Diff, a change detection algorithm for tree-structured data. Our work is motivated by need to monitor massive volume of web documents and detect suspicious changes, called defacement attack on web sites. From this context, our algorithm should be very efficient in speed and use of memory space. X-tree Diff uses a special ordered labeled tree, X-tree, to represent XML/HTML documents. X-tree nodes have a special field, tMD, which stores a 128-bit hash value representing the structure and data of subtrees, so match identical subtrees form the old and new versions. During this process, X-tree Diff uses the Rule of Delaying Ambiguous Matchings, implying that it perform exact matching where a node in the old version has one-to one corrspondence with the corresponding node in the new, by delaying all the others. It drastically reduces the possibility of wrong matchings. X-tree Diff propagates such exact matchings upwards in Step 2, and obtain more matchings downwsards from roots in Step 3. In step 4, nodes to ve inserted or deleted are decided, We aldo show thst X-tree Diff runs on O(n), woere n is the number of noses in X-trees, in worst case as well as in average case, This result is even better than that of BULD Diff algorithm, which is O(n log(n)) in worst case, We experimented X-tree Diff on reat data, which are about 11,000 home pages from about 20 wev sites, instead of synthetic documets manipulated for experimented for ex[erimentation. Currently, X-treeDiff algorithm is being used in a commeercial hacking detection system, called the WIDS(Web-Document Intrusion Detection System), which is to find changes occured in registered websites, and report suspicious changes to users.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.8
• /
• pp.223-230
• /
• 2021

The lightweight block cipher PIPO announced at ICISC'20 has been effectively implemented by applying the bit slice technique. In this paper, we propose a parallel optimal implementation of PIPO for ARM processors. The proposed implementation enables parallel encryption of 8-plaintexts and 16-plaintexts. The implementation targets the A10x fusion processor. On the target processor, the existing reference PIPO code has performance of 34.6 cpb and 44.7 cpb in 64/128 and 64/256 standards. Among the proposed methods, the general implementation has a performance of 12.0 cpb and 15.6 cpb in the 8-plaintexts 64/128 and 64/256 standards, and 6.3 cpb and 8.1 cpb in the 16-plaintexts 64/128 and 64/256 standards. Compared to the existing reference code implementation, the 8-plaintexts parallel implementation for each standard has about 65.3%, 66.4%, and the 16-plaintexts parallel implementation, about 81.8%, and 82.1% better performance. The register minimum alignment implementation shows performance of 8.2 cpb and 10.2 cpb in the 8-plaintexts 64/128 and 64/256 specifications, and 3.9 cpb and 4.8 cpb in the 16-plaintexts 64/128 and 64/256 specifications. Compared to the existing reference code implementation, the 8-plaintexts parallel implementation has improved performance by about 76.3% and 77.2%, and the 16-plaintext parallel implementation is about 88.7% and 89.3% higher for each standard.