• 제목/요약/키워드: ${\omega}-k$ Algorithm

검색결과 37건 처리시간 0.018초

파수 영역에서 모노스태틱 변환을 이용한 바이스태틱 개구합성 레이다 영상화 기법 연구 (A Study on Bistatic SAR Imaging Using Bistatic-to-Monostatic Conversion in Wavenumber Domain)

  • 조병래;선선구;이정수;박규철;하종수
    • 한국전자파학회논문지
    • /
    • 제24권2호
    • /
    • pp.207-213
    • /
    • 2013
  • 본 논문에서는 바이스태틱-모노스태틱 변환을 이용하여 바이스태틱 개구합성 레이다 영상화를 위한 ${\omega}$-K(omega-K) 알고리즘에 대해 기술하였다. 고려된 바이스태틱 개구합성 레이다는 1개의 정지된 송신 안테나와 여러 개의 수신 안테나로 구성된 물리적 배열 구조로 구성되어 있다. 수신 안테나의 물리적 배열 구조의 길이는 SAR 시스템의 개구합성 길이와 동일하다. 모노스태틱 구조와 다르게 바이스태틱 구조에서 ${\omega}$-K(omega-K) 알고리즘은 2차원 파수 영역에서 정확한 수학적 해를 얻을 수 없다. 제안된 영상화 기법의 핵심은 바이스태틱 구조의 데이터를 모노스태틱 구조의 데이터로 변환하는 것이다. 시뮬레이션과 실제 측정된 데이터를 이용하여 제안된 영상화 기법이 효과적임을 보여준다.

ω-κ 알고리즘을 이용한 SAR 영상의 방위각 방향 외삽 기법 연구 (A Study on the Azimuth Direction Extrapolation for SAR Image Using ω-κ Algorithm)

  • 박세훈;최인식;조병래
    • 한국전자파학회논문지
    • /
    • 제23권8호
    • /
    • pp.1014-1017
    • /
    • 2012
  • 본 논문에서는 고해상도 SAR(Synthetic Aperture Radar) 영상 획득을 위해 방위각 방향 해상도를 향상시키기 위한 방법을 소개하였다. SAR 영상 획득을 위해 ${\omega}-k$(omega-k) 알고리즘을 이용하였으며, 2차원 주파수 영역에서 방위각 방향으로 AR(Auto-Regressive) 방법을 이용한 외삽을 이용하여 해상도를 향상시켰다. AR 방법은 선형 예측(linear prediction) 모델을 기반으로 한 외삽 기법이다. AR 방법을 이용한 외삽 기법 중에서 Burg 알고리즘을 이용하여 예측 차수(prediction order)와 표적의 거리에 따른 성능 비교 결과를 보여 준다.

On the Minimization of Crosstalk Conflicts in a Destination Based Modified Omega Network

  • Bhardwaj, Ved Prakash;Nitin, Nitin
    • Journal of Information Processing Systems
    • /
    • 제9권2호
    • /
    • pp.301-314
    • /
    • 2013
  • In a parallel processing system, Multi-stage Interconnection Networks (MINs) play a vital role in making the network reliable and cost effective. The MIN is an important piece of architecture for a multiprocessor system, and it has a good impact in the field of communication. Optical Multi-stage Interconnection Networks (OMINs) are the advanced version of MINs. The main problem with OMINs is crosstalk. This paper, presents the (1) Destination Based Modified Omega Network (DBMON) and the (2) Destination Based Scheduling Algorithm (DBSA). DBSA does the scheduling for a source and their corresponding destination address for messages transmission and these scheduled addresses are passed through DBMON. Furthermore, the performance of DBMON is compared with the Crosstalk-Free Modified Omega Network (CFMON). CFMON also minimizes the crosstalk in a minimum number of passes. Results show that DBMON is better than CFMON in terms of the average number of passes and execution time. DBSA can transmit all the messages in only two passes from any source to any destination, through DBMON and without crosstalk. This network is the modified form of the original omega network. Crosstalk minimization is the main objective of the proposed algorithm and proposed network.

