• Title/Summary/Keyword: Iterative Scheme

Search Result 539, Processing Time 0.023 seconds

Noncooperative Multimode Precoding with Limited Feedback in MIMO Interference Channels

  • Lee, Jong-Ho
    • ETRI Journal
    • /
    • v.34 no.5
    • /
    • pp.763-766
    • /
    • 2012
  • This letter proposes an iterative multimode precoding scheme with limited feedback for nonreciprocal MIMO interference channels. Based on analysis of game theory, we model the iterative multimode precoding as a noncooperative game with a finite set of strategies. Numerical results are presented to verify the sum rate performance of the proposed scheme.

Three-Dimensional Grid Generation Method for an Orthogonal Grid at the Boundary by Using Boundary Element Method (경계요소법을 이용한 경계에 직교하는 삼차원 격자형성법)

  • Jeong H. K.;Kwon J. H.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 1995.10a
    • /
    • pp.82-89
    • /
    • 1995
  • In the present paper, a method of nearly orthogonal grid generation in an arbitrary simply-connected 3D domain will be presented. The method is a new direct and non-iterative scheme based on the concept of the decomposition of the global orthogonal transformation into consecutive mapping of a conformal mapping and an auxiliary orthogonal mapping, which was suggested by King and Leal [4]. In our numerical scheme. Kang and Leal's method is extended from 2D problems to 3D problems while the advantage of the non-iterative algorithm is maintained. The essence of the present mapping method is that an iterative scheme can be avoided by introducing a preliminary step. This preliminary step corresponds to a conformal map and is based on the boundary element method(BEM). This scheme is applied to generate several nearly-orthogonal grid systems which are orthogonal at boundaries.

  • PDF

APPROXIMATING COMMON FIXED POINTS OF ONE-STEP ITERATIVE SCHEME WITH ERROR FOR NON-SELF ASYMPTOTICALLY NONEXPANSIVE IN THE INTERMEDIATE SENSE MAPPINGS

  • Saluja, Gurucharan Singh;Nashine, Hemant Kumar
    • East Asian mathematical journal
    • /
    • v.26 no.3
    • /
    • pp.429-440
    • /
    • 2010
  • In this paper, we study a new one-step iterative scheme with error for approximating common fixed points of non-self asymptotically nonexpansive in the intermediate sense mappings in uniformly convex Banach spaces. Also we have proved weak and strong convergence theorems for above said scheme. The results obtained in this paper extend and improve the recent ones, announced by Zhou et al. [27] and many others.

