• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.5
• /
• pp.1412-1430
• /
• 2024

The soft cancellation list (SCANL) decoding algorithm for polar codes runs L soft cancellation (SCAN) decoders with different decoding factor graphs. Although it can achieve better decoding performance than SCAN algorithm, it has high latency. In this paper, a fast simplified SCANL (Fast-SSCANL) algorithm that runs L independent Fast-SSCAN decoders is proposed. In Fast-SSCANL decoder, special nodes in each factor graph is identified, and corresponding low-latency decoding approaches for each special node is propose first. Then, syndrome check aided Fast-SSCANL (SC-Fast-SSCANL) algorithm is further put forward. The ordinary nodes satisfied the syndrome check will execute hard decision directly without traversing the factor graph, thereby reducing the decoding latency further. Simulation results show that Fast-SSCANL and SC-Fast-SSCANL algorithms can achieve the same BER performance as the SCANL algorithm with lower latency. Fast-SSCANL algorithm can reduce latency by more than 83% compared with SCANL, and SC-Fast-SSCANL algorithm can reduce more than 85% latency compared with SCANL regardless of code length and code rate.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2005.11a
• /
• pp.250-255
• /
• 2005

In this paper, we propose a new fast running FIR filter structure that improves the convergence speed of adaptive signal processing and reduces the computational complexity. The proposed filter is applied to wavelet based adaptive algorithm. Actually we compared the performance of the proposed algorithm with other algorithm using computer simulation of adaptive noise canceler based on synthesis speech. As the result, the frequency domain algorithm is prefer than the existent time domain. we analyzed the Wavelet algorithm, short-length fast running FIR algorithm, fast-short-length fast running FIR algorithm and proposed algorithm.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.35 no.1
• /
• pp.41-53
• /
• 2017

A thermal camera is used to obtain thermal information of a certain area. However, it is difficult to depict all the information of an area in an individual thermal image. To form a high-resolution panoramic thermal image, we propose an optimized FAST (feature from accelerated segment test) algorithm to combine two or more images of the same scene. The FAST is an accurate and fast algorithm that yields good positional accuracy and high point reliability; however, the major limitation of a FAST detector is that multiple features are detected adjacent to one another and the interest points cannot be obtained under no significant difference in thermal images. Our proposed algorithm not only detects the features in thermal images easily, but also takes advantage of the speed of the FAST algorithm. Quantitative evaluation shows that our proposed technique is time-efficient and accurate. Finally, we create a mosaic of the video to analyze a comprehensive view of the scene.

• Journal of the Korean Mathematical Society
• /
• v.42 no.1
• /
• pp.1-16
• /
• 2005

This paper presents a fast factorization algorithm for confluent Cauchy-like matrices. The algorithm consists of two parts. First. a confluent Cauchy-like matrix is transformed into a Cauchy-like matrix available to pivot without changing its structure. Second. a fast partial pivoting factorization algorithm for the Cauchy-like matrix is presented. A new displacement structure cannot possibly generate all entries of a transformed matrix, which is called by 'partially reconstructible'. This paper also discusses how the proposed factorization algorithm can be generally applied to partially reconstructive matrices.

• Journal of IKEEE
• /
• v.13 no.1
• /
• pp.1-10
• /
• 2009

Recently, some frequency domain CMA (Constant Modulus Algorithm) have been introduced in an effort to reduce computational complexities [1,2]. In [1], a fast algorithm that minimizing cost function designed for block input signal is employed, while in [2], a novel cost function that minimizing sample by sample input is used. Although, the two fast algorithm save computational complexities as compared to CMA, the convergence behaviors of the two fast algorithm show different results with repsect to CMA. Thus, in this paper, some analytical results on the error surface of the fast frequency domain CMA are introduced. From the analytical results, we show that the more recent algorithm [2] outperforms the previous algorithm [1]. Simulation results reveals that the recent algorithm [2] shows 50% enhanced convergence with respect to the old fast algorithm [1]. Also, we show that the recent fast algorithm [2] has comparable convergence performance with respect to conventional CMA algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.10
• /
• pp.18-25
• /
• 2000

In this paper, we analyze TCP congestion control algorithm over ATM-UBR network. TCP congestion control algorithm consists of slow start, congestion avoidance, fast recovery, fast retransmit. We analyze the ATM-UBR network service using the BSD 4.3 TCP Reno, Vanilla. However we found the fact that the characteristic of fast retransmit, recovery algorithm makes a serious degradation of Performance in multiple losses of packets. We propose new fast retransmit, recovery algorithm to improve the problem. The results of performance analysis improve the multiple losses of packets using a proposed fast retransmit, recovery algorithm.

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.1
• /
• pp.19-25
• /
• 2012

An adaptive system is a well-known method for removing noise from noise-corrupted speech. In this paper, we perform a least mean square (LMS) based on wavelet adaptive algorithm. It establishes the faster convergence rate of as compared to time domain because of eigenvalue distribution width. And this paper provides the basic tool required for the FIR algorithm whose algorithm reduces the arithmetic complexity. We consider a new fast short-length running FIR structure in discrete wavelet adaptive algorithm. We compare FIR algorithm and short-length fast running FIR algorithm (SFIR) to the proposed fast short-length running FIR algorithm(FSFIR) for arithmetic complexities.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1993.10a
• /
• pp.428-433
• /
• 1993

In this paper, the fast algorithm to calculate cutting force of milling and its application to NC verification system have been studied. The fast force algorithm can calculate the maximum cutting force fastly during one revelotion of tool. The NC verification using the fast force algorithm can verify excessive cutting force which is the cause of deflection and breakage of tool, and can so adjust the feed rate as to manufacture with the maximum force criterion or maximum machining error criterion. So, the fast force algorithm has been added to the NC verification system, the NC verification system can verify the physical problems in NC code effectively.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.7 no.5
• /
• pp.285-290
• /
• 2012

In this paper, we propose a fast encoding algorithm for scalable video encoding without compromising coding performance. Through analysis on multiple motion estimation processes performed at the enhancement layer, we show redundant motion estimations and suggest the condition under which the redundant ones can efficiently be determined without additional memory. Based on the condition, the redundant motion estimation processes are excluded in the proposed algorithm. Simulation results show that the proposed algorithm is faster than the conventional fast encoding method without performance degradation and additional memory.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.1
• /
• pp.27-32
• /
• 2003

This paper describes to extend the fast algorithm fur the capacitance extraction of large three-dimensional object. The triangular meshes are used and refined adaptively in the area where the heavy charges reside in each iterative solving. This technique is applied to the capacitance extraction of a 68-pin cerquad package. The results show fast convergence, and this adaptive technique coupled with the fast algorithm is efficient to reduce the number of elements and computing time with least additional computational efforts in large three dimensional problems.