다중 고정이 허용되는 다중경로 다단상호접속망에 관한 연구 (A Study on the Multiple Fault-Tolerant Multipath Multistage Interconnection Network)

  • 김대호;임채택
    • 대한전자공학회논문지
    • /
    • 제25권8호
    • /
    • pp.972-982
    • /
    • 1988
  • In multiprocessor systems, there are Omega network and M network among various MIN's which interconnect the processor and memory modules. Both one-path Omega network and two-path M network are composed of Log2N stages. In this paper, Augmented M network (AMN) with 2**k+1 paths and Augmented Omega network (AON) with 2**k paths are proposed. The proposed networks can be acomplished by adding K stage(s) to M network and Omega network. Using destination tag, routing algorithm for AMN and AON becomes simple and multiple faults are tolerant. By evaluating RST(request service time) performance of AMN and AON with (Log2N)+K stages, we demonstrated the fact that MMIN (AMN) with 2**k+1 paths performs better than MMIN(AON) with 2**k+1. paths.

  • PDF

송전선로의 고장점 표정 알고리즘 (An Algorithm of fault Location Technique for Long Transmission Line)

  • 박철원;김삼룡;신명철;남시복;이복구
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2002년도 하계학술대회 논문집 A
    • /
    • pp.145-147
    • /
    • 2002
  • In this paper, the improved fault locating method using distributed parameter which calculating the reduced voltage and current according to the ground capacitance in long transmission line was proposed. For the purpose of the fault locating algorithm non influenced source impedance, the loop method was used in the system modeling analysis. To enhance the fault locating, zero sequence of the fault current which is variable according to ground capacitance was not used but positive and negative sequence. System model was simulated using EMTP software. To verify the accuracy of proposed method, in different cases 64 sampled data per cycle was used and 160km and 300km long transmission line has fault resistance $0{\Omega}\;and\;100{\Omega}$ respectively was compared.

  • PDF

최대전력점추적방법과 외부저항 제어 알고리즘을 이용한 미생물연료 전지의 전력생산 최대화 (Improvement of Power Generation of Microbial Fuel Cells using Maximum Power Point Tracking (MPPT) and Automatic Load Control Algorithm)

  • 송영은;김중래
    • KSBB Journal
    • /
    • 제29권4호
    • /
    • pp.225-231
    • /
    • 2014
  • A microbial fuel cell (MFC) and bioelectrochemical systems are novel bioprocesses which employ exoelectrogenic biofilm on electrode as a biocatalyst for electricity generation and various useful chemical production. Previous reports show that electrogenic biofilms of MFCs are time varying systems and dynamically interactive with the electrically conductive media (carbon paper as terminal electron acceptor). It has been reported that maximum power point tracking (MPPT) method can automatically control load by algorithm so that increase power generation and columbic efficiency. In this study, we developed logic based control strategy for external load resistance by using $LabVIEW^{TM}$ which increases the power production with using flat-plate MFCs and MPPT circuit board. The flat-plate MFCs inoculated with anaerobic digester sludge were stabilized with fixed external resistance from $1000{\Omega}$ to $100{\Omega}$. Automatic load control with MPPT started load from $52{\Omega}$ during 120 hours of operation. MPPT control strategy increased approximately 2.7 times of power production and power density (1.95 mW and $13.02mW/m^3$) compared to the initial values before application of MPPT (0.72 mW and $4.79mW/m^3$).

Discrimination of Fall and Fall-like ADL Using Tri-axial Accelerometer and Bi-axial Gyroscope

  • Park, Geun-Chul;Kim, Soo-Hong;Baik, Sung-Wan;Kim, Jae-Hyung;Jeon, Gye-Rok
    • 센서학회지
    • /
    • 제26권1호
    • /
    • pp.7-14
    • /
    • 2017
  • A threshold-based fall recognition algorithm using a tri-axial accelerometer and a bi-axial gyroscope mounted on the skin above the upper sternum was proposed to recognize fall-like activities of daily living (ADL) events. The output signals from the tri-axial accelerometer and bi-axial gyroscope were obtained during eight falls and eleven ADL action sequences. The thresholds of signal vector magnitude (SVM_Acc), angular velocity (${\omega}_{res}$), and angular variation (${\theta}_{res}$) were calculated using MATLAB. When the measured values of SVM_Acc, ${\omega}_{res}$, and ${\theta}_{res}$ were compared to the threshold values (TH1, TH2, and TH3), fall-like ADL events could be distinguished from a fall. When SVM_Acc was larger than 2.5 g (TH1), ${\omega}_{res}$ was larger than 1.75 rad/s (TH2), and ${\theta}_{res}$ was larger than 0.385 rad (TH3), eight falls and eleven ADL action sequences were recognized as falls. When at least one of these three conditions was not satisfied, the action sequences were recognized as ADL. Fall-like ADL events such as jogging and jumping up (or down) have posed a problem in distinguishing ADL events from an actual fall. When the measured values of SVM_Acc, ${\omega}_{res}$, and ${\theta}_{res}$ were applied to the sequential processing algorithm proposed in this study, the sensitivity was determined to be 100% for the eight fall action sequences and the specificity was determined to be 100% for the eleven ADL action sequences.

