• 제목/요약/키워드: Iterative Scheme

검색결과 539건 처리시간 0.024초

Error-detection-coding-aided iterative hard decision interference cancellation for MIMO systems with HARQ

  • Park, Sangjoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권3호
    • /
    • pp.1016-1030
    • /
    • 2018
  • In this paper, an error-detection-coding-aided iterative hard decision interference cancellation (EDC-IHIC) scheme for multiple-input multiple-output systems employing hybrid automatic repeat request (HARQ) for multi-packet transmission is developed and investigated. In the EDC-IHIC scheme, only packets identified as error-free by the EDC are submitted to the interference cancellation (IC) stage for cancellation from the received signals. Therefore, the possibility of error propagation, including inter-transmission error propagation, can be eliminated using EDC-IHIC. Because EDC must be implemented in systems that employ HARQ to determine packet retransmission, error propagation can be prevented without the need for additional redundancy. The results of simulations conducted herein verify that the EDC-IHIC scheme outperforms conventional hard decision IC schemes in terms of the packet error rate in various environments.

Reverse Iterative Image Encryption Scheme Using 8-layer Cellular Automata

  • Zhang, Xing;Zhang, Hong;Xu, Chungen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권7호
    • /
    • pp.3397-3413
    • /
    • 2016
  • Considering that the layered cellular automata (LCA) are naturally fit for representing image data in various applications, a novel reverse iterative image encryption scheme based on LCA is proposed. Specifically, the plain image is set as the final configuration of an 8-layer CA, and some sequences derived from a random sequence are set as the pre-final configuration, which ensure that the same plain image will never be encrypted in the same way when encrypted many times. Then, this LCA is backward evolved by following some reversible two order rules, which are generated with the aid of a newly defined T-shaped neighborhood. The cipher image is obtained from the recovered initial configuration. Several analyses and experimental results show that the proposed scheme possesses a high security level and executive performance.

무요소법의 적응해석을 위한 반복격자해법 (Iterative Cell-wise Solution Method for the Adaptive Analysis of a Meshless Method)

  • 석병호;임장근
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2002년도 가을 학술발표회 논문집
    • /
    • pp.607-614
    • /
    • 2002
  • For the accurate analysis of crack problems, considerable nodal refinement near the crack tip to capture singular stress field with sufficient accuracy to provide a useful computation of stress intensity factor is required. So, in this paper, adaptive nodal refinement scheme is proposed where nodes in restricted cell regions centered at crack tip are arranged in array for enhanced spatial resolution and adaptivity. With only cell-wise adaptive refinement scheme around crack tip fields, singularity of crack tip is sufficiently described to expect a successive crack propagate direction. Through numerical tests, accuracy of the proposed adaptive scheme is investigated and compared with the finite element and experimental results. By this implementation, it is shown that high accuracy is achieved by using iterative cell-wise solution method fur analyzing crack propagation problems.

  • PDF

Strong Convergence Theorems by Modified Four Step Iterative Scheme with Errors for Three Nonexpansive Mappings

  • JHADE, PANKAJ KUMAR;SALUJA, AMARJEET SINGH
    • Kyungpook Mathematical Journal
    • /
    • 제55권3호
    • /
    • pp.667-678
    • /
    • 2015
  • The aim of this paper is to prove strong convergence theorem by a modified three step iterative process with errors for three nonexpansive mappings in the frame work of uniformly smooth Banach spaces. The main feature of this scheme is that its special cases can handle both strong convergence like Halpern type and weak convergence like Ishikawa type iteration schemes. Our result extend and generalize the result of S. H. Khan, Kim and Xu and many other authors.

NON-ITERATIVE DOMAIN DECOMPOSITION METHOD FOR THE CONVECTION-DIFFUSION EQUATIONS WITH NEUMANN BOUNDARY CONDITIONS

  • Younbae Jun
    • East Asian mathematical journal
    • /
    • 제40권1호
    • /
    • pp.109-118
    • /
    • 2024
  • This paper proposes a numerical method based on domain decomposition to find approximate solutions for one-dimensional convection-diffusion equations with Neumann boundary conditions. First, the equations are transformed into convection-diffusion equations with Dirichlet conditions. Second, the author introduces the Prediction/Correction Domain Decomposition (PCDD) method and estimates errors for the interface prediction scheme, interior scheme, and correction scheme using known error estimations. Finally, the author compares the PCDD algorithm with the fully explicit scheme (FES) and the fully implicit scheme (FIS) using three examples. In comparison to FES and FIS, the proposed PCDD algorithm demonstrates good results.

