• Title/Summary/Keyword: Iterative technique

Search Result 569, Processing Time 0.032 seconds

A Study on layered Space Time Trellis codes for MIMO system based on Iterative Decoding Algorithm (MIMO 시스템에서 반복 복호 알고리즘 기반의 계층적 시공간 부호화 방식 연구)

  • Park, Tae-Doo;Jung, Ji-Won
    • Journal of Navigation and Port Research
    • /
    • v.36 no.10
    • /
    • pp.845-849
    • /
    • 2012
  • The next-generation wireless communication requires fast transmission speeds with various services and high reliability. In order to satisfy these needs we study MIMO system used layered space time coded system (LST) combining space time trellis codes (STTC) with turbo codes. In LST, two codes that are inner and outer codes are concatenated in the serial fashion. The inner codes are turbo Pi codes suggested in DVB-RCS NG system, and outer codes are STTC codes proposed by Blum. The interleaver technique is used to efficiently combine two codes. And we proposed and simulated that a full iteration method between turbo decoder and BCJR decoder to improve the performance instead of only processing inner-iteration turbo decoder. The simulation results of proposed effective layered method show improving BER performance about 1.3~1.5dB than conventional one.

Trimming Line Design using Incremental Development Method and Finite Element Inverse Method (점진 전개기법 및 유한요소 역해석법을 이용한 자동차 패널 트리밍 라인 설계)

  • Chung, W.J.;Park, C.D.;Song, Y.J.;Oh, S.W.
    • Transactions of Materials Processing
    • /
    • v.15 no.6 s.87
    • /
    • pp.445-452
    • /
    • 2006
  • In most of automobile body panel manufacturing, trimming process is generally performed before flanging. To find feasible trimming line is crucial in obtaining accurate edge profile after flanging. Section-based method develops blank along manually chosen section planes and find trimming line by generating loop of end points. This method suffers from inaccurate results of edge profile. On the other hand, simulation-based method can produce more accurate trimming line by iterative strategy. In this study, new fast simulation-based method to find feasible trimming line is proposed. Finite element inverse method is used to analyze the flanging process because final shape after flanging can be explicitly defined and most of strain paths are simple in flanging. In utilizing finite element inverse method, the main obstacle is the initial guess generation for general mesh. Robust initial guess generation method is developed to handle genera] mesh with very different size and undercut. The new method develops final triangular mesh incrementally onto the drawing tool surface. Also in order to remedy mesh distortion during development, energy minimization technique is utilized. Trimming line is extracted from the outer boundary after finite element inverse method simulation. This method has many advantages since trimming line can be obtained in the early design stage. The developed method is verified by shrink/stretch flange forming and successfully applied to the complex industrial applications such as door outer flanging process.

Noise Removal Using Complex Wavelet and Bernoulli-Gaussian Model (복소수 웨이블릿과 베르누이-가우스 모델을 이용한 잡음 제거)

  • Eom Il-Kyu;Kim Yoo-Shin
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.43 no.5 s.311
    • /
    • pp.52-61
    • /
    • 2006
  • Orthogonal wavelet tansform which is generally used in image and signal processing applications has limited performance because of lack of shift invariance and low directional selectivity. To overcome these demerits complex wavelet transform has been proposed. In this paper, we present an efficient image denoising method using dual-tree complex wavelet transform and Bernoulli-Gauss prior model. In estimating hyper-parameters for Bernoulli-Gaussian model, we present two simple and non-iterative methods. We use hypothesis-testing technique in order to estimate the mixing parameter, Bernoulli random variable. Based on the estimated mixing parameter, variance for clean signal is obtained by using maximum generalized marginal likelihood (MGML) estimator. We simulate our denoising method using dual-tree complex wavelet and compare our algorithm to well blown denoising schemes. Experimental results show that the proposed method can generate good denoising results for high frequency image with low computational cost.

