• 한국통신학회논문지
• /
• 제22권9호
• /
• pp.2053-2061
• /
• 1997

움직임 보상 부호화 가법은 연속한 비디오 프레임간의 시간적 증복성을 제거하기 때문에 비디오 영상 압축에 매우 중요한 역합을 한다. 그러나 많은 계산량으로 인하여 실시간 응용이나 고해상도 응용에 많은 어려움이 있다. 이러한 문제점을 해결하기 위하여 빠른 탑색 가법과 하드웨어 설계 기법이 활발히 연구되어 왔다. 특히 계산량을 크게 줄이고 안정된 성능을 갖는 삼단계 탐색 기법이 널리 이용되고 있으며 이를 기반으로 한 새로운 탐색 기법들이 제안되었다 본 논문에서는 인접한 블럭들의 움직임 벡터가 미치는 영향을 고려하여 수정된 삼단계 탐색 기법을 제안하고 이의 성능을 평가한다. 실험에 의하여 제안된 기법이 삼단계 탐색 기법에 비교하여 적은 계산량을 가지며, MAE 측면에서 이득이 있음을 보였다.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제15권5호
• /
• pp.437-444
• /
• 2015

In simulation-based circuit optimization, many simulation runs may be wasted while evaluating infeasible designs, i.e. the designs that do not meet the constraints. To avoid such a waste, this paper investigates the use of support vector machine (SVM) classifiers in predicting the design's feasibility prior to simulation and the optimal selection of the SVM parameters, namely, the Gaussian kernel shape parameter ${\gamma}$ and the misclassification penalty parameter C. These parameters affect the complexity as well as the accuracy of the model that SVM represents. For instance, the higher ${\gamma}$ is good for detailed modeling and the higher C is good for rejecting noise in the training set. However, our empirical study shows that a low ${\gamma}$ value is preferable due to the high spatial correlation among the circuit design candidates while C has negligible impacts due to the smooth and clean constraint boundaries of most circuit designs. The experimental results with an LC-tank oscillator example show that an optimal selection of these parameters can improve the prediction accuracy from 80 to 98% and model complexity by $10{\times}$.

• 한국CDE학회논문집
• /
• 제18권3호
• /
• pp.167-176
• /
• 2013

It is necessary to construct equipment catalog in ship outfitting design and offshore plant design. The three-dimensional CAD data of equipment take on different level-of-detail depending on the purpose. Equipment suppliers provide CAD data with high complexity while ship designers need CAD data with low complexity. Therefore, it is necessary to simplify CAD data. However, it takes much time to simplify them manually. To resolve the issue, a system for automatically simplifying the 3D CAD data of equipment was developed. This paper presents the architecture of the system and the implementation details. In addition, experiment result using the prototype system is explained.

• 대한전자공학회논문지SD
• /
• 제46권10호
• /
• pp.61-69
• /
• 2009

본 논문은 저 복잡도와 높은 throughput을 지원하는 LDPC 부호화기의 구조에 대하여 제안한다. LDPC 부호화기가 갖는 높은 복잡도 문제를 해결하기 위하여 기존의 복잡도가 높은 행렬 곱셈 연산기 대신에 간소화된 행렬 곱셈 연산기가 제안되었다. 또한 높은 throughput을 지원하기 위하여 행렬 곱셈 연산시 행 방향 연산 및 부분 병렬처리 연산을 적용하였다. 제안된 부호화기 구조의 로직 게이트와 메모리 사용량은 기존의 5단 파이프라인 부호화기의 구조에 비하여 각각 37.4%와 56.7%씩 감소하였다. 또한 40MHz 클럭 주파수에 대해 기존의 부호화기에 비하여 3배 이상의 throughput인 최대 800Mbps의 throughput을 지원한다.

• 한국정보전자통신기술학회논문지
• /
• 제10권2호
• /
• pp.141-146
• /
• 2017

본 논문에서는 저전력 영상 특징 추출 하드웨어 설계를 위한 하드웨어 폴딩 기법 기반 저면적 Gradient magnitude 연산기 구조를 제안한다. 하드웨어 복잡도를 줄이기 위해 Gradient magnitude 벡터의 특징을 분석하여 기존 알고리즘을 하드웨어를 공유하여 사용할 수 있는 알고리즘으로 변경하여 Folding 구조가 적용될 수 있도록 했다. 제안된 하드웨어 구조는 기존 알고리즘의 특징을 최대한 이용했기 때문에 데이터 품질의 열화가 거의 없이 구현될 수 있다. 제안된 하드웨어 구조는 Altera Quartus II v16.0 환경에서 Altera Cyclone VI (EP4CE115F29C7N) FPGA를 이용하여 구현되었다. 구현 결과, 기존 하드웨어 구조를 이용하여 구현한 연산기와의 비교에서 41%의 logic elements, 62%의 embedded multiplier 절감 효과가 있음을 확인했다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.371-372
• /
• 2007

In this paper we present performance and implementation comparisons of high performance two dimensional forward and inverse Discrete Cosine Transform (2D-DCT/IDCT) algorithm and low power algorithm for $8{\times}8$ 20 DCT and quantization based on partial sum and its corresponding hardware architecture for FPGA in MPEG-4. The architecture used in both low power 20 DCT and 2D IDCT is based on the conventional row-column decomposition method. The use of Fast algorithm and distributed arithmetic(DA) technique to implement the DCT/IDCT reduces the hardware complexity. The design was made using Mentor Graphics Tools for design entry and implementation. Mentor Graphics ModelSim SE6.1f was used for Verilog HDL entry, behavioral Simulation and Synthesis. The 2D DCT/IDCT consumes only 50% of the Operating Power.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제14권4호
• /
• pp.419-426
• /
• 2014

