• Title/Summary/Keyword: Parallel Implementation

Search Result 878, Processing Time 0.024 seconds

Design of a Bit-Serial Divider in GF(2$^{m}$ ) for Elliptic Curve Cryptosystem (타원곡선 암호시스템을 위한 GF(2$^{m}$ )상의 비트-시리얼 나눗셈기 설계)

  • 김창훈;홍춘표;김남식;권순학
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.12C
    • /
    • pp.1288-1298
    • /
    • 2002
  • To implement elliptic curve cryptosystem in GF(2$\^$m/) at high speed, a fast divider is required. Although bit-parallel architecture is well suited for high speed division operations, elliptic curve cryptosystem requires large m(at least 163) to support a sufficient security. In other words, since the bit-parallel architecture has an area complexity of 0(m$\^$m/), it is not suited for this application. In this paper, we propose a new serial-in serial-out systolic array for computing division operations in GF(2$\^$m/) using the standard basis representation. Based on a modified version of tile binary extended greatest common divisor algorithm, we obtain a new data dependence graph and design an efficient bit-serial systolic divider. The proposed divider has 0(m) time complexity and 0(m) area complexity. If input data come in continuously, the proposed divider can produce division results at a rate of one per m clock cycles, after an initial delay of 5m-2 cycles. Analysis shows that the proposed divider provides a significant reduction in both chip area and computational delay time compared to previously proposed systolic dividers with the same I/O format. Since the proposed divider can perform division operations at high speed with the reduced chip area, it is well suited for division circuit of elliptic curve cryptosystem. Furthermore, since the proposed architecture does not restrict the choice of irreducible polynomial, and has a unidirectional data flow and regularity, it provides a high flexibility and scalability with respect to the field size m.

A Study on Implementation and Performance of the Power Control High Power Amplifier for Satellite Mobile Communication System (위성통신용 전력제어 고출력증폭기의 구현 및 성능평가에 관한 연구)

  • 전중성;김동일;배정철
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.4 no.1
    • /
    • pp.77-88
    • /
    • 2000
  • In this paper, the 3-mode variable gain high power amplifier for a transmitter of INMARSAT-B operating at L-band(1626.5-1646.5 MHz) was developed. This SSPA can amplify 42 dBm in high power mode, 38 dBm in medium power mode and 36 dBm in low power mode for INMARSAT-B. The allowable errol sets +1 dBm as the upper limit and -2 dBm as the lower limit, respectively. To simplify the fabrication process, the whole system is designed by two parts composed of a driving amplifier and a high power amplifier. The HP's MGA-64135 and Motorola's MRF-6401 were used for driving amplifier, and the ERICSSON's PTE-10114 and PTF-10021 for the high power amplifier. The SSPA was fabricated by the RP circuits, the temperature compensation circuits and 3-mode variable gain control circuits and 20 dB parallel coupled-line directional coupler in aluminum housing. In addition, the gain control method was proposed by digital attenuator for 3-mode amplifier. Then il has been experimentally verified that the gain is controlled for single tone signal as well as two tone signals. In this case, the SSPA detects the output power by 20 dB parallel coupled-line directional coupler and phase non-splitter amplifier. The realized SSPA has 41.6 dB, 37.6 dB and 33.2 dB for small signal gain within 20 MHz bandwidth, and the VSWR of input and output port is less than 1.3:1. The minimum value of the 1 dB compression point gets more than 12 dBm for 3-mode variable gain high power amplifier. A typical two tone intermodulation point has 36.5 dBc maximum which is single carrier backed off 3 dB from 1 dB compression point. The maximum output power of 43 dBm was achieved at the 1636.5 MHz. These results reveal a high power of 20 Watt, which was the design target.

  • PDF

Trace-Back Viterbi Decoder with Sequential State Transition Control (순서적 역방향 상태천이 제어에 의한 역추적 비터비 디코더)

  • 정차근
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.11
    • /
    • pp.51-62
    • /
    • 2003
  • This paper presents a novel survivor memeory management and decoding techniques with sequential backward state transition control in the trace back Viterbi decoder. The Viterbi algorithm is an maximum likelihood decoding scheme to estimate the likelihood of encoder state for channel error detection and correction. This scheme is applied to a broad range of digital communication such as intersymbol interference removing and channel equalization. In order to achieve the area-efficiency VLSI chip design with high throughput in the Viterbi decoder in which recursive operation is implied, more research is required to obtain a simple systematic parallel ACS architecture and surviver memory management. As a method of solution to the problem, this paper addresses a progressive decoding algorithm with sequential backward state transition control in the trace back Viterbi decoder. Compared to the conventional trace back decoding techniques, the required total memory can be greatly reduced in the proposed method. Furthermore, the proposed method can be implemented with a simple pipelined structure with systolic array type architecture. The implementation of the peripheral logic circuit for the control of memory access is not required, and memory access bandwidth can be reduced Therefore, the proposed method has characteristics of high area-efficiency and low power consumption with high throughput. Finally, the examples of decoding results for the received data with channel noise and application result are provided to evaluate the efficiency of the proposed method.

