• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.10 s.352
• /
• pp.1-7
• /
• 2006

Lattice decoding concept has been proposed for the implementation of the Maximum-Likelihood detection which is the optimal receiver from the viewpoint of the BER (Bit Error Rate) performance for MIMO (Multiple Input Multiple Output) systems. Sphere decoding algorithm and K-best decoding algorithm are based on the lattice decoding concept. A K-best decoding algorithm shows a good BER performance with relatively low complexity. However, with small K value, the error propagation effect severely degrades the performance. In this paper, we propose an adaptive K-best decoding algorithm which has lower average complexity and better BER performance than conventional K-best decoding algorithm.

• Kyungpook Mathematical Journal
• /
• v.43 no.4
• /
• pp.519-538
• /
• 2003

This paper delineates some fundamental properties of the set of strongly unique best coapproximation. Uniqueness of strongly unique best coapproximation is studied. Some characterizations of strongly unique best coapproximation and strongly unique best approximation are obtained. Some more results concerning strongly unique best uniform coapproximation and strongly unique best uniform approximation are presented. Some relations between best uniform approximation and strongly unique best uniform coapproximation are established.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1197-1205
• /
• 2007

An adaptive K-best detection scheme is proposed for MIMO systems. The proposed scheme changes the number of survivor paths, K based on the degree of the reliability of Zero-Forcing (ZF) estimates at each K-best step. The critical drawback of the fixed K-best detection is that the correct path's metric may be temporarily larger than K minimum paths metrics due to imperfect interference cancellation by the incorrect ZF estimates. Based on the observation that there are insignificant differences among path metrics (ML distances) when the ZF estimates are incorrect, we use the ratio of the minimum ML distance to the second minimum as a reliability indicator for the ZF estimates. So, we adaptively select the value of K according to the ML distance ratio. It is shown that the proposed scheme achieves the significant improvement over the conventional fixed K-best scheme. The proposed scheme effectively achieves the performance of large K-best system while maintaining the overall average computation complexity much smaller than that of large K system.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.95-102
• /
• 2006

This paper proposes the KB-Fano algorithm which has lower decoding complexity by applying modified Fano-like metric bias to the conventional K-best algorithm. Additionally, an efficient K-best decoding algorithm, named the KR-Fano scheme, is proposed by jointly combining the K-reduction and the KB-Fano schemes. Simulations show that the proposed algerian provides the remarkable improvement from the viewpoints of the BER performance and the decoding complexity as compared to the conventional K-best scheme.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.2
• /
• pp.213-230
• /
• 2020

As smart TVs have recently emerged as the center of the IoT ecosystem, their importance is increasing. If a vulnerability occurs within a smart TV, there is a possibility that it will cause financial damage, not just in terms of privacy invasion and personal information leakage due to sniffing and theft. Therefore, in this paper, to enhance the completeness of smart TV vulnerability analysis, STRIDE threat classification are used to systematically identify threats. In addition, through the manufacture of the Attack Tree and the actual vulnerability analysis, the effectiveness of the checklist was verified and security requirements were derived for the safe smart TV use environment.

• Annual Conference on Human and Language Technology
• /
• 1998.10c
• /
• pp.15-19
• /
• 1998

기계 번역 시스템에서 품사 태거의 오류는 전체번역 정확률에 결정적인 영향을 미친다. 따라서 어휘 단계의 정보만으로는 중의성 해소가 불가능한 단어에 대해서는 중의성 해소에 충분한 정보를 얻을 수 있는 구문 분석이나 의미 분석 단계까지 완전한 중의성 해소를 유보하는 N-best 품사 태거가 요구된다. 또한 N-best 품사 태거는 단어에 할당되는 평균 품사 개수를 최소화함으로써 상위 단계의 부하를 줄이는 본연의 역할을 수행하여야 한다. 본 논문은 통계 기반 품사 태깅 방법을 이용하여 N-best 후보를 선정하고, 선정된 N-best 후보에 언어 규칙을 적용하여 중의성을 감소시키거나 오류를 보정하는 혼합형 N-best 품사 태깅 방법을 제안한다 제안된 N-best 품사 태거는 6만여 단어의 영어 코퍼스에서 실험한 결과, 단어 당 평균 1.09개의 품사를 할당할 때 0.43%의 오류율을 보인다.