Analysis of Land Uses in the Nakdong River Floodplain Using RapidEye Imagery and LiDAR DEM (RapidEye 영상과 LiDAR DEM을 이용한 낙동강 범람원 내 토지 이용 현황 분석)

  • Choung, Yun-Jae
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.17 no.4
    • /
    • pp.189-199
    • /
    • 2014
  • Floodplain is a flat plain between levees and rivers. This paper suggests a methodology for analyzing the land uses in the Nakdong River floodplain using the RapidEye imagery and the given LiDAR(LIght Detection And Ranging) DEM(Digital Elevation Models). First, the levee boundaries are generated using the LiDAR DEM, and the area of the floodplain is extracted from the given RapidEye imagery. The land uses in the floodplain are identified in the extracted RapidEye imagery by the ISODATA(Iterative Self-Organizing Data Analysis Technique Analysis) clustering. The overall accuracy of the identified land uses by the ISODATA clustering is 91%. Analysis of the identified land uses in the floodplain is implemented by counting the number of the pixels constituting the land cover clusters. The results of this research shows that the area of the river occupies 46%, the area of the bare soil occupies 36%, the area of the marsh occupies 11%, and the area of the grass occupies 7% in the identified floodplain.

An Active Candidate Set Management Model for Realtime Association Rule Discovery (실시간 연관규칙 탐사를 위한 능동적 후보항목 관리 모델)

  • Sin, Ye-Ho;Ryu, Geun-Ho
    • The KIPS Transactions:PartD
    • /
    • v.9D no.2
    • /
    • pp.215-226
    • /
    • 2002
  • Considering the rapid process of media's breakthrough and diverse patterns of consumptions's analysis, a uniform analysis might be much rooms to be desired for interpretation of new phenomena. In special, the products happening intensive sails on around an anniversary or fresh food have the restricted marketing hours. Moreover, traditional association rule discovery algorithms might not be appropriate for analysis of sales pattern given in a specific time because existing approaches require iterative scan operation to find association rule in large scale transaction databases. in this paper, we propose an incremental candidate set management model based on twin-hashing technique to find association rule in special sales pattern using database trigger and stored procedure. We also prove performance of the proposed model through implementation and experiment.

Development of Low-Cost Data Acquisition Method for Close-range Digital Photogrammetric System (근거리 수치사진측량시스템을 위한 저가격 자료획득방법의 개발)

  • Park, Hong-Gi
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.7 no.2 s.14
    • /
    • pp.143-153
    • /
    • 1999
  • GIS have become easier to use and very popular. In recent year digital photogrammetric systems ire becoming cost-effective tools to build and update GIS databases. In close-range photogrammetry for the acquisition of geospatial data, the bundle adjustment needs both initial approximate values and control points to solve the exterior orientation parameters. This paper gives a review of applied and potential algorithms for estimating Initial approximate values before the bundle adjustment, develope new algorithms for determine the exterior orientation parameters, and gives a cost-effective methods for close-range digital photogrammetric system Modifications of existing DLT algorithm were made in this study for providing an efficient, economic, and more accurate photogrammetric data reduction technique. These modifications include robust approaches for automatic detection and elimination of all lands of gross errors in the measurement data, and incorporation of GPS to reduce the number of control points necessary for a DLT solution. Also, this paper derives a new method for space resection from a monocular image. A major advantage of proposed method is that the solution can be uniquely and analytically determined without initial approximate values of exterior orientation parameters and without iterative computation.

  • PDF

An Optical Surfacing Technique of the Best-fitted Spherical Surface of the Large Optics Mirror with Ultra Precision Polishing Machine (대형 광학계 연마 장비에 의한 대구경 반사경의 최적 근사 구면 제조 방법에 관한 연구)

  • Song, Chang Kyu;Khim, Gyungho;Hwang, Jooho;Kim, Byung Sub;Park, Chun Hong;Lee, Hocheol
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.30 no.3
    • /
    • pp.324-330
    • /
    • 2013
  • This paper describes a novel method to surface large optics mirror with an extremely high hardness, which could replace the high cost of the repetitive off-line measurement steps and the large ultra-precision grinding machine with ultra-positioning control of 10 nm resolution. A lot of diamond pellet to be attached on the convex aluminum base consists of a grinding tool for the concave large mirror, and the tool was pressured down on the large mirror blank. The tool motion at an interval on the spiral path was controlled with each feed rate as the dwell time in the conventional computer-controlled polishing. The shape to be surfaced was measured directly by a touch probe on the machine without any separation of the mirror blank. Total 40 iterative steps of the surfacing and measurement could demonstrate the form error of RMS $7.8{\mu}m$, surface roughness of Ra $0.2{\mu}m$ for the mirror blank with diameter of 1 m and spherical radius of curvature of 5400 mm.

