• Title/Summary/Keyword: 행렬 테이블

Search Result 16, Processing Time 0.06 seconds

Research for Improving the Speed of Scrambler in the WAVE System (WAVE 시스템에서 스크램블러의 속도 향상을 위한 연구)

  • Lee, Dae-Sik;You, Young-Mo;Lee, Sang-Youn;Oh, Se-Kab
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.9
    • /
    • pp.799-808
    • /
    • 2012
  • Bit operation of scrambler in the WAVE System become less efficient because parallel processing is impossible in terms of hardware and software. In this paper, we propose algorism to find the starting position of the matrix table. Also, when bit operation algorithm of scrambler and algorithms for matrix table, algorithm used to find starting position of the matrix table were compared with the performance as 8 bit, 16bit, 32 bit processing units. As a result, the number of processing times per second could be done 2917.8 times more in an 8-bit, 5432.1 times in a 16-bit, 10277.8 times in a 32 bit. Therefore, algorithm to find the starting position of the matrix table improves the speed of the scrambler in the WAVE and the receiving speed of a variety of information gathering and precision over the Vehicle to Infra or Vehicle to Vehicle in the Intelligent Transport Systems.

The Algorithm Design and Implemention for Operation using a Matrix Table in the WAVE system (WAVE 시스템에서 행렬 테이블로 연산하기 위한 알고리즘 설계 및 구현)

  • Lee, Dae-Sik;You, Young-Mo;Lee, Sang-Youn;Jang, Chung-Ryong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.4A
    • /
    • pp.189-196
    • /
    • 2012
  • A WAVE(Wireless Access for Vehicular Environment) system is a vehicle communication technology. The system provides the services to prevent vehicle accidents that might occur during driving. Also, it is used to provide various services such as monitoring vehicle management and system failure. However, the scrambler bit operation of WAVE system becomes less efficient in the organizations of software and hardware design because the parallel processing is impossible. Although scrambler algorithm proposed in this paper has different processing speed depending on input data 8 bit, 16 bit, 32 bit, and 64 bit. it improves the processing speed of the operation because it can make parallel processing possible depending on the input unit.

Laxity Decomposition Method for Scheduling Real-time Periodic Messages (실시간 주기적 메세지 스케쥴링을 위한 여유시간 분할방법)

  • 유해영;심재홍;최경희;정기현;박승규;최덕규
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.10B
    • /
    • pp.1867-1875
    • /
    • 1999
  • This paper presents a very unique and analytic method for scheduling messages routed through a non-blocking switch. The laxities of schedulable messages are decomposed and the laxity table is rearranged so that the packets to be scheduled in the next time instance are placed in the diagonal of the traffic matrix. And the modified MLF-SDR algorithm is performed on the table. We present some examples and simulation results which show that the success rate is very high, even when the size of which is large.

  • PDF

The 64-Bit Scrambler Design of the OFDM Modulation for Vehicles Communications Technology (차량 통신 기술을 위한 OFDM 모듈레이션의 64-비트 스크램블러 설계)

  • Lee, Dae-Sik
    • Journal of Internet Computing and Services
    • /
    • v.14 no.1
    • /
    • pp.15-22
    • /
    • 2013
  • WAVE(Wireless Access for Vehicular Environment) is new concepts and Vehicles communications technology using for ITS(Intelligent Transportation Systems) service by IEEE standard 802.11p. Also it increases the efficiency and safety of the traffic on the road. However, the efficiency of Scrambler bit computational algorithms of OFDM modulation in WAVE systems will fall as it is not able to process in parallel in terms of hardware and software. This paper proposes an algorithm to configure 64-bits matrix table in scambler bit computation as well as an algorithm to compute 64-bits matrix table and input data in parallel. The proposed algorithm on this thesis is executed using 64-bits matrix table. In the result, the processing speed for 1 and 1000 times is improved about 40.08% ~ 40.27% and processing rate per sec is performed more than 468.35 compared to bit operation scramble. And processing speed for 1 and 1000 times is improved about 7.53% ~ 7.84% and processing rate per sec is performed more than 91.44 compared to 32-bits operation scramble. Therefore, if the 64 bit-CPU is used for 64-bits executable scramble algorithm, it is improved more than 40% compare to 32-bits scrambler.

Fundamental Matrix Estimation and Key Frame Selection for Full 3D Reconstruction Under Circular Motion (회전 영상에서 기본 행렬 추정 및 키 프레임 선택을 이용한 전방향 3차원 영상 재구성)

  • Kim, Sang-Hoon;Seo, Yung-Ho;Kim, Tae-Eun;Choi, Jong-Soo
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.2
    • /
    • pp.10-23
    • /
    • 2009
  • The fundamental matrix and key frame selection are one of the most important techniques to recover full 3D reconstruction of objects from turntable sequences. This paper proposes a new algorithm that estimates a robust fundamental matrix for camera calibration from uncalibrated images taken under turn-table motion. Single axis turntable motion can be described in terms of its fixed entities. This provides new algorithms for computing the fundamental matrix. From the projective properties of the conics and fundamental matrix the Euclidean 3D coordinates of a point are obtained from geometric locus of the image points trajectories. Experimental results on real and virtual image sequences demonstrate good object reconstructions.

