• 한국통신학회논문지
• /
• 제38A권8호
• /
• pp.697-703
• /
• 2013

다중 반송파를 사용하는 직접 대역확산 부호분할 다중접속 통신시스템에서 주파수 효율 향상을 위한 전송 전력 및 전송률 적응화 시스템을 제안하고 그 성능을 분석하였다. 본 논문에서는 수신단에서 이상적인 채널상태 정보를 알고 있다는 가정 하에, 주파수 영역에서는 각 사용자의 부채널 중에서 가장 채널상태가 좋은 한 대역을 선택하여 전력을 할당하고 시간 영역에서는 목표 수신 품질을 만족하도록 전송률을 결합 조정하는 것을 제안하였다. 수학적 분석을 통하여 평균 전송 전력이 고정되어 있을 때 제안한 방식의 평균 데이터 전송률을 구하고 전력 혹은 전송률 적응화가 적용된 단일 반송파 부호분할 다중접속 통신시스템과 그 성능을 비교하였다.

• Journal of Communications and Networks
• /
• 제8권3호
• /
• pp.290-296
• /
• 2006

In this paper, a generalized blind adaptive algorithm is introduced for multi-user detection of direct sequence code division multiple access (OS-COMA) wireless communication systems. The main property of the proposed algorithm is its ability to resolve the multipath fading channel resulting in inter symbol interference (ISI) as well as multiple access interference (MAI). Other remarkable properties are its low complexity and mitigation to the near-far problem as well as its insensitivity to asynchronous transmission. The proposed system is based on the minimization of the output energy and convergence to the minimum mean square error (MMSE) detector. It is blind in the sense that it needs no knowledge of the other users' signatures, only the intended user signature and timing are required. Furthermore, the convergence of the minimum output energy (MOE) detector to the MMSE detector is analytically proven in case of M-ary PSK. Depicted results show that the performance of the generalized system dominates those previously considered. Further improvements are obtained when multiple input multiple output (MIMO) technique is employed.

• Journal of Communications and Networks
• /
• 제6권1호
• /
• pp.26-34
• /
• 2004

A blind interference canceller in the presence of subchipspaced multipath channels for direct-sequence code division multiple access (DS-CDMA) down-link system is considered. This technique is based on combining the existing blind interference canceller with a technique that involves assigning subchip-tap spacing to the Rake receiver. The proposed receiver minimizes the receiver’s output energy subject to a constraint in order to mitigate the multiple access interference (MAI) along each multipath component, and then suboptimally combining all the multipath components. Moreover, it is able to mitigate the mismatch problem when subchip-spaced multipath components arrive at the blind interference canceller. It is known that optimal combining techniques perform a decorrelation operation before combining, which requires both knowledge and computational complexity. In the following, we have adopted a simpler but suboptimum approach in the combining of the suppressed signals at the output of our proposed receiver. Computer simulation results verify the effectiveness of the proposed receiver to handle subchip-spaced multipath components and still suppresses MAI significantly.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.1648-1653
• /
• 2003

The paper studies effect of quasi-periodic or airplane flutter phenomenon on television broadcasting signal. Airplane flutter is a very important problem. It causes the receiving antenna to receive both direct signal by the Tx (Transmitter antenna) and reflected signal scattered by the airplane with phase delay. The sum of two signals results in fading, sometime collapse and distortion of picture on TV screen. We performed measurement and modeling this phenomenon on TV signal when the airplane flew across and range Tx and Rx (Receiver antenna). The frequency 60.75MHz (Aural frequency of CH3) is used under tests. A single scatter multipath model is introduced. It is used to duplicate some of the measured data and show the dependence of power variation on the airplane fluttering. The fluctuation of the airplane flutter phenomenon was calculated to be around 2-4dB. The Yaki antenna is used for improving airplane flutter problem because it can make high gain and high directivity.

• Communications for Statistical Applications and Methods
• /
• 제10권2호
• /
• pp.433-443
• /
• 2003

In this study, we provide a comparison of multivariate Q-techniques in the up-to-date versions of SAS, SPSS, Minitab and S-plus well known to those who study statistics. We can analyze data through the direct Input method(command) in SAS and use of menu method in SPSS, Minitab and S-plus. The analysis performance method is chosen by the high frequency of use. Widely we compare with each Q-techniques form according to input data, input option, statistical chart and statistical output.

• 대한수학회논문집
• /
• 제10권3호
• /
• pp.735-750
• /
• 1995

We present a domain decomposition algorithm for solving large sparse linear systems of equations arising from queuing networks. Such techniques are attractive since the problems in subdomains can be solved independently by parallel processors. Many of the methods proposed so far use some form of the preconditioned conjugate gradient method to deal with one large interface problem between subdomains. However, in this paper, we propose a "nested" domain decomposition method where the subsystems governing the interfaces are small enough so that they are easily solvable by direct methods on machines with many parallel processors. Convergence of the algorithms is also shown.lso shown.

• Communications for Statistical Applications and Methods
• /
• 제14권2호
• /
• pp.377-388
• /
• 2007

As one of multi-class classification methods, ECOC (Error Correcting Output Coding) method is known to have low classification error rate. This paper aims at suggesting effective multi-class classification method (1) by comparing various encoding methods and decoding methods in ECOC method and (2) by comparing ECOC method and direct classification method. Both SVM (Support Vector Machine) and logistic regression model were used as binary classifiers in comparison.

• 대한수학회논문집
• /
• 제10권1호
• /
• pp.109-113
• /
• 1995

For a Hilbert space H, let L(H) denote the algebra of all bounded operators on H. For an $n \in N$, it is well known that any element $T \in L(\oplus^n H)$ is expressed as an $n \times n$ matrix each of whose entries lies in L(H) so that T is written as $$ (1) T = (T_{ij}), i, j = 1, 2, ..., n, T_{ij} \in L(H), $$ where $\oplus^n H$ is the direct sum Hilbert space of n copies of H.

• 대한수학회논문집
• /
• 제11권3호
• /
• pp.673-680
• /
• 1996

It is proved that $K(c_0,Y)$ is an M-ideal in $L(c_0,Y)$ if Y is a closed subspace of $c_0$. And a new direct proof of the fact that $K(L_1[0,1],\ell_1)$ is not an M-ideal in $L(L_1[0,1],\ell_1)$ is given.

• 한국통신학회:학술대회논문집
• /
• 한국통신학회 2006년도 하계종합학술발표회 논문 초록집
• /
• pp.482-482
• /
• 2006