http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : 서희종 (검색결과 39 건)
- 무료
- 기관 내 무료
- 유료
-
고성능 LDPC 코드를 생성하기 위한 최적화된 알고리듬
서희종 한국전자통신학회 2013 한국전자통신학회 논문지 Vol.8 No.8
In this paper, an algorithm having new edge growth with depth constraints for constructing Tanner graph of LDPC(Low density parity check) codes is proposed. This algorithm reduces effectively the number of small stoping set in the graph and has lower complexity than other algorithm. The simulation results shows the improved performance of the LDPC codes constructed by this algorithm. 본 논문에서, 성능 좋은 LDPC(Low density parity check) 코드을 위한 태너(Tanner) 그래프를 생성하는 알고리듬을 제안한다. 이 알고리듬은 뎁스 컨스트렌트(depth constraints)를 유지하면서 태너 그래프의 새로운 가지를 생성한다. 이 알고리듬은 그래프의 스토핑 셑(stopping set)을 효과적으로 줄이고, 기존의 다른 알고리듬보다도 낮은 계산복잡도를 갖는다. 모의시험을 통해서 이 알고리듬의 개선된 성능을 확인 할 수 있었다.
-
서희종 여수대학교 2001 論文集 Vol.16 No.-
Today networks are becoming ubiquitous, fast, and cheap. But carriers and vendors endeavor in making networks more reliable and secure. Rapid technical evolution, market pressures, and complexity have contributed to large outages in data and voice networks. Owing to the unreliable deployment and operation of otherwise fault-tolerant communication technologies and architectures, there are severe disruptions to thousands of users and enterprises. Network reliability growth make the required services satisfying and must concentrate infrastructure to realize economies of scale.
-
서희종 한국정보전략학회 2002 한국정보전략학회지 Vol.5 No.2
This paper presents effective algorithms for enumerating all the minimal cutsets of networks. A connection matrix represents the network. By reading or adding the branch, I propose an algorithm enumerating all the cutsets, which separates the sub-vertex set and a disjoint vertex set of the graph. This algorithm doesn't enumerate all the events which vertex and edge set can have, and it executes computation to only the number of minimal cutsets. The space needed is proportional to the square of the number of the vertexes, and the time complexity is in the order of the number of cutsets. The method in this paper is most effective because it computes only the minimal cutsets by reading respectively and/or adding reciprocally the edge in the row of its connection matrix.
-
徐熙宗 여수대학교 1987 論文集 Vol.1 No.-
This paper is concerned with the evaluation of the source to K-terminal Reliability, and describes an Algorithm how to compute it. Procedure 1 makes exact paths with respect to each vertex inK-terminal. On a vertex which is a sorurce, procedure 2 makes the polynomial disjoint. Probability expression, in which event has a probability, describes the probabilistic system. Using this Algorithm, a simple example is implemented by a computer. This Algorithm covers the overall Reliability which is a essential problem with regard to the Reliability calculation.
-
-
MPEG-4의 형상 정보 부호화에 사용되는 고속 움직임 추정부 알고리듬
서희종 여수대학교 2002 論文集 Vol.17 No.-
This paper proposes a fast motion estimation algorithm for MPEG-4 shape coding. The proposed algorithm is based on inherent properties of shape coding as well as shape information, i.e., context-based motion estimation feature, motion vector(MV) correlation between neighboring binary alpha blocks (BAB's), and binary feature of shape information. By using these properties, the proposed algorithm can achieve a high processing speed. Simulation results show that our algorithm can reduce the computational complexity of ME for shape coding up to 90% at least even for the worst case. Therefore, the algorithm is suitable for real-time software applications of MPEG-4 shape encoding.
-
Efficient LDPC Decoding Algorithm Using Node Monitoring
서희종 한국전자통신학회 2015 한국전자통신학회 논문지 Vol.10 No.11
In this paper, we proposed an efficient algorithm using Node monitoring (NM) and Piecewise Linear Function Approximation (NP) for reducing the complexity of LDPC code decoding. Proposed NM algorithm is based on a new node-threshold method together with message passing algorithm. Piecewise linear function approximation is used to reduce the complexity of the algorithm. This new algorithm was simulated in order to verify its efficiency. Complexity of our new NM algorithm is improved to about 20% compared with well-known methods according to simulation results.
-
서희종 여수대학교 1997 論文集 Vol.11 No.2
In this paper, we propose a effective and new algorithm by which encoders for good trellis code are constructed, and construct encoder with good code by the algorithm Relations between systematic feedback and its equivalent non-systematic feedforware code are clarified and formulated by mathmetics. After a relative structure of the registers of encoder is set, the states of non-systematic feedforward encoder are representated as a state diagram, and non-systematic feedforward encoder is constructed. An algorithm by which non-systematic feefforward and its equivalent systematic feedback encoder are constructed is proposed. The algorithm is effective, because of searching only necessary state of the state diagram. As examples, rate 1/2 trellis coded QPSK, rate 2/3 trellis coded 8-PSK, and rate 3/4 trellis coded 16-QASK are examined.
-
서희종 여수대학교 1998 論文集 Vol.12 No.2
In this paper, algorithms for conversion from feedforward to feedback codes, and vice veras are presented. The former is based on the trellis search and the latter on the existing method of an algebraic solution, is newly modified. The algorithms work on codes of rate R=k/n.
-
서희종 여수대학교 1998 論文集 Vol.13 No.2
After discussing a few derivations of the polynomial form of a boolean function, the applications of this form are discussed. The polynomial form is shown to be very useful for understanding of switching function on fault tolerant electronics systems. In this paper, tutorial theories are explained.
ScienceON
스콜라연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
