• Title/Summary/Keyword: 반복전송

Search Result 405, Processing Time 0.023 seconds

Selective Extraction of a Single Optical Frequency Component from an Optical Frequency Comb (광 주파수 빗으로부터 단일 광 주파수 성분의 선택적 추출)

  • Han Seb Moon
    • Korean Journal of Optics and Photonics
    • /
    • v.34 no.6
    • /
    • pp.225-234
    • /
    • 2023
  • Mode-locked pulse lasers have a temporal periodicity up over a short period of time. However, in the time-frequency domain, a pulsed laser with temporal periodicity is described as an optical frequency comb with constant frequency spacing. Each frequency component of the optical frequency comb in the frequency domain is then a continuous-wave (CW) laser with hundreds of thousands of single-frequency-component CW lasers in the time domain. This optical frequency comb was developed approximately 20 years ago, enabling the development of the world's most precise atomic clocks and precise transmission of highly stable optical frequency references. In this review, research on the selective extraction of the single-frequency components of optical frequency combs and the control of the frequency components of optical combs is introduced. By presenting the concepts and principles of these optical frequency combs in a tutorial format, we hope to help readers understand the properties of light in the time-frequency domain and develop various applications using optical frequency combs.

A Study on Median Filter's Improvement for Removal of Impulse Noise (임펄스 잡음 제거를 위한 미디언 필터의 개선에 관한 연구)

  • Lee, Kyung-Hyo;Ryu, Ji-Goo;Kim, Nam-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.165-168
    • /
    • 2008
  • With the development of the information technology in recent years, the innovation of multimedia information technology also has been accelerated. Many fields of the digital image processing technologies as image data compression, recognition. restoration, etc. are now being studied actively. When transmitting and saving digital images, noise would be made, and we are using the image filters to remove the noise. The Image Filter used Digital Image Process basically has a two-dimensional structure. There are two methods of the filter's creation - One is reiterating one dimension, and the other is using an indivisible two-dimension image filter. The space domain method using mask is the latter one. That is inserting the value-multiplied pixels values faced each other when the two-dimension filter overlapped on input image- to the filter value's center position and the same position in the image. The image filter is being used widely along with one-dimension filter, according each noise. Most people are using various median filters to remove the impulse noise. However, in this paper, I suggested a powerful switching median filter and compared with conventional method for verification.

  • PDF

Secure Routing Mechanism using one-time digital signature in Ad-hoc Networks (애드혹 네트워크에서의 one-time 전자 서명을 이용한 라우팅 보안 메커니즘)

  • Pyeon, Hye-Jin;Doh, In-Shil;Chae, Ki-Joon
    • The KIPS Transactions:PartC
    • /
    • v.12C no.5 s.101
    • /
    • pp.623-632
    • /
    • 2005
  • In ad-hoc network, there is no fixed infrastructure such as base stations or mobile switching centers. The security of ad-hoc network is more vulnerable than traditional networks because of the basic characteristics of ad-hoc network, and current muting protocols for ad-hoc networks allow many different types of attacks by malicious nodes. Malicious nodes can disrupt the correct functioning of a routing protocol by modifying routing information, by fabricating false routing information and by impersonating other nodes. We propose a routing suity mechanism based on one-time digital signature. In our proposal, we use one-time digital signatures based on one-way hash functions in order to limit or prevent attacks of malicious nodes. For the purpose of generating and keeping a large number of public key sets, we derive multiple sets of the keys from hash chains by repeated hashing of the public key elements in the first set. After that, each node publishes its own public keys, broadcasts routing message including one-time digital signature during route discovery and route setup. This mechanism provides authentication and message integrity and prevents attacks from malicious nodes. Simulation results indicate that our mechanism increases the routing overhead in a highly mobile environment, but provides great security in the route discovery process and increases the network efficiency.

Verticality 3D Monitoring System for the Large Circular Steel Pipe (대형 원형강관 수직도 모니터링을 위한 3D 모니터링 시스템)

  • Koo, Sungmin;Park, Haeyoung;Oh, Myounghak;Baek, Seungjae
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.11
    • /
    • pp.870-877
    • /
    • 2020
  • A suction bucket foundation, especially useful at depths of more than 20m, is a method of construction. The method first places an empty upturned bucket at the target site. Then, the bucket is installed by sucking water or air into it to create negative pressure. For stability, it is crucial to secure the verticality of the bucket. However, inclination by the bucket may occur due to sea-bottom conditions. In general, a repeated intrusion-pulling method is used for securing verticality. However, it takes a long time to complete the job. In this paper, we propose a real-time suction bucket verticality monitoring system. Specifically, the system consists of a sensor unit that collects raw verticality data, a controller that processes the data and wirelessly transmits the information, and a display unit that shows verticality information of a circular steel pipe. The system is implemented using an inclination sensor and an embedded controller. Experimental results show that the proposed system can efficiently measure roll/pitch information with a 0.028% margin of error. Furthermore, we show that the system properly operates in a suction bucket-based model experiment.

