• Journal of Communications and Networks
• /
• 제9권2호
• /
• pp.112-117
• /
• 2007

In this paper, we focus on the total transmission power minimization problem for downlink beamforming multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems while ensuring each user's QoS requirement. Although the linear integer programming (LIP) solution we formulate provides the performance upper bound of the margin adaptive (MA) optimization problem, it is hard to be implemented in practice due to its high computational complexity. By regarding each user's equivalent channel gain as approximate independent values and using iterative descent method, we present a heuristic MA resource allocation algorithm. Simulation results show that the proposed algorithm efficiently converges to the local optimum, which is very close to the performance of the optimal LIP solution. Compared with existing space division multiple access (SDMA) OFDM systems with or without adaptive resource allocation, the proposed algorithm achieves significant performance improvement by exploiting the frequency diversity and multi-user diversity in downlink multiple-input single-output (MISO) OFDM systems.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 추계학술대회 논문집 전력기술부문
• /
• pp.297-300
• /
• 2004

This paper proposes a method for choosing the best composite power system expansion plan considering probabilistic reliability criterion. The proposed method was modeled as the minimization of the investment budget (economics) for constructing new transmission lines subject to not only deterministic(demand constraint) but also probabilistic reliability criterion(LOLE) with considering the uncertainties of the system elements. This is achieved by modeling the power system expansion problem as an integer programming one. The method solves for the optimal strategy using a probabilistic theory based branch and bound method that utilizes a network flow approach and the maximum flow-minimum cut set theorem. Although the proposed method is applied to a simple sample study, the test results demonstrate a fact that the proposed method is suitable for solving the power system expansion planning problem subject to practical uncertainties for future.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권8호
• /
• pp.3841-3861
• /
• 2017

Virtualized small cell network is a promising architecture which can realize efficient utilization of the network resource. However, conventional full duplex self-backhauls lead to residual self-interference, which limits the network performance. To handle this issue, this paper proposes a virtual resource allocation, in which the residual self-interference is fully exploited by employing a physical-layer network coding (PNC) aided self-backhaul scheme. We formulate the features of PNC as time slot and information rate constraints, and based on that, the virtual resource allocation is formulated as a mixed combinatorial optimization problem. To solve the problem efficiently, it is decomposed into two sub problems, and a two-phase iteration algorithm is developed accordingly. In the algorithm, the first sub problem is approximated and transferred into a convex problem by utilizing the upper bound of the PNC rate constraint. On the basis of that, the convexity of the second sub problem is also proved. Simulation results show the advantages of the proposed scheme over conventional solution in both the profits of self-backhauls and utility of the network resource.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권6호
• /
• pp.2859-2872
• /
• 2019

Interference alignment (IA) has been a powerful approach to achieve the maximum degree of freedom (DoF) for K users multiple-input-multiple-output (MIMO) interference channels. However, due to the feasibility constraint, aligning all the interference signals at each receiver is impractical for large K without symbol extension. In this paper, we propose two best-effort interference alignment (BEIA) schemes that the network selects the maximum number of interfering transmitters to align their signals given the feasibility conditions when each transmitter-receiver pair has a constant number of data streams. Besides, in case of not all interfering signals aligned at each receiver, an upper bound of the average throughput is derived. Simulation results show that the proposed schemes have superiority over the traditional methods, such as time division multiple access (TDMA) and cluster IA(CIA), in low and moderate signal-to-noise ratio (SNR) region in terms of average user throughput. In addition, the proposed max-min relative interference distance alignment scheme outperforms the proposed scheme of equal interfering transmitters number alignment in terms of both average user throughput and minimum user throughput.

• 한국전산구조공학회논문집
• /
• 제31권2호
• /
• pp.97-104
• /
• 2018

