• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2053-2061
• /
• 1997

The motion comensated video coding technology is very improtant to compress video signal since it reduces the temporal redundancies in successive frames. But the computational complexity of the motion estimation(ME) is too enormous to use in the area of real-time and/or resolution video processing applications. To reduce the complexity of ME, fast search algoritjms and hardware design methods are developed. Especially, the three step search(TSS) is well known method which shows stable performance in various video sequences. And other variations of TSS are developed to get better performance andto reduce the complexity. In this paepr, we present the modified TSS using neighboring block's motion vectors to determine first step motion vector in TSS. The presented method uses the correlation of the adjacent blocks with same motion field. The simualtion resutls show that it has a good MAE performance and low complexity comparing with original TSS.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.1765-1768
• /
• 2005

Binary-search 알고리즘을 이용한 새로운 6-bit 300MS/s ADC 를 제안 하였다. 본 연구에서 제안된 ADC 는 저전력, 고속동작, 저해상도의 응용분야에 적합하도록 설계 되었다. 11 개의 rail-to-rail 비교기와 기준전압 발생기, 그리고 기준전압 제어회로로 구성 되었으며, 이는 기존의 구조와는 다른 전혀 새로운 형태로 제안된 것이다. 전력소모를 줄이기 위해 비교기 공유기술을 사용하였다. 또한 ADC 의 sub-block 인 rail-to-rail 비교기는 인버터 logic threshold 전압 값을 이용한 새로운 형태의 비교기를 제안하였다. 비교기는 인버터와 n-type preamp, p-type preamp 그리고 각각에 연결되는 latch 로 구성되었다. 기존의 rail-to-rail comparator 에 비해 입력 범위 전체 영역에서 일정한 gm 값을 얻을 수 있다. 실험결과 2.5V 공급전압에서, 17mW 의 전력 소모를 보이며, 최대 304MS/s 의 데이터 변환율을 가진다. INL 과 DNL 은 입력신호가 2.38Mhz 의 주파수를 가지는 삼각파일 때, 각각 ${\pm}0.54LSB$, ${\pm}1LSB$ 보다 작다. TSMC 0.25u 공정을 이용하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.11
• /
• pp.3204-3217
• /
• 2023

In this paper, the downlink of the multicast based spatial modulation systems is investigated. Specifically, physical layer multicasting is introduced to increase the number of access users and to improve the communication rate of the spatial modulation system in which only single radio frequency chain is activated in each transmission. To minimize the bit error rate (BER) of the multicast based spatial modulation system, a joint optimizing algorithm of antenna selection and multicast precoding is proposed. Firstly, the joint optimization is transformed into a mixed-integer non-linear program based on single-stage reformulation. Then, a novel iterative algorithm based on the idea of branch and bound is proposed to obtain the quasioptimal solution. Furthermore, in order to balance the performance and time complexity, a low-complexity deflation algorithm based on the successive convex approximation is proposed which can obtain a sub-optimal solution. Finally, numerical results are showed that the convergence of our proposed iterative algorithm is between 10 and 15 iterations and the signal-to-noise-ratio (SNR) of the iterative algorithm is 1-2dB lower than the exhaustive search based algorithm under the same BER accuracy conditions.

• Journal of Soil and Groundwater Environment
• /
• v.16 no.2
• /
• pp.52-60
• /
• 2011

Although facilities for the passive treatment of AMD (Acid Mine Drainage) are currently operating in Korea, their removal efficiency for heavy metals is relatively low in average (only 80%). Passive treatment system is composed of oxidation tank, SAPS (Successive Alkalinity Producing System), and wetland. In the treatment system adopted in korea, SAPS (Successive Alkalinity Producing System) plays a major role to remove about 65% of heavy metals through a precipitation. However, the efficiency of SAPS is limited due to the use of mushroom compost (MC) as a organic material and of limestone as a neutralizer. Therefore, this research was performed to search for alternative organic materials through the field test. We tested two types of mixed organic materials: 1) cow manure and spent oak (herein, CO) and 2) cow manure and sawdust (herein, CS). For comparison mushroom compost (herein, MC) was also tested. The result showed that the average Fe removal efficiency was 91.38% with CO, 85.19% with CS, and 91.58% with MC. Thus, CO can be effectively used as an alternative of MC in the SAPS system for heavy metals removal.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.2 s.302
• /
• pp.151-160
• /
• 2005

In this paper, we propose a new fast motion estimation algorithm based on successive elimination algorithm (SEA) which can dramatically reduce heavy complexity of the variable block size motion estimation in H.264 encoder. The proposed method applies the conventional SEA in the hierarchical manner to the seven block modes. That is, the proposed algorithm can remove the unnecessary computation of SAD by means of the process that the previous minimum SAD is compared to a current SAD for each mode which is obtained by accumulating sum norms or SAD of $4\times4$ blocks. As a result, we have tighter bound in the inequality between SAD and sum norm than in the ordinary SEA. If the basic size of the block is smaller than $4\times4$, the bound will become tighter but it also causes to increase computational complexity, specifically addition operations for sum norm. Compared with fast full search algorithm of JM of H.264, our algorithm saves 60 to $70\%$ of computation on average for several image sequences.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.232-239
• /
• 2011

