• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.11a
• /
• pp.151-155
• /
• 1999

We proposed the beam tilted antenna by aperture coupled microstrip array, found out the values of design parameters by using Ensemble 5.1 of Ansoft Co., and analysed the performance of fabricated antenna. In order to point to the fixed satellite on the nothern hemisphere, 3 dB beamwidth of this antenna is 25$^{\circ}C$ to 65$^{\circ}C$. Operation bandwidth is 2.51GHz to 2.59GHz. The structure of this antenna is composed by 3 types of squared patches; reflector, driver, and director. The maximum antenna gain is 6.2dB at 2.56GHz and elevation angle of 42$^{\circ}C$. Front-to-Back ratio is more than 13dB at the same condition.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.820-822
• /
• 2005

We have designed a 32-bit microprocessor with fixed point digital signal processing functionality. This processor, combines both general-purpose microprocessor and digital signal processor functionality using the reduced instruction set computer design principles. It has functional units for arithmetic operation, digital signal processing and memory access. They operate in parallel in order to remove stall cycles after DSP or load/store instructions, which usually need one or more issue latency cycles in addition to the first issue cycle. High performance was achieved with these parallel functional units while adopting a sophisticated five-stage pipeline stucture.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.12 no.1
• /
• pp.81-88
• /
• 2007

In this paper, a new single-phase utility-interactive inverter system for residential power generation with fuel cell is proposed. The proposed inverter system is not only capable of working in both stand-alone and grid-connected mode, but also ensures smooth and automatic transfer between the two modes of operation. The proposed control method has little steady-state error and good transient response characteristic. Also, the control method can be implemented using low-cost, fixed point DSP since it has simpler structure, smaller amount of calculation, and smaller number of sensors. The controller for the proposed utility-interactive inverter system is described, and the validity is verified through simulation and experiment.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.4
• /
• pp.3-16
• /
• 2010

Key derivation functions are used within many cryptographic systems in order to generate various keys from a fixed short key string. In this paper we survey a state-of-the-art in the key derivation functions and wish to examine the soundness of the functions on the view point of provable security. Especially we focus on the key derivation functions using pseudorandom functions which are recommended by NISI recently, and show that the variant of Double-Pipeline Iteration mode using pseudorandom permutations is a pseudorandom function. Block ciphers can be regarded as practical primitives of pseudorandom permutations.

• Journal of Korean Neurosurgical Society
• /
• v.30 no.9
• /
• pp.1094-1102
• /
• 2001

