• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2735-2751
• /
• 2020

The emergence of Software Defined Networking (SDN) overcomes the limitations of traditional networking architectures. There are some advantages in SDN which are centralized global network view, programmability, and separation of the data plane and control plane. Due to the limitation of data plane storage capacity in SDN, it is necessary to process the redundancy rules of switch. In this paper, we propose a method for active detection and processing of redundant rules. We use the result generated by the customized probe package to detect redundant rules. And by checking the forwarding behavior of probe packets in the data plane, the redundancy rules are further processed. Furthermore, in order to quickly check the dynamic networks, we propose an incremental algorithms for rapidly evolve the network strategies. We conduct simulation experiments on Matlab to verify the feasibility of the algorithm. The influence of some parameters on the result are discussed.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.506-509
• /
• 1988

This paper describes an effective knowledge acquisition method in the fault diagnosis expert system for the electronic switching system TDX-1A. The knowledge acquisition procedure consists of the knowledge collection, the fault diagnosis modeling and the knowledge representation. Furthermore, to improve the performance of the knowledge bases with rule and frame representation, we showed the knowledge base checking methodlogy by using redundancy and inconsistency check algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.37 no.4
• /
• pp.98-105
• /
• 2014

According to a simple survey on the current status of the assembly line design, it was found that trial and error methods on the basis of experiences have been used mainly in domestic manufacturing industries, even though there exist a lot of excellent line balancing studies. It seems that more practical researches should be carried out to develop user-oriented line balancing tools especially for small and medium-sized enterprises. This study presents a design of the line balancing tool which can support the line balancing tasks of nonspecialists. The proposed design tool is composed of three major modules: pre-process, line balancing, and post-process. In particular, pre-process and post-process are newly proposed to increase its ease of use. We applied the proposed design to a test problem and test result showed that our practical method may contribute to enhance the efficiency of production operations management.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.2227-2234
• /
• 2009

DVB-SSP is a new broadcasting system for hybrid satellite communications, which supports mobile handheld systems and fixed terrestrial systems. An upper layer, including erasure Reed-Solomon error correction combined with cyclic redundancy check. However, a critical factor must be considered in upper layer decoding. If there is only one bit error in an IP packet, the entire IP packet is considered as unreliable bytes, even if it contains correct bytes. If, for example, there is one real byte error, in an IP packet of 512 bytes, 511 correct bytes are erased from the frame. Therefore, this paper proposed upper layer decoding methods; LLR-based decoding. By means of simulation we show that the performance of the proposed decoding algorithm is superior to that of the conventional one.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.9
• /
• pp.835-842
• /
• 2009

DVB-SSP is a new broadcasting system for hybrid satellite communications, which supports mobile handheld systems and fixed terrestrial systems. However, a critical factor must be considered in upper layer decoding which including erasure Reed-Solomon error correction combined with cyclic redundancy check. If there is only one bit error in an IP packet, the entire IP packet is considered as unreliable bytes, even if it contains correct bytes. IF, for example, there is one real byte error, in an If packet of 512 bytes, 511 correct bytes are erased from the frame. Therefore, this paper proposed two kinds of upper layer decoding methods; LLR-based decoding and hybrid decoding. By means of simulation we show that the performance of the proposed decoding algorithm is superior to that of the conventional one.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.2
• /
• pp.658-675
• /
• 2022

