• Title/Summary/Keyword: Fast Computation

Search Result 750, Processing Time 0.029 seconds

Blind Channel Estimation based on Hadamard Matrix Interstream Transmission for Multi-Cell MIMO Networks (다중 셀 MIMO 네트워크를 위한 Hadamard 행렬 Interstream 전송 기반 Blind 채널 추정)

  • Yang, Jae-Seung;Hanif, Mohammad Abu;Park, Ju-Yong;Lee, Moon-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.4
    • /
    • pp.119-125
    • /
    • 2015
  • In this paper, we introduce a Hadamard matrix interstream transmission based blind channel estimation for multi-cells multiple-input and multiple-output (MIMO) networks. The proposed scheme is based on a network with mobile stations (MS) which are deployed with multi cells. We assume that the MS have the signals from both cells. The signal from near cell are considered as desired signal and the signals from the other cells are interference signal. Since the channel is blind, so that we transmit Hadamard matrix pattern pilot stream to estimate the channel; that gives easier and fast channel estimation for large scale MIMO channel. The computation of Hadamard based system takes only complex additions, and thus the complexity of which is much lower than the scheme with Fourier transform since complex multiplications are not needed. The numerical analysis will give perfection of proposed channel estimation.

The Performance Comparison of the CMA and MMA Algorithm for Blind Adaptive Equalization (블라인드 적응 등화를 위한 CMA와 MMA 알고리즘의 성능 비교)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.2
    • /
    • pp.153-158
    • /
    • 2012
  • This paper deals with the performance comparison of adaptive equalization algorithm, CMA and MMA, that is used for the minimization of the distortion and noise effect in the communication channel at receiver.. We confirmed the application possibilities of the point to point or point to multipoint digital transmission technologies by analyzing the performance of MMA which is changing the error function of CMA that is the possible algorithm of fast equalization by relatively simple arithmatic computation compared to the other method. In CMA algorithm, we need the PLL for the amplitude compensation only and not possible to phase compensation inherently. But in MMA algorithm, we confired that the amplitude and phase of received signal can be compensated by computer simulation. For the comparison of algorithm, we used the essential performance index, convergence characteristics and residual isi. The result of performance comparison of algorithms, the MMA has good in convergence characteristic and the CMA has good in residual isi that is used for the amplitude compensation.

Combining Model-based and Heuristic Techniques for Fast Tracking the Global Maximum Power Point of a Photovoltaic String

  • Shi, Ji-Ying;Xue, Fei;Ling, Le-Tao;Li, Xiao-Fei;Qin, Zi-Jian;Li, Ya-Jing;Yang, Ting
    • Journal of Power Electronics
    • /
    • v.17 no.2
    • /
    • pp.476-489
    • /
    • 2017
  • Under partial shading conditions (PSCs), multiple maximums may be exhibited on the P-U curve of string inverter photovoltaic (PV) systems. Under such conditions, heuristic methods are invalid for extracting a global maximum power point (GMPP); intelligent algorithms are time-consuming; and model-based methods are complex and costly. To overcome these shortcomings, a novel hybrid MPPT (MPF-IP&O) based on a model-based peak forecasting (MPF) method and an improved perturbation and observation (IP&O) method is proposed. The MPF considers the influence of temperature and does not require solar radiation measurements. In addition, it can forecast all of the peak values of the PV string without complex computation under PSCs, and it can determine the candidate GMPP after a comparison. Hence, the MPF narrows the searching range tremendously and accelerates the convergence to the GMPP. Additionally, the IP&O with a successive approximation strategy searches for the real GMPP in the neighborhood of the candidate one, which can significantly enhance the tracking efficiency. Finally, simulation and experiment results show that the proposed method has a higher tracking speed and accuracy than the perturbation and observation (P&O) and particle swarm optimization (PSO) methods under PSCs.