Objective : During the trans-condylar or trans-jugular approach for the lesion of cranio-cervical junction(CCJ), its necessary to identify the accurate locations of vertebral artery(VA), internal jugular vein(IJV) and its related lower cranial nerves. These neurovascular structures can also be damaged during the operation for vascular tumor or traumatic aneurysm around extra-jugular foramen, because of their changed locations. To reduce the neurovascular injury at the operation for CCJ, morphometric relationship of its surrounding neurovascular structures based on the tip of the transverse process of atlas(C1 TP), were studied. Materials & Methods : Using 10 adult formalin fixed cadavers, tip of mastoid process(MT) and TPs of atlas and axis were exposed bilaterally after removal of occipital and posterior neck muscles. Using standard caliper, the distances were measured from the C1 TP to the following structures : 1) exit point of VA from C1 transverse foramen, 2) branching point of muscular artery from VA, 3) entry point of VA into posterior atlanto-occipital membrane(AOM), 4) branching point of C-1 nerve. In addition, the distances were measured from the mid-portion of the posterior arch of atlas to the entry point of the VA into AOM and to the exit point of the VA from C1 transverse foramen. After removal of the ventrolateral neck muscles, neurovascular structures were exposed in the extra-jugular foraminal region. Distances were then measured from the C1 TP to the following structures : 1) just extra-jugular foraminal IJV and lower cranial nerves, 2) MT and branching point of facial nerve in parotid gland. In addition, distance between MT and branching point of facial nerve was measured. Results : The VA was located at the mean distance of 12mm(range, 10.5-14mm) from the C1 transverse foramen and entered into the AOM at the mean distance of 24mm(range, 22.8-24.4mm) from the C1 TP. The mean distance from the mid portion of the C1 posterior arch was 20.6mm(range, 19.1-22.3mm) to the entry point of the VA into AOM and 38.4mm(range, 34-42.4mm) to the exit point of the VA from C1 transverse foramen. Muscular artery branched away from the posterior aspect of the transverse portion of VA below the occipital condyle at the mean distance of 22.3mm(range, 15.3-27.5mm) from the C1 TP. The C-1 nerve was identified in all specimens and ran downward through the ventroinferior surface of the transverse segment of VA and branched at the mean distance of 20mm(range, 17.7-20.3mm) from the C1 TP. The IJV was located at the mean distance of 6.7mm(range, 1-13.4mm) ventromedially from the lateral surface of the C1 TP. The XI cranial nerve ran downward on the lateral surface of the IJV at the mean distance of 5mm(range, 3-7.5mm) from the C1 TP. Both IX and X cranial nerves were located in the soft tissue between the medial aspect of the internal carotid artery(ICA) and the medial aspect of the IJV at the mean distance of 15.3mm(range, 13-24mm) and 13.7mm(range, 11-15.4mm) from the C1 TP, respectively. The IX cranial nerve ran downward ventroinferiorly crossing the lateral aspect of the ICA. The X cranial nerve ran downward posteroinferior to the IX cranial nerve and descended posterior to the ICA. The XII cranial nerve was located between the posteroinferior aspect of the IX cranial nerve and the posterior aspect of the ICA at the mean distance of 13.3mm(range, 9-15mm) ventromedially from the C1 TP. The distance between MT and C1 TP was 17.4mm(range, 12.5-23.9mm). The VII cranial nerve branched at the mean distance of 10.2mm(range, 6.8-15.3mm) ventromedially from the MT and at the mean distance of 17.3mm(range, 13-21mm) anterosuperiorly from the C1 TP. Conclusion : This study facilitates an understanding of the microsurgical anatomy of CCJ and may help to reduce the neurovascular injury at the surgery around CCJ.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.188-198
• /
• 2005

The Goldschmidt iterative algorithm for finding a floating point square root calculated it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's square root algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the square root of a floating point number F, the algorithm repeats the following operations: $R_i=\frac{3-e_r-X_i}{2},\;X_{i+1}=X_i{\times}R^2_i,\;Y_{i+1}=Y_i{\times}R_i,\;i{\in}\{{0,1,2,{\ldots},n-1} }}'$with the initial value is $'\;X_0=Y_0=T^2{\times}F,\;T=\frac{1}{\sqrt {F}}+e_t\;'$. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than $'e_r=2^{-p}'$. The value of p is 28 for the single precision floating point, and 58 for the doubel precision floating point. Let $'X_i=1{\pm}e_i'$, there is $'\;X_{i+1}=1-e_{i+1},\;where\;'\;e_{i+1}<\frac{3e^2_i}{4}{\mp}\frac{e^3_i}{4}+4e_{r}'$. If '|X_i-1|<2^{\frac{-p+2}{2}}\;'$ is true, $'\;e_{i+1}<8e_r\;'$ is less than the smallest number which is representable by floating point number. So, $\sqrt{F}$ is approximate to $'\;\frac{Y_{i+1}}{T}\;'$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal square root tables ($T=\frac{1}{\sqrt{F}}+e_i$) with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a square root unit. Also, it can be used to construct optimized approximate reciprocal square root tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.2
• /
• pp.380-389
• /
• 2005

The Goldschmidt iterative algorithm for a floating point divide calculates it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's divide algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To calculate a floating point divide '$\frac{N}{F}$', multifly '$T=\frac{1}{F}+e_t$' to the denominator and the nominator, then it becomes ’$\frac{TN}{TF}=\frac{N_0}{F_0}$'. And the algorithm repeats the following operations: ’$R_i=(2-e_r-F_i),\;N_{i+1}=N_i{\ast}R_i,\;F_{i+1}=F_i{\ast}R_i$, i$\in${0,1,...n-1}'. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than ‘$e_r=2^{-p}$'. The value of p is 29 for the single precision floating point, and 59 for the double precision floating point. Let ’$F_i=1+e_i$', there is $F_{i+1}=1-e_{i+1},\;e_{i+1}',\;where\;e_{i+1}, If '$[F_i-1]<2^{\frac{-p+3}{2}}$ is true, ’$e_{i+1}<16e_r$' is less than the smallest number which is representable by floating point number. So, ‘$N_{i+1}$ is approximate to ‘$\frac{N}{F}$'. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal tables ($T=\frac{1}{F}+e_t$) with varying sizes. 1'he superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a divider. Also, it can be used to construct optimized approximate reciprocal tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.413-420
• /
• 2005

