• Journal of Communications and Networks
• /
• v.18 no.5
• /
• pp.762-772
• /
• 2016

This paper studies the problem of precoding and post-coding design for multicell multiuser downlink transmissions in the absence of perfect channel state information (CSI). Using statistical information of imperfect CSI, an iterative multiuser multicell transceiver design is formulated by minimizing the mean squared error (MSE) cost function of signal and leakage interference under per-base station power constraint (PBPC). The convergence of the iterative precoding and postcoding algorithm is verified by analytical and empirical results. The proposed precoding and postcoding algorithm offers a low computational complexity and robustness against CSI imperfection.

• Investigative Magnetic Resonance Imaging
• /
• v.19 no.1
• /
• pp.19-30
• /
• 2015

Purpose: A new compressed sensing technique by iterative truncation of small transformed coefficients (ITSC) is proposed for fast cardiac CINE MRI. Materials and Methods: The proposed reconstruction is composed of two processes: truncation of the small transformed coefficients in the r-f domain, and restoration of the measured data in the k-t domain. The two processes are sequentially applied iteratively until the reconstructed images converge, with the assumption that the cardiac CINE images are inherently sparse in the r-f domain. A novel sampling strategy to reduce the normalized mean square error of the reconstructed images is proposed. Results: The technique shows the least normalized mean square error among the four methods under comparison (zero filling, view sharing, k-t FOCUSS, and ITSC). Application of ITSC for multi-slice cardiac CINE imaging was tested with the number of slices of 2 to 8 in a single breath-hold, to demonstrate the clinical usefulness of the technique. Conclusion: Reconstructed images with the compression factors of 3-4 appear very close to the images without compression. Furthermore the proposed algorithm is computationally efficient and is stable without using matrix inversion during the reconstruction.

• ETRI Journal
• /
• v.30 no.6
• /
• pp.807-817
• /
• 2008

We present a low-density parity-check (LDPC)-based, threaded layered space-time-frequency system with emphasis on the iterative receiver design. First, the unbiased minimum mean-squared-error iterative-tree-search (U-MMSE-ITS) detector, which is known to be one of the most efficient multi-input multi-output (MIMO) detectors available, is improved by augmentation of the partial-length paths and by the addition of one-bit complement sequences. Compared with the U-MMSE-ITS detector, the improved detector provides better detection performance with lower complexity. Furthermore, the improved detector is robust to arbitrary MIMO channels and to any antenna configurations. Second, based on the structure of the iterative receiver, we present a low-complexity belief-propagation (BP) decoding algorithm for LDPC-codes. This BP decoder not only has low computing complexity but also converges very fast (5 iterations is sufficient). With the efficient receiver employing the improved detector and the low-complexity BP decoder, the proposed system is a promising solution to high-data-rate transmission over selective-fading channels.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.798-809
• /
• 2013

In this paper, we propose robust relay and destination filter design methods for the multi-user peer-to-peer amplify-and-forward relaying systems while taking imperfect channel knowledge into consideration. Specifically, the relay and destination filter sets are developed to minimize the sum mean-squared-error (MSE). We first present a robust joint optimum relay and destination filter calculation method with an iterative algorithm. Motivated by the need to reduce computational complexity of the iterative scheme, we then formulate a simplified sum MSE minimization problem using the relay filter decomposability, which lead to two robust sub-optimum non-iterative design methods. Finally, we propose robust modified destination filter design methods which require only local channel state information between relay node and a specific destination node. The analysis and simulation results verify that, compared with the optimum iterative method, the proposed non-iterative schemes suffer a marginal loss in performance while enjoying significantly improved implementation efficiencies. Also it is confirmed that the proposed robust filter design methods provide desired robustness in the presence of channel uncertainty.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.8
• /
• pp.891-897
• /
• 1992

A local iterative Image restoration method Is Introduced that processes with varying iteration numbers according to the local statistics. In general almost of the Iterative method applies Its algorithm to the whole Image without considering the local pixel informations, which Is not so effective for the processing time. Usually the edges or details have an Important role In visual effect. So in this paper we process the edges or the details many times while In the flat region we just pass over or decrease iterations. This method shows good MSE (Mean Square Error) improvement, better subjective qualify and reduced processing time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.7
• /
• pp.1287-1294
• /
• 2006

In many current wireless packet data system, the short-burst transmissions are used, and training overhead is very significant for such short burst formats. So, the availability of the short training sequence and the fast converging algorithm is essential in the adaptive equalizer. In this paper, the new equalizer algorithm is proposed to improve the performance of a MTLMS (multiple-training least mean square) based DFE (decision feedback equalizer)using the short training sequence. In the proposed method, the output of the DFE is fed back to the LMS (least mean square) based adaptive DEF loop iteratively and used as an extended training sequence. Instead of the block operation using ML (maximum likelihood) estimator, the low-complexity adaptive LMS operation is used for overall processing. Simulation results show that the perfonnance of the proposed equalizer is improved with a linear computational increase as the iterations parameter in creases and can give the more robustness to the time-varying fading.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.7
• /
• pp.26-32
• /
• 1994

The Lloyd-Max algorithm is an iterative scheme for design of the minimum mean square error quantizer. It is very simple in concept and easy to program into a computer. However its convergence and accuracy are primarily dependent upon the accuracy of the initial parameter. In this paper, a new initial parameter which converges to a specific value when the number of output levels becomes large is selected. And an estimator using curve fitting techique is suggested. In addition, performance of the proposed method is shown to be superior to that of the existing methods in accuracy and convergence.

• 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.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.2 s.314
• /
• pp.93-101
• /
• 2007

To jointly optimize the spatial registration and the exposure compensation, an iterative registration algorithm, the Lucas-Kanade algorithm, is combined with an exposure compensation algorithm, which is based on the histogram transformation function. Based on a simple regression model, a nonparametric estimator, the empirical conditional mean, and its polynomial fitting are used as histogram transformation functions for the exposure compensation. Since the proposed algorithm is composed of separable optimization phases, the proposed algorithm is more advantageous than the joint approaches of Mann and Candocia in the aspect of implementation flexibility. The proposed algorithm performs a better registration for real images than the case of registration that does not consider the exposure difference.

• Journal of Information Processing Systems
• /
• v.15 no.4
• /
• pp.820-832
• /
• 2019

Estimation of accurate blood volume flow in ultrasound Doppler blood flow spectrograms is extremely important for clinical diagnostic purposes. Blood volume flow measurements require the assessment of both the velocity distribution and the cross-sectional area of the vessel. Unfortunately, the existing volume flow estimation algorithms by ultrasound lack the velocity space distribution information in cross-sections of a vessel and have the problems of low accuracy and poor stability. In this paper, a new robust ultrasound volume flow estimation method based on multigate (RMG) is proposed and the multigate technology provides detail information on the local velocity distribution. In this method, an accurate double iterative flow velocity estimation algorithm (DIV) is used to estimate the mean velocity and it has been tested on in vivo data from carotid. The results from experiments indicate a mean standard deviation of less than 6% in flow velocities when estimated for a range of SNR levels. The RMG method is validated in a custom-designed experimental setup, Doppler phantom and imitation blood flow control system. In vitro experimental results show that the mean error of the RMG algorithm is 4.81%. Low errors in blood volume flow estimation make the prospect of using the RMG algorithm for real-time blood volume flow estimation possible.