Efficient Coding of Motion Vector and Mode Information for H.264/AVC (H.264/AVC에서 효율적인 움직임 벡터와 모드 정보의 압축)

  • Lee, Dong-Shik;Kim, Young-Mo
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.10
    • /
    • pp.1359-1365
    • /
    • 2008
  • The portion of header in H.264 gets higher than those of previous standards instead of its better compression efficiency. Therefore, this paper proposes a new technique to compress the header of H.264. Unifying a sentence elementary in H.264, H.264 does not consider the distribution of element which be encoded and uses existing Exp-Golomb method, but it is uneffective for variable length coding. Most of the header are block type(s) and motion vector difference(s), and there are redundancies in the header of H.264. The redundancies in the header of H.264 which are analyzed in this paper are three. There are frequently appearing symbols and non-frequently appearing symbols in block types. And when mode 8 is selected in macroblock, all of four sub-macroblock types are transferred. At last, same values come in motion vector difference, especially '0.' This paper proposes the algorithm using type code and quadtree, and with them presents the redundant information of header in H.264. The type code indicates shape of the macroblock and the quadtree does the tree structured motion compensation. Experimental results show that proposed algorithm achieves lower total number of encoded bits over JM12.4 up to 32.51% bit reduction.

  • PDF

Packet Loss Concealment Algorithm Based on Speech Characteristics (음성신호의 특성을 고려한 패킷 손실 은닉 알고리즘)

  • Yoon Sung-Wan;Kang Hong-Goo;Youn Dae-Hee
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.7C
    • /
    • pp.691-699
    • /
    • 2006
  • Despite of the in-depth effort to cantrol the variability in IP networks, quality of service (QoS) is still not guaranteed in the IP networks. Thus, it is necessary to deal with the audible artifacts caused by packet lasses. To overcame the packet loss problem, most speech coding standard have their own embedded packet loss concealment (PLC) algorithms which adapt extrapolation methods utilizing the dependency on adjacent frames. Since many low bit rate CELP coders use predictive schemes for increasing coding efficiency, however, error propagation occurs even if single packet is lost. In this paper, we propose an efficient PLC algorithm with consideration about the speech characteristics of lost frames. To design an efficient PLC algorithm, we perform several experiments on investigating the error propagation effect of lost frames of a predictive coder. And then, we summarize the impact of packet loss to the speech characteristics and analyze the importance of the encoded parameters depending on each speech classes. From the result of the experiments, we propose a new PLC algorithm that mainly focuses on reducing the error propagation time. Experimental results show that the performance is much higher than conventional extrapolation methods over various frame erasure rate (FER) conditions. Especially the difference is remarkable in high FER condition.

Implementation of High-Throughput SHA-1 Hash Algorithm using Multiple Unfolding Technique (다중 언폴딩 기법을 이용한 SHA-1 해쉬 알고리즘 고속 구현)

  • Lee, Eun-Hee;Lee, Je-Hoon;Jang, Young-Jo;Cho, Kyoung-Rok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.47 no.4
    • /
    • pp.41-49
    • /
    • 2010
  • This paper proposes a new high speed SHA-1 architecture using multiple unfolding and pre-computation techniques. We unfolds iterative hash operations to 2 continuos hash stage and reschedules computation timing. Then, the part of critical path is computed at the previous hash operation round and the rest is performed in the present round. These techniques reduce 3 additions to 2 additions on the critical path. It makes the maximum clock frequency of 118 MHz which provides throughput rate of 5.9 Gbps. The proposed architecture shows 26% higher throughput with a 32% smaller hardware size compared to other counterparts. This paper also introduces a analytical model of multiple SHA-1 architecture at the system level that maps a large input data on SHA-1 block in parallel. The model gives us the required number of SHA-1 blocks for a large multimedia data processing that it helps to make decision hardware configuration. The hs fospeed SHA-1 is useful to generate a condensed message and may strengthen the security of mobile communication and internet service.

