• The Journal of the Korea institute of electronic communication sciences
• /
• v.4 no.4
• /
• pp.247-252
• /
• 2009

This paper presents an Integer-N phase-locked loop (PLL) frequency synthesizer using a novel prescaler based on a charge pump and clock triggering circuit. A quadrature VCO has been designed for the 900MHz UHF RFID application. In this circuit, a voltage-controlled oscillator(VCO), a novel Prescaler, phase frequency detector(PFD), charge pump(CP), and analog lock detector(ALD) have been integrated with 0.35-${\mu}m$CMOS process. The integer divider has been developed with a verilog-HDL module, and the PLL mixed mode simulation has been performed with Spectre-Verilog co-simulator. The sweep range of VCO is designed from 828 to 960 MHz and the VCO generates four phase quadrature signals. The simulation results show that the phase noise of VCO is -102dBc/Hz at 100 KHz offset frequency, and the maximum lock-in time is about 4us with 32MHz step change (from 896 to 928 MHz).

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.279-282
• /
• 1999

Frequency divider selects the channel of the frequency synthesizer. General programmable divider has many flip-flops to realize all integer division value and stability problem by using dual modules prescaler. In this paper, a new architecture of programmable divider is proposed and designed to improve these problems. The proposed programmable divider has only thirteen flip-flops. The programmable divider is designed by 0.65${\mu}{\textrm}{m}$ CMOS technology and HSPICE. Operating frequency of the programmable divider is 200MHz with a 3V supply voltage.

• Journal of the Chungcheong Mathematical Society
• /
• v.32 no.2
• /
• pp.171-177
• /
• 2019

We associate a positive integer n and a subgroup H of the group G(n) with a polynomial $J_{n,H}(x)$, which is called the Galois polynomial. It turns out that $J_{n,H}(x)$ is a polynomial with integer coefficients for any n and H. In this paper, we provide an equivalent condition for a subgroup H to provide the Galois polynomial which is irreducible over ${\mathbb{Q}}$.

• Bulletin of the Korean Mathematical Society
• /
• v.44 no.1
• /
• pp.83-86
• /
• 2007

We determine the largest integer i such that $0 and the coefficient of $t^{i}$ is odd in the polynomial $(1+t+t^{2}+{\cdots}+t^{n})^{n+1}$. We apply this to prove that the co-index of the tangent bundle over $FP^{n}$ is stable if $2^{r}{\leq}n<2^{r}+\frac{1}{3}(2^{r}-2)$ for some integer r.

• Journal of the Korean Mathematical Society
• /
• v.36 no.3
• /
• pp.633-648
• /
• 1999

In this paper, for any two bipartite ordered sets P and Q, we define the convolution P * Q of P and Q. For dim(P)=s and dim(Q)=t, we prove that s+t-(U+V)-2 dim(P*Q) s+t-(U+V)+2, where U+V is the max-mn integer of the certain realizers. In particular, we also prove that dim(P)=n+k- {{{{ { n+k} over {3 } }}}} for 2 k n<2k and dim(Pn ,k)=n for n 2k, where Pn,k=Sn*Sk is the convolution of two standard ordered sets Sn and Sk.

• Communications of the Korean Mathematical Society
• /
• v.18 no.4
• /
• pp.661-667
• /
• 2003

In this paper, we show, for a positive integer m and a large odd integer n, the polynomial equation (equation omitted) has a real zero on $((n+1)^{1+\frac{1}{m}},{\;}(n+1)^{1+\frac{1}{m}}+{\frac{1}{2}})$ and $((n+1)^{1+\frac{1}{m}}+{\frac{1}{2}},{\;}(n+2)^{1+\frac{1}{m}})$ respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.12
• /
• pp.1928-1934
• /
• 1993

This paper presents a fast algorithm of integer discrete cosine transform(IDCT) allowing VLSI implementation by integer arithmetic. The proposed fast algorithm has been developed using Chen`s matrix decomposition in DCT, and requires less number of arithmetic operations compared to the IDCT. In the presented algorithm, the number of addition number is the same as the one of Chen`s algorithm if DCT, and the number of multiplication if the same as that in DCT at N=8 but drastically decreasing when N is above 8. In addition, the drawbacks of DCT such as performance degradation at the finite length arithmetic could be overcome by the IDCT.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.3
• /
• pp.49-62
• /
• 1998

In the ring loading problem, traffic demands are given for each pair of nodes in an undirected ring network with n nodes and a flow is routed in either of the two directions, clockwise and counter-clockwise. The load of a link is the sum of the flows routed through the link and the objective of the Problem is to minimize the maximum load on the ring. In the ring loading problem with integer demand splitting, each demand can be split between the two directions and the flow routed in each direction is restricted to integers. Recently, Vachani et al. ［INFORMS J. Computing 8 (1996) 235-242］ have developed an Ο(n$^3$) algorithm for solving this integer version of the ring loading problem and independently, Schrijver et al. ［to appear in SIAM J. Disc. Math.］ have presented an algorithm which solves the problem with ｛0,1｝ demands in Ο（n$^2$｜K｜ ) time where K denotes the index set of the origin-desㅇtination pairs of nodes having flow demands. In this paper, we develop an algorithm which solves the problem in Ο(n ｜K｜) time.

• Journal of the Korean Mathematical Society
• /
• v.56 no.1
• /
• pp.67-80
• /
• 2019

For positive integers a, b, c, and an integer n, the number of integer solutions $(x,y,z){\in}{\mathbb{Z}}^3$ of $a{\frac{x(x-1)}{2}}+b{\frac{y(y-1)}{2}}+c{\frac{z(z-1)}{2}}=n$ is denoted by t(a, b, c; n). In this article, we prove some relations between t(a, b, c; n) and the numbers of representations of integers by some ternary quadratic forms. In particular, we prove various conjectures given by Z. H. Sun in [6].

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.6
• /
• pp.19-25
• /
• 2017

This paper deals with integer factorization of two prime p,q of SHA-256 secure hash value n for Bit coin mining. This paper proposes an algorithm that greatly reduces the execution time of Pollard's rho integer factorization algorithm. Rho(${\rho}$) algorithm computes $x_i=x^2_{i-1}+1(mod\;n)$ and $y_i=[(y^2_{i-1}+1)^2+1](mod\;n)$ for intial values $(x_0,y_0)=(2,2)$ to find the factor 1 < $gcd({\mid}x_i-y_i{\mid},n)$ < n. It however fails to factorize some particular composite numbers. The algorithm proposed in this paper applies multiple initial values $(x_0,y_0)=(2^k,2^k)$ and ($2^k,2$), $2{\leq}k{\leq}10$ to the existing Pollard's Rho algorithm. As a results, the proposed algorithm achieves both the factorization of all the composite numbers and the reduction of the execution time of Pollard's Rho by 67.94%.