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

• Journal of information and communication convergence engineering
• /
• v.6 no.1
• /
• pp.59-63
• /
• 2008

The methods or algorithms which can accelerate simulation speed became of great importance, as the modeling and simulation methodology for discrete event systems is used in many areas such as model validation/verification and performance evaluation. This paper proposes a tool named, DEVSIF composer. The tool is made of an automated compiled simulation technology and it builds a new composed model which can be executed much fast by composing the component models together. Models are described by our new specification language DEVSIF, which is compatible with object-oriented language and supports representation of a hierarchical model structure. Experimental results demonstrates that DEVSIF composer enhances the simulation speed of a transformed DEVS model 5 times faster than that of the original ones in average.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.275-284
• /
• 2010

The current multihome-aware protocols (like stream control transmission protocol (SCTP) or parallel TCP for concurrent multipath data transfer (CMT) are not designed for high-capacity and large-latency networks; they often have performance problems transferring large data files over shared long-distance wide area networks. It has been shown that SCTP-CMT is more sensitive to receive buffer (rbuf) constraints, and this rbuf-blocking problem causes considerable throughput loss when multiple paths are used simultaneously. In this research paper, we demonstrate the weakness of SCTP-CMT rbuf constraints, and we then identify that rbuf-blocking problem in SCTP multihoming is mostly due to its loss-based nature for detecting network congestion. We present a simulation-based performance comparison of FAST TCP versus SCTP in high-speed networks for solving a number of throughput issues. This work proposes an end-to-end transport layer protocol (i.e., FAST TCP multihoming as a reliable, delaybased, multihome-aware, and selective ACK-based transport protocol), which can transfer data between a multihomed source and destination hosts through multiple paths simultaneously. Through extensive ns-2 simulations, we show that FAST TCP multihoming achieves the desired goals under a variety of network conditions. The experimental results and survey presented in this research also provide an insight on design decisions for the future high-speed multihomed transport layer protocols.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1379-1382
• /
• 1997

We introduce a fast implementation of the adaptive transversal filter which uses least-mean-square(LMS) algorithm. The fast Hadamard transform(FHT) is used for the implementation of the filter. By using the proposed filter we can get the significant time reduction in computatioin over the conventional time domain LMS filter at the cost of a little performance. By computer simulation, we show the comparison of the propsed Hadamard-domain filter and the time domain filter in the view of multiplication time, mean-square error and robustness for noise.

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

• Proceedings of the KIEE Conference
• /
• 2007.10a
• /
• pp.105-106
• /
• 2007

We present a fast reconstruction technique for elliptic objects, which can be applied to real-time computer tomography (CT) for simple geometric objects. It will be also shown that only 3 projections are needed to reconstruct an ellipse. A piecewise quadratic model is also proposed for more efficient Kalman filter based support estimation, which is used for the fast reconstruction technique. The performance of the piecewise quadratic model is compared with that of the existing piecewise linear model. Simulation results for the fast reconstruction are also presented.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.3
• /
• pp.103-114
• /
• 1994

This paper proposes an implementation of DCT (Discrete Cosine Transform) and IDCT (Inverse DCT) using a fast DCT algorithm with shift and addition operations instead of multiplications Based on the proposed algorithm, a new VLSI architecture for the DCT and the IDCT is proposed. It shows modularity , regularity and capability for multiprocessing. Its performance is also simulated by a simulation software, "Compass". The results of the simulation provide the quality of decompression images, the increase in processing speed, representing the superiority of the proposed architecture.

• Nuclear Engineering and Technology
• /
• v.55 no.7
• /
• pp.2474-2482
• /
• 2023

The development of fast reactors with complex designs and operation status requires more accurate and effective simulation. The Monte-Carlo method can generate multi-group cross-sections in arbitrary geometry without approximation on resonances treatment and leads to good results in combination with diffusion codes. However, in previous studies, the coupling of Monte-Carlo generated multi-group cross-sections (MC-MGXS) and transport solvers has shown relatively large biases in fast reactor problems. In this paper, the main contribution to the biases is proved to be the neglect of the angle-dependence of the total cross-sections. The flux-moment homogenization technique (MHT) is proposed to take into account this dependence. In this method, the angular dependence is attributed to the transfer cross-sections, keeping an independent form for the total sections. For the MET-1000 benchmark, the multi-group transport simulation results with MC-MGXS generated with MHT are improved by 700 pcm and an additional 120 pcm with higher order scattering. The factors that cause the residual bias are discussed. The core power distribution bias is also significantly reduced when MHT is used. It proves that the MCMGXS with MHT can be applicable with transport solvers in fast reactor analysis.

• Nuclear Engineering and Technology
• /
• v.52 no.6
• /
• pp.1110-1119
• /
• 2020

The Floating Absorber for Safety at Transient (FAST) is a safety device used in the innovative Sodium-cooled Fast Reactor (iSFR). The FAST insert negative reactivity under transient or accident conditions. However, behavior of the FAST is still unclear under transient conditions. Therefore, the existing Floating Absorber for Safety at Transient Analysis Code (FASTAC) is improved to analyze the FAST movement by considering the reactivity and temperature distribution within the reactor core. The current FAST system is simulated under a single control rod withdrawal accident condition. In this investigation, the reactor thermal power does not return to its initial thermal power even if the FAST inserts negative reactivity. Only a 9 K of coolant temperature margin, in the hottest fuel assembly at EOL, can lead to unnecessary insertion of the negative reactivity. On the other hand, the FASTs cannot contribute to controlling the reactivity when normalized radial power is less than 0.889 at BOL and 0.972 at EOL. These simulation results suggest that the current FAST design needs to be optimized depending on its installed location. Meanwhile, the FAST system keeps the fuel, cladding and coolant temperatures below their limit temperatures with given conditions.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.1
• /
• pp.45-55
• /
• 1993

In this paper, a two-stage block matching algorithm (BMA), which can reduce greatly the computational complexity of the conventional BMAs, is proposed, in which the onedimensional distortion measure based on the integral projection is introduced to determine the candidate motion vectors and then among them a final motion vector is detected based on the conventional two-dimensional distortion measure. Due to the one-dimensional calculation of a distortion measure, the proposed algorithm can reduce the computational complexity of the conventional BMA (full search method with a 16$\times$16 block) by a factor of 4, with its performance comparable to those of the conventional ones. Simulation results based on the original and noisy image sequences are shown. Also the simulation of the proposed method combined with the MPEG (Moving Picture Experts Group) SM3 (Simulation Model Three) is presented. Computer simulation shows that the proposed algorithm is fast with its performance comparable to those of the conventional ones.