• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 전기.전자공학 학술대회 논문집
• /
• 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.

• 산업경영시스템학회지
• /
• 제37권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.

• 한국정보통신학회논문지
• /
• 제13권10호
• /
• pp.2227-2234
• /
• 2009

이동체에 대해서 위성을 이용한 통신 방식을 규정하고 있는 DVB-SSP 표준화에서는 Physical Layer와 Upper Layer의 두 단계로 부호화 및 복호화를 한다. 수신단에서 Physical Layer의 복호 방식인 LDPC 복호 후 Upper Layer의 erasure RS 복호를 위해, CRC 검사를 수행하여 수신된 데이터에서 1 bit의 오류발생에도 IP 패킷 모두를 삭제함으로써 복호 시 비효율성을 증가시킬 수 있다. 따라서 본 논문에서는 LDPC 복호기에 출력되는 LLR 값을 이용하여 IP 패킷 전체를 삭제하는 것이 아니라 LLR 값이 낮은 비트만 선택적으로 삭제하는 방식을 제안하며, 이를 시뮬레이션 하여 기존의 CRC 방식과 비교하였다.

• 한국전자파학회논문지
• /
• 제20권9호
• /
• pp.835-842
• /
• 2009

이동체에 대해서 위성을 이용한 통신 방식을 규정하고 있는 DVB-SSP(Satellite Services for Portable devices) 표준화에서는 physical layer와 upper layer의 두 단계로 부호화 및 복호화를 한다. 수신단에서 physical layer의 복호 방식인 LDPC 복호후 upper layer의 erasure RS 복호를 위해, CRC 검사를 수행하여 수신된 데이터에서 1 bit의 오류에도 IP 패킷 모두를 삭제함으로써 복호시 오류가 발생하지 않은 정보가 손실될 수 있다. 따라서 본 논문에서는 두 가지 방식의 복호 알고리즘을 제안하며, LDPC 복호기에 출력되는 LLR 값을 이용하여 IP 패킷 전체를 삭제하는 것이 아니라 LLR 값이 낮은 비트만 선택적으로 삭제하는 방식과 삭제되는 개수에 따라 복호 알고리즘을 혼합하는 혼합형 복호 알고리즘을 제안하며, 이를 시뮬레이션하여 기존의 CRC 방식과 비교하였다. 그 결과 제안한 알고리즘이 Gaussian 채널일 때, 성능이 약 0.2 dB 개선됨을, 이동하는 철도의 환경에서는 오류 마루현상이 제거됨을 알 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권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).

• 디지털산업정보학회논문지
• /
• 제11권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
• /
• 제23권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.

• 한국통신학회논문지
• /
• 제34권11B호
• /
• pp.1133-1141
• /
• 2009

본 논문에서는 무선 센서 망으로 k-연결 (k+1)-감지 고장 감내 위상을 구성하는 분산 위상 제어 프로토콜을 제시한다. 센서 망에 있어 최근에 주목받고 있는 근본적인 문제는 최소한의 활동하는 노드들로 위상을 구성하며, 다양한 응용과 환경에 적합한 감지도와 망 연결수를 제공하는 것이다. 망의 수용 능력을 증대시키는 동시에 에너지 효율성을 개선하고 더불어 망의 연결성을 유지하기 위해서, 많은 위상 제어 알고리즘들이 제안되어 왔다. 대부분의 알고리즘들은 연결되는 링크들의 수를 줄임으로써, 노드들의 고장이나 파손시에 여분의 경로배정이 어렵게 되는 문제를 발생시킨다. 특정 감지도를 보장하며 이 문제를 해결하는 프로토콜이 제안되었으나, 감지도 계산을 위해서는 정확한 위치정보가 필요하고, k-감지인 경우에 대부분의 활동 센서들이 2k-연결을 유지한다. 우리는 감지범위의 반지름이 통신 범위의 반지름의 두 배인 조건이 연결이 감지범위를 함의하기 위한 필요충분조건임을 증명하고, 이에 기반하여 무선 센서 망에서 k-연결을 제공하며 (k+1)-감지를 보장하는 고장 감내 위상을 구성하는 프로토콜을 제시한다. 제안한 분산된 알고리즘은 정확한 위치정보 없이 (k+1)-감지를 보장하며, 복잡도는 O(1) 이다. 모의 실험하여 패킷손실율과 전송 지연시간 그리고 에너지 소비율을 분석 하였다.