• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.148-154
• /
• 2010

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen 802.11n for wireless local access network(WLAN) standard are required a large number of computation due to large size of coded block and iteration. Therefore, we presented three kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algorithm. Secondly, we have apply early stop algorithm. This method is reduced number of unnecessary iteration. Third, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and early stop algorithm is reduced more than one iteration and computational complexity of early detected method is about 30% offs in case of check node update, 94% offs in case of check node update compared to conventional scheme.

• Journal of Internet Computing and Services
• /
• v.15 no.5
• /
• pp.17-24
• /
• 2014

Blind algorithms designed to maximize the probability that constant modulus errors become zero carry out some summation operations for a set of constant modulus errors at an iteration time inducing heavy complexity. For the purpose of reducing this computational burden induced from the summation, a new approach to the estimation of the zero-error probability (ZEP) of constant modulus errors (CME) and its gradient is proposed in this paper. The ZEP of CME at the next iteration time is shown to be calculated recursively based on the currently calculated ZEP of CME. It also is shown that the gradient for the weight update of the algorithm can be obtained by differentiating the ZEP of CME estimated recursively. From the simulation results that the proposed estimation method of ZEP-CME and its gradient produces exactly the same estimation results with a significantly reduced computational complexity as the block-processing method does.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.5 no.1
• /
• pp.17-24
• /
• 1995

In spite of the good security of the cryptosystem on an elliptic curve defined over finite field, the cryptosystem on an elliptic curve is slower than that on a finite field. To be practical, we need a better method to improve a speed of the cryptosystem on an elliptic curve defined over a finite field. In 1991, Koblitz suggested to use an anomalous curve over $F_2$, which is an elliptic curve with Frobenious map whose trace is 1, and reduced a speed of computation of mP. In this paper, we consider an elliptic curve defined over $F_4$ with Frobenious map whose trace is 3 and suggest an efficient algorithm to compute mP. On the proposed elliptic curve, we can compute multiples mP with ${\frac{3}{2}}log_2m$+1 addition in worst case.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.4
• /
• pp.11-16
• /
• 2004

A simple stopping criterion for iterative decoding based on min-sum processing is presented. While most stopping criteria suggested in the literature, are based on Cross Entropy (CE) and its simplification, the proposed stopping criterion is to check if a decoded sequence is a valid codeword along the encoder trellis structure. This new stopping criterion requires less computational complexity and saves mem4)ry compared to the conventional stopping rules. The numerical results are presented on the 3GPP turbo code and a Serially Concatenated Convolutional Cods (SCCC).

• Journal of Korea Multimedia Society
• /
• v.14 no.8
• /
• pp.1000-1009
• /
• 2011

Image interpolation is a technique which estimates the non-allocated pixel values on image scale-transform. It requires minimum computational complexity and minimum image quality degradation on the interpolated resultant images. In this paper we propose an image interpolation method using iterative error estimation. The proposed method consists of the following five steps: loss-information computational step, loss-information estimation step, loss-information application step, error computation step, and error application step. The experimental results obtained show that the average PSNR is increased by 3.3dB, subjective image quality is enhanced and the minimum computation complexity is decreased by 83%. The proposed image interpolation algorithm may be helpful in various applications such as image reconstruction and enlargement.

• KIPS Transactions on Computer and Communication Systems
• /
• v.12 no.1
• /
• pp.41-46
• /
• 2023

Iterative reconstruction of CT takes a long time because projection and back-projection are alternatively repeated until taking a good image. To reduce the reconstruction time, we need a fast algorithm for calculating the projection which is a time-consuming step. In this paper, we proposed a new algorithm to calculate the line integral and the algorithm is approximately 10% faster than the well-known Siddon method (Jacobs version) and has a good image quality. Although the algorithm has been investigated for the case of parallel beams, it can be extended to the case of fan and cone beam geometries in the future.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11c
• /
• pp.1729-1732
• /
• 2002

DNA의 염기서열이 밝혀지면서 인간 생체에 대한 다양한 연구가 활발히 진행되고 있다. 응용분야 중 친자확인에 DNA 염기서열을 이용하려는 시도가 최근에 연구되고 있다. 본 연구는 DNA의 반복 염기서열을 이용하여 수작업으로 이루어지고 있는 친자 찬인 방법을 데이터베이스 기술을 이용하여 수행하는 최초의 연구이다. 방대한 양의 자료에서 친자확률을 계산하는데 걸리는 시간은 DB를 구축하는 방법에 크게 좌우된다. 본 논문에서는 친자확률을 계산하는 시간을 최소화할 수 있는 DB를 설계하고 또한 최소 시간내에 질의 결과를 획득하는 질의 구성하는 방법을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.70-72
• /
• 2003

전자계 산란의 시간영역 신호는 대응하는 주파수 영역 응답에 대해서도 동시에 효율적인 방법으로 나타낼 수 있는 이유는 다항식의 직교하는 성질 때문이다. 직교 다항식을 이용함으로써, 이른 시간과 낮은 주파수 영역을 동시에 추정할 수 있다 그 접근법은 CGM(Conjugate Gradient Method)방법과 간단한 DFT(Discrete Fourier transform)에 의거한다. 본 논문에서는 Bessel-Chebyshev 함수를 이용한 이른 시간과 낮은 주파수영역 응답을 동시에 추정하기 위한 접근의 방법을 제시하고, 구현하였다. 오직 이른 시간과 낮은 주파수 정보를 필요로 하기 때문에 이 방법으로 계산시 반복계산의 수렴속도가 무척 빠르다는 이점이 있어, 신속한 정보를 얻을 수 있다.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1997.05b
• /
• pp.30-35
• /
• 1997

물성치가 상이한 계에서 접합면을 포함한 전 영역내의 연속 응력장 개선방안을 제안하였다. 재료의 물성치가 100배 차이가 나는 직선보 예제에 대해 변위형 유한요소해에서는 접착면 상ㆍ하측에서 응력들이 불연속이며 상당한 차이를 보이고 있는데 반하여 본 연구에서의 응력장은 연속이며 접합면의 절점응력들이 이론해에 근접하고 있다 또한 본 연구에서의 연속 응력장으로 계산한 변형률 에너지는 수회 이내의 반복계산에서 이론해에 수렴하고 있다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1892-1897
• /
• 2012

In this paper, efficient CNU(Check Node Update) algorithms are analyzed for high speed LDPC decoding in DVB-S2 standard. In aspect to CNU methods, there are some kinds of CNU methods. Among of them, MP (Min Product) method is quite often used in LDPC decoding. However MP needs LUT (Look Up Table) that is critical path in LDPC decoding speed. A new SC-NMS (Self-Corrected Normalized Min-Sum) method is proposed in the paper. NMS needs only normalized scaling factor instead of LUT and compensates the overestimation of MP approximation. In addition, SC method is proposed. It gives a faster convergence toward a decoded codeword. If a message change its sign between two iterations, it is not reliable and to avoid to propagate noisy information, its module is set to 0. The performance of SC-NMS has a little degrade compare to MP by 0.1 dB, however considering computational complexity and decoding speed, SC-NMS algorithm is optimal method for CNU algorithm.