Vibration reduction for interaction response of a maglev vehicle running on guideway girders

  • Wang, Y.J.;Yau, J.D.;Shi, J.;Urushadze, S.
    • Structural Engineering and Mechanics
    • /
    • 제76권2호
    • /
    • pp.163-173
    • /
    • 2020
  • As a vehicle moves on multiple equal-span beams at constant speed, the running vehicle would be subjected to repetitive excitations from the beam vibrations under it. Once the exciting frequency caused by the vibrating beams coincides with any of the vehicle's frequencies, resonance would take place on the vehicle. A similar resonance phenomenon occurs on a beam subject to sequential moving loads with identical axle-intervals. To reduce both resonant phenomena of a vehicle moving on guideway girders, this study proposed an additional feedback controller based the condensed virtual dynamic absorber (C-VDA) scheme. This condensation scheme has the following advantages: (1) the feedback tuning gains required to adapt the control currents or voltages are directly obtained from the tuning forces of the VDA; (2) the condensed VDA scheme does not need additional DoFs of the absorber to control the vibration of the maglev-vehicle/guideway system. By decomposing the maglev vehicle-guideway coupling system into two sub-systems (the moving vehicle and the supporting girders), an incremental-iterative procedure associated with the Newmark method is presented to solve the two sets of sub-system equations. From the present studies, the proposed C-VDA scheme is a feasible approach to suppress the interaction response for a maglev vehicle in resonance moving on a series of guideway girders.

불확실한 초기치를 갖는 반복시스템에 대한 유한구간 추종제어 (Finite-horizon Tracking Control for Repetitive Systems with Uncertain Initial Condition)

  • 최윤종;윤성욱;이창희;조재영;박부견
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
    • /
    • pp.297-298
    • /
    • 2007
  • Repetitive systems stand for a kind of systems that perform a simple task on a fixed pattern repetitively and are widely spread in industrial fields. Hence, those systems have been of much interests by many researchers, especially in the field of iterative learning control (ILC). In this paper, we propose a finite-horizon tracking control scheme for linear time-varying repetitive systems with uncertain initial conditions. The scheme is derived both analytically and numerically for state-feedback systems and only numerically for output-feedback systems. Then, it is extended to stable systems with input constraints. All numerical schemes are developed in the forms of linear matrix inequalities. A distinguished feature of the proposed scheme from the existing iterative learning control is that the scheme guarantees the tracking performance exactly even under uncertain initial conditions. The simulation results demonstrate the good performance of the proposed scheme.

  • PDF

Generalized Distributed Multiple Turbo Coded Cooperative Differential Spatial Modulation

  • Jiangli Zeng;Sanya Liu;Hui Wang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권3호
    • /
    • pp.999-1021
    • /
    • 2023
  • Differential spatial modulation uses the antenna index to transmit information, which improves the spectral efficiency, and completely bypasses any channel side information in the recommended setting. A generalized distributed multiple turbo coded-cooperative differential spatial modulation based on distributed multiple turbo code is put forward and its performances in Rayleigh fading channels is analyzed. The generalized distributed multiple turbo coded-cooperative differential spatial modulation scheme is a coded-cooperation communication scheme, in which we proposed a new joint parallel iterative decoding method. Moreover, the code matched interleaver is considered to be the best choice for the generalized multiple turbo coded-cooperative differential spatial modulation schemes, which is the key factor of turbo code. Monte Carlo simulated results show that the proposed cooperative differential spatial modulation scheme is better than the corresponding non-cooperative scheme over Rayleigh fading channels in multiple input and output communication system under the same conditions. In addition, the simulation results show that the code matched interleaver scheme gets a better diversity gain as compared to the random interleaver.

수중 음향통신에 적합한 터보 등화기 기반의 최적의 반복 부호 기법 연구 (Analysis of Optimum Iterative Codes for Underwater Acoustic Communication based on Turbo Equalizer)

  • 박태두;정지원
    • 한국항해항만학회지
    • /
    • 제37권5호
    • /
    • pp.487-492
    • /
    • 2013
  • 수중에서의 통신은 해수면과 해저면 등에 의한 신호의 반사가 생겨 다중경로 현상이 발생한다. 이러한 다중경로의 영향으로 신호는 왜곡되고 원활한 수신을 방해하게 된다. 본 논문에서는 수신신호의 성능을 향상시키고자 수중통신에 적합한 반복부호를 설정하였다. 적용 가능한 반복부호로는 터보 부호와 LDPC 부호, BCJR 기반의 컨볼루션 부호가 있으며, 동일한 부호화율 및 비슷한 부호어 길이에서 터보 등 화기 기반의 성능을 분석하였다. 반복횟수를 5회로 고정하였고, 수중 채널 데이터는 실제 동해 바다에서 송수신 거리가 5Km로 실험을 하였다. 그리고 데이터 속도를 1Kbps에서 측정된 실제 데이터를 이용하였다. 성능 분석 결과, BCJR 기반의 컨볼루션 부호가 가장 적합함을 알 수 있었다.

STRONG CONVERGENCE AND ALMOST STABILITY OF ISHIKAWA ITERATIVE SCHEMES WITH ERRORS IN BANACH SPACES

  • Zeqing Liu;Kim, Jong-Kyu;Park, Hye-Kyeong
    • Journal of applied mathematics & informatics
    • /
    • 제10권1_2호
    • /
    • pp.261-275
    • /
    • 2002
  • Let T be a local strongly accretive operator from a real uniformly smooth Banach space X into itself. It is proved that Ishikawa iterative schemes with errors converge strongly to a unique solution of the equations T$\_$x/ = f and x + T$\_$x/ = f, respectively, and are almost T$\_$b/-stable. The related results deal with the strong convergence and almost T$\_$b/-stability of Ishikawa iterative schemes with errors for local strongly pseudocontractive operators.