• Title/Summary/Keyword: 이동 시퀀스

Search Result 121, Processing Time 0.029 seconds

Application of Direct-Sequence Spread Spectrum Mobile Communication Used in Chinese Coal Mines (중국의 광산에서 사용되는 디렉트-시퀀스 스프레드 스팩트럼 이동통신의 응용)

  • Zhang, Ke;Suh, Heejong
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.7-10
    • /
    • 2003
  • 본 논문에서는 중국의 광산에서 수행되고 있는 통신인 지하이동통신을 요약하여 설명하고, 이에 대한 문제점을 논의한다. 또한, 지하에서 스프레드 스펙트럼(spread spectrum) 통신이 장애에 강하고, CDMA가 사용하기에 용이하고 적합하다는 것을 제안한다. 그리고 중국 광산에서 사용되는 스프레드 스펙트럼 통신의 앞으로 전망을 설명하고 실행가능하고 실용적 인 프로그램을 제안한다.

  • PDF

Adaptive P-SLM Method with New Phase Sequence for PAPR Reduction of MIMO-OFDM Systems (MIMO-OFDM 시스템의 PAPR 감소를 위한 새로운 위상시퀀스의 적응형 P-SLM기법)

  • Yoo, Eun-Ji;Byun, Youn-Shik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.3C
    • /
    • pp.149-156
    • /
    • 2011
  • MIMO-OFDM(Multiple Input Multiple Output-Orthogonal Frequency Division Multiplexing) has been spotlighted as a solution of high-quality service for next generation's wireless communications. However, like OFDM, one of main problems of MIMO-OFDM is the high PAPR(Peak-to-Average Power Ratio). In this paper, an adaptive P-SLM(Partitioned-SeLetive Mapping) based on new phase sequence is proposed to reduce PAPR. The proposed method has better performance and lower complexity than conventional method due to the use of periodic multiplication and adaptability by fixed critical PAPR value. Simulation results show that the proposed method has better performance and lower complexity than conventional method.

Speech Recognition of the Korean Vowel 'ㅐ', Based on Time Domain Sequence Patterns (시간 영역 시퀀스 패턴에 기반한 한국어 모음 'ㅐ'의 음성 인식)

  • Lee, Jae Won
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.11
    • /
    • pp.713-720
    • /
    • 2015
  • As computing and network technologies are further developed, communication equipment continues to become smaller, and as a result, mobility is now a predominant feature of current technology. Therefore, demand for speech recognition systems in mobile environments is rapidly increasing. This paper proposes a novel method to recognize the Korean vowel 'ㅐ' as a part of a phoneme-based Korean speech recognition system. The proposed method works by analyzing a sequence of patterns in the time domain instead of the frequency domain, and consequently, its use can markedly reduce computational costs. Three algorithms are presented to detect typical sequence patterns of 'ㅐ', and these are combined to produce the final decision. The results of the experiment show that the proposed method has an accuracy of 89.1% in recognizing the vowel 'ㅐ'.

A Method for Optimal Moving Pattern Mining using Frequency of Moving Sequence (이동 시퀀스의 빈발도를 이용한 최적 이동 패턴 탐사 기법)

  • Lee, Yon-Sik;Ko, Hyun
    • The KIPS Transactions:PartD
    • /
    • v.16D no.1
    • /
    • pp.113-122
    • /
    • 2009
  • Since the traditional pattern mining methods only probe unspecified moving patterns that seem to satisfy users' requests among diverse patterns within the limited scopes of time and space, they are not applicable to problems involving the mining of optimal moving patterns, which contain complex time and space constraints, such as 1) searching the optimal path between two specific points, and 2) scheduling a path within the specified time. Therefore, in this paper, we illustrate some problems on mining the optimal moving patterns with complex time and space constraints from a vast set of historical data of numerous moving objects, and suggest a new moving pattern mining method that can be used to search patterns of an optimal moving path as a location-based service. The proposed method, which determines the optimal path(most frequently used path) using pattern frequency retrieved from historical data of moving objects between two specific points, can efficiently carry out pattern mining tasks using by space generalization at the minimum level on the moving object's location attribute in consideration of topological relationship between the object's location and spatial scope. Testing the efficiency of this algorithm was done by comparing the operation processing time with Dijkstra algorithm and $A^*$ algorithm which are generally used for searching the optimal path. As a result, although there were some differences according to heuristic weight on $A^*$ algorithm, it showed that the proposed method is more efficient than the other methods mentioned.

PAPR-minimized Sequence Mapping with Data Space Reduction by Partial Data Side Information in OFDM System (OFDM 시스템에서 부분 데이터 추가정보를 이용한 데이터 공간 감소를 갖는 최대 전력 대 평균 전력 비 최소화 시퀀스 사상 기법)

  • Jin Jiyu;Ryu Kwan Woongn;Park Yong wan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.12A
    • /
    • pp.1340-1348
    • /
    • 2004
  • In this paper, we propose a PAPR-minimized sequence mapping scheme that achieves the minimum Peak-to-Average Power Ratio (PAPR) and the minimum amount of computations for the OFDM system. To reduce the PAPR, the mapping table is created with information about block index and symbol patterns of the lower signal power. When the input data sequence comes, it performed division by the block length to find the quotient and remainder. The symbol pattern of the lower signal power can be found in terms of the block index as the quotient in the mapping table and transmitted with remainder as the side information to distinguish and recover the original data sequence in the receiver. The two methods with the proposed mapping scheme are proposed in this paper. One is with mapping table to recover the O%M signal in both transmitter and receiver. The other is with mapping table only in transmitter to reduce the load and the complexity in the mobile system. We show that this algorithm provides the PAPR reduction, the simple processing and less computational complexity to be implemented for the multi-carrier system.

