• Title/Summary/Keyword: function approximations

Search Result 123, Processing Time 0.027 seconds

Performance Analysis of Precoded MIMO MMSE Receivers in Transmit-Correlated Rayleigh Channels (송신 상관된 레일리 채널에서 프리코더를 갖는 MIMO MMSE 수신기의 성능 분석)

  • Kim, Wonsop
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.7
    • /
    • pp.552-559
    • /
    • 2013
  • In this paper, the multiple-input multiple-output (MIMO) system with a precoder is considered in the transmit-correlated Rayleigh channels. We specifically target the MIMO system employing the minimum mean square error receivers. Based on random matrix theory, we first present a direct and generalized formulation for deriving a probability density function (PDF) of the signal-to-interference-plus-noise ratio (SINR). Then, we derive the accurate closed-form SINR PDFs for a small number of transmit and receive antennas. Based on the SINR PDFs, tight closed-form approximations of the symbol error rate (SER) are derived. Our analysis suggests that the SER approximations can be used to accurately estimate the error probabilities or as a useful tool for the system design.

CONTINUITY OF ONE-SIDED BEST SIMULTANEOUS APPROXIMATIONS

  • Lee, Mun-Bae;Park, Sung-Ho;Rhee, Hyang-Joo
    • Bulletin of the Korean Mathematical Society
    • /
    • v.37 no.4
    • /
    • pp.743-753
    • /
    • 2000
  • In the space $C_1(X)$ of real-valued continuous functions with $L_1-norm$, every bounded set has a relative Chebyshev center in a finite-dimensional subspace S. Moreover, the set function $F\rightarrowZ_S(F)$ corresponding to F the set of its relative Chebyshev centers, in continuous on the space B[$C_1(X)$(X)] of nonempty bounded subsets of $C_1(X)$ (X) with the Hausdorff metric. In particular, every bounded set has a relative Chebyshev center in the closed convex set S(F) of S and the set function $F\rightarrowZ_S(F)$(F) is continuous on B[$C_1(X)$ (X)] with a condition that the sets S(.) are equal.

  • PDF

Numerical Comparisons for the Null Distribution of the Bagai Statistic

  • Ha, Hyung-Tae
    • Communications for Statistical Applications and Methods
    • /
    • v.19 no.2
    • /
    • pp.267-276
    • /
    • 2012
  • Bagai et al. (1989) proposed a distribution-free test for stochastic ordering in the competing risk model, and recently Murakami (2009) utilized a standard saddlepoint approximation to provide tail probabilities for the Bagai statistic under finite sample sizes. In the present paper, we consider the Gaussian-polynomial approximation proposed in Ha and Provost (2007) and compare it to the saddlepoint approximation in terms of approximating the percentiles of the Bagai statistic. We make numerical comparisons of these approximations for moderate sample sizes as was done in Murakami (2009). From the numerical results, it was observed that the Gaussianpolynomial approximation provides comparable or greater accuracy in the tail probabilities than the saddlepoint approximation. Unlike saddlepoint approximation, the Gaussian-polynomial approximation provides a simple explicit representation of the approximated density function. We also discuss the details of computations.

The shifted Chebyshev series-based plug-in for bandwidth selection in kernel density estimation

  • Soratja Klaichim;Juthaphorn Sinsomboonthong;Thidaporn Supapakorn
    • Communications for Statistical Applications and Methods
    • /
    • v.31 no.3
    • /
    • pp.337-347
    • /
    • 2024
  • Kernel density estimation is a prevalent technique employed for nonparametric density estimation, enabling direct estimation from the data itself. This estimation involves two crucial elements: selection of the kernel function and the determination of the appropriate bandwidth. The selection of the bandwidth plays an important role in kernel density estimation, which has been developed over the past decade. A range of methods is available for selecting the bandwidth, including the plug-in bandwidth. In this article, the proposed plug-in bandwidth is introduced, which leverages shifted Chebyshev series-based approximation to determine the optimal bandwidth. Through a simulation study, the performance of the suggested bandwidth is analyzed to reveal its favorable performance across a wide range of distributions and sample sizes compared to alternative bandwidths. The proposed bandwidth is also applied for kernel density estimation on real dataset. The outcomes obtained from the proposed bandwidth indicate a favorable selection. Hence, this article serves as motivation to explore additional plug-in bandwidths that rely on function approximations utilizing alternative series expansions.

A Noncoherent Method for Sequential Code Acquisition with Simplified Structure Based on Approximated Bessel Function (어림 베셀함수를 바탕으로 얼개를 간단히 한 비동위상 순차 부호획득 방법)

  • Kwon, Hyoung-Moon;Lee, Ju-Mi;Yoon, Seok-Ho;Lee, Sung-Ro;Song, Iick-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.9C
    • /
    • pp.955-963
    • /
    • 2005
  • In this paper, we consider the noncoherent code acquisition problem using sequential schemes. We show that the outputs of the noncoherent receiver approximately have a central chi-square distribution under the null hypothesis through simulations. Based on this observation, simplified acquisition schemes are obtained using the approximations of the Bessel function. The performance of the simplified and original schemes are compared in additive white Gaussian noise and slowly varying fading channels. Numerical results show that the simplified schemes have essentially the same performance as the original schemes.

