• 한국수학교육학회지시리즈B:순수및응용수학
• /
• 제2권2호
• /
• pp.157-162
• /
• 1995

Let I be the interval, $S^1$ the circle and let X be a compact metric space. And let $C^{circ}(X,\;X)$ denote the set of continuous maps from X into itself. For any f$f\in\;C\circ(X,\;X),\;let\;P(f),\;R(f),\;\Gamma(f),\;\Lambda(f)\;and\;\Omega(f)$ denote the collection of the periodic points, recurrent points, ${\gamma}-limit{\;}points,{\;}{\omega}-limit$ points and nonwandering points, respectively.(omitted)

• 한국인터넷방송통신학회논문지
• /
• 제19권5호
• /
• pp.47-54
• /
• 2019

본 논문에서는 간단한 시공간 블록 부호 (STBC)를 적용한 MC-CDMA 시스템에서 상수 모듈러스 (CM) 기반의 블라인드 적응 수신기를 설계하는 방법을 제시한다. 전송 심볼들을 검파하기 위하여 사용되는 여파기 계수 벡터들을 부분 벡터들로 분할하고, CM 메트릭을 최소화시키는 최적의 부분 벡터들 간의 특별한 관계식을 유도한다. 이러한 특별한 관계를 이용하여 변형된 CM 메트릭을 제시한다. 그리고 나서, 변형된 CM 메트릭을 최소화시키는 블라인드 적응형 통계적 변화율 CM 알고리즘 (SG-CMA)을 제안한다. 제안하는 기법의 여파기 계수 벡터들은 유도한 특별한 관계를 만족하는 영역에서만 갱신되기 때문에, 제안하는 블라인드 적응 SG-CMA 기법이 기존의 SG-CMA 기법보다 더 빠른 수렴 속도를 갖는다. 그리고, 컴퓨터 모의실험을 통하여, 제안하는 SG-CMA 기법의 우수성을 검증한다.

• 대한수학회지
• /
• 제48권2호
• /
• pp.397-420
• /
• 2011

In this paper we study the structure of closed weakly dense ideals in Privalov spaces $N^p$ (1 < p < $\infty$) of holomorphic functions on the disk $\mathbb{D}$ : |z| < 1. The space $N^p$ with the topology given by Stoll's metric [21] becomes an F-algebra. N. Mochizuki [16] proved that a closed ideal in $N^p$ is a principal ideal generated by an inner function. Consequently, a closed subspace E of $N^p$ is invariant under multiplication by z if and only if it has the form $IN^p$ for some inner function I. We prove that if $\cal{M}$ is a closed ideal in $N^p$ that is dense in the weak topology of $N^p$, then $\cal{M}$ is generated by a singular inner function. On the other hand, if $S_{\mu}$ is a singular inner function whose associated singular measure $\mu$ has the modulus of continuity $O(t^{(p-1)/p})$, then we prove that the ideal $S_{\mu}N^p$ is weakly dense in $N^p$. Consequently, for such singular inner function $S_{\mu}$, the quotient space $N^p/S_{\mu}N^p$ is an F-space with trivial dual, and hence $N^p$ does not have the separation property.

• 대한수학회논문집
• /
• 제34권3호
• /
• pp.951-965
• /
• 2019

Let $f:X{\rightarrow}X$ be a continuous map on a compact metric space (X, d) and for an arbitrary $x{\in}X$, $${\mathcal{SC}}_d(x,f):=\{y{\mid}x{\text{ can be strong }}d-{\text{chain to }}y\}$$. We give an example to show that ${\mathcal{SC}}_d(x,f)$ is dependent on the metric d on X but it is a closed and f-invariant set. We prove that if ${\mathcal{SC}}_d(x,f){\supseteq}{\Omega}(f)$ or f has the asymptotic-average shadowing property, then ${\mathcal{SC}}_d(x,f)=X$. Also, we show that if f has the shadowing property, then ${\lim}\;{\sup}_{n{\in}{\mathbb{N}}}\{f^n\}={\mathcal{SC}}_d(f)$ where ${\mathcal{SC}}_d(f)=\{(x,y){\mid}y{\in}{\mathcal{SC}}_d(x,f)\}$. For each $n{\in}{\mathbb{N}}$, we give an example in which ${\mathcal{SCR}}_d(f^n){\neq}{\mathcal{SCR}}_d(f)$. In spite of it, we prove that if $f^{-1}:(X,d){\rightarrow}(X,d)$ is an equicontinuous map, then ${\mathcal{SCR}}_d(f^n)={\mathcal{SCR}}_d(f)$ for all $n{\in}{\mathbb{N}}$.

• 한국통신학회논문지
• /
• 제29권12A호
• /
• pp.1387-1395
• /
• 2004

