• Title/Summary/Keyword: min-sum

Search Result 489, Processing Time 0.033 seconds

Code Rate 1/2, 2304-b LDPC Decoder for IEEE 802.16e WiMAX (IEEE 802.16e WiMAX용 부호율 1/2, 2304-비트 LDPC 복호기)

  • Kim, Hae-Ju;Shin, Kyung-Wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.4A
    • /
    • pp.414-422
    • /
    • 2011
  • This paper describes a design of low-density parity-check(LDPC) decoder supporting block length 2,304-bit and code rate 1/2 of IEEE 802.16e mobile WiMAX standard. The designed LDPC decoder employs the min-sum algorithm and partially parallel layered-decoding architecture which processes a sub-matrix of $96{\times}96$ in parallel. By exploiting the properties of the min-sum algorithm, a new memory reduction technique is proposed, which reduces check node memory by 46% compared to conventional method. Functional verification results show that it has average bit-error-rate(BER) of $4.34{\times}10^{-5}$ for AWGN channel with Fb/No=2.1dB. Our LDPC decoder synthesized with a $0.18{\mu}m$ CMOS cell library has 174,181 gates and 52,992 bits memory, and the estimated throughput is about 417 Mbps at 100-MHz@l.8-V.

A FPGA Design of High Speed LDPC Decoder Based on HSS (HSS 기반의 고속 LDPC 복호기 FPGA 설계)

  • Kim, Min-Hyuk;Park, Tae-Doo;Jung, Ji-Won
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.23 no.11
    • /
    • pp.1248-1255
    • /
    • 2012
  • LDPC decoder architectures are generally classified into serial, parallel and partially parallel architectures. Conventional method of LDPC decoding in general give rise to a large number of computation operations, mass power consumption, and decoding delay. It is necessary to reduce the iteration numbers and computation operations without performance degradation. This paper studies horizontal shuffle scheduling(HSS) algorithm and self-correction normalized min-sum(SC-NMS) algorithm. In the result, number of iteration is half than conventional algorithm and performance is almost same between sum-product(SP) and SC-NMS. Finally, This paper implements high-speed LDPC decoder based on FPGA. Decoding throughput is 816 Mbps.

A Simple Stopping Criterion for the MIN-SUM Iterative Decoding Algorithm on SCCC and Turbo code (반복 복호의 계산량 감소를 위한 간단한 복호 중단 판정 알고리즘)

  • Heo, Jun;Chung, Kyu-Hyuk
    • 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).

An Area-efficient Implementation of Layered LDPC Decoder for IEEE 802.11n WLAN (IEEE 802.11n WLAN 표준용 Layered LDPC 복호기의 저면적 구현)

  • Jeong, Sang-Hyeok;Na, Young-Heon;Shin, Kyung-Wook
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.486-489
    • /
    • 2010
  • This paper describes a layered LDPC decoder which supports block length of 1,944 bits and code rate 1/2 for IEEE 802.11n WLAN standard. To reduce the hardware complexity, the min-sum algorithm and layered architecture is adopted. A novel memory reduction technique suitable for min-sum algorithm reduces memory size by 75% compared with conventional method. The designed processor has 200,400 gates and 19,400 bits memory, and it is verified by FPGA implementation. The estimated throughput is about 200 Mbps at 120 MHz clock by using Xilinx Virtex-4 FPGA device.

  • PDF

Perpendicular Magnetic Recording Channel Equalization Based on Gaussian Sum Approximation of Kalman Filters (Gaussian Sum Approximation을 기반으로 한 Kalman filter의 수직자기 채널 등화기법)

  • Kong, Gyu-Yeol;Cho, Hyun-Min;Choi, Soo-Yong
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.297-298
    • /
    • 2008
  • A new equalization method for perpendicular magnetic recording channels is proposed. The proposed equalizer incorporates the Gaussian sum approximation into a Kalman filtering framework to mitigate inter-symbol interference in perpendicular magnetic recording systems. The proposed equalizer consists of a bank of linear equalizers using the Kalman filtering algorithm and its output is obtained by combining the outputs of linear equalizers through the Gaussian sum approximation.

  • PDF

A study on solutions of Jisuguimundo using the range of magic sums (합의 범위를 이용한 지수귀문도 해의 탐구)

  • Kwon, Gyunuk;Park, Sang Hu;Song, Yun Min;Choi, Seong Woong;Park, Poo-Sung
    • Journal for History of Mathematics
    • /
    • v.27 no.2
    • /
    • pp.111-125
    • /
    • 2014
  • Jisuguimundo is an inimitable magic hexagon devised by Choi Seok-Jeong, who was the author of GuSuRyak as well as a prime minister in Joseon dynasty. Jisuguimundo, recorded in GuSuRyak, is also known as Hexagonal Tortoise Problem (HTP) because its nine hexagons resemble a tortoise shell. We call the sum of numbers in a hexagon in Jisuguimundo a magic sum, and show that the magic sum of hexagonal tortoise problem of order 2 varies 40 through 62 exactly and that of hexagonal tortoise problem of order 3 varies 77 through 109 exactly. We also find all of the possible solutions for hexagonal tortoise problem of oder 2.

