• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.4
• /
• pp.11-16
• /
• 2004

A simple stopping criterion for iterative decoding based on min-sum processing is presented. While most stopping criteria suggested in the literature, are based on Cross Entropy (CE) and its simplification, the proposed stopping criterion is to check if a decoded sequence is a valid codeword along the encoder trellis structure. This new stopping criterion requires less computational complexity and saves mem4)ry compared to the conventional stopping rules. The numerical results are presented on the 3GPP turbo code and a Serially Concatenated Convolutional Cods (SCCC).

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.3
• /
• pp.201-207
• /
• 2018

There is no known polynomial time algorithm for random-type quadratic assignment problem(RQAP) that is a NP-complete problem. Therefore the heuristic or meta-heuristic approach are solve the approximated solution for the RQAP within polynomial time. This paper suggests polynomial time algorithm for random type quadratic assignment problem (QAP) with time complexity of $O(n^2)$. The proposed algorithm applies one-to-one matching strategy between ascending order of sum of distance for each location and descending order of sum of quantity for each facility. Then, swap the facilities for reflect the correlation of distances of locations and quantities of facilities. For the experimental data, this algorithm, in spite of $O(n^2)$ polynomial time algorithm, can be improve the solution than genetic algorithm a kind of metaheuristic method.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.5
• /
• pp.107-112
• /
• 2015

This paper proposes a simplified algorithm devised to obtain optimal solution to the marriage problem. In solving this problem, the most widely resorted to is the Gale-Shapley algorithm with the time complexity of $O({\mid}V{\mid}^2{\mid}E{\mid})$. The proposed algorithm on the other hand firstly constructs a $p_{ij}$ matrix of inter-preference sum both sexes' preference over the opposite sex. Secondly, it selects $_{min}p_i$ from each row to establish ${\mid}p_{.j}{\mid}{\geq}2,j{\in}S$, ${\mid}p_{.j}{\mid}=1$, $j{\in}H$, ${\mid}p_{.j}{\mid}=0$, $j{\in}T$. Finally, it shifts $_{min}\{_{min}p_{ST},p_{SH}+p_{HT\}$ for $_{min}P_{ST}$ of $S{\rightarrow}T$ and $p_{SH}+p_{HT}$, $p_{HT}<_{min}p_{ST}$ of $S{\rightarrow}H$, $H{\rightarrow}T$. The proposed algorithm has not only improved the Gale-Shapley's algorithm's complexity of $O({\mid}V{\mid}^2{\mid}E{\mid})$ to $O({\mid}V{\mid}^2)$ but also proved its extendable use on unbalanced marriage problems.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.12
• /
• pp.42-49
• /
• 2016

This paper proposes a low-complexity generator which finds the first two minimum values using bit-serial scheme. A low-complexity generator is an important part for low-area LDPC decoders based on the min-sum decoding algorithm because the hardware complexity of generators utilizes a significant portion of LDPC decoders. To reduce hardware complexity, bit-serial LDPC decoders has been studied. The generator of the existing bit-serial LDPC decoders can find only the first minimum value, and thus it leads to a BER performance degradation. The proposed generator using bit-serial scheme finds the first two minimum values. Hence, it can improve the BER performance. In addition, the area-time complexity of the proposed generator is lower than those of the existing generators finding the first two minima.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.6
• /
• pp.340-345
• /
• 2002

In this paper, we deal with the following facility location problem. Given a set P of n points in the plane, find two (discrete) centers p and q in P that minimize the sum of there distance plus the distance of any other point to the closer center. In this paper, we propose an Ο(n$^2$1ogn)-time algorithm to compute the two centers.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.383-387
• /
• 2015