Numerical Study on Dynamic Characteristics of Pintle Nozzle for Variant Thrust: Part 2 (가변 추력용 핀틀 노즐의 동적 특성에 관한 수치적 연구: Part 2)

  • Heo, Jun-Young;Kim, Ki-Wan;Sung, Hong-Gye;Yang, June-Seo
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2012.05a
    • /
    • pp.123-128
    • /
    • 2012
  • According to the sequence of pintle operation, the performance characteristics of pintle nozzles are analyzed. The pintle movement was simulated using unsteady numerical techniques, the response lag and sensitivity at the chamber and nozzle are estimated for movable pintle. Three operation sequences of the pintle are considered for evaluating whether the rate of the chamber pressure increase and the operation sequence will have any significant impact towards the rocket performance. Three operation sequencies are as following; the pintle moves toward the nozzle throat, it turns instantly (case 1), stops at the nozzle throat for some time(0.5sec) (case 2), and stops at the nozzle throat (case 3). As a result, the dynamic characteristics according to the operation sequence and pintle shape were analyzed to take account the rocket performance.

  • PDF

Research on the modulation method detection in hierarchically modulated T-DMB (계층변조가 적용된 T-DMB 시스템에서 변조방식 검출기법에 대한 연구)

  • Bae, Jae-Hwui;Kim, Young-Su;Lim, Jong-Soo;Lee, Soo-In;Han, Dong-Seog
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2008.11a
    • /
    • pp.95-98
    • /
    • 2008
  • 국내외적인 이동멀티미디어 방송 시장의 급속한 성장과 더불어 동일한 주파수 대역에서 기존 T-DMB 시스템에 비해 더 많은 데이터 전송률을 얻기 위해, T-DMB 시스템에 계층변조를 적용하여 전송률을 높이는 연구가 국내외적으로 추진되고 있다. 기존 T-DMB 시스템의 DQPSK 신호에 새로운 변조방식으로 변조된 신호를 더하여 계층변조 하는 경우에, 새로 추가되는 신호에는 한 개 이상의 변조방식이 적용될 수 있다. 이러한 경우의 일례는 DQPSK-BPSK 및 DQPSK-QPSK 변조가 있을 수 있다. 이와 같이 새로 추가되는 신호에 한 개 이상의 변조방식이 적용된 경우에, 수신단에서 새로 추가된 신호에 적용된 변조방식을 용이하게 검출하기 위한 수단이 필요하다. 이것을 위하여 PRS 신호에 PN 시퀀스를 계층변조 형태로 추가하여 수신단에서 PN 시퀀스의 상관을 취하여 새로 추가되는 신호의 변조방식을 검출하는 방법을 제안하고, 실험 결과를 제시한다.

  • PDF

A DPSK Demodulator of Direct Sequence Spread Spectrum using SAW Convolver (탄성표면파 콘벌버를 이용한 직접 시퀀스 대역 확산 통신에서의 DPSK 복조에 관한 연구)

  • Lee, Dong-Wook;Cho, Kwan;Whang, Keum-Chan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.15 no.6
    • /
    • pp.494-505
    • /
    • 1990
  • This paper reports on the development of a DPSK demodulator of DS spread spectrum communications that use one SAW convolver. The spreading code chip pattern is changed from bit to bit in data portion of packet. And code chip is PSK modulated. Compared with simulation, experiment shows that the DPSK signal spreaded can be demodulated by using only one SAW convolver. And the theoretical performance of this DPSK demudulator is equal to CSK demodulator wich uses two SAW convolvers.

  • PDF

On new channel estimation method (새로운 채널 추정방법에 관한 연구)

  • 송석일;한영열
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.9A
    • /
    • pp.2240-2247
    • /
    • 1998
  • This paper presents a new method for channel impulse response measurment with a suitably designed binary sounding sequence. This method results in ideal channel estimation using three correlators instead of one. This system complexity can be easily overcome by the present technologies. The class of sounding sequences used in this method are the training sequence for channel impulse response measurment with the zero values of autocorrelation function at all shifts except zero and middle shifts in digital cellular mobile telephone system based on GSM. Computer searches are carried out to find the suitable sounding sequences.

  • PDF

삼차원 모델에 대한 연성 워터마킹 방법

  • Lee, Sang Gwang;Ho, Yo Seong
    • The Magazine of the IEIE
    • /
    • v.30 no.6
    • /
    • pp.42-42
    • /
    • 2003
  • 최근 급증하는 디지털 멀티미디어 정보를 보호하기 위해 다양한 종류의 디지털 워터마킹 방법들이 개발되고 있다. 본 논문에서는 디지털 워터마킹의 기본 원리를 살펴보고, 삼각형 스트립(triangle strip)을 이용한 삼차원 모델에 대한 연성 워터마킹 (fragile watermarking) 방법을 제안한다. 사용자 키(key) 값으로 생성된 이진 무작위 시퀀스는 배타적 논리합(exclusive OR) 연산을 통해 이진 워터마크 시퀀스와 결합한 후, 꼭지점 좌표(vertex coordinates)를 변동시켜 삼각형 스트립에 삽입된다. 컴퓨터 모의 실험을 통해, 제안한 워터마킹 방법이 무작위 잡음 첨가(additive random noise), 이동, 회전, 비례 축소(scaling), 폴리곤 간략화(polygon simplification), 기하 정보 압축 (geometry compression) 등과 같은 삼차원 모델에 대한 다양한 공격을 검출할 수 있으며 변조된 위치를 표시할 수 있다는 것을 보였다.