Test Statistics for Volume under the ROC Surface and Hypervolume under the ROC Manifold

  • Hong, Chong Sun;Cho, Min Ho
    • Communications for Statistical Applications and Methods
    • /
    • v.22 no.4
    • /
    • pp.377-387
    • /
    • 2015
  • The area under the ROC curve can be represented by both Mann-Whitney and Wilcoxon rank sum statistics. Consider an ROC surface and manifold equal to three dimensions or more. This paper finds that the volume under the ROC surface (VUS) and the hypervolume under the ROC manifold (HUM) could be derived as functions of both conditional Mann-Whitney statistics and conditional Wilcoxon rank sum statistics. The nullhypothesis equal to three distribution functions or more are identical can be tested using VUS and HUM statistics based on the asymptotic large sample theory of Wilcoxon rank sum statistics. Illustrative examples with three and four random samples show that two approaches give the same VUS and $HUM^4$. The equivalence of several distribution functions is also tested with VUS and $HUM^4$ in terms of conditional Wilcoxon rank sum statistics.

Robust Computation of Polyhedral Minkowski Sum Boundary (다면체간의 강건한 민코스키합 경계면 계산)

  • Kyung, Min-Ho;Sacks, Elisha
    • Journal of the Korea Computer Graphics Society
    • /
    • v.16 no.2
    • /
    • pp.9-17
    • /
    • 2010
  • Minkowski sum of two polyedra is an operation to compute the sum of all pairs of points contained in the polyhedra. It has been a very useful tool to solve many geometric problems arising in the areas of robotics, NC machining, solid modeling, and so on. However, very few algorithms have been proposed to compute Minkowski sum of polyhedra, because computing Minkowski sum boundaries is susceptible to roundoff errors. We propose an algorithm to robustly compute the Minkowski sum boundaries by employing the controlled linear perturbation scheme to prevent numerically ambiguous and degenerate cases from occurring. According to our experiments, our algorithm computes the Minkowski sum boundaries with the precision of $10^{-14}$ by perturbing the vertices of the input polyhedra up to $10^{-10}$.

Estimation of polycyclic aromatic hydrocarbons emission from sewage sludge of sewerage treatment plants in Korea

  • Kim, Dong-Hwan;Hwang, Jong-Seob;Lee, Min-Hee;Ok, Gon
    • Proceedings of the Korean Environmental Sciences Society Conference
    • /
    • 2003.11a
    • /
    • pp.85-88
    • /
    • 2003
  • Polycyclic aromatic hydrocarbons (PARs) are an important group of organic contaminants present in sewage sludge, due to their persistence, toxic, bioaccumulative and long range transfer. These characters make themselves as Persistent Organic Pollutants(POPs) in Long Range Transboundary Air Pollutions convention(LRT AP) of Europe. A method of the gas chromatographic-mass spectrometric (GC-MS) determination of PARs present in sewage sludge was developed and applied to analyzed samples from five sewerage treatment plants (SWTPs), having different treatment types. PARs were extracted from freeze-dried samples by toluene 16 hours in a soxhlet extraction system. The sludge extracts were cleaned-up by an activated silica gel column chromatography. The sum of the 16 US Environmental Protection Agency PARs sewage sludge samples varied from 2.44 to 4.82 ${\mu}g$/g. Concentration of emission carcinogen PARs(PARcarc), such as Benzo(a)anthracene, Benzo(b)fluoranthene, Benzo(k)fluoranthene, Benzo(a)pyrene, Dibenzo(a, h)anthracene and Indeno(1, 2, 3-cd)pyrene ranged from 0.62 to 1.03 ${\mu}g$/g. The total amount of PAHs emission from sewage sludge in Korea was calculated as a top-down approach. PARs and $\sum$PAHcarc from sewage treatment plants had several pathway each by-products. In the ocean dumping, PAHs and $\sum$PAHcarc emissions were 1155.95 kg/year and 5040.32 kg/year. In recycle, PAHs and $\sum$PAHcarc emissions were 98.36 kg/year and 428.87 kg/year. In the landfill, PAHs and $\sum$PAHcarc emissions were 190.40 kg/year and 830.21 kg/year. In the incineration, PAHs and $\sum$PAHcarc emission were 33.10 kg/year and 830.21 kg/year. (In case of incineration, the whole provisions of PARs and $\sum$PAHcarc contained to flowed in sludge was supposed to be exhausted to environment through exhaust after incineration.)

  • PDF