Geometrically nonlinear dynamic analysis of FG graphene platelets-reinforced nanocomposite cylinder: MLPG method based on a modified nonlinear micromechanical model

  • Rad, Mohammad Hossein Ghadiri;Shahabian, Farzad;Hosseini, Seyed Mahmoud
    • Steel and Composite Structures
    • /
    • v.35 no.1
    • /
    • pp.77-92
    • /
    • 2020
  • The present paper outlined a procedure for geometrically nonlinear dynamic analysis of functionally graded graphene platelets-reinforced (GPLR-FG) nanocomposite cylinder subjected to mechanical shock loading. The governing equation of motion for large deformation problems is derived using meshless local Petrov-Galerkin (MLPG) method based on total lagrangian approach. In the MLPG method, the radial point interpolation technique is employed to construct the shape functions. A micromechanical model based on the Halpin-Tsai model and rule of mixture is used for formulation the nonlinear functionally graded distribution of GPLs in polymer matrix of composites. Energy dissipation in analyses of the structure responding to dynamic loads is considered using the Rayleigh damping. The Newmark-Newton/Raphson method which is an incremental-iterative approach is implemented to solve the nonlinear dynamic equations. The results of the proposed method for homogenous material are compared with the finite element ones. A very good agreement is achieved between the MLPG and FEM with very fine meshing. In addition, the results have demonstrated that the MLPG method is more effective method compared with the FEM for very large deformation problems due to avoiding mesh distortion issues. Finally, the effect of GPLs distribution on strength, stiffness and dynamic characteristics of the cylinder are discussed in details. The obtained results show that the distribution of GPLs changed the mechanical properties, so a classification of different types and volume fraction exponent is established. Indeed by comparing the obtained results, the best compromise of nanocomposite cylinder is determined in terms of mechanical and dynamic properties for different load patterns. All these applications have shown that the present MLPG method is very effective for geometrically nonlinear analyses of GPLR-FG nanocomposite cylinder because of vanishing mesh distortion issue in large deformation problems. In addition, since in proposed method the distributed nodes are used for discretization the problem domain (rather than the meshing), modeling the functionally graded media yields to more accurate results.

Simple Stopping Criterion Algorithm using Variance Values of Noise in Turbo Code (터보부호에서 잡음 분산값을 사용한 간단한 반복중단 알고리즘)

  • Jeong Dae-Ho;Kim Hwan-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.3 s.345
    • /
    • pp.103-110
    • /
    • 2006
  • Turbo code, a kind of error correction coding technique, has been used in the field of digital mobile communication system. As the number of iterations increases, it can achieves remarkable BER performance over AWGN channel environment. However, if the number of iterations Is increases in the several channel environments, any further iteration results in very little improvement, and requires much delay and computation in proportion to the number of iterations. To solve this problems, it is necessary to device an efficient criterion to stop the iteration process and prevent unnecessary delay and computation. In this paper, it proposes an efficient and simple criterion for stopping the iteration process in turbo decoding. By using variance values of noise derived from mean values of LLR in turbo decoder, the proposed algorithm can largely reduce the computation and average number of iterations without BER performance degradation. As a result of simulations, the computation of the proposed algorithm is reduced by about $66{\sim}80%$ compared to conventional algorithm. The average number of iterations is reduced by about $13.99%{\sim}15.74%$ compared to CE algorithm and about $17.88%{\sim}18.59%$ compared to SCR algorithm.

An X-masking Scheme for Logic Built-In Self-Test Using a Phase-Shifting Network (위상천이 네트워크를 사용한 X-마스크 기법)

  • Song, Dong-Sup;Kang, Sung-Ho
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.2
    • /
    • pp.127-138
    • /
    • 2007
  • In this paper, we propose a new X-masking scheme for utilizing logic built-in self-test The new scheme exploits the phase-shifting network which is based on the shift-and-add property of maximum length pseudorandom binary sequences(m-sequences). The phase-shifting network generates mask-patterns to multiple scan chains by appropriately shifting the m-sequence of an LFSR. The number of shifts required to generate each scan chain mask pattern can be dynamically reconfigured during a test session. An iterative simulation procedure to synthesize the phase-shifting network is proposed. Because the number of candidates for phase-shifting that can generate a scan chain mask pattern are very large, the proposed X-masking scheme reduce the hardware overhead efficiently. Experimental results demonstrate that the proposed X-masking technique requires less storage and hardware overhead with the conventional methods.