• 한국통신학회논문지
• /
• 제31권2C호
• /
• pp.117-122
• /
• 2006

본 논문에서는 로그 최우비(log likelihood ratio, LLR)를 이용하여 Gray 부호화된 PAM신호를 위한 비트 연판정 계산식을 제안한다. 이 계산식은 Gray 매핑 특성을 이용하여 Max-Log-MAP 알고리듬에서 필요한 max0/min0 함수를 사용하지 않고 산술 연산만을 사용하기 때문에 구현이 간단하다. 제안된 식의 결과는 기존 Max-Log-MAP 알고리듬의 결과와 일치한다. 또한, 식에 사용되는 인자들은 송수신 시스템이 서로 공유하는 정보와 수신된 심벌 값만을 이용하여 계산한다. 따라서 본 논문에서 제안된 알고리듬은 일반적으로 많이 사용하는 이진 반복 복호기 등과 함께 실제 응용 설계에 적용이 가능하며, 특히 실제 설계에 적용되는 기존의 여러 가지 알고리듬에 비하여 구조가 유연하고 효율적이며 정확한 비트별 LLR을 제공하는 효율적인 방법 중의 하나이다.

• 한국통신학회논문지
• /
• 제39A권4호
• /
• pp.209-211
• /
• 2014

본 논문에서는 HEVC 부호화의 연산 복잡도를 줄이기 위한 고속 움직임 탐색 방법을 제안한다. 고속움직임 탐색을 위한 종래의 방법은 현재 영상과 참조 영상 간의 거리에 따라 탐색 영역의 크기를 조절하는 반면, 제안 방법은 예측 단위 간의 움직임 벡터 차의 유사성을 이용하여 예측 단위에 따라 움직임 벡터 탐색 영역을 적응적으로 조절한다. 실험을 통해 제안 방법은 random access 실험 조건에서 움직임 예측의 연산 시간을 약 10.7% 감소시키는 반면, 약 0.1%의 낮은 부호화 성능 하락을 가지는 것을 확인하였다.

• Korean Journal of Geomatics
• /
• 제2권2호
• /
• pp.139-143
• /
• 2002

The rational polynomial coefficients (RPC) model is a generalized sensor model that is used as an alternative solution for the physical sensor model for IKONOS of the Space Imaging. As the number of sensors increases along with greater complexity, and the standard sensor model is needed, the applicability of the RPC model is increasing. The RPC model has the advantages in being able to substitute for all sensor models, such as the projective, the linear pushbroom and the SAR. This report aimed to generate a RPC model from the physical sensor model of the KOMPSAT-1(Korean Multi-Purpose Satellite) and aerial photography. The KOMPSAT-1 collects 510~730 nm panchromatic imagery with a ground sample distance (GSD) of 6.6 m and a swath width of 17 km by pushbroom scanning. The least square solution was used to estimate the RPC. In addition, data normalization and regularization were applied to improve the accuracy and minimize noise. This study found that the RPC model is suitable for both KOMPSAT-1 and aerial photography.

• 한국음향학회지
• /
• 제24권4호
• /
• pp.217-223
• /
• 2005

본 논문에서는 분산 음성 인식 시스템에서 사용되는 멜켑스트럼 계수를 양자화 하기 위하여 예측 구조를 갖는 BC-TCQ 양자화기를 제안하였다. 분산 음성 인식 시스템을 위한 효율적인 멜켑스트럼 계수 양자화기를 설계하기 위하여, 인접 프레임간의 높은 상관도를 이용한 1차 AR 예측 필터를 적용하였다. 그리고 예측 필터에 의해서 구해지는 예측 에러 벡터는 BC-TCQ를 사용하여 양자화를 수행하였다. 본 연구에서 제안된 예측 BC-TCQ멜켑스트럼 계수 양자화기는 분산 음성 인식 시스템을 위해 ETSI 규격에서 사용되는 split VQ 멜켑스트럼 계수 양자화 방식보다 cepstral distortion (CD) 측면에서 훨씬 좋은 성능을 보이며, 인코딩 연산 복잡도 및 메모리 요구량에서도 더 유리하다.

• 한국컴퓨터정보학회논문지
• /
• 제20권7호
• /
• pp.41-47
• /
• 2015

The bandwidth minimization problem (BMP) has been classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. This paper suggests polynomial time heuristic algorithm is to find the solution of bandwidth minimization problem. To find the minimum bandwidth ${\phi}^*=_{min}{\phi}(G)$, ${\phi}(G)=_{max}\{{\mid}f(v_i)-f(v_j):v_i,v_j{\in}E\}$ for given graph G=(V,E), m=|V|,n=|E|, the proposed algorithm sets the maximum degree vertex $v_i$ in graph G into global central point (GCP), and labels the median value ${\lceil}m+1/2{\rceil}$ between [1,m] range. The graph G is partitioned into subgroup, the maximum degree vertex in each subgroup is set to local central point (LCP), and we adjust the label of LCP per each subgroup as possible as minimum distance from GCP. The proposed algorithm requires O(mn) time complexity for label to all of vertices. For various twelve graph, the proposed algorithm can be obtains the same result as known optimal solution. For one graph, the proposed algorithm can be improve on known solution.