DEVELOPMENT OF A NEW ION TRANSPORT CODE FOR PLANETARY IONOSPHERES WITH EXPLICIT TREATMENT OF ION-ION COLLISION

  • KIM YONG HA
    • Journal of The Korean Astronomical Society
    • /
    • v.38 no.2
    • /
    • pp.59-66
    • /
    • 2005
  • A new ion transport code for planetary ionospheric studies has been developed with consideration of velocity differences among ion species involving ion-ion collision. Most of previous planetary ionosphere models assumed that ions diffuse through non-moving ion and neutral background in order to consolidate continuity and momentum equations for ions into a simple set of diffusion equations. The simplification may result in unreliable density profiles of ions at high altitudes where ion velocities are fast and their velocity differences are significant enough to cause inaccuracy when computing ion-ion collision. A new code solves explicitly one-dimensional continuity and momentum equations for ion densities and velocities by utilizing divided Jacobian matrices in matrix inversion necessary to the Newton iteration procedure. The code has been applied to Martian nightside ionosphere models, as an example computation. The computed density profiles of $O^+,\;OH^+$, and $HCO^+$ differ by more than a factor of 2 at altitudes higher than 200 km from a simple diffusion model, whereas the density profile of the dominant ion, $O_2^+$, changes little. Especially, the density profile of $HCO^+$ is reduced by a factor of about 10 and its peak altitude is lowered by about 40 km relative to a simple diffusion model in which $HCO^+$ ions are assumed to diffuse through non-moving ion background, $O_2^+$. The computed effects of the new code on the Martian nightside models are explained readily in terms of ion velocities that were solved together with ion densities, which were not available from diffusion models. The new code should thus be expected as a significantly improved tool for planetary ionosphere modelling.

VLSI Design for Motion Estimation Based on Bit-plane Matching (비트 플레인 정합에 의한 움직임 추정기의 VLSI 설계)

  • Go, Yeong-Gi;O, Hyeong-Cheol;Go, Seong-Je
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.38 no.5
    • /
    • pp.509-517
    • /
    • 2001
  • Full-search algorithm requires large amount of computation which causes time delay or very complex hardware architecture for real time implementation. In this paper, we propose a fast motion estimator based on bit-plane matching, which reduce the computational complexity and the hardware cost. In the proposed motion estimator, the conventional motion estimation algorithms are applied to the binary images directly extracted from the video sequence. Furthermore, in the proposed VLSI motion estimator, we employ a Pair of processing cores that calculate the motion vector continuously By controlling the data flow in a systolic fashion using the internal shift registers in the processing cores, we avoid using SRAM (local memory) so that we remove the time overhead for accessing the local memory and adopt lower-cost fabrication technology. We modeled and tested the proposed motion estimator in VHDL, and then synthesized the whole system which has been integrated in a 0.6-$\mu$m triple-metal CMOS chip of size 8.15 X 10.84$\textrm{mm}^2$.

  • PDF

Minimum Path Planning for Mobile Robot using Distribution Density (분포 밀도를 이용한 이동 로봇의 최단 경로 설정)

  • Kwak Jae-Hyuk;Lim Joon-Hong
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.43 no.3 s.309
    • /
    • pp.31-40
    • /
    • 2006
  • Many researches on path planning and obstacle avoidance for the fundamentals of mobile robot have been done. Informations from various sensors can find obstacles and make path. In spite of many solutions of finding optimal path, each can be applied to only a constrained condition. This means that it is difficult to find a universal algorithm. A optimal path with a complicated computation generates a time delay which cannot avoid moving obstacles. In this paper, we propose the algorithm of path planning and obstacle avoidance for mobile robot. We call the proposed method Random Access Sequence(RAS) method. In the proposed method, a small region is set first and numbers are assigned to its neighbors, then the path is selected using these numbers. It has an advantage of fast planning and simple operation. This means that new path selection may be possible within short time and that helps a robot to avoid obstacle in any direction. When a robot meets moving obstacles, it avoids obstacles in a random direction. RAS method using obstacle information from variable sensors is useful to get minimum path length to goal.