Study on Calibration for Parallel-Typed Tilting Table (병렬기구형 틸팅 테이블의 보정에 관한 연구)

  • Kim, T.S.;Jung, J.W.;Kim, Y.H.;Park, K.W.;Lee, M.K.
    • Proceedings of the KSME Conference
    • /
    • 2003.11a
    • /
    • pp.1512-1517
    • /
    • 2003
  • This paper presents the calibration for the parallel typed tilting table. The calibration system needs only simple sensing device which is a digital indicator to measure the orientation of a table. The calibration algorithm is developed by a measurement operator. It eliminates the concern about the poor parameter observability due to a large number of parameters of parallel-mechanism. This paper uses the QR-decomposition to find the optimal calibration configurations maximizing the linear independence of rows of a observation matrix. The number of identifiable parameters is examined by the rank of the observation matrix, which represents the parameter observability. The method is applied to a Parallel-typed Tilting Table and all the necessary kinematic parameters are identifiable.

  • PDF

Real-Time Nonlinear Lens-Flare Rendering Method Based on Look-Up Table (룩업테이블 기반 실시간 비선형 렌즈플레어 렌더링 방법)

  • Jo, Sunghun;Jeong, Yuna;Lee, Sungkil
    • Journal of KIISE
    • /
    • v.44 no.3
    • /
    • pp.253-260
    • /
    • 2017
  • In computer graphics, high-quality lens flares have been generated using costly offline rendering. A recent matrix-based approximation has enabled generation of high-quality lens flares suitable for real-time applications, but its quality degrades due to the lack of nonlinear patterns of lens flares. This paper introduces a method for high-quality lens-flare rendering, which includes blending of both nonlinear as well as linear patterns. The nonlinear patterns are pre-rendered or photo-graphically captured offline and stored in a look-up table. The online stage reads only the pattern by looking up the table using a light angle, hence making its performance drop negligible while greatly improving the quality.

Compression of the Rules of Producing Phonetic Values (음가 생성 규칙의 압축)

  • 이계영;임재걸;김경징
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1999.10b
    • /
    • pp.201-203
    • /
    • 1999
  • 음성합성에서 자연스러운 합성음을 생성하기 위하여 표준 발음법을 페트리넷 근저행렬로 모델링하는 방법으로 표준 발음법을 음가 생성 규칙으로 만들 수 있다. 본 논문은 페트리넷으로 모델링된 음가 생성 규칙의 크기를 줄이는 방법을 제안하고 구현하였다. 압축하기 전의 음가 생성 테이블의 크기는 719*107의 2차원 배열이었으며 구현된 시스템으로 압축한 결과 41*40의 2차원 구조체 배열로 압축되었다.

  • PDF

Study on the Observability of a Calibration System for a Parallel Tilting Table with Measuerment Operator (측정연산자에 의한 병렬기구 틸팅 테이블의 관측성에 관한 연구)

  • Park Kun Woo;Lee Min Ki;Kim Tae Sung
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.29 no.6 s.237
    • /
    • pp.795-803
    • /
    • 2005
  • This paper studies the observability of calibration system with a measurement operator. The calibration system needs a simple digital indicator to measure the mobile table movements with respect to the MC coordinate. However, it yields the concern about the poor parameter observability due to measuring only a part of the movements. We uses the QR-decomposition to find the optimal calibration configurations maximizing the linear independence of rows of an observation matrix. The number of identifiable parameter is examined by the rank of the observation matrix, which represents the parameter observability. The method is applied to a 6-axis MC with parallel tilting table and the calibration results are presented. These results verify that all necessary kinematic parameters are observable and the calibration system has robustness to the noise using optimal calibration configurations.

Data Hiding Scheme for Few-Color Image Using Weight Matrix (가중치 행렬을 이용한 다치 컬러 영상의 데이터 은닉 기법)

  • Ha, Soon-Hye;Park, Young-Ran;Park, Ji-Hwan
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2004.05a
    • /
    • pp.1035-1038
    • /
    • 2004
  • 스테가노그라피는 비밀 정보를 이미지나 오디오, 비디오 또는 텍스트 등 커버(cover) 라고 불리는 다른 미디어에 숨겨서 전송하는 방법으로 제 3자는 정보가 숨겨져 있다는 사실 자체를 알지 못하도록 하는 것이다. 대부분 영상 데이터를 이용하고 있으나, 제한된 색으로만 구성된 이진 영상 및 다치 영상의 경우 비시각적으로 비밀 정보를 숨기는 것이 일반 컬러 또는 그레이 영상에 비해 어려움이 있다. 본 논문에서는 가중치 테이블을 사용하여 영상의 한 블록에 최대 2비트만을 변경시키면서 많은 양의 정보를 숨기는 방법을 제안한다.

  • PDF