A Dynamical Load Balancing Method for Data Streaming and User Request in WebRTC Environment (WebRTC 환경에 데이터 스트리밍 및 사용자 요청에 따른 동적로드 밸런싱 방법)

  • Ma, Linh Van;Park, Sanghyun;Jang, Jong-hyun;Park, Jaehyung;Kim, Jinsul
    • Journal of Digital Contents Society
    • /
    • v.17 no.6
    • /
    • pp.581-592
    • /
    • 2016
  • WebRTC has quickly grown to be the world's advanced real-time communication in several platforms such as web and mobile. In spite of the advantage, the current technology in WebRTC does not handle a big-streaming efficiently between peers and a large amount request of users on the Signaling server. Therefore, in this paper, we put our work to handle the problem by delivering the flow of data with dynamical load balancing algorithms. We analyze the request source users and direct those streaming requests to a load balancing component. More specifically, the component determines an amount of the requested resource and available resource on the response server, then it delivers streaming data to the requesting user parallel or alternately. To show how the method works, we firstly demonstrate the load-balancing algorithm by using a network simulation tool OPNET, then, we seek to implement the method into an Ubuntu server. In addition, we compare the result of our work and the original implementation of WebRTC, it shows that the method performs efficiently and dynamically than the origin.

Comparison Study on Projection and Backprojection Methods for CT Simulation (투사 및 역투사 방법에 따른 컴퓨터단층촬영 영상 비교)

  • Oh, Ohsung;Lee, Seung Wook
    • Journal of radiological science and technology
    • /
    • v.37 no.4
    • /
    • pp.323-330
    • /
    • 2014
  • Image reconstruction is one of the most important processes in CT (Computed tomography) technology. For fast scanning and low dose to the objects, iterative reconstruction is becoming more and more important. In the implementation of iterative reconstruction, projection and backprojection processes are considered to be indispensable parts. However, many approaches for projection and backprojection may result severe image artifacts due to their discrete characteristics and affects the reconstructed image quality. Thus, new approaches for projection and backprojection are highly demanded these days. In this paper, distance-driven approach was evaluated and compared with other conventional methods. The numerical simulator was developed to make the phantoms, and projection and backprojection images were compared using these approaches. As a result, it turned out that there are less artifacts during projection and backprojection in parallel and fan beam geometry.

Design and Implementation of an Efficient Web Services Data Processing Using Hadoop-Based Big Data Processing Technique (하둡 기반 빅 데이터 기법을 이용한 웹 서비스 데이터 처리 설계 및 구현)

  • Kim, Hyun-Joo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.1
    • /
    • pp.726-734
    • /
    • 2015
  • Relational databases used by structuralizing data are the most widely used in data management at present. However, in relational databases, service becomes slower as the amount of data increases because of constraints in the reading and writing operations to save or query data. Furthermore, when a new task is added, the database grows and, consequently, requires additional infrastructure, such as parallel configuration of hardware, CPU, memory, and network, to support smooth operation. In this paper, in order to improve the web information services that are slowing down due to increase of data in the relational databases, we implemented a model to extract a large amount of data quickly and safely for users by processing Hadoop Distributed File System (HDFS) files after sending data to HDFSs and unifying and reconstructing the data. We implemented our model in a Web-based civil affairs system that stores image files, which is irregular data processing. Our proposed system's data processing was found to be 0.4 sec faster than that of a relational database system. Thus, we found that it is possible to support Web information services with a Hadoop-based big data processing technique in order to process a large amount of data, as in conventional relational databases. Furthermore, since Hadoop is open source, our model has the advantage of reducing software costs. The proposed system is expected to be used as a model for Web services that provide fast information processing for organizations that require efficient processing of big data because of the increase in the size of conventional relational databases.

Efficiency Evaluation of Genetic Algorithm Considering Building Block Hypothesis for Water Pipe Optimal Design Problems (상수관로 최적설계 문제에 있어 빌딩블록가설을 고려한 유전 알고리즘의 효율성 평가)

  • Lim, Seung Hyun;Lee, Chan Wook;Hong, Sung Jin;Yoo, Do Guen
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.5
    • /
    • pp.294-302
    • /
    • 2020
  • In a genetic algorithm, computer simulations are performed based on the natural evolution process of life, such as selection, crossover, and mutation. The genetic algorithm searches the approximate optimal solution by the parallel arrangement of Schema, which has a short definition length, low order, and high adaptability. This study examined the possibility of improving the efficiency of the optimal solution by considering the characteristics of the building block hypothesis, which are one of the key operating principles of a genetic algorithm. This study evaluated the efficiency of the optimization results according to the gene sequence for the implementation in solving problems. The optimal design problem of the water pipe was selected, and the genetic arrangement order reflected the engineering specificity by dividing into the existing, the network topology-based, and the flowrate-based arrangement. The optimization results with a flowrate-based arrangement were, on average, approximately 2-3% better than the other batches. This means that to increase the efficiency of the actual engineering optimization problem, a methodology that utilizes clear prior knowledge (such as hydraulic properties) to prevent such excellent solution characteristics from disappearing is essential. The proposed method will be considered as a tool to improve the efficiency of large-scale water supply network optimization in the future.