This paper investigates the user selection problem of successive zero-forcing precoded multiuser multiple-input multiple-output (MU-MIMO) downlink systems, in which the base station and mobile receivers are equipped with multiple antennas. Assuming full knowledge of the channel state information at the transmitter, dirty paper coding (DPC) is an optimal precoding strategy, but practical implementation is difficult because of its excessive complexity. As a suboptimal DPC solution, successive zero-forcing DPC (SZF-DPC) was recently proposed; it employs partial interference cancellation at the transmitter with dirty paper encoding. Because of a dimensionality constraint, the base station may select a subset of users to serve in order to maximize the total throughput. The exhaustive search algorithm is optimal; however, its computational complexity is prohibitive. In this paper, we develop two low-complexity user scheduling algorithms to maximize the sum rate capacity of MU-MIMO systems with SZF-DPC. Both algorithms add one user at a time. The first algorithm selects the user with the maximum product of the maximum column norm and maximum eigenvalue. The second algorithm selects the user with the maximum product of the minimum column norm and minimum eigenvalue. Simulation results demonstrate that the second algorithm achieves a performance similar to that of a previously proposed capacity-based selection algorithm at a high signal-to-noise (SNR), and the first algorithm achieves performance very similar to that of a capacity-based algorithm at a low SNR, but both do so with much lower complexity.

• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.98-113
• /
• 2002

In this paper, we present advanced algorithms to reduce the computations of block matching algorithms for motion estimation in video coding. Advanced multi-level successive elimination algorithms(AMSEA) are based on the Multi-level successive elimination algorithm(MSEA)[1]. The first algorithm is that when we calculate the sum of absolute difference (SAD) between the sum norms of sub-blocks in MSEA, we use the partial distortion elimination technique. By using the first algorithm, we can reduce the computations of MSEA further. In the second algorithm, we calculate SAD adaptively from large value to small value according to the absolute difference values between pixels of blocks. By using the second algorithm, the partial distortion elimination in SAD calculation can occur early. So, the computations of MSEA can be reduced. In the third algorithm, we can estimate the elimination level of MSEA. Accordingly, the computations of the MSEA related to the level lower than the estimated level can be reduced. The fourth algorithm is a very fast block matching algorithm with nearly 100% motion estimation accuracy. Experimental results show that AMSEA are very efficient algorithms for the estimation of motion vectors.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.4
• /
• pp.30-39
• /
• 2003

In this paper, we carried out the performance evaluation of HM-Net(Hidden Markov Network) speech recognition system for Korean speech databases. We adopted to construct acoustic models using the HM-Nets modified by HMMs(Hidden Markov Models), which are widely used as the statistical modeling methods. HM-Nets are carried out the state splitting for contextual and temporal domain by PDT-SSS(Phonetic Decision Tree-based Successive State Splitting) algorithm, which is modified the original SSS algorithm. Especially it adopted the phonetic decision tree to effectively express the context information not appear in training speech data on contextual domain state splitting. In case of temporal domain state splitting, to effectively represent information of each phoneme maintenance in the state splitting is carried out, and then the optimal model network of triphone types are constructed by in the parameter. Speech recognition was performed using the one-pass Viterbi beam search algorithm with phone-pair/word-pair grammar for phoneme/word recognition, respectively and using the multi-pass search algorithm with n-gram language models for sentence recognition. The tree-structured lexicon was used in order to decrease the number of nodes by sharing the same prefixes among words. In this paper, the performance evaluation of HM-Net speech recognition system is carried out for various recognition conditions. Through the experiments, we verified that it has very superior recognition performance compared with the previous introduced recognition system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.4
• /
• pp.395-403
• /
• 2016

This paper introduces a multi-cell search method for heterogeneous networks (HetNet), in which user equipments need to search multiple cells in its vicinity simultaneously. Due to the difficulty of acquiring channel informations for multiple cells, a non-coherent approach is preferred. In this paper, a non-coherent single-cell search scheme using a weighted vector is proposed, and the successive interference cancellation based multi-cell search algorithm is devised. In order to improve cell search performance, the weighted vector is designed in a way to exploit the general characteristic of wireless channel. Based on the fact that the performance of the proposed single-cell search scheme deviates slowly from the one using the optimal weighted vector, a universal weighted vector is also proposed, which shows the performance close to the optimal ones for various channel environments and signal-to-noise ratio regimes. Simulation results confirm that the proposed multi-cell search algorithm is capable of identifying cells more accurately with the help of the proposed single-cell search scheme, and can detect the remaining cells more effectively by removing the signals of the identified cells from the received signal.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.22 no.2
• /
• pp.101-122
• /
• 2011

Information literacy(IL) is the essential skill in the knowledge information society in the 21st century. Spreading the awareness of importance of IL across the world, the efforts to develop and implement IL standards or instructions are expanded around United States, United Kingdom, and Australia. In this study, Author extracts the core elements of IL from domestic and foreign IL standards and integrates those with Kuhlthau's Information Search Process(ISP) Model in order to develop the curriculum model of IL for undergraduates. The curriculum model has been constructed by consideration of capability of application to practice and expressed as the syllabus for the structure of university education. In the curriculum model, major instructional contents are extracted from 6 core elements of IL and the contents are organized by 6 ISP stages. Author suggests some successive studies based on the curriculum model for expansion and advancement of IL instruction.