• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5B
• /
• pp.830-841
• /
• 2000

We extend the sue of the method of least square to develop a recursive algorithm for the design of adaptive transversal filters such that, given the least-square estimate of this vector of the filter at iteration n-1, we may compute the updated estimate of this vector at iteration a upon the arrival of new data. We begin the development of the RLS algorithm by reviewing some basic relations that pertain to the method of least squares. Then, by exploiting a relation in matrix algebra known as the matrix inversion lemma, we develop the RLS algorithm. An important feature of the RLS algorithm is that it utilizes information contained in the input data, extending back to the instant of time when the algorithm is initiated. In this paper, we propose new tap weight updated RLS algorithm in adaptive transversal filter with data-recycling buffer structure. We prove that convergence speed of learning curve of RLS algorithm with data-recycling buffer is faster than it of exiting RL algorithm to mean square error versus iteration number. Also the resulting rate of convergence is typically an order of magnitude faster than the simple LMS algorithm. We show that the number of desired sample is portion to increase to converge the specified value from the three dimension simulation result of mean square error according to the degree of channel amplitude distortion and data-recycle buffer number. This improvement of convergence character in performance, is achieved at the (B+1)times of convergence speed of mean square error increase in data recycle buffer number with new proposed RLS algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.4
• /
• pp.691-698
• /
• 2003

We extend the sue of the method of least square to develop a recursive algorithm for the design of adaptive transversal filters such that, given the least-square estimate of this vector of the filter at iteration n-l, we may compute the updated estimate of this vector at iteration n upon the arrival of new data. We begin the development of the RLS algorithm by reviewing some basic relations that pertain to the method of least squares. Then, by exploiting a relation in matrix algebra known as the matrix inversion lemma, we develop the RLS algorithm. An important feature of the RLS algorithm is that it utilizes information contained in the input data, extending back to the instant of time when the algorithm is initiated. In this paper, we propose new tap weight updated RLS algorithm in adaptive transversal filter with data-recycling buffer structure. We prove that convergence speed of learning curve of RLS algorithm with data-recycling buffer is faster than it of exiting RLS algorithm to mean square error versus iteration number. Also the resulting rate of convergence is typically an order of magnitude faster than the simple LMS algorithm. We show that the number of desired sample is portion to increase to converge the specified value from the three dimension simulation result of mean square error according to the degree of channel amplitude distortion and data-recycle buffer number. This improvement of convergence character in performance, is achieved at the B times of convergence speed of mean square error increase in data recycle buffer number with new proposed RLS algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1998.11a
• /
• pp.574-577
• /
• 1998

In this paper, a new simple and efficient technique to improve the convergence speed of LMS algorithm is proposed in an interference-limited multi-path fading environment as encountered in indoor wireless communications. The convergence characteristics of the proposed algorithm, whose coefficients are multiply adapted in a symbol time period by recycling the received data, are analyzed to prove theoretically the improvement of convergence speed. The theoretical analysis shows that the data-recycling in technique can increase convergence speed by (B+1) times without increasing the computational complexity substantially where B is the number of recycled data. The results of the computer simulation demonstrate that the simulation results are in accordance with the theoretical analysis and the superiority of the filter algorithm.

• Journal of the Korea Organic Resources Recycling Association
• /
• v.18 no.4
• /
• pp.54-63
• /
• 2010

When MBT(Mechanical Biological Treatment) facility is designed, the management system adequate for domestic circumstance in Korea has been insufficient and power plant's load on seasonal variation has not been resolved yet. Thus, this study introduced MBT facility and MSW(Municipal Solid Waste)'s seasonal emission characteristics were investigated in order to establish new MBT management system. and additional thermal buffer-materials's calorific values were also considered to reduce the power plant's load. The results showed that the screening efficiency of MBT facility and the physical characteristics of each waste can be identified, and the calorific value by seasonal variation for MBT facility can be kept constant all the year round by using an additional thermal buffer-materials.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.4
• /
• pp.11-22
• /
• 1999

Least-mean-square(LMS) adaptive filters have proven to be extremely useful in a number of signal processing tasks. However LMS adaptive filter suffer from a slow rate of convergence for a given steady-state mean square error as compared to the behavior of recursive least squares adaptive filter. In this paper an efficient signal interference control technique is introduced to improve the convergence speed of LMS algorithm with tap weighted vectors updating which were controled by reusing data which was abandoned data in the Adaptive transversal filter in the scheme with data recycling buffers. The computer simulation show that the character of convergence and the value of MSE of proposed algorithm are faster and lower than the existing LMS according to increasing the step-size parameter $\mu$ in the experimentally computed. learning curve. Also we find that convergence speed of proposed algorithm is increased by (B+1) time proportional to B which B is the number of recycled data buffer without complexity of computation. Adaptive transversal filter with proposed data recycling buffer algorithm could efficiently reject ISI of channel and increase speed of convergence in avoidance burden of computational complexity in reality when it was experimented having the same condition of LMS algorithm.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.963-967
• /
• 2009