A New Overlap Save Algorithm for Fast Convolution (고속 컨벌루션을 위한 새로운 중첩보류기법)

  • Kuk, Jung-Gap;Cho, Nam-Ik
    • Journal of Broadcast Engineering
    • /
    • v.14 no.5
    • /
    • pp.543-550
    • /
    • 2009
  • The most widely used block convolution method is the overlap save algorithm (OSA), where a block of M data to be convolved with a filter is concatenated with the previous block and 2M-point FFT and multiplications are performed for this overlapped block. By discarding half of the results, we obtain linear convolution results from the circular convolution. This paper proposes a new transform which reduces the block size to only M for the block convolution. The proposed transform can be implemented as the M multiplications followed by M-point FFT Hence, existing efficient FFT libraries and hardware can be exploited for the implementation of proposed method. Since the required transform size is half that of the conventional method, the overall computational complexity is reduced. Also the reduced transform size results in the reduction of data access time and cash miss-hit ratio, and thus the overall CPU time is reduced. Experiments show that the proposed method requires less computation time than the conventional OSA.

Adaptive Extended Bilateral Motion Estimation Considering Block Type and Frame Motion Activity (블록의 성질과 프레임 움직임을 고려한 적응적 확장 블록을 사용하는 프레임율 증강 기법)

  • Park, Daejun;Jeong, Jechang
    • Journal of Broadcast Engineering
    • /
    • v.18 no.3
    • /
    • pp.342-348
    • /
    • 2013
  • In this paper, a novel frame rate up conversion (FRUC) algorithm using adaptive extended bilateral motion estimation (AEBME) is proposed. Conventionally, extended bilateral motion estimation (EBME) conducts dual motion estimation (ME) processes on the same region, therefore involves high complexity. However, in this proposed scheme, a novel block type matching procedure is suggested to accelerate the ME procedure. We calculate the edge information using sobel mask, and the calculated edge information is used in block type matching procedure. Based on the block type matching, decision will be made whether to use EBME. Motion vector smoothing (MVS) is adopted to detect outliers and correct outliers in the motion vector field. Finally, overlapped block motion compensation (OBMC) and motion compensated frame interpolation (MCFI) are adopted to interpolate the intermediate frame in which OBMC is employed adaptively based on frame motion activity. Experimental results show that this proposed algorithm has outstanding performance and fast computation comparing with EBME.

Defect Inspection of FPD Panel Based on B-spline (B-spline 기반의 FPD 패널 결함 검사)

  • Kim, Sang-Ji;Hwang, Yong-Hyeon;Lee, Byoung-Gook;Lee, Joon-Jae
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.10
    • /
    • pp.1271-1283
    • /
    • 2007
  • To detect defect of FPD(flat panel displays) is very difficult due to uneven illumination on FPD panel image. This paper presents a method to detect various types of defects using the approximated image of the uneven illumination by B-spline. To construct a approximated surface, corresponding to uneven illumination background intensity, while reducing random noises and small defect signal, only the lowest smooth subband is used by wavelet decomposition, resulting in reducing the computation time of taking B-spline approximation and enhancing detection accuracy. The approximated image in lowest LL subband is expanded as the same size as original one by wavelet reconstruction, and the difference between original image and reconstructed one becomes a flat image of compensating the uneven illumination background. A simple binary thresholding is then used to separate the defective regions from the subtracted image. Finally, blob analysis as post-processing is carried out to get rid of false defects. For applying in-line system, the wavelet transform by lifting based fast algorithm is implemented to deal with a huge size data such as film and the processing time is highly reduced.

  • PDF

Enhancement Techniques for GPU-Based Rendering of Participating Media (GPU 기반 반투과 매체 렌더링의 향상 기법)

  • Cha, Deuk-Hyun;Yi, Yong-Il;Ihm, In-Sung
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.12
    • /
    • pp.1165-1176
    • /
    • 2010
  • In order to realistically visualize such participating media as cloud, smoke, and gas, the light transport process must be physically simulated inside the media. While it is known that this process is well described physically through the volume rendering equation, it usually takes a great deal of computation time for obtaining high-precision solutions. Recently, GPU-based, fast rendering methods have been proposed for the realistic simulation of participating media, however, there still remain several problems to be resolved. In this article, we describe our rendering techniques applied to enhance the performances and features of our GPU-assisted participating media renderer, and analyze how such efforts have actually improved the renderer. The presented techniques will be effectively used in volume renderers for creating various digital contents in the special effects industries.