• Title/Summary/Keyword: implementation algorithm

Search Result 4,233, Processing Time 0.027 seconds

An Efficient Soft-Output MIMO Detection Method Based on a Multiple-Channel-Ordering Technique

  • Im, Tae-Ho;Park, In-Soo;Yoo, Hyun-Jong;Yu, Sung-Wook;Cho, Yong-Soo
    • ETRI Journal
    • /
    • v.33 no.5
    • /
    • pp.661-669
    • /
    • 2011
  • In this paper, we propose an efficient soft-output signal detection method for spatially multiplexed multiple-input multiple-output (MIMO) systems. The proposed method is based on the ordered successive interference cancellation (OSIC) algorithm, but it significantly improves the performance of the original OSIC algorithm by solving the error propagation problem. The proposed method combines this enhanced OSIC algorithm with a multiple-channel-ordering technique in a very efficient way. As a result, the log likelihood ratio values can be computed by using a very small set of candidate symbol vectors. The proposed method has been synthesized with a 0.13-${\mu}m$ CMOS technology for a $4{\times}4$ 16-QAM MIMO system. The simulation and implementation results show that the proposed detector provides a very good solution in terms of performance and hardware complexity.

Estimation-Based Load-Balancing with Admission Control for Cluster Web Servers

  • Sharifian, Saeed;Motamedi, Seyed Ahmad;Akbari, Mohammad Kazem
    • ETRI Journal
    • /
    • v.31 no.2
    • /
    • pp.173-181
    • /
    • 2009
  • The growth of the World Wide Web and web-based applications is creating demand for high performance web servers to offer better throughput and shorter user-perceived latency. This demand leads to widely used cluster-based web servers in the Internet infrastructure. Load balancing algorithms play an important role in boosting the performance of cluster web servers. Previous load balancing algorithms suffer a significant performance drop under dynamic and database-driven workloads. We propose an estimation-based load balancing algorithm with admission control for cluster-based web servers. Because it is difficult to accurately determine the load of web servers, we propose an approximate policy. The algorithm classifies requests based on their service times and tracks the number of outstanding requests from each class in each web server node to dynamically estimate each web server load state. The available capacity of each web server is then computed and used for the load balancing and admission control decisions. The implementation results confirm that the proposed scheme improves both the mean response time and the throughput of clusters compared to rival load balancing algorithms and prevents clusters being overloaded even when request rates are beyond the cluster capacity.

  • PDF

An Implementation of thePrecisely Speed-Controlled DC Servo Motor System Using Direct MRAC Algorithm (직접적응제어방식을 이용한 직류전동기의 정밀 속도제어 시스템의 구현)

  • Kim, Jun-Sik;Chong, Dong-Keun;Hong Chol-Ho;Yi Taek-Jong
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.4
    • /
    • pp.35-44
    • /
    • 1989
  • In this paper, a precisely speed-controlled DC servo motor system utilizing direct adaptive control (DAC) algorithm which require that neither satisfaction of the perfect model following conditions (PMFC) nor explicit parameter identification is proposed. Computer simulation as well as experiments using MC-68000 are implemened with the above input trajectory fairly well in spite of load disturbances and parameter variations. Presented algorithm is simple and effective both in software and hardware applications.

  • PDF

Optimized Integer Cosine Transform (최적화 정수형 여현 변환)

  • 이종하;김혜숙;송인준;곽훈성
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.9
    • /
    • pp.1207-1214
    • /
    • 1995
  • We present an optimized integer cosine transform(OICT) as an alternative approach to the conventional discrete cosine transform(DCT), and its fast computational algorithm. In the actual implementation of the OICT, we have used the techniques similar to those of the orthogonal integer transform(OIT). The normalization factors are approximated to single one while keeping the reconstruction error at the best tolerable level. By obtaining a single normalization factor, both forward and inverse transform are performed using only the integers. However, there are so many sets of integers that are selected in the above manner, the best OICT matrix obtained through value minimizing the Hibert-Schmidt norm and achieving fast computational algorithm. Using matrix decomposing, a fast algorithm for efficient computation of the order-8 OICT is developed, which is minimized to 20 integer multiplications. This enables us to implement a high performance 2-D DCT processor by replacing the floating point operations by the integer number operations. We have also run the simulation to test the performance of the order-8 OICT with the transform efficiency, maximum reducible bits, and mean square error for the Wiener filter. When the results are compared to those of the DCT and OIT, the OICT has out-performed them all. Furthermore, when the conventional DCT coefficients are reduced to 7-bit as those of the OICT, the resulting reconstructed images were critically impaired losing the orthogonal property of the original DCT. However, the 7-bit OICT maintains a zero mean square reconstruction error.

  • PDF

Two-Dimensional Dimming Algorithm using Light Spread Function (빛 확산 함수를 이용한 이차원 디밍 알고리즘)

  • Jung, Hye-Dong;Kang, Sung-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.8B
    • /
    • pp.1204-1210
    • /
    • 2010
  • In this paper, in order to reduce the power consumption of LCD TV, we present a two-dimensional dimming algorithm for LED BLU(Backlight Unit) using light spread function and a pragmatic implementation method. In conventional two dimensional dimming algorithms, LED BLU is divided into MxN blocks and proper backlight luminance for each block is computed according to input image and used for dimming control. But, LED light of each block is diffused and affects the neighboring blocks so that luminance of each block becomes larger than that of intent. In the proposed algorithm, dimming control values are reduced by the amount of quantity affected by the neighboring blocks using light spread function, resulting in additional reduction of power consumption.

