• ETRI Journal
• /
• v.34 no.6
• /
• pp.879-884
• /
• 2012

When the number of users is finite, the performance improvement of the orthogonal random beamforming (ORBF) scheme is limited in high signal-to-noise ratio regions. In this paper, to improve the performance of the ORBF scheme, the user set and transmit power allocation are jointly determined to maximize sum rate under the total transmit power constraint. First, the transmit power allocation problem is expressed as a function of a given user set. Based on this expression, the optimal user set with the maximum sum rate is determined. The suboptimal procedure is also presented to reduce the computational complexity, which separates the user set selection procedure and transmit power allocation procedure.

• Journal of information and communication convergence engineering
• /
• v.12 no.4
• /
• pp.221-227
• /
• 2014

In this paper, we analyze the effect of the coherence bandwidth of wireless channels on leakage suppression methods for discrete Fourier transform (DFT)-based channel estimation in orthogonal frequency division multiplexing (OFDM) systems. Virtual carriers in an OFDM symbol cause orthogonality loss in DFT-based channel estimation, which is referred to as the leakage problem. In order to solve the leakage problem, optimal and suboptimal methods have already been proposed. However, according to our analysis, the performance of these methods highly depends on the coherence bandwidth of wireless channels. If some of the estimated channel frequency responses are placed outside the coherence bandwidth, a channel estimation error occurs and the entire performance worsens in spite of a high signal-to-noise ratio.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.9
• /
• pp.2153-2161
• /
• 1993

Self-tuning control algorithms for an input-amplitude constrained system are developed and implemented. Magnitude of control input for small motors is generally restricted to narrow bound due to actuator saturation. The gain-adjusted control algorithm and the bounded-gain control algorithm proposed in this study yield smoother control input variations within the magnitude constraints comparing with the existing Clarke's suboptimal control algorithm. In the gain-adjusted control algorithm, the feedforward gain is adjusted using maximum gain, while in the bounded-gain control algorithm, the feedforward gain is bounded using weighting factor. For the DC servo motor control, the system performances of the proposed algorithms are compared with those of the existing algorithm by computer simulation and experiment. It is shown that the input variations of the proposed algorithms are smoother as compared with the existing algorithm.

• Journal of the Korean Society of Laryngology, Phoniatrics and Logopedics
• /
• v.20 no.2
• /
• pp.126-130
• /
• 2009

Arytenoid motion has long been recognized as complex. Misunderstandings about the specifics of arytenoid motion remain prevalent. The resultant misunderstandings have led to erroneous or suboptimal clinical approaches to the treatment of vocal fold immobility. A thorough understanding of the anatomy of the arytenoid and cricoid cartilages, the cricoarytenoid joint, and related ligaments, muscles, and other structures is essential in order to fully understand laryngeal motion disorders. Arytenoid motion occurs in three directions. Movements involving a change anteriorly and posteriorly, as well as vertically, are due to the revolving or pitchlike motion of the arytenoid along the minor axis of the cricoid's elliptically shaped facet. The medial and lateral movements are due to the orientation of the arytenoid which in turn is determined by the forward, lateral, and inferior inclination of the cricoid-arytenoid facet. During adduction it is the outward angulation of the vocal process from the body of the arytenoid that allows the entire length of the vocal proceses to approximate one another and to have this meeting occur at the proper vertical height.

• Tuberculosis and Respiratory Diseases
• /
• v.72 no.2
• /
• pp.117-123
• /
• 2012

Optimal level of sedation and analgesia is important for the comfort and safety of critically ill patients. However, suboptimal sedation is relatively common in the intensive care unit (ICU) and it could cause prolonged mechanical ventilation and ICU stay, also increase delirium and ICU acquired weakness and resultant decreased survival. Therefore, accurate assessment of the level of sedation and analgesia, maintaining adequate level of sedation, and daily evaluation of each patient and following adjustment could be important treatment strategy in critically ill patients. Recently, the strategy for sedation in the ICU is changing toward the direction of lowering sedation level or even "no sedation" with concurrent use of analgesics and the use of ultra short acting analgesics could be helpful in some patients. Clinicians should be aware of the importance of algorithmic approach including daily interruption of sedative and assessment of sedation level and especially in the patients under mechanical ventilation, organizational approaches such as the 'ABCDE' bundle could improve the management of critically ill patients.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.840-855
• /
• 2011

In the context of additive noise steganography model, we propose a method to detect least significant bit (LSB) matching steganography in grayscale images. Images are decomposed into detail sub-bands with local linear transform (LLT) masks which are sensitive to embedding. Novel normalized characteristic function features weighted by a bank of band-pass filters are extracted from the detail sub-bands. A suboptimal feature set is searched by using a threshold selection algorithm. Extensive experiments are performed on four diverse uncompressed image databases. In comparison with other well-known feature sets, the proposed feature set performs the best under most circumstances.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.8
• /
• pp.1913-1925
• /
• 2012

In order to efficiently utilize limited radio resources, resource allocation schemes in OFDMA-based wireless networks have gained intensive attention recently. Instead of improving the throughput performance, the utility is adopted as the metric for resource allocation, which provides reasonable methods to build up the relationship between user experience and various quality-of-service (QoS) metrics. After formulating the optimization problem by using a weighted bipartite graph, a modified bipartite matching method is proposed to find a suboptimal solution for the resource allocation problem in OFDMA-based wireless systems with feasible computational complexity. Finally, simulation results are presented to validate the effectiveness of the proposed method.

• Journal of KSNVE
• /
• v.4 no.1
• /
• pp.71-82
• /
• 1994

We propose a systematic method to select the master states, which are retained in the reduced model after the order reduction process. The proposed method is based on the fact that the range space of right eigenvector matrix is spanned by orthogonal base vectors, and tries to keep the orthogonality of the submatrix of the base vector matrix as much as possible during the reduction process. To quentify the skewness of that submatrix, we define "Absolute Singularity Factor(ASF)" based on its singular values. While the degree of observability is concerned with estimation error of state vector and up to n'th order derivatives, ASF is related only to the minimum state estimation error. We can use ASF to evaluate the estimation performance of specific partial measurements compared with the best case in which all the state variables are identified based on the full measurements. A heuristic procedure to find suboptimal master states with reduced computational burden is also proposed. proposed.

• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.1874-1875
• /
• 2011

본 논문에서는 스위칭 선형 시스템의 적응 LQ 준최적 제어를 위한 Q-학습법 알고리즘을 제안한다. 제안된 제어 알고리즘은 안정성이 증명된 기존 Q-학습법에 기반하며 스위칭 시스템 모델의 변수를 모르는 상황에서도 준최적 제어가 가능하다. 이 알고리즘을 기반으로 기존에 스위칭 시스템에서 고려하지 않았던 각 시스템의 불확실성 및 최적 적응 제어 문제를 해결하고 컴퓨터 모의실험을 통해 제안한 알고리즘의 성능과 결과를 검증한다.

• Journal of Korea Multimedia Society
• /
• v.5 no.3
• /
• pp.249-254
• /
• 2002

We consider a buffer-constrained adaptive quantization algorithm for image compression. Buffer control algorithm was considered with source coding scheme by some researchers and recently a formal description of the algorithm in terms of rate-distortion has been developed. We propose a buffer control algorithm that incorporates the buffer occupancy into the Lagrange multiplier form in a rate-distortion cost measure. Although the proposed algorithm provides the suboptimal performance as opposed to the optimal Vieterbi algorithm, it can be implemented with very low computaional complexity. In addition stability of this buffer control algorithm has been mentioned briefly using Liapnov stability theory.