본 논문에서는 페이즈필드 설계법 기반의 피로 제약 조건 구조물의 위상최적설계를 수행하였다. 페이즈필드 설계법의 도입으로 기존의 위상최적설계법에서 발생하기 쉬운 중간 영역의 크기를 크게 감소시켰다. 수정된 upper bound P-norm의 도입으로 모든 지점의 응력 성분을 고려하면서, 전역적 응력값이 국부적 최대 응력값과 근사한 값을 가질 수 있도록 설정하였다. 또한 기존의 피로 파괴 제약 조건 위상최적설계에서 다루지 않았던 응력 수정 계수에 대한 고려를 위하여 위상최적설계 결과물의 1차 주응력 성분을 고려하여 응력 수정 계수를 도입하고 이에 따라 허용 응력 진폭 값을 수정 하였다. 이를 통하여 인장 응력으로 인한 내구 한도 감소 요인을 반영한 체계적인 설계 방안을 제시하였다.

• Journal of Communications and Networks
• /
• 제14권4호
• /
• pp.374-384
• /
• 2012

Utilizing artificial noise (AN) is a good means to guarantee security against eavesdropping in a multi-inputmulti-output system, where the AN is designed to lie in the null space of the legitimate receiver's channel direction information (CDI). However, imperfect CDI will lead to noise leakage at the legitimate receiver and cause significant loss in the achievable secrecy rate. In this paper, we consider a delayed feedback system, and investigate the impact of delayed CDI on security by using a transmit beamforming and AN scheme. By exploiting the Gauss-Markov fading spectrum to model the feedback delay, we derive a closed-form expression of the upper bound on the secrecy rate loss, where $N_t$ = 2. For a moderate number of antennas where $N_t$ > 2, two special cases, based on the first-order statistics of the noise leakage and large number theory, are explored to approximate the respective upper bounds. In addition, to maintain a constant signal-to-interferenceplus-noise ratio degradation, we analyze the corresponding delay constraint. Furthermore, based on the obtained closed-form expression of the lower bound on the achievable secrecy rate, we investigate an optimal power allocation strategy between the information signal and the AN. The analytical and numerical results obtained based on first-order statistics can be regarded as a good approximation of the capacity that can be achieved at the legitimate receiver with a certain number of antennas, $N_t$. In addition, for a given delay, we show that optimal power allocation is not sensitive to the number of antennas in a high signal-to-noise ratio regime. The simulation results further indicate that the achievable secrecy rate with optimal power allocation can be improved significantly as compared to that with fixed power allocation. In addition, as the delay increases, the ratio of power allocated to the AN should be decreased to reduce the secrecy rate degradation.

• 정보처리학회논문지B
• /
• 제14B권4호
• /
• pp.287-294
• /
• 2007

실세계의 문제에서 많은 기계학습의 알고리즘들은 데이터의 클래스 불균형 문제에 어려움을 겪는다. 이러한 클래스 불균형 문제를 해결하기 위하여 데이터의 비율을 변경하거나 좀 더 나은 샘플링 전략으로 극복하려는 연구들이 제안되었다. 그러나 데이터의 비율을 변경하는 연구에서는 전체 데이터 분포의 특성을 고려하지 못하고, 샘플링 전략을 제안하는 연구에서는 여러 가지 제한 조건을 고려해야만 한다. 본 논문에서는 위의 두가지 방법의 장점을 모두 포함하는 개선된 집중 샘플링 방법을 제안한다. 제안된 방법에서는 클래스 불균형 문제를 해결하기 위해 학습에 유용한 데이터들을 샘플링하는데 스코어링에 기반한 데이터 분할 방법을 이용한다. 즉, 입력 데이터들에 대해 SOM(Self Organizing Map)의 학습 결과로 얻은 BMU(Best Matching Unit)와의 거리를 계산하고, 이 거리론 스코어라 한다. 측정된 스코어는 오름차순으로 정렬되며, 이 과정에서 입력 데이터의 분포가 재 표현되고, 재 표현된 분포는 전체 데이터의 특성을 대표하게 된다. 그 결과로 얻은 데이터들 중에서 유용하지 못한 데이터들에 대해 제거하는 과정을 수행하여 새로운 학습 데이터 셋을 얻는다. 새로운 학습 데이터 생성 과정에서는 재 표현된 분포의 결과를 두 구간(upper, lower)으로 분할하는데, 두 추간 사이의 데이터들은 유용하지 못한 패턴들로 간주되어 학습에 이용되지 않는다. 본 논문에서 제안한 방법은 클래스 불균형의 비율 감수 훈련 데이터의 크기 감소, 과적합의 방지 등 몇 가지 장점을 보인다. 제안한 방법으로 샘플링된 데이터에 kNN 을 적용하여, 분류 실험한 결과 심한 불균형이 있는 ecoli 데이터의 분류 성능이 최대 2.27배 향상되었다.