Splines via Computer Programming

  • 김경태
    • Communications of the Korean Institute of Information Scientists and Engineers
    • /
    • v.1 no.1
    • /
    • pp.72-74
    • /
    • 1983
  • Traditionally, polynomials have been used to approximte functions with prescribed values at a number of points(called the knots) on a given interal on the real line. The method of splines recently developed is more flexible. It approximates a function in a piece-wise fashion, by means of a different polynomial in each subinterval. The cubic spline gas ets origins in beam theory. It possessed continuous first and second deriatives at the knots and is characterised by a minimum curvature property which es rdlated to the physical feature of minimum potential energy of the supported beam. Translated into mathematical terms, this means that between successive knots the approximation yields a third-order polynomial sith its first derivatives continuous at the knots. The minimum curvature property holds good for each subinterval as well as for the whole region of approximation This means that the integral of the square of the second derivative over the entire interval, and also over each subinterval, es to be minimized. Thus, the task of determining the spline lffers itself as a textbook problem in discrete computer programming, since the integral of ghe square of the second derivative can be obviously recognized as the criterion function whicg gas to be minimized. Starting with the initial value of the function and assuming an initial solpe of the curve, the minimum norm property of the curvature makes sequential decision of the slope at successive knots (points) feasible. It is the aim of this paper to derive the cubic spline by the methods of computer programming and show that the results which is computed the all the alues in each subinterval of the spline approximations.

New approximations of the ruin probability in a continuous time surplus process (보험상품 파산확률의 새로운 근사방법)

  • Kwon, Cheonga;Choi, Seung Kyoung;Lee, Eui Yong
    • Journal of the Korean Data and Information Science Society
    • /
    • v.25 no.1
    • /
    • pp.1-10
    • /
    • 2014
  • In this paper, we study approximations of the ruin probability in a continuous time surplus process. First, we introduce the well-known approximation formulas of the ruin probability such as Cram$\acute{e}$r, Tijms' and De Vylder's methods. We, then, suggest new approximation formulas of two types, which improve the existing approximation formulas. One is Cram$\acute{e}$r and Tijms' type which makes use of the moment generating function of distribution of a claim size and the other is De Vylder's type which makes use of the surplus process with exponential claims. Finally, we compare, by illustrating numerical examples, the newly suggested approximation formulas with the existing approximation formulas of the ruin probability.

The Optimal Number of Transmit Antennas Maximizing Energy Efficiency in Multi-user Massive MIMO Downlink System with MRT Precoding (MU-MIMO 하향링크 시스템에서의 MRT 기법 사용 시 에너지 효율을 최대화하는 최적 송신 안테나의 수)

  • Lee, Jeongsu;Han, Yonggue;Lee, Chungyong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.11
    • /
    • pp.33-39
    • /
    • 2014
  • We propose an optimal number of transmit antennas which maximizes energy-efficiency (EE) in multi-user massive multiple-input multiple-output (MIMO) downlink system with the maximal ratio transmission (MRT) precoding. With full channel state information at the transmitter (CSIT), we find a closed form solution by partial differential function with proper approximations using average channel gain, independence of individual channels, and average path loss. With limited feedback, we get a solution numerically by the bisection with approximations in the same manner, and analyze an effect of feedback bits on the optimal number of transmit antennas. Simulation results show that the optimal numbers of transmit antenna getting from proposed closed form solution and exhaustive search are nearly same.

Theoretical Study on the Absorption Spectrum of a Chromophore in Liquid (용액상 색소분자의 흡수스펙트럼에 대한 이론적 연구)

  • Woo, Jung-Moon;Yang, Min-O
    • Journal of the Korean Chemical Society
    • /
    • v.52 no.1
    • /
    • pp.7-15
    • /
    • 2008
  • Molecular motion influencing the absorption spectrum of a chromophore in liquid is theoretically described by a quantum mechanical time correlation function. In the present paper, we developed a theoretical method to calculate such a quantum mechanical time-correlation function from a classical time-correlation function using semi-classical approximations. The calculated time-correlation function was combined with the second order cumulant expansion method to calculate the absorption spectrum of nile blue in acetonitrile. Reasonably good agreement with experimental spectrum was obtained. From the comparison with experimental spectrum, we concluded that the time scale of solvation dynamics of the system should be longer then 1ps and the first shell of solvent is the major contribution to the solvation dynamics.

A Case Study on Function Point Method applying on Monte Carlo Simulation in Automotive Software Development

  • Do, Sung Ryong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.6
    • /
    • pp.119-129
    • /
    • 2020
  • Software development activities are influenced by stochastic theory rather than deterministic one due to having process variability. Stochastic methods factor in the uncertainties associated with project activities and provides insight into the expected project outputs as probability distributions rather than as deterministic approximations. Thus, successful software projects systematically manage and balance five objectives based on historical probability: scope, size, cost, effort, schedule, and quality. Although software size estimation having much uncertainty in initial development has traditionally performed using deterministic methods: LOC(Lines Of Code), COCOMO(COnsructive COst MOdel), FP(Function Point), SLIM(Software LIfecycle Management). This research aims to present a function point method based on stochastic distribution and a case study based on Monte Carlo Simulation applying on an automotive electrical and electronics system software development. It is expected that the result of this paper is used as guidance for establishing of function point method in organizations and tools for helping project managers make decisions correctly.