The Log-structured File System (LFS) collects all modified data into a memory buffer and writes them sequentially to a segment on disk. Therefore, it has the potential to utilize the maximum bandwidth of storage devices where sequential writes are much faster than random writes. However, as disk space is finite, LFS has to conduct cleaning to produce free segments. This cleaning operation is the main reason LFS performance deteriorates when file system utilization is high. To overcome painful cleaning and reduced performance of LFS, we propose the segment space recycling (SSR) scheme that directly writes modified data to invalid areas of the segments and describe the classification method of data and segment to consider locality of reference for optimizing SSR scheme. We implement U-LFS, which employs our segment space recycling scheme in LFS, and experimental results show that SSR scheme increases performance of WOLF by up to 1.9 times in HDD and 1.6 times in SSD when file system utilization is high.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.12
• /
• pp.149-155
• /
• 2012

SSD is a storage device of having high-performance controller and cache buffer and consists of many NAND flash memories. Because NAND flash memory does not support in-place update, valid pages are invalidated when update and erase operations are issued in file system and then invalid pages are completely deleted via garbage collection. However, garbage collection performs many erase operations of long latency and then it reduces I/O performance and increases wear leveling in SSD. In this paper, we propose a new method of de-duplicating valid data and recycling invalid data. The method de-duplicates valid data and then recycles invalid data so that it improves de-duplication ratio. Due to reducing number of writes and garbage collection, the method could increase I/O performance and decrease wear leveling in SSD. Experimental result shows that it can reduce maximum 20% number of garbage collections and 9% I/O latency than those of general case.

• Journal of environmental and Sanitary engineering
• /
• v.15 no.3
• /
• pp.62-69
• /
• 2000

In point of recycling wastes, batch test was conducted to examine the neutralization and Fe removal from laboratory wastewater using wastes. Oyster shell and slag had a buffer capacity to neutralize an acidic wastewater but tire rubber didn't. With increasing reaction time, dosage and agitation speed, Fe was well removed by wastes. As a result on the experiments of Freundlich isotherm, the adsorption intensities(1/n) were 0.32∼0.46 and the adsorption capacities(k) were 4.3∼4.6 for removing Fe from laboratory wastewater by wastes. In view of these results, it was estimated that wastes containing the similar compositions as these could utilize the neutralization and adsorption of heavy metals in laboratory wastewater.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.5 no.5
• /
• pp.58-66
• /
• 2002

We present a planting plan of the buffer-forest belts created at the boundary area of the waste landfill site which is located in the coastal area of Kyubg-Gi province. In order to form a proper section of ground soil excavated from the sea and a forest which shows a distinction of the vegetation stratification, the planting plan with trees, sub-trees, shrubs, and seedlings (produced at a sprout cultivation place) is devised with an adjustment of planting density. 1. The preparation of mounding is required for planting at a waste landfill site. We first estimate an economical and efficient banking height together with the quantity of soil, and prepare a planting ground with excavated ground soil for the consideration of soil recycling. On the planting ground a banking with a height of 1.5-2m is produced by self-supported soil, playing a role in a salt blocking and an irritation layer of planting. Finally, an additional banking with a height of 2m is produced by qualified vegetation soil, forming a vegetation section with a total height of 6m. 2. Since the planning site is located in the border, the planting area is composed of two regions : one is an inclined face (slope 1 : 3) toward the inside of the landfill site and the other is an inclined face (slope 1 : 4) toward the inland. The buffer planting in the former (latter) region consists of wind break forest (mixed-landscape forest) within a width of less than 35m. 3. Based on the data obtained from the literatures and the investigation of local plants, we choose the 21 plant species (such as Pinus thunbergii, Pinus densiflora, Sorbus alnifolia, Albizzia julibrissin and etc.) and the additinal 7 species which are grown at a sprout cultivation palce of the SUDOKWON landfill site (Rosa rugosa, Quercus acutissima, Prunus armeniaca var. ansu., and etc.). Sub-trees with a height of above 2.5m and seedlings are planted with an interval of $1.5{\times}1.5m$ ($0.45roots/m^2$) and $0.5{\times}0.5m$ ($4roots/m^2$), respectively. Here, both trees exhibit communities planting with more than three rows. Shrubs are planted with $9-16roots/m^2$, depending on their size. Since this case study provides a reference of the planting beds as well as a planting plan at the SUDOKWON landfill site, it is not sufficient for the present plan to be utilized for the formation of buffer-forest belts which are used for the analysis of environmental factor and the reduction of environmental pollutants in the sea waste landfill site. Thus, further studies with the ecological basis are demanded for the environment planting restoration in the sea waste landfill site.

• Journal of the Korea Organic Resources Recycling Association
• /
• v.27 no.4
• /
• pp.51-59
• /
• 2019

In this study, the influence of anaerobic digested sludge and 50 mM PBS (phosphate buffer solution) mixing ratio (1:1, 1:2, 1:3, 1:4, 1:5, 1:6, 1:7) on hydrogen production and inoculation period were examined. MECs were operated in fed-batch mode with an applied voltage of 0.9 V. As a result, in the 1:1 mixing ratio reactor, 9.8-20.9 mL of hydrogen was produced with the highest hydrogen content of 66.8-79.6%. Hydrogen gas production and power density increased from after 12 days of inoculation for the 1:1 mixing ratio reactor. In case of 1:2, 1:3 and 1:4 mixing ratio reactor, the hydrogen gas production was 3.7-7.1 mL and the hydrogen gas content was 5.8-65.8%. The hydrogen gas yield in 1:5, 1:6 and 1:7 ratio reactors, was 0.50-0.69 mL and hydrogen content range was 1.8-7.1%. The mixing ratio was found to be suitable for hydrogen production and inoculation period by mixing ratio up to 1:4.