• Communications for Statistical Applications and Methods
• /
• v.16 no.1
• /
• pp.157-162
• /
• 2009

The baker transformation is an ergodic transformation defined on the half open unit square. This paper considers the limiting behavior of the partial sum process of a martingale sequence constructed from the baker transformation. We get the uniform law of large numbers for the baker transformation.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.671-676
• /
• 2003

In this paper, we proposed a new First Partial product Addition (FPA) architecture with new compressor (or parallel counter) to CSA tree built in the process of adding partial product for improving speed in the fast parallel multiplier to improve the speed of calculating partial product by about 20% compared with existing parallel counter using full Adder. The new circuit reduces the CLA bit finding final sum by N/2 using the novel FPA architecture. A 5.14nS of multiplication speed of the $16{\times}16$ multiplier is obtained using $0.25\mu\textrm{m}$ CMOS technology. The architecture of the multiplier is easily opted for pipeline design and demonstrates high speed performance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.103-108
• /
• 2016

In communication systems the solution of the problem of maximizing the mutual information between the input and output of a channel composed of several subchannels under total power constraint has a waterfilling structure. OFDM and MIMO can be decomposed into parallel subchannels with CSI. Waterfilling solves the problem of optimal power allocation to these subchannels to achieve the rate approaching the channel capacity under total power constraint. In waterfilling, more power is alloted to good channels(high SNR) and less or no power to bad channels to increase the rate of good channels, resulting in channel capacity. Waterfilling finds the exact water level satisfying the power constraint employing an iterative algorithm to estimate and update the water level. In this process computation of partial sums of inverse of square of subchannel gain is repeatedly required. In this paper we reduced the computation time of waterfilling algorithm by replacing the partial sum computation with reference to an array which contains the precomputed partial sums in initialization phase.

• Communications for Statistical Applications and Methods
• /
• v.21 no.3
• /
• pp.245-251
• /
• 2014

Two exponential inequalities are established for a wide class of general weakly dependent sequences of random variables, called ${\psi}$-weakly dependent process which unify weak dependence conditions such as mixing, association, Gaussian sequences and Bernoulli shifts. The ${\psi}$-weakly dependent process includes, for examples, stationary ARMA processes, bilinear processes, and threshold autoregressive processes, and includes essentially all classes of weakly dependent stationary processes of interest in statistics under natural conditions on the process parameters. The two exponential inequalities are established on more general conditions than some existing ones, and are proven in simpler ways.

• Bulletin of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.221-231
• /
• 1995

Let $Z_1, Z_2, \ldots, Z_l$ be random set functions or intergrals. Then it is possible to discuss their products. In the case of random integrals, $Z_i$ is a random set function indexed y a family, $G_i$ say, of real valued functions g on $S_i$ for which the integrals $Z_i(g) = \smallint gdZ_i$ are well defined. If $g_i = \in g_i (i = 1, 2, \ldots, l) and g_1 \otimes \cdots \otimes g_l$ denotes the tensor product $g(s) = g_1(s_1)g_2(s_2) \cdots g_l(s_l) for s = (s_1, s_2, \ldots, s_l) and s_i \in S_i$, then we can defined $Z(g) = (Z_1 \times Z_2 \times \cdots \times Z_l)(g) = Z_1(g_1)Z_2(g_2) \cdots Z_l(g_l)$.

• Journal of the Korean Statistical Society
• /
• v.12 no.1
• /
• pp.10-17
• /
• 1983

Let $X^{(n)}_j, j=1,2,\cdots,n, n=1,2,\cdots$ be a triangular array of random variables which arise naturally in a study of ferromagnetism in statistical mechanics. This paper presents weak convergence of random function $W_n(t)$, an appropriately normalized partial sum process based on $S^{(n)}_n = X^{(n)}_i+\cdot+X^{(n)}_n$. The limiting process W(t) is shown to be Gaussian when weak dependence exists. At the critical point where the change form weak to strong dependence takes place, W(t) turns out to be non-Gaussian. Our results are direct extensions of work by Ellis and Newmam (1978). An example is considered and the relation of these results to critical phenomena is briefly explained.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.10
• /
• pp.1193-1201
• /
• 1988

In this paper, we describe the syntactic and semantic parsing methods which use the case frames. The case structures based on obligatory cases of verbs. And, we use a small set of partial-garammar rules based on simple sentence to represent such case structures. Also, we enhance the efficiency by constructing independent procedure for particle classification and ambiguity resolution of major particle considering the importance of Japanese particle process in the generation. And we construct the generation table considering the combination possibility between the verbs and auxiliary verbs for processing the termination phrase. Therefore we can generate more natural translated sentence according to unique decision with information of syntactic analysis and simplify the generating process.

• 한국연소학회:학술대회논문집
• /
• 1999.10a
• /
• pp.155-163
• /
• 1999

A numerical study for simulating a swirling pulverized coal combustion in axisymmetric geometry is done here by applying the weighted sum of gray gases model (WSGGM) approach with the discrete ordinate method (DOM) to model the radiative heat transfer equation. In the radiative transfer equation, the same polynomial equation and coefficients for weighting factors as those for gas are adopted for the coal/char particles as a function of partial pressure and particle temperature. The Eulerian balance equations for mass, momentum, energy, and species mass fractions are adopted with the standard ${\kappa}-{\varepsilon}$ turbulence model, whereas the Lagrangian approach is used for the particulate phase for soot. The eddydissipation model is employed for the reaction rate for gaseous mixture, and the single-step first-order reaction model for the devolatilization process for coal. By comparing the numerical results with experimental ones, the models used here are confirmed and found to be one of good alternatives for simulating the combustion as well as radiative characteristics.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.928-930
• /
• 2005

With an increasing importance of the information security issues, the efficienct calculation process in terms of finite field level is becoming more important in the Elliptic curve cryptosystems. Serial multiplication architectures are based on the Mastrovito's serial multiplier structure. In this paper, we manipulate the numerical expressions so that we could suggest a 3-times as fast as (3x) the Mastrovito's multiplier using the polynomial basis. The architecture was implemented with HDL, to be evaluated and verified with EDA tools. The implemented 3x GF (Galois Field) multiplier showed 3 times calculation speed as fast as the Mastrovito's, only with the additional partial-sum generation processing unit.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.7
• /
• pp.70-77
• /
• 2010

Motion estimation occupies most of the required computation in video compression, and many fast search algorithms were propsoed to reduce huge computation. SAD (sum-of-absolute difference) calculation is the most computation-intensive process in the motion estimation. Early termination is widely used in SAD calculation, where SAD calculation is terminated and it proceeds to next search position if partial SAD during SAD calculation exceeds current minimum SAD. In this paper, we proposed a modified 3-step search algorithm for effective early termination where only search order of search positions are adaptive rearranged. Simulation results show that the proposed motion estimation algorithm reduces computation by 17~30% over conventional 3-step search algorithm without extra computation, while maintaining same performance.