This paper presents a fast-simplified successive cancellation (SC) flipping (Fast-SSC-Flip) decoding algorithm for polar code. Firstly, by researching the probability distribution of the number of error bits in a node caused by channel noise in simplified-SC (SSC) decoder, a measurement criterion of node reliability is proposed. Under the guidance of the criterion, the most unreliable nodes are firstly located, then the unreliable bits are selected for flipping, so as to realize Fast-SSC-Flip decoding algorithm based on node reliability (NR-Fast-SSC-Flip). Secondly, we extended the proposed NR-Fast-SSC-Flip to multiple node (NR-Fast-SSC-Flip-ω) by considering dynamic update to measure node reliability, where ω is the order of flip-nodes set. The extended algorithm can correct the error bits in multiple nodes, and get good performance at medium and high signal-to-noise (SNR) region. Simulation results show that the proposed NR-Fast-SSC-Flip decoder can obtain 0.27dB and 0.17dB gains, respectively, compared with the traditional Fast-SSC-Flip [14] and the newly proposed two-bit-flipping Fast-SSC (Fast-SSC-2Flip-E2) [18] under the same conditions. Compared with the newly proposed partitioned Fast-SSC-Flip (PA-Fast-SSC-Flip) (s=4) [18], the proposed NR-Fast-SSC-Flip-ω (ω=2) decoder can obtain about 0.21dB gain, and the FER performance exceeds the cyclic-redundancy-check (CRC) aided SC-list (CRC-SCL) decoder (L=4).

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.3
• /
• pp.31-43
• /
• 2015

In this paper, we discuss a code generation technique for custom transport triggered architecture (TTA) from a high-level language structure. This methodology is implemented by using TTA-based Co-design Environment (TCE) tool. The results show how the scheduler exploits instruction level parallelism in the custom target architecture and source program. Thus, the scheduler generates parallel TTA instructions using lower cycle counts than the sequential scheduling algorithm. Moreover, we take Tensilica tool to make a comparison with TCE. Because of the efficiency of TTA, TCE takes less execution cycles compared to Tensilica configurations. Finally, this paper shows that it requires only 7 cycles to generate the parallel TTA instruction set for implementing Cyclic Redundancy Check (CRC) applications as an input design, and presents the code generation technique to move complexity from the processor software to hardware architecture. This method can be applicable lots of channel Codecs like CRC and source Codecs like High Efficiency Video Coding (HEVC).

• Journal of Astronomy and Space Sciences
• /
• v.23 no.3
• /
• pp.269-288
• /
• 2006

We revised the OTFTOOL which was developed in Five College Radio Astronomy Observatory (FCRAO) for the On-The-Fly (OTF) observation. Besides the improvement of data resampling function of conventional OTFTOOL, we added a new SELF referencing mode and data pre-reduction function. Since OTF observation data have a large redundancy, we can choose and use only good quality samples excluding bad samples. Sorting out the bad samples is based on the floating level, rms level, antenna trajectory, elevation, $T_{sys}$, and number of samples. And, spikes are also removed. Referencing method can be chosen between CLASSICAL mode in which the references are taken from the OFFs observation and ELLIPSOIDAL mode in which the references are taken from the inner source free region (this is named as SELF reference). Baseline is subtracted with the source free channel windows and the baseline order chosen by the user. Passing through these procedures, the raw OTF data will be an FITS datacube. The revised-OTFTOOL maximizes the advantages of OTF observation by sorting out the bad samples in the earliest stage. And the new self-referencing method, the ELLIPSOIDAL mode, is very powerful to reduce the data. Moreover since it is possible to see the datacube at once without moving them into other data reduction programs, it is very useful and convenient to check whether the data resampling works well or not. We expect that the revised-OTFTOOL can be applied to the facilities of the OTF observation like SRAO, NRAO, and FCRAO.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1133-1141
• /
• 2009

In this paper, we present a distributed fault-tolerant topology control protocol that configure a wireless sensor network to achieve k-connectivity and (k+1)-coverage. One fundamental issue in sensor networks is to maintain both sensing coverage and network connectivity in order to support different applications and environments, while some least active nodes are on duty. Topology control algorithms have been proposed to maintain network connectivity while improving energy efficiency and increasing network capacity. However, by reducing the number of links in the network, topology control algorithms actually decrease the degree of routing redundancy. Although the protocols for resolving such a problem while maintaining sensing coverage were proposed, they requires accurate location information to check the coverage, and most of active sensors in the constructed topology maintain 2k-connectivity when they keep k-coverage. We propose the fault-tolerant topology control protocol that is based on the theorem that k-connectivity implies (k+1)-coverage when the sensing range is at two times the transmission range. The proposed distributed algorithm does not need accurate location information, the complexity is O(1). We demonstrate the capability of the proposed protocol to provide guaranteed connectivity and coverage, through both geometric analysis and extensive simulation.