• Title/Summary/Keyword: convergence rate

Search Result 3,425, Processing Time 0.035 seconds

A Weighted Block-by-Block Decoding Algorithm for CPM-QC-LDPC Code Using Neural Network

  • Xu, Zuohong;Zhu, Jiang;Zhang, Zixuan;Cheng, Qian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.8
    • /
    • pp.3749-3768
    • /
    • 2018
  • As one of the most potential types of low-density parity-check (LDPC) codes, CPM-QC-LDPC code has considerable advantages but there still exist some limitations in practical application, for example, the existing decoding algorithm has a low convergence rate and a high decoding complexity. According to the structural property of this code, we propose a new method based on a CPM-RID decoding algorithm that decodes block-by-block with weights, which are obtained by neural network training. From the simulation results, we can conclude that our proposed method not only improves the bit error rate and frame error rate performance but also increases the convergence rate, when compared with the original CPM-RID decoding algorithm and scaled MSA algorithm.

Improvement of Topology Algorithm's Convergence Rate Using Chaotic Map (카오틱 맵을 이용한 위상 최적화 알고리즘의 수렴속도 향상)

  • Kim, Yong-Ho;Kim, Gi-Chul;Lee, Jae-Hwan;Jang, Hyo-Jae;Han, Seog-Young
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.23 no.3
    • /
    • pp.279-283
    • /
    • 2014
  • Recently, a topology algorithm based on the artificial bee colony algorithm (ABCA) has been proposed for static and dynamic topology optimization. From the results, the convergence rate of the algorithm was determined to be slightly slow. Therefore, we propose a new search method to improve the convergence rate of the algorithm using a chaotic map. We investigate the effect of the chaotic map on the convergence rate of the algorithm in static and dynamic topology optimization. The chaotic map has been applied to three cases, namely, employ bee search, onlooker bee search, and both employ bee as well as onlooker bee search steps. It is verified that the case in which the logistic function of the chaotic map is applied to both employ bee as well as onlooker bee search steps shows the best dynamic topology optimization, improved by 5.89% compared to ABCA. Therefore, it is expected that the proposed algorithm can effectively be applied to dynamic topology optimization to improve the convergence rate.

Aqua-Aware: Underwater Optical Wirelesss Communication enabled Compact Sensor Node, Temperature and Pressure Monitoring for Small Moblie Platforms

  • Maaz Salman;Javad Balboli;Ramavath Prasad Naik;Wan-Young Chung;Jong-Jin Kim
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.23 no.2
    • /
    • pp.50-61
    • /
    • 2022
  • This work demonstrates the design and evaluation of Aqua-Aware, a lightweight miniaturized light emitting diode (LED) based underwater compact sensor node which is used to obtain different characteristics of the underwater environment. Two optical sensor nodes have been designed, developed, and evaluated for a short and medium link range called as Aqua-Aware short range (AASR) and Aqua-Aware medium range (AAMR), respectively. The hardware and software implementation of proposed sensor node, algorithms, and trade-offs have been discussed in this paper. The underwater environment is emulated by introducing different turbulence effects such as air bubbles, waves and turbidity in a 4-m water tank. In clear water, the Aqua-Aware achieved a data rate of 0.2 Mbps at communication link up to 2-m. The Aqua-Aware was able to achieve 0.2 Mbps in a turbid water of 64 NTU in the presence of moderate water waves and air bubbles within the communication link range of 1.7-m. We have evaluated the luminous intensity, packet success rate and bit error rate performance of the proposed system obtained by varying the various medium characteristics.

Rate of Convergence of Empirical Distributions and Quantiles in Linear Processes with Applications to Trimmed Mean

  • Lee, Sangyeol
    • Journal of the Korean Statistical Society
    • /
    • v.28 no.4
    • /
    • pp.435-441
    • /
    • 1999
  • A 'convergence in probability' rate of the empirical distributions and quantiles of linear processes is obtained. As an application of the limit theorems, a trimmed mean for the location of the linear process is considered. It is shown that the trimmed mean is asymptotically normal. A consistent estimator for the asymptotic variance of the trimmed mean is provided.

  • PDF

Exponential Convergence of A Learning Scheme for Unknown Linear Systems

  • Kuc, Tae-yong;Lee, Jin-Soo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10b
    • /
    • pp.550-554
    • /
    • 1992
  • In this paper the issue of convergence rate is introduced for a learning control scheme we have developed and applied for tracking of unknown linear systems. A sufficient condition under which the output trajectory converges exponentially fast is obtained using the controllability grammian of controllable linear systems. Under the same condition it is also shown that the learning control input converges exponentially with the same rate as the rate of output convergence. A numerical example with computer simulation results is presented to show the feasibility of the scheme.

  • PDF

