• 대한전자공학회논문지SP
• /
• 제46권5호
• /
• pp.15-24
• /
• 2009

Compressed sensing은 소수의 선형 관측으로부터 sparse 신호를 복원하는 문제를 언급하고 있다. 최근 벡터 경우에서의 성공적인 연구 결과가 행렬의 경우로 확장되었다. Low-rank 행렬의 compressed sensing은 ill-posed inverse problem을 low-rank 정보를 이용하여 해결한다. 본 문제는 rank 최소화 혹은 low-rank 근사의 형태로 나타내질 수 있다. 본 논문에서는 최근 제안된 여러 가지 효율적인 알고리즘에 대한 survey를 제공한다.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제13권2호
• /
• pp.152-156
• /
• 2013

This paper presents a fast-lock dual-loop successive approximation register-controlled duty-cycle corrector (SARDCC) circuit using a mixed (binary+sequential) search algorithm. A wider duty-cycle correction range, higher operating frequency, and higher duty-cycle correction accuracy have been achieved by utilizing the dual-loop architecture and the binary search SAR that achieves the fast duty-cycle correcting property. By transforming the binary search SAR into a sequential search counter after the first DCC lock-in, the proposed dual-loop SARDCC keeps the closed-loop characteristic and tracks variations in process, voltage, and temperature (PVT). The measured duty cycle error is less than ${\pm}0.86%$ for a wide input duty-cycle range of 15-85 % over a wide frequency range of 0.5-2.0 GHz. The proposed dual-loop SARDCC is fabricated in a 0.18-${\mu}m$, 1.8-V CMOS process and occupies an active area of $0.075mm^2$.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 B
• /
• pp.683-685
• /
• 1999

As a method of obtaining pulse transfer function. transfer function of discrete-time from input-output data, there are method of obtaining unknown parameter of pulse transfer function from estimated impulse response before(1-3). There is no need to approximate to several meanings because of not being established algebraical relations between impulse response for estimation error and parameter of transfer function exactly. In this paper, I inquire the method[4] of obtaining the optimal pulse transfer function as a meaning of Hankel norm approximation from impulse response data and examine estimated property as computer simulation from this method.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제3권1호
• /
• pp.1-15
• /
• 1999

Gradient recovery techniques for the second order elliptic boundary value problem are well known. In particular, the Midpoint and the Vertex Recovery Operator have been studied by various authors and under suitable assumptions on the regularity of the unknown solution superconvergence property of these recovered gradients have been proved. In this paper we extend these results to the recovered gradient of the finite element approximation to a model initial-boundary value problem, and go on to prove superconvergence result for this recovered gradient in a discrete (in time) error norm.

• 전자공학회논문지S
• /
• 제35S권5호
• /
• pp.27-34
• /
• 1998

This paper is on the discrete model reduction method over disc-type analytic domains. We define hankel singular value over the disc that is mapped by standard bilinear mapping. And the generalized singular perturbation approximation and the direct truncation are generalized to GSPA and DT over a disc. Furthermore, it is shown that the reduced order model over a smaller domaing has a smaller .inf.-norm error bound. And the poposed reduction method is used to obtain the regional pole placement property.

• 대한수학회지
• /
• 제38권2호
• /
• pp.321-336
• /
• 2001

A Feynman functional formulation is given for the Global Positioning System, GPS. Both the sequential and analytic Feynman functionals are presented for the classical, exterior, gravity problems which included rigid body rotations, special relativity and some general relativity corrections. A mathematically rigorous approach is introduced whose solutions exist, are unique and which depend continuously on the intial data. This formulation is convergent and has the finite approximation property. It is emphasized that all of the problems studied are classical (not quantum) evolution systems.

• East Asian mathematical journal
• /
• 제24권1호
• /
• pp.57-65
• /
• 2008

The approximate solvability of a generalized system for non-linear variational inequality in Hilbert spaces was studied, based on the convergence of projection methods. But little research was done in Banach space. The primary reason was that projection mapping lacked preferably property in Banach space. In this paper, we introduced the generalized projection methods. By using these methods, the results presented in this paper extended the main results of S. S. Chang [3] from Hilbert spaces to Banach space.

• Journal of applied mathematics & informatics
• /
• 제2권2호
• /
• pp.21-46
• /
• 1995

Congestion and memory occupancy in computer system may be reduced further if new jobs are admitted only when the num-ber of jobs queued at CPU is below CPU run queue cutoff (RQ). In this paper we prove that response time of a job is invariant with respect to RQ if jobs do not communicate each other. We also demonstrate this invariance property numerically using marix-geometric methods and present an approximate method for the delay due to context switch-ing under time slicing. The approximation suggests that time slicing with constant overhead yields a throughput similar to an FCFS system without overhead.

• 대한수학회보
• /
• 제44권4호
• /
• pp.807-816
• /
• 2007

For the stochastic differential inclusion on infinite dimensional space of the form $dX_t{\in}\sigma(X_t)dW_t+b(X_t)dt$, where ${\sigma}$, b are set-valued maps, W is an infinite dimensional Hilbert space valued Q-Wiener process, we prove the boundedness and continuity of solutions under the assumption that ${\sigma}$ and b are closed convex set-valued satisfying the Lipschitz property using approximation.

• ETRI Journal
• /
• 제30권1호
• /
• pp.170-172
• /
• 2008

A substitution box (S-box) plays a central role in cryptographic algorithms. In this paper, an efficient method for designing S-boxes based on chaotic maps is proposed. The proposed method is based on the mixing property of piecewise linear chaotic maps. The S-box so constructed has very low differential and linear approximation probabilities. The proposed S-box is more secure against differential and linear cryptanalysis compared to recently proposed chaotic S-boxes.