• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9C
• /
• pp.1227-1234
• /
• 2004

In this paper, we propose a modified Normalized-BP algorithm by changing the normalization factor according to the reliability of updated messages. Proposed algorithm has almost same decoding complexity as Normalized-BP algorithm and achieves a bit-error probability of $10^4$within 0.02dB away from compared with LLR-BP algorithm.

• ETRI Journal
• /
• v.26 no.5
• /
• pp.432-436
• /
• 2004

In this paper, we propose the modified uniformly most powerful (UMP) belief-propagation (BP)-based decoding algorithm which utilizes multiplicative and additive factors to diminish the errors introduced by the approximation of the soft values given by a previously proposed UMP BP-based algorithm. This modified UMP BP-based algorithm shows better performance than that of the normalized UMP BP-based algorithm, i.e., it has an error performance closer to BP than that of the normalized UMP BP-based algorithm on the additive white Gaussian noise channel for low density parity check codes. Also, this algorithm has the same complexity in its implementation as the normalized UMP BP-based algorithm.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.107-112
• /
• 1998

In this paper, we propose a new paradigm (NEW_BP) to be capable of overcoming limitations of the traditional backpropagation(OLD_BP). NEW_BP is based on the method of conjugate gradients with the normalized direction vectors and computes step size through the linear search which may be characterized by order statistics and golden section. Simulation results showed that NEW_BP was definitely superior to both the stochastic OLD_BP and the deterministic OLD_BP in terms of accuracy and rate of convergence and might sumount the problem of local minima. Furthermore, they confirmed us that stagnant phenomenon of training in OLD_BP resulted from the limitations of its algorithm in itself and that unessential approaches would never cured it of this phenomenon.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.134-134
• /
• 2004

• Journal of Satellite, Information and Communications
• /
• v.9 no.4
• /
• pp.104-110
• /
• 2014

This paper considers two reconstruction schemes of structured-sparse signals, turbo inference and Markov chain Monte Carlo (MCMC) inference, in compressed sensing(CS) technique that is recently getting an important issue for an efficient video wireless transmission system using multi-copter as an unmanned aerial vehicle. Proposed reconstruction algorithms are setting importance on reduction of image data sizes, fast reconstruction speed and errorless reconstruction. As a result of experimentation with twenty kinds of images, we can find turbo reconstruction algorithm based on loopy belief propagation(BP) has more excellent performances than MCMC algorithm based on Gibbs sampling as aspects of average reconstruction computation time, normalized mean squared error(NMSE) values.