• The Bulletin of The Korean Astronomical Society
• /
• v.39 no.2
• /
• pp.86.2-86.2
• /
• 2014

We present a new ray-tracing code, "Odyssey", for the Kerr spacetime accelerated by the Graphics Processing Unit (GPU). Taking advantage of the ability of nVidia graphic cards to evaluate trajectories of a large amount of photon simultaneously, the code is two orders of magnitude as fast as the previous CPU-based code corresponding to the speed of few nanoseconds per photon per time step. In the light of the Graphic User Interface (GUI) powered by the GPU-enhanced 2D/3D displaying technique, DirectX, it is feasible for users to manipulate diverse results such as rotating and zooming in/out the trajectories of photon instantly near the black hole. Thus the Odyssey can serve as a tool not only for scientific but also for the educational purpose. We discuss possible applications in detail in light of several results such as the shape of the silhouette of a black hole, the shape of a hot spot orbiting a black hole, and 3D photon trajectories.

• Journal of IKEEE
• /
• v.15 no.3
• /
• pp.241-247
• /
• 2011

In this paper, it was implemented an algorithm of multimedia fingerprinting in DCT block. For the improvement of the limits of DRM’s ability, the proposed algorithm could be decided a responsibility boundary to judge a traitor who falsified the content according to perform separately a watermarking of content provider and a fingerprinting of content user. At the test image size($128{\times}128$) and block size($8{\times}8$) of the content provider, the measured PSNR is Inf~46.6dB with watermarking strength ${\Theta}=0.5{\sim}1.2$, and at a number of users and user's code length are n=7,15,31,63 and l=7,15,31,64 each, the measured PSNR is Inf~46.1 with fingerprinting code length l=7,15,31,63. Finally, a traitor tracing of the falsified content is approached to a trace ratio 1 which is extended to n-1.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.1
• /
• pp.9-18
• /
• 2003

In this paper, we analyzed the throughput of DS/CDMA system applying packet combining scheme combined with Type- I Hybrid ARQ scheme over AWGN channel and Nakagami fading channel with RAKE receiver. As the parameter for analysis, we used number of combined packet(L), number of diversity branch$({L_c})$, fading index(m), and length of packet(N), and used CRC-12 error detection code and (2,1,3) convolutional code. As a results, we found that throughput of system over Nakagami fading channel with RAKE receiver was superior to throughput over AWGN channel, and throughput of system decreases rapidly as channel degrades when number of combined packet(L) was increased. However throughput of system with the combining scheme was achieved even at low ${E_b}/{N_o}$. Also, we found that throughput of system was increased when fading index(m) and number of diversity branch$({L_c})$ were increased, but it was decreased when number of user(K) and length of packet(N) were increased.

• Journal of Advanced Navigation Technology
• /
• v.15 no.4
• /
• pp.495-501
• /
• 2011

The characteristics of a discriminator estimating a tracking error in a signal tracking loop of a GPS receiver can be affected by the noise power, and the slope of the discriminator function is actually lowered as the noise power increases. In this paper, an algorithm to compensate the lowered slope of the function using the estimated C/N0 is studied, and a new design method of a code tracking which provides more accurate tracking error than a conventional one by adopting the compensation algorithm is proposed. Through the experimental results, finally, it has been check that the accuracy of the proposed DLL is enhanced about 50% when the dynamics of the vehicle is 20g/s.

• Journal of Yeungnam Medical Science
• /
• v.2 no.1
• /
• pp.183-190
• /
• 1985