This paper proposes a high-throughput encoding process and encoder architecture for quasi-cyclic low-density parity-check codes in IEEE 802.11ac standard. In order to achieve the high throughput with low complexity, a partially parallel processing based encoding process and encoder architecture are proposed. Forward and backward accumulations are performed in one clock cycle to increase the encoding throughput. A low complexity cyclic shifter is also proposed to minimize the hardware overhead of combinational logic in the encoder architecture. In IEEE 802.11ac systems, the proposed encoder is rate compatible to support various code rates and codeword block lengths. The proposed encoder is implemented with 130-nm CMOS technology. For (1944, 1620) irregular code, 7.7 Gbps throughput is achieved at 100 MHz clock frequency. The gate count of the proposed encoder core is about 96 K.

• ETRI Journal
• /
• 제38권1호
• /
• pp.100-111
• /
• 2016

This paper presents a low-complexity channel-adaptive reconfigurable $4{\times}4$ QR-decomposition and M-algorithm-based maximum likelihood detection (QRM-MLD) multiple-input and multiple-output (MIMO) detector. Two novel design approaches for low-power QRM-MLD hardware are proposed in this work. First, an approximate survivor metric (ASM) generation technique is presented to achieve considerable computational complexity reduction with minor BER degradation. A reconfigurable QRM-MLD MIMO detector (where the M-value represents the number of survival branches in a stage) for dynamically adapting to time-varying channels is also proposed in this work. The proposed reconfigurable QRM-MLD MIMO detector is implemented using a Samsung 65 nm CMOS process. The experimental results show that our ASM-based QRM-MLD MIMO detector shows a maximum throughput of 288 Mbps with a normalized power efficiency of 10.18 Mbps/mW in the case of $4{\times}4$ MIMO with 64-QAM. Under time-varying channel conditions, the proposed reconfigurable MIMO detector also achieves average power savings of up to 35% while maintaining a required BER performance.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.772-776
• /
• 2004

This paper proposes an interference avoidance approach for Constraint-Based Routing (CBR) algorithm in the Multi-Protocol Label Switching (MPLS) network. The MPLS network itself has a capability of integrating among any layer-3 protocols and any layer-2 protocols of the OSI model. It is based on the label switching technology, which is fast and flexible switching technique using pre-defined Label Switching Paths (LSPs). The MPLS network is a solution for the Traffic Engineering(TE), Quality of Service (QoS), Virtual Private Network (VPN), and Constraint-Based Routing (CBR) issues. According to the MPLS CBR, routing performance requirements are capability for on-line routing, high network throughput, high network utilization, high network scalability, fast rerouting performance, low percentage of call-setup request blocking, and low calculation complexity. There are many previously proposed algorithms such as minimum hop (MH) algorithm, widest shortest path (WSP) algorithm, and minimum interference routing algorithm (MIRA). The MIRA algorithm is currently seemed to be the best solution for the MPLS routing problem in case of selecting a path with minimum interference level. It achieves lower call-setup request blocking, lower interference level, higher network utilization and higher network throughput. However, it suffers from routing calculation complexity which makes it difficult to real task implementation. In this paper, there are three objectives for routing algorithm design, which are minimizing interference levels with other source-destination node pairs, minimizing resource usage by selecting a minimum hop path first, and reducing calculation complexity. The proposed CBR algorithm is based on power factor calculation of total amount of possible path per link and the residual bandwidth in the network. A path with high power factor should be considered as minimum interference path and should be selected for path setup. With the proposed algorithm, all of the three objectives are attained and the approach of selection of a high power factor path could minimize interference level among all source-destination node pairs. The approach of selection of a shortest path from many equal power factor paths approach could minimize the usage of network resource. Then the network has higher resource reservation for future call-setup request. Moreover, the calculation of possible path per link (or interference level indicator) is run only whenever the network topology has been changed. Hence, this approach could reduce routing calculation complexity. The simulation results show that the proposed algorithm has good performance over high network utilization, low call-setup blocking percentage and low routing computation complexity.

• 전자공학회논문지
• /
• 제51권6호
• /
• pp.34-42
• /
• 2014

본 논문에서는 두 개의 공간 스트림을 갖는 multiple-input multiple-output 시스템을 위한 modified maximum-likelihood 심볼 검파 알고리즘 기반의 저 복잡도 고 성능의 심볼 검파기의 구조를 제시하고 이를 구현한 결과를 보인다. 제안하는 심볼 검파기에서는 비용함수 계산 과정에서의 각 심볼 별로 병렬적으로 계산되던 곱셈 연산을 멀티 사이클 기반의 점증적인 덧셈 연산으로 대체하였다. 또한 양자화 과정을 파이프 라인 구조를 적용하여 성상의 범위에 따라 단계적으로 수행할 수 있게 구현하였다. 그 결과 제안하는 심볼 검파기는 256 QAM과 같이 복잡한 변조 방식을 지원하면서도 하드웨어 복잡도가 낮다. 양자화 과정의 파이프 라인을 재구성함으로써 여러 변조 방식과 안테나 환경에서의 심볼 검파를 유연하게 지원한다. 설계된 심볼 검파기는 $0.11-{\mu}m$ CMOS 공정의 라이브러리를 사용하여 최대 478 MHz의 동작주파수에서 38.7K의 논리 게이트로 구현되어 16 QAM에서 166Mbps, 64 QAM에서 80 Mbps의 처리량을 달성한다.