Study on the Business Process Modeling scheme using the Context Analysis methodology (상황 분석 방법론을 적용한 효율적 비즈니스 프로세스 모델링 방안에 관한 연구)

  • You, Chi-Hyung;Sang, Sung-Kyung;Kim, Jung-Jae;Na, Won-Shik
    • Journal of Digital Contents Society
    • /
    • v.9 no.4
    • /
    • pp.661-667
    • /
    • 2008
  • The dynamics of business cycles has been changed by the macroscopic economic forces because of the introduction of new technical know-how each year. These the dynamics of business has a significant influence on the investment of enterprise in the information communication field. Today, the most important goal of the IT investment is simply not to lower the production cost any more, but to improve the usefulness for the customers and partners in order to obtain the optimized mass products. Therefore, the enterprises have been concentrating their all abilities on the automation, integration, and optimization of business process using BPM. In addition, they are concentrating their efforts on the business expansion by approaching the technical aspect using RFID application system. However, in order to accomplish a successful enterprise ability, the technical view, business process view, and organization view must be considered together. We suggested the method considering organization view, via the technical element, i.e., RFID system for approaching the business process. Furthermore, we tried the optimization of assignment using Context Analysis methodology and proposed the method to reduce the element with respect to the time, human, and expense by applying the Case Study method that minimizes the iteration times through the transmitted processing procedure and type. The proposed method gave us the expectation that it will bring out the innovative improvement with respect to the time, expense, quality, and customer's satisfaction in the process from the analysis of business process to the analysis and design of system.

  • PDF

An Improvement for Location Accuracy Algorithm of Moving Indoor Objects (실내 이동 객체의 위치 정확도 개선을 위한 알고리즘)

  • Kim, Mi-Kyeong;Jeon, Hyeon-Sig;Yeom, Jin-Young;Park, Hyun-Ju
    • Journal of Internet Computing and Services
    • /
    • v.11 no.2
    • /
    • pp.61-72
    • /
    • 2010
  • This paper addresses the problem of moving object localization using Ultra-Wide-Band(UWB) range measurement and the method of location accuracy improvement of the indoor moving object. Unlike outdoor environment, it is difficult to track moving object position due to various noises in indoor. UWB is a radio technology that has attention for localization applications recently. UWB's ranging technique offer the cm accuracy. Its capabilities for data transmission, range accurate estimation and material penetration are suitable technology for indoor positioning application. This paper propose a positioning algorithm of an moving object using UWB ranging technique and particle filter. Existing positioning algorithms eliminate estimation errors and bias after location estimation of mobile object. But in this paper, the proposed algorithm is that eliminate predictable UWB range distance error first and then estimate the moving object's position. This paper shows that the proposed positioning algorithm is more accurate than existing location algorithms through experiments. In this study, the position of moving object is estimated after the triangulation and eliminating the bias and the ranging error from estimation range between three fixed known anchors and a mobile object using UWB. Finally, a particle filter is used to improve on accuracy of mobile object positioning. The results of experiment show that the proposed localization scheme is more precise under the indoor.

Implementation and Validation of the Web DDoS Shelter System(WDSS) (웹 DDoS 대피소 시스템(WDSS) 구현 및 성능검증)

  • Park, Jae-Hyung;Kim, Kang-Hyoun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.4
    • /
    • pp.135-140
    • /
    • 2015
  • The WDSS improves defensive capacity against web application layer DDoS attack by using web cache server and L7 switch which are added on the DDoS shelter system. When web DDoS attack occurs, security agents divert traffic from backbone network to sub-network of the WDSS and then DDoS protection device and L7 switch block abnormal packets. In the meantime, web cache server responds only to requests of normal clients and maintains stable web service. In this way, the WDSS can counteract the web DDoS attack which generates small traffic and depletes server-client session resource. Furthermore, the WDSS does not require IP tunneling because it is not necessary to retransfer the normal requests to original web server. In this paper, we validate operation of the WDSS and verify defensive capability against web application layer DDoS attacks. In order to do this, we built the WDSS on backbone network of an ISP. And we performed web DDoS tests by using a testing system that consists of zombie PCs. The tests were performed by three types and various amounts of web DDoS attacks. Test results suggest that the WDSS can detect small traffic of the web DDoS attacks which do not have repeat flow whereas the formal DDoS shelter system cannot.