The glucose nonfermenting gram-negative bacilli encountered about 10% of all gram-negative bacilli isolated from clinical material. Therefore, a rapid and correct identification of glucose nonfermenting gram-negative bacilli is impostent for a better management of infectious disease. There are many conventional systems for the Identification of glucose nonfermenting gram-negative bacilli but most of them have problems and difficulties. Commercial Kit Systems exist and they are too expensive for dally use 10 Korea because of high cost. Based on 12 selected tests we propose a new code system, MCRCODE-N for rapid and 10-expensive identification of glucose nonfermenting gram-negative bacilli. The selective 12 tests are oxidase, glucose oxidation motility, urease, DNase arginine dehydrolase, nitrate reduction, gelatin Liquefaction, esculin hydrolysis, mannitol oxidation, maltose oxidation, Lactose oxidation. The 12 tests are divided 4 group and then each group has 3 tests. The result of each group is expressed by the number as below. The positive test is given by specific number (1st test = 1, 2nd test = 2, 3rd test = 4), while any negative result is 0. Each 3 numbers of one group are added and make number of 1 digit. Four digit number is refered to the code book of MCRCODE-N system or MCRCODE system using computer (Apple-II model) created by authors. This MCRCODE-N system is suitable ones for our use 10 Korea. We propose the MCRCODEN-N system for clinical use.

• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.1-4
• /
• 2010

As a countermeasure to simple power attack, the unified point addition codes for the elliptic curve cryptosystem were introduced. However, some authors proposed a different kind of power attacks to the codes. This power attack uses the observation that some internal operations in the codes behave differently for addition and doubling. In this paper, we propose a new countermeasure against such an attack. The basic idea of the new countermeasure is that, if one of the input points of the codes is transformed to an equivalent point over the underlying finite field, then the code will behave in the same manner for addition and doubling. The new countermeasure is highly efficient in that it only requires 27(n-1)/3 extra ordinary integer subtractions (in average) for the whole n-bit scalar multiplication. The timing analysis of the proposed countermeasure is also presented to confirm its SPA resistance.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.15-21
• /
• 2010

This paper proposes the multimedia fingerprinting code insertion algorithm when video content is distributed in P2P environment, and designs the collusion codebook SRP(Small RISC Processor) embedded system for the collusion attack prevention. In the implemented system, it is detecting the fingerprinting code inserted in the video content of the client user in which it requests an upload to the web server and in which if it is certified content then transmitted to the streaming server then the implemented system allowed to distribute in P2P network. On the contrary, if it detects the collusion code, than the implemented system blocks to transmit the video content to the streaming server and discontinues to distribute in P2P network. And also it traces the colluders who generate the collusion code and participates in the collusion attack. The collusion code of the averaging attack is generated with 10% of BIBD code v. Based on the generated collusion code, the codebook is designed. As a result, when the insert quantity of the fingerprinting code is 0.15% upper in bitplane 0~3 of the Y(luminance) element of I-frame at the video compression of ASF for a streaming service and MP4 for an offline offer of video content, the correlation coefficient of the inserted original code and the detected code is above 0.15. At the correlation coefficient is above 0.1 then the detection ratio of the collusion code is 38%, and is above 0.2 then the trace ratio of the colluder is 20%.

• ETRI Journal
• /
• v.27 no.3
• /
• pp.273-279
• /
• 2005

Toward code division multiple access (CDMA) communications and data protection, we propose and analyze pseudorandom noise (PN) sequences generated from a 2-dimensional array structure of shift-registers. For any positive integers m and n, we construct PN sequences of period $2^{mm}-1$ using an $m{\times}n$ array of registers and show that we can generate all shifted PN sequences as required by IS-95x with the proper linear combination of available sequences.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.61-64
• /
• 2000

There are many methods of generating PN sequences. In this paper, we propose and examine a new class of composite shift register to generate PN sequences. The new composite generator, in comparison with the original LFSR which generates PN codes of period 2$^n$-1, when coupled with codes of period k, generates PN codes with (longer) period LCM(2$^n$-1,k).

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.224-228
• /
• 2003

물리, 화학, 생물, 공학 등의 학문 분야뿐만 아니라 인공위성과의 통신, 컴퓨터, 컴팩트 디스크 등 첨단산업기술에 까지 광범위하게 응용되고 있는 부호는 입력잘못이나 전파 방해 등 여러 가지 원인으로 오류가 발생할 수 있다. 본 논문에서는 셀룰라 오토마타를 기반으로 하여 검사비트를 생성하고 선형대수 이론을 이용하여 수신된 부호어를 효과적으로 복호할 수 있는 복호기법을 제안한다.