A Simple Method to Reduce the Splitting Error in the LOD-FDTD Method

  • Kong, Ki-Bok;Jeong, Myung-Hun;Lee, Hyung-Soo;Park, Seong-Ook
    • Journal of electromagnetic engineering and science
    • /
    • v.9 no.1
    • /
    • pp.12-16
    • /
    • 2009
  • This paper presents a new iterative locally one-dimensional [mite-difference time-domain(LOD-FDTD) method that has a simpler formula than the original iterative LOD-FDTD formula[l]. There are fewer arithmetic operations than in the original LOD-FDTD scheme. This leads to a reduction of CPU time compared to the original LOD-FDTD method while the new method exhibits the same numerical accuracy as the iterative ADI-FDTD scheme. The number of arithmetic operations shows that the efficiency of this method has been improved approximately 20 % over the original iterative LOD-FDTD method.

An Efficient Partial Detection Scheme for MIMO-OFDM Systems (MIMO-OFDM 시스템에서 효율성을 위한 분할 검출 기법)

  • Kang, Sung-jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.9
    • /
    • pp.1722-1724
    • /
    • 2015
  • This paper proposes a partial detection scheme using QRD-M, DFE, and iterative schemes for efficiency in terms of detection performance and complexity in a MIMO-OFDM system. The proposed scheme detects signals by using the different detection methods in according to spatial stream. In the proposed scheme, QRD-M with high detection performance and high complexity is used in spatial stream that requires low complexity, and DFE with low detection performance and low complexity is used in spatial stream that requires high complexity. Also, the iterative detection is performed in the detected spatial stream by using DFE. From the simulation, it is confirmed that although proposed scheme has increased complexity, detection performance is greatly improved by the proposed scheme.

Performance Analysis of Iterative Detection Scheme for the D-STTD System

  • Yoon, Gil-Sang;Lee, Jeong-Hwan;Cho, In-Sik;Seo, Chang-Woo;Ryoo, Sang-Jin;You, Cheol-Woo;Hwang, In-Tae
    • Journal of information and communication convergence engineering
    • /
    • v.7 no.2
    • /
    • pp.235-240
    • /
    • 2009
  • This paper combines various detection techniques and analyzes their performances in detecting the transmission information of the D-STTD scheme that uses, in parallel, the STTD scheme known as the Alamouti code. The D-STTD scheme adopts one of the STTD schemes for transmission to acquire diverse effects and uses another form of STTD for multiplexing effects. Due to the multiplexing effect that transmits different data, it is difficult to apply D-STTD to the conventional STTD combining technique. This paper combines the D-STTD system with linear algorithm, SIC algorithm and OSIC algorithm known as multiplexing detection scheme based on MMSE scheme. And we propose the detection scheme of the D-STTD using MAP algorithm and analyze the performance of each system. The simulation results showed that the detector using iterative algorithm has better performance than Linear MMSE Detector. Especially, we can show that the detector using MAP algorithm outperforms conventional detector.

An Accelerated Iterative Method for the Dynamic Analysis of Multibody Systems (반복 계산법 및 계산 가속기법에 의한 다물체 동역학 해법)

  • 이기수;임철호
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.16 no.5
    • /
    • pp.899-909
    • /
    • 1992
  • An iterative solution technique is presented to analyze the dynamic systems of rigid bodies subjected to kinematic constraints. Lagrange multipliers associated with the constraints are iteratively computed by monotonically reducing an appropriately defined constraint error vector, and the resulting equation of motion is solved by a well-established ODE technique. Constraints on the velocity and acceleration as well as the position are made to be satisfied at joints at each time step. Time integration is efficiently performed because decomposition or orthonormalization of the large matrix is not required at all. An acceleration technique is suggested for the faster convergence of the iterative scheme.

Modified Clipping for Iterative Decoding of Superposition Coding (중첩 부호의 반복 복호를 위한 개선된 클리핑 기법)

  • Yan, Yi-Er;Kim, Jeong-Ki;Chen, Zhu;Lee, Moon-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.2
    • /
    • pp.44-51
    • /
    • 2008
  • In this paper, we propose a modified clipping scheme for iterative decoding of superposition coding system by losing less power than clipping scheme. Our proposed scheme in superposition coding system shows good performance in peak-to-average power ratio(PAPR) and system performance with the same Clipping Ratio especially in low Clipping Ratio case. Finally in order to alleviate the performance degradation due to clipping noises, we combine a soft compensation algorithm that is combined with soft-input-soft-output(SISO) decoding algorithms in an iterative manner proposed by [1][2]. Simulation results show that with the proposed scheme, most performance loss can be recovered.

Iterative learning control based on inverse process model

  • Lee, Kwang-Soon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10b
    • /
    • pp.539-544
    • /
    • 1992
  • An iterative lear-rung control scheme is newly designed in tile frequency domain. Purposing for batch process control, a generic form of feedback-assisted first-order learning is considered first, and the inverse model-based learning algorithm is derived through convergence analysis in the frequency domain. To enhance the robustness of the proposed scheme, a filtered version is also presented. Performance of the proposed scheme is evaluated through numerical simulations.

  • PDF

AN EFFICIENT THIRD ORDER MANN-LIKE FIXED POINT SCHEME

  • Pravin, Singh;Virath, Singh;Shivani, Singh
    • Nonlinear Functional Analysis and Applications
    • /
    • v.27 no.4
    • /
    • pp.785-795
    • /
    • 2022
  • In this paper, we introduce a Mann-like three step iteration method and show that it can be used to approximate the fixed point of a weak contraction mapping. Furthermore, we prove that this scheme is equivalent to the Mann iterative scheme. A comparison is made with the other third order iterative methods. Results are presented in a table to support our conclusion.