• Journal of the Korean Mathematical Society
• /
• v.45 no.5
• /
• pp.1297-1310
• /
• 2008

Main purpose of this paper is to combine the optimal form of Fan's best approximation theorem and Nash's equilibrium existence theorem into a single existence theorem simultaneously. For this, we first prove a general best proximity pair theorem which includes a number of known best proximity theorems. Next, we will introduce a new equilibrium concept for a generalized Nash game with normal form, and as applications, we will prove new existence theorems of Nash equilibrium pairs for generalized Nash games with normal form.

• Journal of applied mathematics & informatics
• /
• v.39 no.3_4
• /
• pp.437-442
• /
• 2021

In this paper, we study the characterizations of two-sided best simultaneous approximations for ℓ-tuple subset from a closed convex subset of ℝ^m with ℓ^m₁(w)-norm. Main fact is, k^* is a two-sided best simultaneous approximation to F from K if and only if there exist f₁, …, f_p in F, for any k ∈ K $${\mid}{\sum\limits_{i=1}^{m}}sgn(f_{ji}-k^*_i)k_iw_i{\mid}{\leq}\;{\sum\limits_{i{\in}Z(f_j-k^*)}}\;{\mid}k_i{\mid}w_i$$ for each j = 1, …, p and 𝐰 ∈ W.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.111-114
• /
• 2002

음성인식에서 발화검증은 비인식대상어휘(OOV)를 기각시키고, 인식대상어휘라도 오인식 가능성이 높은 결과를 기각시키는 기술을 말한다. 본 논문에서는 혼동가능성 높은 숫자쌍들이 존재하는 한국어 연결 숫자 인식에서 발화검증 결과로 숫자열 기각시 오인식 가능성이 높은 숫자열을 그냥 기각시키는 대신에 대체오류를 수정하여 인식성능을 향상시키고자 하였다. N-best decoding 결과에 따르면 $2^{nd}\;best$ 나 $3^{rd}\;best$안에 대부분의 제대로 된 인식결과들이 포함된다. 따라서, N-best decoding을 이용해, 숫자열 기각시 $2^{nd}\;best$ 숫자열로 대체된 것이라고 가정한 후, 개별숫자 log likelihood ratio(LLR)과 N-best 기반의 숫자열 LLR[3] 등을 함께 고려한 신뢰도 측정방식에 의해 그 가정이 맞다고 판단이 되면 $2^{nd}\;best$ 의 숫자열과 대체함으로써 부분적으로 오류를 수정하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• pp.373-376
• /
• 2012

Multiple-Input Multiple-Output (MIMO) 시스템의 복잡도를 감소시키는 방식은 실생활에서 MIMO 시스템을 활용하는 데에 있어 중요한 부분이다. 널리 사용되는 Maximum Likelihood (ML) 복호기의 경우 낮은 에러오율 (BER) 을 보여주지만 복잡도가 높다. 실생활에 활용하기 위하여 ML 복호기의 복잡도를 감소시킬 필요가 있고 이에 Sphere Decoding Algorithm (SDA) 이 제안되었다. 이를 발전시킨 List Sphere Decoding(LSD) 은 여러 종류가 있다. 그 중에 넓이 우선 탐색 방식인 K-Best LSD 알고리즘은 각 레이어에서 리스트의 크기가 복잡도와 밀접한 연관이 있다. 본 논문에서는 기존의 K-Best LSD 알고리즘에 기반하여 초기 반지름 설정 및 선형적으로 리스트 크기를 감소시키는 방식으로 K-Best LSD 알고리즘의 복잡도를 기존 알고리즘에 비해 크게 낮추면서도 비트 오율 성능 열화가 적은 알고리즘을 제안하고 전산 실험을 통해 이를 검증한다.