• Title/Summary/Keyword: 반복 횟수

Search Result 708, Processing Time 0.027 seconds

Mechanical Properties of Soil under Repeated Load (반복하중(反復荷重)을 받는 흙의 역학적(力學的) 특성(特性))

  • Chun, Byung Sik;Park, Heung Gyu
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.10 no.4
    • /
    • pp.113-122
    • /
    • 1990
  • In case of repeated wheel-loads are acted on subbase course material, field test is generally executed to get the design standard, but the study shows dynamic properties of soils especially under repeated loads, which have not been well known to us. We try not only to obtain yield stress and elastic modulus of soil in terms of rheological model interpretation but also to investigate the influence of the repeated loads. Yield stress of soil induces hardening until approaching critical value along with the increase in number of cycle, whereas the change in modulus of elasticity with respect to the number of cycle greatly depends on the strength of repeated stress, if weak in strength of repeated stress, the modulus of elasticity increases along with the number of cycle, while if strong, it tends to decrease.

  • PDF

An Efficient Iterative Decoding Stop Criterion Algorithm for Reducing Computation of Turbo Code (터보부호의 계산량 감소를 위한 효율적인 반복중단 알고리즘)

  • Jeong Dae-Ho;Lim Soon-Ja;Kim Hwan-Yong
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.42 no.6 s.336
    • /
    • pp.9-16
    • /
    • 2005
  • It is well blown about the fact that turbo code has better the BER performance as the number of decoding iterations increases in the AWGN channel environment. However, as the number of decoding iterations is increased under the several channel environments, any further iteration results in very little improvement, and it requires much delay and computation in proportion to the number of decoding iterations. In this paper, it proposes the efficient iterative decoding stop criterion algorithm which can largely reduce the computation and the average number of decoding iterations of turbo code. Through simulations, it is verifying that the proposed algorithm can efficiently stop the iterative decoding by using the variance value of LLR and can largely reduce the computation and the average number of decoding iterations without BER performance degradation. As a result of simulation, the computation for the proposed algerian is reduced by about $40\%$ compared to conventional CE algorithm. The average number of decoding iterations for the proposed algorithm is reduced by about $9.94\%$ and $8.32\%$ compared to conventional HDA and SCR algorithm respectively, and by about $2.16\%{\~}7.84\%$ compared to conventional CE algorithm.

Performance of UEP Channel Coding with Iterative Decoding of SCCC under Rayleigh Fading Channel (Rayleigh Fading 채널에서 SCCC의 반복복호에 의한 UEP 채널 부호화의 성능 분석)

  • 이연문;조경식;정차근
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.71-74
    • /
    • 1999
  • 본 논문에서는 이동 무선 채널에 의한 동영상의 실시간 전송을 위해 채널 상태에 따라 터보코드의 반복 복호 횟수를 자동으로 결정한 UEP(Unequal Error Protection) 채널 부호화 방법에 대해 레일리 페이딩 채널에서의 성능을 분석한다. 이 부호화 방법은 열악한 채널 환경에서 우선 순위가 높은 정보에 보다 많은 반복 횟수가 부과되게 함으로써 헤더 정보나 움직임 벡터 등과 같이 동영상 신호의 복원에 중요한 정보에 대한 오류의 전파효과를 억제시킬 수 있다. 연집 오류의 주요인인 레일리 페이딩 채널에서 복호기의 성능을 분석하기 위해 컴퓨터 모의실험을 수행해 그 결과를 제시한다.

  • PDF

Efficient stop criterion algorithm of the turbo code using the maximum sign change of the LLR (LLR 최대부호변화를 적용한 터보부호의 효율적인 반복중단 알고리즘)

  • Shim Byoung-Sup;Jeong Dae-Ho;Lim Soon-Ja;Kim Tae-Hyung;Kim Hwan-Yong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.5 s.347
    • /
    • pp.121-127
    • /
    • 2006
  • It is well known the fact that turbo codes has better performance as the number of iteration and the interleaver size increases in the AWGN channel environment. However, as the number of iteration and the interleaver size are increased, it is required much delay and computation for iterative decoding. Therefore, it is important to devise an efficient criterion to stop the iteration process and prevent unnecessary computations and decoding delay. In this paper, it proposes the efficient stop criterion algorithm for turbo codes using the maximum sign change of LLR. It is verifying that the proposal variable iterative decoding controller can be reduced the average iterative decoding number compared to conventional schemes with a negligible degradation of the error performance.

Quantization Performances and Iteration Number Statistics for Decoding Low Density Parity Check Codes (LDPC 부호의 복호를 위한 양자화 성능과 반복 횟수 통계)

  • Seo, Young-Dong;Kong, Min-Han;Song, Moon-Kyou
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.2
    • /
    • pp.37-43
    • /
    • 2008
  • The performance and hardware complexity of LDPC decoders depend on the design parameters of quantization, the clipping threshold $c_{th}$ and the number of quantization bits q, and also on the maximum number of decoding iterations. In this paper, the BER performances of LDPC codes are evaluated according to the clipping threshold $c_{th}$ and the number of quantization bits q through the simulation studies. By comparing the quantized Min-Sum algorithm with the ideal Min-Sum algorithm, it is shown that the quantized case with $c_{th}=2.5$ and q=6 has the best performance, which approaches the idea case. The decoding complexities are calculated and the word error rates(WER) are estimated by using the pdf which is obtained through the statistical analyses on the iteration numbers. These results can be utilized to tradeoff between the decoding performance and the complexity in LDPC decoder design.