Implementation of Constructor-Oriented Visualization System for Occluded Construction via Mobile Augmented-Reality (모바일 증강현실을 이용한 작업자 중심의 폐색된 건축물 시각화 시스템 개발)

  • Kim, Tae-Ho;Kim, Kyung-Ho;Han, Yunsang;Lee, Seok-Han;Choi, Jong-Soo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.2
    • /
    • pp.55-68
    • /
    • 2014
  • Some infrastructure these days is usually constructed under the ground for it to not interfere the foot-traffic of pedestrians, and thus, it is difficult to visually confirm the accurate location of the site where the establishments must be buried. These technical difficulties increase the magnitude of the problems that could arise from over-reliance on the experience of the worker or a mere blueprint. Such problems include exposure to flood and collapse. This paper proposes a constructor-oriented visualization system via mobile gadgets in general construction sites with occluded structures. This proposal is consisted with three stages. First, "Stage of detecting manhole and extracting features" detects and extracts the basis point of occluded structures which is unoccluded manhole. Next, "Stage of tracking features" tracks down the extracted features in the previous stage. Lastly, "Stage of visualizing occluded constructions" analyzes and synthesizes the GPS data and 3D objects obtained from mobile gadgets in the previous stages. This proposal implemented ideal method through parallel analysis of manhole detection, feature extraction, and tracking techniques in indoor environment, and confirmed the possibility through occluded water-pipe augmentation in real environment. Also, it offers a practical constructor-oriented environment derived from the augmented 3D results of occluded water-pipings.

Augmented Presentation Framework Design and System Implementation for Immersive Information Visualization and Delivery (몰입적 정보 표현과 전달을 위한 증강 프레젠테이션 디자인 및 시스템 구현)

  • Kim, Minju;Wohn, Kwangyun
    • Journal of the HCI Society of Korea
    • /
    • v.12 no.1
    • /
    • pp.5-13
    • /
    • 2017
  • Interactive intervention of the human presenter is one of the important factors that make the visualization more effective. Rather than just showing the content, the presenter enhances the process of the information delivery by providing the context of visualization. In this paper, we define this as an augmented presentation. In augmented presentation concept, the presenter can facilitate presentation more actively by being fully immersed in the visualization space and reaching and interacting into digital information. In order to concrete the concept, we design presentation space that enables the presenter to be seamlessly immersed in the visualization. Also we increase the presenter's roles as a storyteller, controller and augmenter allowing the presenter to fully support communicative process between the audience and the visualization. Then, we present an augmented presentation system to verify the proposed concept. We rendered 3D visualization through a half-mirror film and a wall projection screen that are place in parallel and applied with stereoscopic images, then, spatially align the presenter inside the virtual visualization space. After that, we conduct a controlled experiment to investigate the subjective level of immersion and engagement of the audience to HoloStation compared to traditional presentation system. Our initial investigation suggests that the newly conceived augmented presentation has potential not only to enhance the information presentation but also to supports the delivery of visualization.

A Framework of Recognition and Tracking for Underwater Objects based on Sonar Images : Part 2. Design and Implementation of Realtime Framework using Probabilistic Candidate Selection (소나 영상 기반의 수중 물체 인식과 추종을 위한 구조 : Part 2. 확률적 후보 선택을 통한 실시간 프레임워크의 설계 및 구현)

  • Lee, Yeongjun;Kim, Tae Gyun;Lee, Jihong;Choi, Hyun-Taek
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.3
    • /
    • pp.164-173
    • /
    • 2014
  • In underwater robotics, vision would be a key element for recognition in underwater environments. However, due to turbidity an underwater optical camera is rarely available. An underwater imaging sonar, as an alternative, delivers low quality sonar images which are not stable and accurate enough to find out natural objects by image processing. For this, artificial landmarks based on the characteristics of ultrasonic waves and their recognition method by a shape matrix transformation were proposed and were proven in Part 1. But, this is not working properly in undulating and dynamically noisy sea-bottom. To solve this, we propose a framework providing a selection phase of likelihood candidates, a selection phase for final candidates, recognition phase and tracking phase in sequence images, where a particle filter based selection mechanism to eliminate fake candidates and a mean shift based tracking algorithm are also proposed. All 4 steps are running in parallel and real-time processing. The proposed framework is flexible to add and to modify internal algorithms. A pool test and sea trial are carried out to prove the performance, and detail analysis of experimental results are done. Information is obtained from tracking phase such as relative distance, bearing will be expected to be used for control and navigation of underwater robots.