Log-MAP 복호 알고리즘을 사용하는 터보 복호기는 뛰어난 복호 성능에도 불구하고, 반복적 연산으로 인하여 인터리버의 크기에 비례하는 많은 메모리와 높은 하드웨어 복잡도가 단점으로 지적된다. 이에 본 논문에서는 Log-MAP 복호 알고리즘 기반의 터보 복호기를 설계할 때 복호 성능 및 하드웨어 복잡도에 영향을 미칠 수 있는 다양한 설계 이슈들을 제시하고, 설계 이슈들의 변화에 따른 복호 성능을 모의실험을 통하여 비교 분석한다. 하드웨어 복잡도와 복호 성능간의 균형을 고려하여 수신정부 사전정보, 상태 메트릭을 각각 5 비트, 6 비트 그리고 7 비트로 할당하여 부동 소수점 연산의 비트오율에 근접하는 성능을 확인하였다. Log-MAP 복호 알고리즘의 주연산인 MAX*에 대한 하드웨어 복잡도와 복호 성능을 비교 분석하였다. MAX* 연산 중 계산도가 큰 오류 보정 함수를 근사화된 조합회로로 구성하여 하드웨어 부담을 줄일 수 있는 방법을 제시하였고, 윈도우 블록 길이가 32인 슬라이딩 윈도우 기법을 적용하여 적은 복호 성능 저하로 상태메트릭 저장에 필요한 메모리 공간을 감소할 수 있음을 확인하였다.

• 대한수학회보
• /
• 제37권4호
• /
• pp.743-753
• /
• 2000

In the space $C_1(X)$ of real-valued continuous functions with $L_1-norm$, every bounded set has a relative Chebyshev center in a finite-dimensional subspace S. Moreover, the set function $F\rightarrowZ_S(F)$ corresponding to F the set of its relative Chebyshev centers, in continuous on the space B[$C_1(X)$(X)] of nonempty bounded subsets of $C_1(X)$ (X) with the Hausdorff metric. In particular, every bounded set has a relative Chebyshev center in the closed convex set S(F) of S and the set function $F\rightarrowZ_S(F)$(F) is continuous on B[$C_1(X)$ (X)] with a condition that the sets S(.) are equal.

• Journal of Information Processing Systems
• /
• 제9권2호
• /
• pp.315-332
• /
• 2013

This paper presents an approach for improving the use of VP-tree in video indexing and searching. A vantage-point tree or VP-tree is one of the metric space-based indexing methods used in multimedia database searches and data retrieval. Instead of relying on the Euclidean distance as a measure of search space, the proposed approach focuses on the trigonometric inequality for compressing the search range, which thus, improves the search performance. A test result of using 10,000 video files shows that this method reduced the search time by 5-12%, as compared to the existing method that uses the AESA algorithm.

• ETRI Journal
• /
• 제40권3호
• /
• pp.330-336
• /
• 2018

Free-space optical (FSO) systems have attracted much attention from both research and application perspectives owing to their many benefits, such as license-free operation, low-cost, and high data rates. This paper investigates the ergodic capacity of FSO systems, which is an important metric of system performance. The stochastic temporary laser-beam blockage, pointing errors, and atmospheric turbulence are simultaneously considered. The results illustrate that the link blockage causes a decreased ergodic capacity. We show that to maximize the ergodic capacity, there is an optimal value of the laser-beam radius at the waist, which largely depends on pointing errors; however, it is independent of the atmospheric turbulence and the probability of link blockage.

• 대한수학회논문집
• /
• 제30권3호
• /
• pp.209-219
• /
• 2015

In this article, we first give metric version of an iteration scheme of Agarwal et al. [1] and approximate fixed points of two finite families of nonexpansive mappings in hyperbolic spaces through this iteration scheme which is independent of but faster than Mann and Ishikawa scheme. Also we consider case of three finite families of nonexpansive mappings. But, we need an extra condition to get convergence. Our convergence theorems generalize and refine many know results in the current literature.

• 대한수학회보
• /
• 제36권3호
• /
• pp.589-597
• /
• 1999

Let G be a closed subspace of a Banach space X and let (S,$\Omega$,$\mu$) be a $\sigma$-finite measure space. It was known that $L_1$(S,G) is proximinal in $L_1$(S,X) if and only if $L_p$(S,G) is proximinal in $L_p$(S,X) for 1$\infty$. In this article we show that this result remains true when "proximinal" is replaced by "Chebyshev". In addition, it is shown that if G is a proximinal subspace of X such that either G or the kernel of the metric projection $P_G$ is separable then, for 0 < p $\leq$ $\infty$. $L_p$(S,G) is proximinal in $L_p$(S,X)