A Study of Iteration Method for 2-Dimensional 2-Group Diffusion Problems (2차원 2군 확산 문제의 반복법에 대한 고찰)

  • Jong Hwa Chang;Kil Yoo Kim;Chang Hyun Chung
    • Nuclear Engineering and Technology
    • /
    • v.15 no.1
    • /
    • pp.33-40
    • /
    • 1983
  • It is shown that the Shanks sequence $E_{k}$-transformation and the conventional extrapolation method are theoretically related. The $E_1$$^2$-transformation method is then applied for the multigroup diffusion problems. The diffusion code, CITATION, is modified for this study and the computing time is compared for each iteration tactics. The Equipose method, in which only sing1e inner iteration for each energy group is carried for an outer iteration, has been known as the fastest iteration method. However, in the case of 3-group problems, the proposed method, in which the number of inner iteration for the fast and thermal group is 2 and 1 respectively, gives better convergency than the Equipose method by about 12%. The double extrapolation method results in faster computing time than the single extrapolation method without computing storage problem. It is, however, to note that this method is verified only for a two-group treatment.t.

  • PDF

Repeated Reading Experiences of Adults: Centered on Lifelong Education Center Students at Chonbuk National University (성인의 반복독서 경험에 관한 연구 - 전북대학교 평생교육원 학생들을 중심으로 -)

  • Lee, Seung-Chae
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.45 no.1
    • /
    • pp.353-376
    • /
    • 2011
  • The goal of this study is to examine what kind of repeated-reading habits adults have, what sort of books they read repeatedly, and what preferences they have depending on their age or gender. A questionnaire was distributed to the students at Lifelong Education Center of Chonbuk National University to survey their repeated reading experiences. The results of the statistical analysis are as follows: 1) Most adults have experienced repeated reading. 2) Women have more experience with repeated reading than men, and in terms of age, more people in their forties read the same books repeatedly. 3) Most repeated readers read their books twice: Women tend to read their books repeatedly more than men do. 4) More than half of the adults in the sample group have read their favorite books several times. 5) The importance of books in this study was judged on the basis of the number of repeated readers and the frequency of reading. The order of important books is as follows: The Little Prince, The Tale of Three Kingdoms, The Giving Tree, The Greek and Roman Mythology, Meu Pe de Larania Lima, No Possession, Hope for the Flowers, and Demian. 6) More than half of the male repeated readers read The Tale of Three Kingdoms while female repeated readers tend to read a wider variety of books. 7) Adults read the same books repeatedly to enjoy and learn something.

SWAT model calibration/validation using SWAT-CUP II: analysis for uncertainties of simulation run/iteration number (SWAT-CUP을 이용한 SWAT 모형 검·보정 II: 모의 실행 및 반복 횟수에 따른 불확실성 분석)

  • Yu, Jisoo;Noh, Joonwoo;Cho, Younghyun
    • Journal of Korea Water Resources Association
    • /
    • v.53 no.5
    • /
    • pp.347-356
    • /
    • 2020
  • The main objective of the study is to propose the most efficient SWAT model calibration method using SWAT-CUP with less computing time and high performance. In order to achieve the goal, Case1-3 (250, 500, and 1,000 simulation runs) and Case4 (1,000 simulation runs in the first iteration and then 500 simulation runs for the following iterations) were defined to compare the results. When evaluating the values of the objective function, Case2 and Case3 reached the same value after the fourth iteration, and Case1 reached the closed value of Case2-3 after the eighth iteration. However, the final estimates of the parameters had different ranges in Cases1-3, and only the results of Case3 and Case4 converged similarly. Thus, it can be considered that the parameter calibration results are highly affected by the initial number of simulation runs. On the other hand, SWAT simulation results did not show the significant difference after the first iteration, unlike the parameter ranges. From the analysis results, we can conclude that the most suitable and effective method was to repeat one or two times of iterations with a sufficient number of simulation runs, as in Case4.

Effect of theRehydration Cycles on the Quality Changes of Retorted Sea Cucumber (StichopusJaponicus) During Storage (재수화 반복횟수를 달리한 해삼 병조림의 저장기간에 따른 품질변화 특성)

  • Kim, Yoon Sung;Yoon, Won Byong
    • Food Engineering Progress
    • /
    • v.21 no.1
    • /
    • pp.29-35
    • /
    • 2017
  • Quality changes of dried sea cucumber (Stichopusjaponicus) after applying a cyclic rehydration and retorting process were investigated during 4 weeks of storage. The length, volume, and weight of dried sea cucumber increased significantly as the number of rehydration cycles increased. Sea cucumber (SC) was bottled in the glass jar and a retort thermal process ($121.1^{\circ}C$, 0.15 MPa) was applied. The total thermal processing time (TTT) was 24 min based on the temperature at the cold point. The size and texture of retorted SC were significantly changed until the first week of storage. However, regardless of the number of rehydration cycles, the size and texture of samples at different rehydration cycles showed no significant difference during the whole storage. The length, volume, weight, rehydration ratio ($R_R$), hardness, and chewiness at the maximum degree of swelling during rehydration of dried SC were estimated as 100.86 mm, 38.62 mL, 41.05 g, 6.39 of $R_R$, $249.19g_f$, and 4.05 mJ, respectively.

A Study on High Speed LDPC Decoder Based on HSS (HSS기반의 고속 LDPC 복호기 연구)

  • Jung, Ji Won
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.5 no.3
    • /
    • pp.164-168
    • /
    • 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. In the result, number of iteration is half than conventional algorithm without performance degradation. Finally, this paper present design methodology of high-speed LDPC decoder and confirmed its throughput is up to about 600Mbps.