2차원 Confined 충돌 슬롯제트의 유선상류도식을 이용한 수치 해석 (Streamline-Upwind Numerical Simulation of Two-Dimensional Confined Impinging Slot Jets)

  • 박태현;최형권;유정열;김상준
    • 대한기계학회논문집B
    • /
    • 제26권12호
    • /
    • pp.1663-1673
    • /
    • 2002
  • In the present paper, flow and heat transfer characteristics of confined impinging slot jets have been numerically investigated using a SIMPLE-based segregated SUPG finite element method. For laminar jets, it is shown that the skin friction coefficient obtained from the present SUPG formulation approaches the grid-independent Galerkin solution inducing negligible false diffusion in the flow field when a moderate number of grid points are used. For turbulent jets, the k-$\omega$turbulence model is adopted. The streamwise mean velocity and the heat transfer coefficient respectively agree very well with existing experimental data within limited ranges of parameters.

ON EXTREMAL SORT SEQUENCES

  • Yun, Min-Young;Keum, Young-Wook
    • Journal of applied mathematics & informatics
    • /
    • 제9권1호
    • /
    • pp.239-252
    • /
    • 2002
  • A sort sequence $S_n$ is sequence of all unordered pairs of indices in $I_n$={1,2,…n}. With a sort sequence $S_n$ = ($s_1,S_2,...,S_{\frac{n}{2}}$),one can associate a predictive sorting algorithm A($S_n$). An execution of the a1gorithm performs pairwise comparisons of elements in the input set X in the order defined by the sort sequence $S_n$ except that the comparisons whose outcomes can be inferred from the results of the preceding comparisons are not performed. A sort sequence is said to be extremal if it maximizes a given objective function. First we consider the extremal sort sequences with respect to the objective function $\omega$($S_n$) - the expected number of tractive predictions in $S_n$. We study $\omega$-extremal sort sequences in terms of their prediction vectors. Then we consider the objective function $\Omega$($S_n$) - the minimum number of active predictions in $S_n$ over all input orderings.

시간 및 공간복잡도가 개선된 VLSI 설계규칙 검증 알고리듬 (A Time and Space Efficient Algorithm for VLSI Geometrical Rule Checking)

  • 정자춘;신성용;이현찬;이철동;유영욱
    • 대한전자공학회논문지
    • /
    • 제26권5호
    • /
    • pp.137-144
    • /
    • 1989
  • 기하학적인 마스크 설계도면에서 최소폭/간격을 효과적으로 검증하기 위한 새로운 알고리듬을 제안한다. 제안된 알고리듬은 영역탐색문제를 평면소인법을 사용하여 순서적으로 해결하고 있다. 이 알고리듬은 O(n log n)의 시간복잡도를 가지는데, 모든 최소폭/간격의 위반을 보고하는 문제에 있어서 시간복잡도의 lower bound가 ${\Omega}$(n log n)이기때문에 이론적으로 최적이다. 여기서, n은 마스크 패턴에서의 edge의 총 수 이다. 그리고, O($n^{0.5}$)의 공간복잡도를 가지므로 실제적으로 매우 빠르다. 그리고 종래의 알고리듬에 비해 간단하므로 이해하기 용이하고 구현하기가 편리한 장점이 있다. 이 알고리듬은 VAX8650 컴퓨터에서 C-언어로 구현되었으며 직교영역에서 25만개의 정점 데이타에 대해서 116.7초내에 처리했다.

  • PDF