• 한국전자파학회논문지
• /
• 제26권1호
• /
• pp.71-80
• /
• 2015

한정된 배터리 용량으로 장시간 모바일 시스템을 구동시키기 위하여 저전력 설계에 대한 요구가 높아지면서 PMIC(Power Management IC)의 핵심 부분인 LDO(Low Drop-Out) 레귤레이터의 설계에 대한 관심이 증가하고 있다. 본 논문에서는 Dongbu HiTek $0.5{\mu}m$ BCDMOS 공정을 이용하여 최적화 기법 중 하나인 기하 프로그래밍(Geometric Programming: GP)을 통해 외부 커패시터가 없는 LDO 레귤레이터의 성능을 최적화하였다. 계수가 양수인 단항식 (monomial)으로 모델링된 트랜지스터의 특성 파라미터들을 이용하여 안정도(stability)와 PSR(Power-Supply Rejection)과 같은 LDO 레귤레이터의 특성을 기하 프로그래밍(Geometric Programming: GP)에 적용 가능한 형태로 유도하였다. 위상 마진(phase margin)과 PSR 모델은 시뮬레이션 결과와 비교하였을 때 각각 평균 9.3 %와 13.1 %의 오차를 보였다. 제안한 모델을 사용하여 PSR 제약 조건이 바뀔 경우, 자동화된 회로 설계를 수행하였고, 모델의 정확도를 검증하였다. 본 논문에서 유도된 안정도와 PSR 모델을 이용하면 회로의 목표 성능이 변화하더라도 부가적인 설계 시간을 줄이면서 목표 성능을 가진 회로를 재설계하는 것이 가능할 것이다.

• 대한수학회지
• /
• 제52권4호
• /
• pp.685-697
• /
• 2015

For a field K, a square-free monomial ideal I of K[$x_1$, . . ., $x_n$] is called an f-ideal, if both its facet complex and Stanley-Reisner complex have the same f-vector. Furthermore, for an f-ideal I, if all monomials in the minimal generating set G(I) have the same degree d, then I is called an $(n, d)^{th}$ f-ideal. In this paper, we prove the existence of $(n, d)^{th}$ f-ideal for $d{\geq}2$ and $n{\geq}d+2$, and we also give some algorithms to construct $(n, d)^{th}$ f-ideals.

• Nuclear Engineering and Technology
• /
• 제31권3호
• /
• pp.303-313
• /
• 1999

Various interpolation methods have been compared for reconstruction of LMR pin power distributions in hexagonal geometry. Interpolation functions are derived for several combinations of nodal quantities and various sets of basis functions, and tested against fine mesh calculations. The test results indicate that the interpolation functions based on the sixth degree polynomial are quite accurate, yielding maximum interpolation errors in power densities less than 0.5%, and maximum reconstruction errors less than 2% for driver assemblies and less than 4% for blanket assemblies. The main contribution to the total reconstruction error is made tv the nodal solution errors and the comer point flux errors. For the polynomial interpolations, the basis monomial set needs to be selected such that the highest powers of x and y are as close as possible. It is also found that polynomials higher than the seventh degree are not adequate because of the oscillatory behavior.

• 대한수학회지
• /
• 제51권2호
• /
• pp.427-442
• /
• 2014

A previous work gave a combinatorial description of the crystal B(${\infty}$), in terms of certain simple Young tableaux referred to as the marginally large tableaux, for finite dimensional simple Lie algebras. Using this result, we present an explicit description of the crystal B(${\lambda}$), in terms of the marginally large tableaux, for the $G_2$ Lie algebra type. We also provide a new description of B(${\lambda}$), in terms of Nakajima monomials, that is in natural correspondence with our tableau description.

• 대한수학회보
• /
• 제52권3호
• /
• pp.977-986
• /
• 2015

Let G be a graph on the vertex set $V(G)=\{x_1,{\cdots},x_n\}$ with the edge set E(G), and let $R=K[x_1,{\cdots},x_n]$ be the polynomial ring over a field K. Two monomial ideals are associated to G, the edge ideal I(G) generated by all monomials $x_i,x_j$ with $\{x_i,x_j\}{\in}E(G)$, and the vertex cover ideal $I_G$ generated by monomials ${\prod}_{x_i{\in}C}{^{x_i}}$ for all minimal vertex covers C of G. A minimal vertex cover of G is a subset $C{\subset}V(G)$ such that each edge has at least one vertex in C and no proper subset of C has the same property. Indeed, the vertex cover ideal of G is the Alexander dual of the edge ideal of G. In this paper, for an unmixed bipartite graph G we consider the lattice of vertex covers $L_G$ and we explicitly describe the minimal free resolution of the ideal associated to $L_G$ which is exactly the vertex cover ideal of G. Then we compute depth, projective dimension, regularity and extremal Betti numbers of R/I(G) in terms of the associated lattice.

