• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.271-280
• /
• 2002

In this paper, the input-output interconnection method of the multiple-valued signal processing circuit using Perfect Shuffle technique and Kronecker product is discussed. Using this method, the circuit design method of the multiple-valued Reed-Muller Expansions (MRME) which can process the multiple-valued signal easily on finite fields GF$(p^m)$ is presented. The proposed input-output interconnection methods show that the matrix transform is an efficient and the structures are modular. The circuits of multiple-valued signal processing of MRME on GF$(p^m)$ design the basic cells to implement the transform and inverse transform matrix of MRME by using two basic gates on GF(3) and interconnect these cells by the input-output interconnection technique of the multiple-valued signal processing circuits. The proposed multiple-valued signal processing circuits that are simple and regular for wire routing and possess the properties of concurrency and modularity are suitable for VLSI.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11A
• /
• pp.852-861
• /
• 2009

We propose a complexity reduced Lattice Reduction(LR) scheme for MIMO detection under time varying fading environments. It is found that for successive MIMO transmission instances, the integer matrix P after LR decomposition remains the same or only a few elements of the matrix P are slightly changed. Based on this feature, we perform LR reduction by setting the initial values for P matrix for the decomposition to be the one obtained in the previous instance not starting from the identity matrix. Simulation results reveal that the proposed scheme drastically reduces overall complexity of LR reduction compared to the conventional scheme for various system parameters under time varying channels. We also show that the proposed scheme can be applied to Seysen LR as well as LLL(Lenstra, Lenstra, and Lavasaz)-LR.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37A no.9
• /
• pp.799-808
• /
• 2012

Bit operation of scrambler in the WAVE System become less efficient because parallel processing is impossible in terms of hardware and software. In this paper, we propose algorism to find the starting position of the matrix table. Also, when bit operation algorithm of scrambler and algorithms for matrix table, algorithm used to find starting position of the matrix table were compared with the performance as 8 bit, 16bit, 32 bit processing units. As a result, the number of processing times per second could be done 2917.8 times more in an 8-bit, 5432.1 times in a 16-bit, 10277.8 times in a 32 bit. Therefore, algorithm to find the starting position of the matrix table improves the speed of the scrambler in the WAVE and the receiving speed of a variety of information gathering and precision over the Vehicle to Infra or Vehicle to Vehicle in the Intelligent Transport Systems.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.40 no.9
• /
• pp.597-604
• /
• 2016

A parallel algorithm of bi-conjugate gradient method was developed based on CUDA for parallel computation of the incompressible Navier-Stokes equations. The governing equations were discretized using splitting P2P1 finite element method. Asymmetric stenotic flow problem was solved to validate the proposed algorithm, and then the parallel performance of the GPU was examined by measuring the elapsed times. Further, the GPU performance for sparse matrix-vector multiplication was also investigated with a matrix of fluid-structure interaction problem. A kernel was generated to simultaneously compute the inner product of each row of sparse matrix and a vector. In addition, the kernel was optimized to improve the performance by using both parallel reduction and memory coalescing. In the kernel construction, the effect of warp on the parallel performance of the present CUDA was also examined. The present GPU computation was more than 7 times faster than the single CPU by double precision.

• Korean journal of applied entomology
• /
• v.50 no.3
• /
• pp.235-245
• /
• 2011

Temperature-related parameters of Panonychus citri (McGregor) (Acarina: Tetranychidae) development were estimated and a stage-structured matrix model was developed. The lower threshold temperatures were estimated as $8.4^{\circ}C$ for eggs, $9.9^{\circ}C$ for larvae, $9.2^{\circ}C$ for protonymphs, and $10.9^{\circ}C$ for deutonymphs. Thermal constants were 113.6, 29.1, 29.8, and 33.4 degree days for eggs, larvae, protonymphs, and deutonymphs, respectively. Non-linear development models were established for each stage of P. citri. In addition, temperature-dependent total fecundity, age-specific oviposition rate, and age-specific survival rate models were developed for the construction of an oviposition model. P. citri age was categorized into five stages to construct a matrix model: eggs, larvae, protonymphs, deutonymphs and adults. For the elements in the projection matrix, transition probabilities from an age class to the next age class or the probabilities of remaining in an age class were obtained from development rate function of each stage (age classes). Also, the fecundity coefficients of adult population were expressed as the products of adult longevity completion rate (1/longevity) by temperature-dependent total fecundity. To evaluate the predictability of the matrix model, model outputs were compared with actual field data in a cool early season and hot mid to late season in 2004. The model outputs closely matched the actual field patterns within 30 d after the model was run in both the early and mid to late seasons. Therefore, the developed matrix model can be used to estimate the population density of P. citri for a period of 30 d in citrus orchards.

• Review of KIISC
• /
• v.2 no.4
• /
• pp.30-36
• /
• 1992