Implementation of Ray Tracing Processor for the Parallel Processing (병렬처리를 위한 고속 Ray Tracing 프로세서의 설계)

  • Choe, Gyu-Yeol;Jeong, Deok-Jin
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.5
    • /
    • pp.636-642
    • /
    • 1999
  • The synthesis of the 3D images is the most important part of the virtual reality. The ray tracing is the best method for reality in the 3D graphics. But the ray tracing requires long computation time for the synthesis of the 3D images. So, we implement the ray tracing with software and hardware. Specially we design the hit-test unit with FPGA tool for the ray tracing. Hit-test unit is a very important part of ray tracing to improve the speed. In this paper, we proposed a new hit-test algorithm and apply the parallel architecture for hit-test unit to improve the speed. We optimized the arithmetic unit because the critical path of hit-test unit is in the multiplication part. We used the booth algorithm and the baugh-wooley algorithm to reduce the partial product and adapted the CSA and CLA to improve the efficiency of the partial product addition. Our new Ray tracing processor can produce the image about 512ms/F and can be adapted to real-time application with only 10 parallel processors.

  • PDF

Performance Analysis of Error Correction Codes for 3GPP Standard (3GPP 규격 오류 정정 부호 기법의 성능 평가)

  • 신나나;이창우
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.15 no.1
    • /
    • pp.81-88
    • /
    • 2004
  • Turbo code has been adopted in the 3GPP standard, since its performance is very close to the Shannon limit. However, the turbo decoder requires a lot of computations and the amount of the memory increases as the block size of turbo codes becomes larger. In order to reduce the complexity of the turbo decoder, the Log-MAP, the Max-Log-MAP and the sliding window algorithm have been proposed. In this paper, the performance of turbo codes adopted in the 3GPP standard is analyzed by using the floating point and the fixed point implementation. The efficient decoding method is also proposed. It is shown that the BER performance of the proposed method is close to that of the Log-MAP algorithm.

Policy Iteration Algorithm Based Fault Tolerant Tracking Control: An Implementation on Reconfigurable Manipulators

  • Li, Yuanchun;Xia, Hongbing;Zhao, Bo
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.4
    • /
    • pp.1740-1751
    • /
    • 2018
  • This paper proposes a novel fault tolerant tracking control (FTTC) scheme for a class of nonlinear systems with actuator failures based on the policy iteration (PI) algorithm and the adaptive fault observer. The estimated actuator failure from an adaptive fault observer is utilized to construct an improved performance index function that reflects the failure, regulation and control simultaneously. With the help of the proper performance index function, the FTTC problem can be transformed into an optimal control problem. The fault tolerant tracking controller is composed of the desired controller and the approximated optimal feedback one. The desired controller is developed to maintain the desired tracking performance at the steady-state, and the approximated optimal feedback controller is designed to stabilize the tracking error dynamics in an optimal manner. By establishing a critic neural network, the PI algorithm is utilized to solve the Hamilton-Jacobi-Bellman equation, and then the approximated optimal feedback controller can be derived. Based on Lyapunov technique, the uniform ultimate boundedness of the closed-loop system is proven. The proposed FTTC scheme is applied to reconfigurable manipulators with two degree of freedoms in order to test the effectiveness via numerical simulation.

Implementation of 2.5D Mapping System for Fashion Design (패션디자인을 위한 2.5D맵핑 시스템의 구현)

  • Lee, Min-Kyu;Kim, Young-Un;Cho, Jun-Ei;Han, Sung-Kuk;Jung, Sung-Tae;Lee, Yong-Ju;Jung, Suck-Tae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.599-602
    • /
    • 2005
  • This paper utilizing model picture of finished clothes in fashion design field various material (textile fabrics) doing Draping directly can invent new design, and do not produce direction sample or poetic theme width and confirm clothes work to simulation. Also, construct database about model and material image that can confirm Mapping result by real time. Development did the 2.5D Mapping system that used path extraction algorithm, warp algorithm, a lighting extraction and application algorithm in order to implement natural Draping of model picture and material image.

  • PDF

On the convergence Rate Improvement of Mathematical Decomposition Technique on distributed Optimal Power Flow (수화적 분할 기법을 이요한 분산처리 최적조류계산의 수렴속도 향상에 관한 연구)

  • Hur, Don;Park, Jong-Keun;Kim, Balho-H.
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.50 no.3
    • /
    • pp.120-130
    • /
    • 2001
  • We present an approach to parallelizing optimal power flow that is suitable for distributed implementation and is applicable to very large interconnected power systems. This approach can be used by utilities to optimize economy interchange without disclosing details of their operating costs to competitors. Recently, it is becoming necessary to incorporate contingency constraints into the formulation, and more rapid updates of telemetered data and faster solution time are becoming important to better track changes in the system. This concern led to a research to develop an efficient algorithm for a distributed optimal power flow based on the Auxiliary Problem Principle and to study the convergence rate improvement of the distributed algorithm. The objective of this paper is to find a set of control parameters with which the Auxiliary Problem Principle (Algorithm - APP) can be best implemented in solving optimal power flow problems. We employed several IEEE Reliability Test Systems, and Korea Power System to demonstrate the alternative parameter sets.

  • PDF