• 한국경영과학회지
• /
• 제26권3호
• /
• pp.79-94
• /
• 2001

This paper presents a new algorithm for the K shortest paths Problem which develops initial K shortest paths, and repeat to expose hidden shortest paths with dual approach and to replace the longest path in the present K paths. The initial solution comprises K shortest paths among shortest paths to traverse each arc in a Double Shortest Arborescence which is made from bidirectional Dijkstra algorithm. When a crossing node that have two or more inward arcs is found at least three time by turns in this K shortest paths, there may be some hidden paths which are shorter than present k-th path. To expose a hidden shortest path, one inward arc of this crossing node is chose by means of minimum detouring distance calculated with dual variables, and then the hidden shortest path is exposed with joining a detouring subpath from source to this inward arc and a spur of a feasible path from this crossing node to sink. If this exposed path is shorter than the k-th path, the exposed path replaces the k-th path. This algorithm requires worst case time complexity of O(Kn$^2$), and O(n$^2$) in the case k$\leq$3.

• ETRI Journal
• /
• 제38권6호
• /
• pp.1074-1084
• /
• 2016

This paper presents a transmission method for improving human body communications in terms of spectral efficiency, and the performances of bit-error-rate (BER) and frame synchronization, with a highly simplified structure. Compared to the conventional frequency selective digital transmission supporting IEEE standard 802.15.6 for wireless body area networks, the proposed scheme improves the spectral efficiency from 0.25 bps/Hz to 1 bps/Hz based on the 3-dB bandwidth of the transmit spectral mask, and the signal-to-noise-ratio (SNR) by 0.51 dB at a BER of $10^{-6}$ with an 87.5% reduction in the detection complexity of the length of the Hamming distance computation. The proposed preamble structure using its customized detection algorithm achieves perfect frame synchronization at the SNR of a BER of $10^{-6}$ by applying the proposed pre-processing to compensate for the distortions on the preamble signals due to the band-limit effects by transmit and receive filters.

• 제어로봇시스템학회논문지
• /
• 제17권4호
• /
• pp.353-361
• /
• 2011

A precise embedded ultrasonic localization system is developed for autonomous mobile robots in indoor environments, which is essential for autonomous navigation of mobile robots with various tasks. Although ultrasonic sensors are more cost-effective than other sensors such as LRF (Laser Range Finder) and vision, they suffer inaccuracy and directional ambiguity. First, we apply the matched filter to measure the distance precisely. For resolving the computational complexity of the matched filter for embedded systems, we propose a new matched filter algorithm with fast computation in three points of view. Second, we propose an accurate ultrasonic localization system which consists of three ultrasonic receivers on the mobile robot and two or more transmitters on the ceiling. Last, we add an extended Kalman filter to estimate position and orientation. Various simulations and experimental results show the effectiveness of the proposed system.

• 대한기계학회논문집B
• /
• 제31권12호
• /
• pp.986-993
• /
• 2007

The microchannel heat sink is promising heat dissipation method far high density electronic devices. The cross-sectional shape of MEMS based microchannel heat sink is limited to triangular, trapezoidal, and rectangular due to their fabrication method. And heat is added to one side surface of heat source. Therefore, those specific conditions make some complexity of heat transfer in microchannel heat sink. Though many previous research of conjugate heat transfer in microchannel was conducted, most of them did not consider heat loss. In this study, numerical investigation of conjugate heat transfer in rectangular microchannel was conducted. The method of heat loss evaluation was verified numerically. Heat distribution was different for each wall of rectangular microchannel due to thermal conductivity and distance from heat source. However, the ratio of heat from each channel wall was correlated. Therefore, the effective area correction factor could be proposed to evaluate accurate heat flux in one side heating condition.

• 한국인터넷방송통신학회논문지
• /
• 제11권4호
• /
• pp.113-118
• /
• 2011

서열 상동성 분석은 생명현상에 관여하는 물질을 정렬, 색인하여 데이터베이스 하는 것으로, 생명정보학의 유용성을 입증하는 분야이다. 본 논문에서는 구조가 복잡한 진핵생물의 서열 패턴을 단백질 서열로 변환하기 위해 은닉마르코프모델을 이용하는 GenScan 프로그램을 이용한다. 서열상동성 분석 중 최소거리 탐색 문제는 문제의 크기가 커지면 계산량이 기하급수적으로 증가하여 정확한 계산이 불가능해진다. 따라서 유사한 아미노산간의 치환과 상이한 아미노산간의 치환 점수를 차등화한 점수표를 적용하고, 은닉마르코프모델 등을 적용해 정교한 전이 확률모델을 적용한다. 변환된 서열을 서열 상동성 분석을 위해 사용되는 blast p를 이용하여, 은닉 마르코프 모델을 도입함으로 인해 단백질 구조 서열로 변환하는 데에 있어서 우수한 기능을 제공함을 알 수 있다.