• Journal of Computing Science and Engineering
• /
• 제1권1호
• /
• pp.56-73
• /
• 2007

Demands have been growing in safety-critical application fields for producing networked real-time embedded computing (NREC) systems together with acceptable assurances of tight service time bounds (STBs). Here a service time can be defined as the amount of time that the NREC system could take in accepting a request, executing an appropriate service method, and returning a valid result. Enabling systematic composition of large-scale NREC systems with STB certifications has been recognized as a highly desirable goal by the research community for many years. An appealing approach for pursuing such a goal is to establish a hard-real-time (HRT) component model that contains its own STB as an integral part. The TMO (Time-Triggered Message-Triggered Object) programming scheme is one HRT distributed computing (DC) component model established by the first co-author and his collaborators over the past 15 years. The TMO programming scheme has been intended to be an advanced high-level RT DC programming scheme that enables development of NREC systems and validation of tight STBs of such systems with efforts far smaller than those required when any existing lower-level RT DC programming scheme is used. An additional goal is to enable maximum exploitation of concurrency without damaging any major structuring and execution approaches adopted for meeting the first two goals. A number of previously untried program structuring approaches and execution rules were adopted from the early development stage of the TMO scheme. This paper presents new concrete justifications for those approaches and rules, and also discusses new extensions of the TMO scheme intended to enable further exploitation of concurrency in NREC system design and programming.

• 대한전자공학회논문지TC
• /
• 제49권8호
• /
• pp.77-83
• /
• 2012

본 논문에서는 주파수 공유 시스템의 구 채널 환경(outdated channel environment)에서 일차 사용자(primary user)에 의한 간섭이 존재할 때 이차 사용자(secondary user)의 평균값 기반 전력 할당 기법의 성능을 분석하고, 평가한다. 일차 사용자의 신호가 이차 사용자의 수신단에서 간섭으로 작용할 때, 이차 사용자의 에르고딕 용량(ergodic capacity)의 상한값을 분석하고, 이를 기반으로 일차 사용자에 의한 간섭이 이차 사용자의 성능 저하에 어느 정도 영향을 끼치는지 고찰한다. 모의 실험을 통해 간섭에 의한 이차 사용자의 성능 저하 정도를 보이고, 일차 사용자에 의한 간섭이 커질수록, 평균값 기반 전력 할당 기법의 용량이 구 채널 정보 기반 전력 할당 기법의 용량보다 좋아지는 영역이 작아지는 것을 보여준다.

• 전자공학회논문지S
• /
• 제35S권6호
• /
• pp.46-54
• /
• 1998

본 논문은 파라미터 불확실성을 갖는 비선형 시스템을 안정화하며, 폐루프 시스템의 외란감쇠에 대한 $L_{2}$ 이득 제한조건을 만족시키는 견실 퍼지 $H^{\infty}$ 제어기 설계기법을 제시한다. 불확실성을 갖는 비선형 시스템을 불확실성을 갖는 Takagi-Sugeno(T-S) 모델로 표현하고 병렬 분산 보상(PDC : parallel distributed compensation)의 개념을 이용하여 제어기를 설계한다. 파라미터 불확실성을 갖는 T-S 퍼지모델에 대한 감쇠율을 만족하는 폐루프 시스템의 안정성 조건과 Lyapunov 함수를 이용하여 외란감쇠 조건을 유도하고, 선형 행렬 부등식(LMI: linear matrix inequality)을 이용하여 견실 퍼지 $H^{\infty}$ 제어기가 존재할 충분조건을 구한다. 마지막으로 불확실성을 갖는 비선형 시스템에 대한 퍼지 $H^{\infty}$ 제어기 설계 예를 보인다.