EMPIRICAL BAYES ESTIMATION OF THE TRUNCATION PARAMETER WITH ASYMMETRIC LOSS FUNCTION USING NA SAMPLES

  • Shi, Yimin;Shi, Xiaolin;Gao, Shesheng
    • Journal of applied mathematics & informatics
    • /
    • v.14 no.1_2
    • /
    • pp.305-317
    • /
    • 2004
  • We construct the empirical Bayes (EB)estimation of the parameter in two-side truncated distribution families with asymmetric Linex loss using negatively associated (NA) samples. The asymptotical optimality and convergence rate of the EB estimation is obtained. We will show that the convergence rate can be arbitrarily close to $O(n^{-q}),\;q\;=\;{\lambda}s(\delta\;-\;2)/\delta(s\;+\;2)$.

Convergence Rate of Newton-Raphson Method (뉴톤-랩슨 반복법의 점근비율)

  • 이관제
    • The Korean Journal of Applied Statistics
    • /
    • v.6 no.2
    • /
    • pp.319-328
    • /
    • 1993
  • The actual convergence rate of Newton-Raphson iteration method at each step is studied under the regularity conditions for the limiting distribution: The convergence rate of it is accelerated with good starting values. Hence we can decide a number of iterations according to our purposes.

  • PDF

Non-Contact Heart Rate Monitoring from Face Video Utilizing Color Intensity

  • Sahin, Sarker Md;Deng, Qikang;Castelo, Jose;Lee, DoHoon
    • Journal of Multimedia Information System
    • /
    • v.8 no.1
    • /
    • pp.1-10
    • /
    • 2021
  • Heart Rate is a crucial physiological parameter that provides basic information about the state of the human body in the cardiovascular system, as well as in medical diagnostics and fitness assessments. At present day, it has been demonstrated that facial video-based photoplethysmographic signal captured using a low-cost RGB camera is possible to retrieve remote heart rate. Traditional heart rate measurement is mostly obtained by direct contact with the human body, therefore, it can result inconvenient for long-term measurement due to the discomfort that it causes to the subject. In this paper, we propose a non-contact-based remote heart rate measuring approach of the subject which depends on the color intensity variation of the subject's facial skin. The proposed method is applied in two regions of the subject's face, forehead and cheeks. For this, three different algorithms are used to measure the heart rate. i.e., Fast Fourier Transform (FFT), Independent Component Analysis (ICA) and Principal Component Analysis (PCA). The average accuracy for the three algorithms utilizing the proposed method was 89.25% in both regions. It is also noteworthy that the FastICA algorithm showed a higher average accuracy of more than 92% in both regions. The proposed method obtained 1.94% higher average accuracy than the traditional method based on average color value.

On Sweeping Operators for Reducing Premature Convergence of Genetic Algorithms (유전 알고리즘의 조기수렴 저감을 위한 연산자 소인방법 연구)

  • Lee, Hong-Kyu
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.12
    • /
    • pp.1210-1218
    • /
    • 2011
  • GA (Genetic Algorithms) are efficient for searching for global optima but may have some problems such as premature convergence, convergence to local extremum and divergence. These phenomena are related to the evolutionary operators. As population diversity converges to low value, the search ability of a GA decreases and premature convergence or converging to local extremum may occur but population diversity converges to high value, then genetic algorithm may diverge. To guarantee that genetic algorithms converge to the global optima, the genetic operators should be chosen properly. In this paper, we analyze the effects of the selection operator, crossover operator, and mutation operator on convergence properties, and propose the sweeping method of mutation probability and elitist propagation rate to maintain the diversity of the GA's population for getting out of the premature convergence. Results of simulation studies verify the feasibility of using these sweeping operators to avoid premature convergence and convergence to local extrema.

Estimation of Tunnel Convergence Using Statistical Analysis (통계처리를 활용한 터널 내공변위의 분석에 관한 연구)

  • 김종우
    • Tunnel and Underground Space
    • /
    • v.13 no.2
    • /
    • pp.108-116
    • /
    • 2003
  • Measured convergence data of a tunnel were investigated by means of statistical and regression analysis, where the rock mass were mainly composed of andesite and granite. The rock mass around tunnel were classified by RMR method into five different ratings, and then convergence data which belong to individual ratings were statistically processed to find out the appropriate regression equations. Exponential equations were better coincided with measured data than logarithmic equations. As the number of rock mass rating was increased, the magnitude and standard deviation of convergence were increased. Final convergence data were also investigated to study the relevance with both maximum displacement rate and early measured convergence. Some brief results of their relevance are presented. For instance, the regression coefficient between final convergence and maximum displacement rate was turned out to be 0.87 for this studied tunnel.