• Title/Summary/Keyword: hybrid iterative scheme

Search Result 28, Processing Time 0.03 seconds

Hybrid Iterative Detection Algorithm for MIMO Systems (다중 안테나 시스템을 위한 Hybrid Iterative 검출 기법)

  • Kim, Sang-Heon;Shin, Myeong-Cheol;Kim, Kyeong-Yeon;Lee, Chung-Yong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.4 s.316
    • /
    • pp.117-122
    • /
    • 2007
  • For multiple antenna systems, we consider the hybrid iterative detection of the maximum a posteriori probability(MAP) detection and the linear detection such as the minimum-mean-square-error(MMSE) filtering with soft cancelation. We devise methods to obtain both the lower complexity of the linear detection and the superior performance of the MAP detection. Using the a prior probability of the coded bit which is extrinsic of the outer decoder, we compute the threshold of grouping and determine the detection scheme symbol by symbol. Through the simulation results, it is shown that the proposed receiver obtains the superior performance to the MMSE detector and the lower complexity than the MAP detector.

Hybrid combiner design for downlink massive MIMO systems

  • Seo, Bangwon
    • ETRI Journal
    • /
    • v.42 no.3
    • /
    • pp.333-340
    • /
    • 2020
  • We consider a hybrid combiner design for downlink massive multiple-input multiple-output systems when there is residual inter-user interference and each user is equipped with a limited number of radio frequency (RF) chains (less than the number of receive antennas). We propose a hybrid combiner that minimizes the mean-squared error (MSE) between the information symbols and the ones estimated with a constant amplitude constraint on the RF combiner. In the proposed scheme, an iterative alternating optimization method is utilized. At each iteration, one of the analog RF and digital baseband combining matrices is updated to minimize the MSE by fixing the other matrix without considering the constant amplitude constraint. Then, the other matrix is updated by changing the roles of the two matrices. Each element in the RF combining matrix is obtained from the phase component of the solution matrix of the optimization problem for the RF combining matrix. Simulation results show that the proposed scheme performs better than conventional matrix-decomposition schemes.

Increasing Secrecy Capacity via Joint Design of Cooperative Beamforming and Jamming

  • Guan, Xinrong;Cai, Yueming;Yang, Weiwei;Cheng, Yunpeng;Hu, Junquan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.4
    • /
    • pp.1041-1062
    • /
    • 2012
  • In this paper, we propose a hybrid cooperative scheme to improve the secrecy rate for a cooperative network in presence of multiple relays. Each relay node transmits the mixed signal consisting of weighted source signal and intentional noise. The problem of power allocation, the joint design of beamforming and jamming weights are investigated, and an iterative scheme is proposed. It is demonstrated by the numerical results that the proposed hybrid scheme further improves secrecy rate, as compared to traditional cooperative schemes.

OUTER APPROXIMATION METHOD FOR ZEROS OF SUM OF MONOTONE OPERATORS AND FIXED POINT PROBLEMS IN BANACH SPACES

  • Abass, Hammad Anuoluwapo;Mebawondu, Akindele Adebayo;Narain, Ojen Kumar;Kim, Jong Kyu
    • Nonlinear Functional Analysis and Applications
    • /
    • v.26 no.3
    • /
    • pp.451-474
    • /
    • 2021
  • In this paper, we investigate a hybrid algorithm for finding zeros of the sum of maximal monotone operators and Lipschitz continuous monotone operators which is also a common fixed point problem for finite family of relatively quasi-nonexpansive mappings and split feasibility problem in uniformly convex real Banach spaces which are also uniformly smooth. The iterative algorithm employed in this paper is design in such a way that it does not require prior knowledge of operator norm. We prove a strong convergence result for approximating the solutions of the aforementioned problems and give applications of our main result to minimization problem and convexly constrained linear inverse problem.

학습제어기를 이용한 직류전동기제어

  • 홍기철;남광희
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1989.10a
    • /
    • pp.402-406
    • /
    • 1989
  • Since the control parameters of classical PID controller are fixed for all control period, it is not easy to produce a desired transition phenomena. We incorporate an iterative learning scheme to the linear controller so that it has more flexibility and adaptation capability especially in the transition period. In this paper a hybrid type learning controller is proposed in which fixed linear controller guides learning at the beginning stage. Once a perfect learning is achieved, then the control action is performed by only the learning controller. A computer simulation result demonstrates better performance during transition time than that with only linear PD controller.

  • PDF

A study on the Convergence of Iterative Fourier Transform Algorithm for Optimal Design of Diffractive Optical Elements (회절광학소자의 최적 설계를 위한 Iterative Fourier Transform Algorithm의 수렴성에 관한 연구)

  • Kim, Hwi;Yang, Byung-Choon;Park, Jin-Hong;Lee, Byoung-Ho
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.5
    • /
    • pp.298-311
    • /
    • 2003
  • Iterative Fourier transform algorithm, (IFTA) is tile iterative numerical algorithm for the design of the diffractive optical elements (DOE), by which the phase distribution of a DOE converges on a local optimal solution. The convergence of IFTA depends on several factors 3s initial phase distribution, the structure of the degree of freedom on the observation plane, and the values of internal parameters. In this paper, we analyze tile dependence of the convergence of IFTA on an internal parameter of IFTA, the relaxation parameter, and propose a new hybrid scheme of genetic algorithm and IFTA to obtain more accurate solution.

