• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.12
• /
• pp.1343-1352
• /
• 1992

This paper presents a new and easy method to obtain the Fourier transforms of the n-th order cosine-pulses whose maximum amplitudes are uniform. The new method is focused on deriving a formula which is recursively related following their orders and can be well applied to some numerical solutions. On the other hand, this method also offers more compact procedures in view of analytical solutions than the conventional methods because the results are consist of the sum of two functions which are easily calculated. Especially, the formula can be represented as a complete recursion by the separation of coefficients originated by the authors and the resulting difference equation is given by the sum of the original 'sinc' functions shifted by some symmetrical factors and multiplied by some constants. The constants are easily decided from the binomial coefficients and the shifting factors from the corresponding exponential differences in the expansion of $(a+b)^n$.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.2
• /
• pp.106-112
• /
• 2007

This paper proposes a hybrid architecture algorithm for fast computation of DCT and DFT via recursive factorization. Recursive factorization of DCT-II and DFT transform matrix leads to a similar architectural structure so that common architectural base may be used by simply adding a switching device. Linking between two transforms was derived based on matrix recursion formula. Hybrid acrchitectural design for DCT and DFT matrix decomposition were derived using the generation matrix and the trigonometric identities and relations. Data flow diagram for high-speed architecture of Cooley-Tukey type was drawn to accommodate DCT/DFT hybrid architecture. From this data flow diagram computational complexity is comparable to that of the fast DCT algorithms for moderate size of N. Further investigation is needed for multi-mode operation use of FFT architecture in other orthogonal transform computation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.917-924
• /
• 2008

Motion estimation and compensation in the spatial domain check the searching area of specified size in the previous frame and search block to minimize the difference with current block. When we check the searching area, it consumes the most encoding times due to increasing the complexity. We can solve this fault by means of motion estimation using shifting matrix in the transform domain instead of the spatial domain. We derive so the existed shifting matrix to a new recursion equation that we decrease more computations. We modify simply vertical shifting matrix and horizontal shifting matrix in the transform domain for motion estimation of half-pixel accuracy. So, we solve increasing computation due to bilinear interpolation in the spatial domain. Simulation results prove that motion estimation by the proposed algorithm in DCT-based transform domain provides higher PSNR using fewer bits than results in the spatial domain.

• The Journal of the Korea Contents Association
• /
• v.10 no.12
• /
• pp.70-76
• /
• 2010

This paper Extended ELZW(EBCDIC Lempel Ziv Welch) algorithm uses 2 byte prefix field for pointer of a table and 1 byte suffix field for repeat counter. where, a prefix field uses a pointer(index) of compression table and a suffix field uses a counter of overlapping or recursion text data in compression table. To increase compression ratio, after construction of compression table, table data are properly packed as different bit string in accordance with a alphabet, Hangeul, and pointer respectively. Therefore, proposed ELZW algorithm is superior to 1byte LZW algorithm as 5.22 percent and superior to 2byte LZW algorithm as 8.96 percent.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.12
• /
• pp.149-158
• /
• 2012

Proposed is a hybrid randomizing function using two asymptotically optimal randomizing functions: Elias function and Peres function. Randomizing function is an mathematical abstraction of producing a uniform random bits from a source of randomness with bias. It is known that the output rate of Elias function and Peres function approaches to the information-theoretic upper bound. Especially, for each fixed input length, Elias function is optimal. However, its computation is relatively complicated and depends on input lengths. On the contrary, Peres function is defined by a simple recursion. So its computation is much simpler, uniform over the input lengths, and runs on a small footprint. In view of this tradeoff between computational complexity and output efficiency, we propose a hybrid randomizing function that has strengths of the two randomizing functions and analyze it.

• School Mathematics
• /
• v.19 no.3
• /
• pp.553-570
• /
• 2017

The purpose of this study was to gain insights into investigating the feasibility on integrating computational thinking(CT) into school mathematics. Definitions and the components of CT were varied among studies. In this study, CT in mathematics was focused on thinking related with mathematical problem solving under ICT supportive environment where computing tools are available to students to solve problems and verify their answers. The focus is not given on the computing environment itself but on CT in mathematics education. For integrating CT into mathematical problem solving, providing computing environment, understanding of tools and supportive curriculum revisions for integration are essential. Coding with language specially developed for mathematics education such as LOGO, and solving realistic mathematical problems using S/W such as Excel in mathematics classrooms, or integrating CT into math under STEAM contexts are suggested for integration CT into math education. Several conditions for the integration were discussed in this paper.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.7
• /
• pp.1400-1406
• /
• 2007