• 대한수학회지
• /
• 제55권6호
• /
• pp.1469-1483
• /
• 2018

We study a subclass of p-ary functions in n variables, denoted by ${\mathcal{A}}_n$, which is a collection of p-ary functions in n variables satisfying a certain condition on the exponents of its monomial terms. Firstly, we completely classify all p-ary (n - 1)-plateaued functions in n variables by proving that every (n - 1)-plateaued function should be contained in ${\mathcal{A}}_n$. Secondly, we prove that if f is a p-ary r-plateaued function contained in ${\mathcal{A}}_n$ with deg f > $1+{\frac{n-r}{4}}(p-1)$, then the highest degree term of f is only a single term. Furthermore, we prove that there is no p-ary r-plateaued function in ${\mathcal{A}}_n$ with maximum degree $(p-1){\frac{n-4}{2}}+1$. As application, we partially classify all (n - 2)-plateaued functions in ${\mathcal{A}}_n$ when p = 3, 5, and 7, and p-ary bent functions in ${\mathcal{A}}_2$ are completely classified for the cases p = 3 and 5.

• 한국통신학회논문지
• /
• 제11권1호
• /
• pp.53-63
• /
• 1986

본 논문은 코드레이트가 R, 에러 정정 능력이 t일때, R>1/t를 만족하는 비이진 코드의 디코더 설계에 관한 연구이다. 에러 트래핑 디코딩 방식으로 설계하기 위해 카버링 단항식 개념을 도입하였으며, 실제 이를 이용하여 (15, 11) Reed-Solomon코드의 디코더를 구현하였다. 이 디코더 시스템은 Galois Field 곱셈 및 나눗셈 회로를 필요로 하지 않으므로 간단히 구성할 수 있었으며, 마이크로 컴퓨터를 이용하여 실험하였다. 본 연구의 결과로서, 이 디코더는 하나의 코드 위드를 디코딩하는데 60클럭이 소요되었으며 2개의 심볼 에러와 8개의 이진 버스트 에러를 정정할 수 있으며, 성능을 채널 에러 확률이 $5{\times}10^-4$~$5{\times}10^-5$정도일 때 가장 효율적임을 알 수 있었다.

• 대한수학회지
• /
• 제55권6호
• /
• pp.1381-1388
• /
• 2018

Let ${\Delta}$ be a simplicial complex, $I_{\Delta}$ its Stanley-Reisner ideal and $K[{\Delta}]$ its Stanley-Reisner ring over a field K. Assume that ${\Gamma}(R)$ denotes the zero-divisor graph of a commutative ring R. Here, first we present a condition on two reduced Noetherian rings R and R', equivalent to ${\Gamma}(R){\cong}{\Gamma}(R{^{\prime}})$. In particular, we show that ${\Gamma}(K[{\Delta}]){\cong}{\Gamma}(K^{\prime}[{\Delta}^{\prime}])$ if and only if ${\mid}Ass(I_{\Delta}){\mid}={\mid}Ass(I_{{{\Delta}^{\prime}}}){\mid}$ and either ${\mid}K{\mid}$, ${\mid}K^{\prime}{\mid}{\leq}{\aleph}_0$ or ${\mid}K{\mid}={\mid}K^{\prime}{\mid}$. This shows that ${\Gamma}(K[{\Delta}])$ contains little information about $K[{\Delta}]$. Then, we define the squarefree zero-divisor graph of $K[{\Delta}]$, denoted by ${\Gamma}_{sf}(K[{\Delta}])$, and prove that ${\Gamma}_{sf}(K[{\Delta}){\cong}{\Gamma}_{sf}(K[{\Delta}^{\prime}])$ if and only if $K[{\Delta}]{\cong}K[{\Delta}^{\prime}]$. Moreover, we show how to find dim $K[{\Delta}]$ and ${\mid}Ass(K[{\Delta}]){\mid}$ from ${\Gamma}_{sf}(K[{\Delta}])$.