Bowel and rectal diseases are on the increase by irregular life and westernized eating habits of modern people, especially rectal cancer, which accounts for 50% of the entire colon cancer. For the initial rectal cancer, because there is no portion projecting on the surface, if not see inside the tissue with ultrasound, you make an errors that misdiagnosis as rectal abscess. However there is a need for more accurate diagnosis, because it is sometimes difficult to distinguish abscess from rectal cancer depending on staging, in spite of the ultrasonic diagnosis. Therefore, this study was performed quantitative analysis by using a computer algorithm for rectal cancer and abscess image. Each of 20 cases about normal, abscess and cancer by setting analysis region ($50{\times}50$ pixels) applies to GLCM algorithm and Autocorrelation, Max probability, Sum average, Sum variance in each image were analyzed by comparing the 4 single parameter. Consequently, The high lesion detection efficiency was presented 100% by the 3 parameter of Autocorrelation, Max probability, Sum variance and the parameter of Sum average presents 95% in cancer, more than 90% in abscess. Those parameters are valuable in distinction standard about normal, cancer and abscess in rectum. It is sufficient availability as a computer assisted diagnosis system depended on clinical using.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.8
• /
• pp.644-649
• /
• 2013

For effective DC-free coding in the optical storage systems, the Guided Scrambling algorithm is widely used. To reduce digital discrepancy of the coded sequence, functions of digital sum value (DSV) are used as criteria to choose the best candidate. Among these criteria, the minimum digital sum value (MDSV), minium squared weight (MSW), and minimum threshold overrun (MTO) are popular methods for effective DC-suppression. In this paper, we formulate integer programming models that are equivalent to MDSV, MSW, and MTO GS coding. Incorporating the MDSV integer programming model in MaxMin setting, we develop an integer programming model that computes the worst case MDSV bound given scrambling polynomial and control bit size. In the simulation, we compared the worst case MDSV bound for different scrambling polynomial and control bit sizes. We find that careful selection of scrambling polynomial and control bit size are important factor to guarantee the worst case MDSV performance.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.798-801
• /
• 2010

This paper describes an efficient architecture for LDPC(Low-Density Parity Check) decoder, which supports three block lengths (648, 1,296, 1,944) of IEEE 802.11n standard. To minimize hardware complexity, the min-sum algorithm and block-serial layered structure are adopted in DFU(Decoding Function Unit) which is a main functional block in LDPC decoder. The optimized H-ROM structure for multi block lengths reduces the ROM size by 42% as compared to the conventional method. Also, pipelined memory read/write scheme for inter-layer DFU operations is proposed for an optimized operation of LDPC decoder.

• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.1872-1873
• /
• 2007

최근 유럽에서는 사용자와 운영자들의 요구에 부응하여 기존 DVB 위성 광대역 서비스에 대한 표준을 DVB-S에서 DVB-S2로 업그레이드 시켰다. DVB-S2는 ACM을 적용하여 여러 채널환경에서 기존의 표준보다 안정적인 전송과 높은 효율을 보여준다. DVB-S2 시스템은 FEC 알고리듬으로써 LDPC와 BCH를 사용하고 있다. LDPC는 R. G. Gallager에 의해 고안된 블록부호화 방식으로 검사행렬 H에서 1의 sparse 한 성질을 이용하여 큰 블록에서 더 좋은 성능을 발휘하도록 되어있다. 본 논문에서는 DVB-S2의 중요 서브시스템인 FEC블록 중 LDPC 복호기에 관하여 ACM을 적용하여 상위수준 시뮬레이션을 실시하였다. 실험결과 각 변조 방식 및 부호율에 따라서 BER이 SNR 0에서 14dB까지 넓게 분포함을 확인하였다. 그러므로 채널 환경에 따라 변조방식과 부호율을 달리하여 속도를 향상시키거나 데이터의 안정성을 높일 수 있다. 그리고 이 때 LDPC 복호기가 충분히 성능을 발휘함을 알 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.9
• /
• pp.1095-1102
• /
• 2016

In this paper, we propose a decoding scheme that can apply to a three dimensional turbo product code(TPC) with a single parity check code(SPC). In general, SPC is used an axis with shortest code length in order to maximize a code rate of the TPC. However, SPC does not have any error correcting capability, therefore, the error correcting capability of the three-dimensional TPC results in little improvement in comparison with the two-dimensional TPC. We propose two schemes to improve performance of three dimensional TPC decoder. One is $min^*$-sum algorithm that has advantages for low complexity implementation compared to Chase-Pyndiah algorithm. The other is a modified serial iterative decoding scheme for high performance. In addition, the simulation results for the proposed scheme are shown and compared with the conventional scheme. Finally, we introduce some practical considerations for hardware implementation.