The core part of education program of the gifted students in information is the thinking ability extension of the programming. We propose four phases of the education model : (1) problem understanding (2) visualization (3) symbolization (4) algorithmization. This model of four phases is applied to learn the abstract concept of recursion using the data structure of Tree. This model is verified by presenting the example of 'Hanoi Tower' to stimulate intellectual curiosity of the students and help to expand their thinking strength. Also, we show the characteristics of which the teaching subjects and learning activities have, by presenting and clarifying the type of education program, properties of the learning contents, and lower level components. The students can deepen and foster the growth of the learning contents by the students' activities of self-evaluation, and their thinking abilities are increased by the guidances of their teachers.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.16 no.2
• /
• pp.97-103
• /
• 2023

Since most of the information is transmitted through the network, eavesdropping and interception by a third party may occur. Appropriate measures are required for effective, secure and confidential communication in the network. Steganography is a technology that prevents third parties from detecting that confidential information is hidden in other media. Due to structural vulnerabilities, information protected by encryption and steganography techniques can be easily exposed to illegitimate groups. In order to improve the limitations of LSB where the simplicity and predictability of the hiding method exist, I propose a technique to improve the security of the message to be hidden based on PRNG and recursive function. To enhance security and confusion, XOR operation was performed on the result of selecting a random bit from the upper bits of the selected channel and the information transformed by the RS-box. PSNR and SSIM were used to confirm the performance of the proposed method. Compared to the reference values, the SSIM and PSNR of the proposed method were 0.9999 and 51.366, respectively, confirming that they were appropriate for hiding information.

• Journal of Korean Ophthalmic Optics Society
• /
• v.12 no.3
• /
• pp.39-48
• /
• 2007

The stimulus of accommodation A, the stimulus of convergence C and the prism diopter ${\Delta}$ are reviewed and redefined more obviously. How the A and C are managed in the practice are reviewed and summarized. As a result, the common practical process of the binocular vision findings is most suitable in the case of the $l_c=26.67mm$, where the near distance is measured from the test lens to the near target and its value is 40 cm and the average of the P.D equal to 64 mm. The $l_c$ is the distance between the test lens and the center of rotation. Those values were used at calculating the various values in this paper. The error of the stimulus of accommodation values which are evaluated by the practically used formula (5) are calculated. Where the distance between lens and the principle point of eye is 15.07 mm ($=l_H$). The incremental stimulus of convergence values P' caused by the addition prism $P_m$ are evaluated by the recursion computation method. The P' are varied with the $P_m$, the distance $p_c$ between the prism and the center of rotation, the initial convergence value (or inverse target distance) $C_o$ and the refractive index n of the prism material. The recursion computation method and the other formulas are described in detail. In this paper n=1.7 is used. The two factors by which the P' is increased are exist. The one which is major is the property by which the values of convergence whose unit is ${\Delta}$ are not added in the generally way. The other is the that the actual power of the prism is varied with the angle of incidence light. And the P' is decreased remarkably by an increase in the $p_c$ and $C_o$. The $P^{\prime}/P_m$ are calculated and graphed which are varied with the $p_c$ and $C_o$, where the $P_m=20{\Delta}$, P.D=64 mm and n=1.7. The index n dependence of the $P^{\prime}/P_m$ is negligible (refer to fig. 6). The $p_c$ are evaluated at which the P' equal to the $P_m$ for various $P_m$ (refer to table 1). The actual values of the stimulus of convergence and accommodation which are manipulated simply in the practice are calculated. Two graphical forms are suggested. The one is like as the commonly used one. But the stimulus of convergence and of accommodation values in the practice are positioned at the exact positions when the graphic is made (refer to fig. 9). The other is the form that the incremental stimulus of convergence values caused by the addition prisms are represented at actual positions (refer to fig. 11).

• Journal of Digital Convergence
• /
• v.18 no.6
• /
• pp.513-522
• /
• 2020

The purpose of this study is to analyze the auto-regression effect between the elderly's assets and depression and life satisfaction, and to approach the influence of assets and depression on the elderly's life from a longitudinal perspective. For this purpose, the data for the 9th year (2014), 11th year (2016), and 13th year (2018) of the Korea Welfare Panel were used. As a result of the analysis, First, the assets, depression and life satisfaction of the elderly have a lasting effect on the passage of time, and the assets, depression and life satisfaction of the previous point in time (B=.694, B=.725, p<.001), depression (B=.258, B=.331 and p<.001) and life satisfaction (B=.264, B=.265, p<.001). Second, cross-recursion coefficients show how the relationship between the assets of the elderly and depression and the satisfaction of life affects each other over time, and the assets of the older person at the previous point in time (B=.010, B=.011, p<.001), the assets of the older persons at previous times are subsequently satisfied with their lives (B=.128, B=.124, p<.001). Based on the results of the above analysis, it is necessary to support the elderly's asset management service and education to prevent depression, such as continuous asset utilization education.