이 논문에서 우리는 여러 가지 분할 항등식을 유도했고 제한된 분할에 관한 새로운 항등식을 증명하고, 분할의 기본적인 이론과 분할함수(Partition Number Function)가 다항식 함수가 아니라는 것을 보이며, n 의 분할의 수 p(n)에 대한 하계(Lower Bound)를 얻기 위해 Stirling의 n ! 에 대한 근사값을 소개한다. 그리고 Hardy-Ramanujan 공식, Euler 항등식과 p(n) 의 순환식을 유도하며, 그리고 $d_m$(n)이n을m개의 부분으로 분할하는 분할의 수를 나타낼 때 우리는 $d_m$(n)에 관한 일반적인 공식을 p(n)과 함께 행렬식의 형태로 표현한다.

• Review of KIISC
• /
• v.2 no.4
• /
• pp.37-47
• /
• 1992

이 논문에서 우리는 여러 가지 분할 항등식을 유도했고 제한된 분할에 관한 새로운 항등식을 증명하고, 분할의 기본적인 이론과 분할함수(Partition Number Function)가 다항식 함수가 아니라는 것을 보이며, n의 분할의 수 p(n)에 대한 ㅎ계(Lower Bound)를 얻기 위해 Stirling의 n !에 대한 근사값을 소개한다. 그리고Hardy-Ramanujan 공식, Euler 항등식과 p(n)의 순환식을 유도하며, 그리고 d$_{m}$ (n)이 n을 m개의 부분으로 분할하는 분할의 수를 나타낼 때 우리는 d$_{m}$ (n) 에 관한 일반적인 공식을 p(n)과 함께 행렬식의 형태로 표현한다.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.1
• /
• pp.55-65
• /
• 1995

Existing multiple-row downdating algorithms have adopted a CFD(Cholesky Factor Downdating) that recursively downdates one row at a time. The CFD based algorithm requires 5/2p $n^{2}$ flops(floating point operations) downdating a p$\times$n observation matrix $Z^{T}$ . On the other hands, a HCFD(Hybrid CFD) based algorithm we propose in this paper, requires p $n^{2}$＋6/5 $n^{3}$ flops v hen p$\geq$n. Such a HCFD based algorithm factorizes $Z^{T}$ at first, such that $Z^{T}$ = $Q_{z}$ RT/Z, and then applies the CFD onto the upper triangular matrix Rt/z, so that the total number of floating point operations for downdating $Z^{T}$ would be significantly reduced compared with that of the CFD based algorithm. Benchmark tests on the Sun SPARC/2 and the Tolerant System also show that performance of the HCFD based algorithm is superior to that of the CFD based algorithm, especially when the number of rows of the observation matrix is large.rge.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.21 no.2
• /
• pp.71-82
• /
• 1984

A programme, called BIPOLE, for the numerical analysis of twotimensional n-p-n bipolar transistors was developed. It has included the SRH and Auger recolnbination processes, the mobility dependence on the impurity density and the electric field, and the band-gap narrowing effect. The finite difference equations of the fundamental semiconductor equations are formulated using Newton's method for Poisson's equation and the divergence theorem for the hole and electron continuity equations without physical restrictions. The matrix of the linearized equations is sparse, symmetric M-matrix. For the solution of the linearized equations ICCG method and Gummel's algorithm have been employed. The programme BIPOLE has been applied to various kinds of the steady-state problems of n-p-n transistors. For the examples of applications the variations of common emitter current gain, emitter and diffusion capacitances, and input and output characteristics are calculated. Three-dimensional representations of some D.C. physical quantities such as potential and charge carrier distributions were displayed. This programme will be used for the nome,rical analysis of the distortion phenom ana of two-dimensional n-p-n transistors. The BIPOLE programme is available for everyone.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.2
• /
• pp.359-368
• /
• 1996

This paper introduces PGD(Preprocessed Givens Downdating)and PHD(Preprocessed Hyperbolic Downdating) algorithms, wherein a multiple-row observation matrix $Z^T$ is factorized into a partial Cholesky factor Rz, such that $Z^T$ = $Q_zR_z, Q_zQ^T_z=I$, and then Rz is recursively downdated by using GD(Givens Downdating)and HD(Hyperbolic Dondating), respectively. Time complexities of PGD and PHD algorithms are $pn^2$ ＋ $5n^3/6$ 및 $pn^2$＋$n^3/3$ flops, respectively, if p$\geq$n, while those of the existing GD and HD are known to be $5pn^2/2$ and $2pn^2$ flops,, respectively. This concludes that the factorization of observation matrices, which we call preprocessing, would improve the overall performance of the downdating process. Benchmarks on the Sun SPARC/2 system also show that preprocessing would shorten the required downdating times compared to those of downdatings without preprocessing. Furthermore, benchmarks also show that PHD provides better performance than PGD.