The Newton-Raphson iterative algorithm for finding a floating point reciprocal square mot calculates it by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson's reciprocal square root algorithm is proposed that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the rediprocal square root of a floating point number F, the algorithm repeats the following operations: '$X_{i+1}=\frac{{X_i}(3-e_r-{FX_i}^2)}{2}$, $i\in{0,1,2,{\ldots}n-1}$' with the initial value is '$X_0=\frac{1}{\sqrt{F}}{\pm}e_0$'. The bits to the right of p fractional bits in intermediate multiplication results are truncated and this truncation error is less than '$e_r=2^{-p}$'. The value of p is 28 for the single precision floating point, and 58 for the double precision floating point. Let '$X_i=\frac{1}{\sqrt{F}}{\pm}e_i$, there is '$X_{i+1}=\frac{1}{\sqrt{F}}-e_{i+1}$, where '$e_{i+1}{<}\frac{3{\sqrt{F}}{{e_i}^2}}{2}{\mp}\frac{{Fe_i}^3}{2}+2e_r$'. If '$|\frac{\sqrt{3-e_r-{FX_i}^2}}{2}-1|<2^{\frac{\sqrt{-p}{2}}}$' is true, '$e_{i+1}<8e_r$' is less than the smallest number which is representable by floating point number. So, $X_{i+1}$ is approximate to '$\frac{1}{\sqrt{F}}$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications Per an operation is derived from many reciprocal square root tables ($X_0=\frac{1}{\sqrt{F}}{\pm}e_0$) with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a reciprocal square root unit. Also, it can be used to construct optimized approximate reciprocal square root tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc.

• The KIPS Transactions:PartA
• /
• v.12A no.2 s.92
• /
• pp.95-102
• /
• 2005

The Newton-Raphson iterative algorithm for finding a floating point reciprocal which is widely used for a floating point division, calculates the reciprocal by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson's reciprocal algorithm is proposed that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the reciprocal of a floating point number F, the algorithm repeats the following operations: '$'X_{i+1}=X=X_i*(2-e_r-F*X_i),\;i\in\{0,\;1,\;2,...n-1\}'$ with the initial value $'X_0=\frac{1}{F}{\pm}e_0'$. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than $'e_r=2^{-p}'$. The value of p is 27 for the single precision floating point, and 57 for the double precision floating point. Let $'X_i=\frac{1}{F}+e_i{'}$, these is $'X_{i+1}=\frac{1}{F}-e_{i+1},\;where\;{'}e_{i+1}, is less than the smallest number which is representable by floating point number. So, $X_{i+1}$ is approximate to $'\frac{1}{F}{'}$. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal tables $(X_0=\frac{1}{F}{\pm}e_0)$ with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a reciprocal unit. Also, it can be used to construct optimized approximate reciprocal tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia scientific computing, etc.

• Clean Technology
• /
• v.9 no.4
• /
• pp.179-187
• /
• 2003

The technology of fluidized bed to use dry sorbent can be new technology that reduce the operating cost and make efficient operation. Therefore, this study investigated $CO_2$ control by dry sorbents with operating variables in a fluidized bed, compared with fixed bed for $CO_2$ adsorption capacity and pressure drop, and presented the $CO_2$ adsorption capacity of activated carbon, molecular sieve 5A, molecular sieve 13X, and activated alumina. As the results of this study, the basic data could be achieved for operation of fluidized bed process, and fluidized bed process presented relatively high $CO_2$ adsorption capacity and low pressure drop with the increase of gas velocity. In addition, molecular sieve 5A showed 1.1~3.0-fold later breakthrough point and 1.1~2.7-fold higher adsorption capacity than the other dry sorbents.