CRC-Turbo Concatenated Code for Hybrid ARQ System

  • Kim, Woo-Tae;Kim, Jeong-Goo;Joo, Eon-Kyeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.3C
    • /
    • pp.195-204
    • /
    • 2007
  • The cyclic redundancy check(CRC) code used to decide retransmission request in hybrid automatic repeat request(HRAQ) system can also be used to stop iterative decoding of turbo code if it is used as an error correcting code(ECC) of HARQ system. Thus a scheme to use CRC code for both iteration stop and repeat request in the HARQ system with turbo code based on the standard of cdma 2000 system is proposed in this paper. At first, the optimum CRC code which has the minimum length without performance degradation due to undetected errors is found. And the most appropriate turbo encoder structure is also suggested. As results, it is shown that at least 32-bit CRC code should be used and a turbo code with 3 constituent encoders is considered to be the most appropriate one.

The Softest handoff Design using iterative decoding (Turbo Coding)

  • Yi, Byung-K.;Kim, Sang-G.;Picknoltz, Raymond-L.
    • Journal of Communications and Networks
    • /
    • v.2 no.1
    • /
    • pp.76-84
    • /
    • 2000
  • Communication systems, including cell-based mobile communication systems, multiple satellite communication systems of multi-beam satellite systems, require reliable handoff methods between cell-to-cell, satellite-to-satellite of beam-to-team, respectively. Recent measurement of a CDMA cellular system indicates that the system is in handoff at about 35% to 70% of an average call period. Therefore, system reliability during handoff is one of the major system performance parameters and eventually becomes a factor in the overall system capacity. This paper presents novel and improved techniques for handoff in cellular communications, multi-beam and multi-satellite systems that require handoff during a session. this new handoff system combines the soft handoff mechanism currently implemented in the IS-95 CDMA with code and packet diversity combining techniques and an iterative decoding algorithm (Turbo Coding). the Turbo code introduced by Berrou et all. has been demonstrated its remarkable performance achieving the near Shannon channel capacity [1]. Recently. Turbo codes have been adapted as the coding scheme for the data transmission of the third generation international cellular communication standards : UTRA and CDMA 2000. Our proposed encoder and decoder schemes modified from the original Turbo code is suitable for the code and packet diversity combining techniques. this proposed system provides not only an unprecedented coding gain from the Turbo code and it iterative decoding, but also gain induced by the code and packet diversity combining technique which is similar to the hybrid Type II ARQ. We demonstrate performance improvements in AWGN channel and Rayleigh fading channel with perfect channel state information (CSI) through simulations for at low signal to noise ratio and analysis using exact upper bounding techniques for medium to high signal to noise ratio.

  • PDF

A VISCOSITY APPROXIMATIVE METHOD TO CES$\`{A}$RO MEANS FOR SOLVING A COMMON ELEMENT OF MIXED EQUILIBRIUM, VARIATIONAL INEQUALITIES AND FIXED POINT PROBLEMS

  • Jitpeera, Thanyarat;Katchang, Phayap;Kumam, Poom
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.1_2
    • /
    • pp.227-245
    • /
    • 2011
  • In this paper, we introduce a new iterative method for finding a common element of the set of solutions for mixed equilibrium problem, the set of solutions of the variational inequality for a ${\beta}$inverse-strongly monotone mapping and the set of fixed points of a family of finitely nonexpansive mappings in a real Hilbert space by using the viscosity and Ces$\`{a}$ro mean approximation method. We prove that the sequence converges strongly to a common element of the above three sets under some mind conditions. Our results improve and extend the corresponding results of Kumam and Katchang [A viscosity of extragradient approximation method for finding equilibrium problems, variational inequalities and fixed point problems for nonexpansive mapping, Nonlinear Analysis: Hybrid Systems, 3(2009), 475-86], Peng and Yao [Strong convergence theorems of iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems, Mathematical and Computer Modelling, 49(2009), 1816-828], Shimizu and Takahashi [Strong convergence to common fixed points of families of nonexpansive mappings, Journal of Mathematical Analysis and Applications, 211(1) (1997), 71-83] and some authors.

ISI Estimation Using Iterative MAP for Faster-Than-Nyquist Transmission (나이퀴스트 율보다 빠른 전송 시스템에서 반복 MAP을 이용한 ISI 추정 기법)

  • Kang, Donghoon;Kim, Haeun;Park, Kyeongwon;Lee, Arim;Oh, Wangrok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.5
    • /
    • pp.967-974
    • /
    • 2017
  • In this paper, we propose an inter-symbol interference (ISI) estimation scheme based on the maximum a posteriori (MAP) algorithm for faster-than-Nyquist (FTN) systems. Unfortunately, the ISI estimator based on the MAP algorithm requires relatively high computational complexity. To reduce the complexity of the MAP based ISI estimator, we propose a hybrid ISI estimation scheme based on the MAP and successive interference cancellation (SIC) algorithms. The proposed scheme not only offers good ISI estimation performances but also requires reasonably low complexity.