• Journal of Communications and Networks
• /
• 제14권3호
• /
• pp.230-236
• /
• 2012

Based on the known binary sequence sets and Gray mapping, a new method for constructing quaternary sequence sets is presented and the resulting sequence sets' properties are investigated. As three direct applications of the proposed method, when we choose the binary aperiodic, periodic, and Z-complementary sequence sets as the known binary sequence sets, the resultant quaternary sequence sets are the quaternary aperiodic, periodic, and Z-complementary sequence sets, respectively. In comparison with themethod proposed by Jang et al., the new method can cope with either both the aperiodic and periodic cases or both even and odd lengths of sub-sequences, whereas the former is only fit for the periodic case with even length of sub-sequences. As a consequence, by both our and Jang et al.'s methods, an arbitrary binary aperiodic, periodic, or Z-complementary sequence set can be transformed into a quaternary one no matter its length of sub-sequences is odd or even. Finally, a table on the existing quaternary periodic complementary sequence sets is given as well.

• Journal of information and communication convergence engineering
• /
• 제16권3호
• /
• pp.166-172
• /
• 2018

A pseudo-random sequence generated by using a primitive polynomial, trace function, and Legendre symbol has been researched in our previous work. Our previous sequence has some interesting features such as period, autocorrelation, and linear complexity. A pseudo-random sequence widely used in cryptography. However, from the aspect of the practical use in cryptographic systems sequence needs to generate swiftly. Our previous sequence generated by utilizing a primitive polynomial, however, finding a primitive polynomial requires high calculating cost when the degree or the characteristic is large. It’s a shortcoming of our previous work. The main contribution of this work is to find some relation between the generated sequence and irreducible polynomials. The purpose of this relationship is to generate the same sequence without utilizing a primitive polynomial. From the experimental observation, it is found that there are (p - 1)/2 kinds of polynomial, which generates the same sequence. In addition, some of these polynomials are non-primitive polynomial. In this paper, these relationships between the sequence and the polynomials are shown by some examples. Furthermore, these relationships are proven theoretically also.

• Journal of Communications and Networks
• /
• 제15권6호
• /
• pp.581-588
• /
• 2013

Based on an interleaving technique and quadriphase periodic complementary sequence (CS) mates, this paper presents a method for constructing a family of 16-quadrature amplitude modulation (QAM) periodic CS mates. The resulting mates arise from the conversion of quadriphase periodic CS mates, and the period of the former is twice as long as that of the latter. In addition, based on the existing binary periodic CS mates, a table on the existence of the proposed 16-QAM periodic CS mates is given. Furthermore, the proposed method can also transform a mutually orthogonal (MO) quadriphase CS set into an MO 16-QAM CS set. Finally, three examples are given to demonstrate the validity of the proposed method.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.264-267
• /
• 2003

Multiple sequence alignment is a useful tool to identify the relationships among protein sequences. Dynamic programming is the most widely used algorithm to obtain multiple sequence alignment with optimal cost. However dynamic programming cannot be applied to certain cost function due its drawback and to produce optimal multiple sequence alignment. We proposed sub-alignment refinement algorithm to overcome the problem of dynamic programming and impelmented this algorithm as a module of our MS Windows-based sequence alignment program.

• ETRI Journal
• /
• 제40권6호
• /
• pp.699-713
• /
• 2018

Orthogonal frequency division multiplexing (OFDM) has been the overwhelmingly prevalent choice for high-data-rate systems due to its superior advantages compared with other modulation techniques. In contrast, a high peak-to-average-power ratio (PAPR) is considered the fundamental obstacle in OFDM systems since it drives the system to suffer from in-band distortion and out-of-band radiation. The partial transmit sequence (PTS) technique is viewed as one of several strategies that have been suggested to diminish the high PAPR trend. The PTS relies upon dividing an input data sequence into a number of subblocks. Hence, three common types of the subblock segmentation methods have been adopted - interleaving (IL-PTS), adjacent (Ad-PTS), and pseudorandom (PR-PTS). In this study, a new type of subblock division scheme is proposed to improve the PAPR reduction capacity with a low computational complexity. The results indicate that the proposed scheme can enhance the PAPR reduction performance better than the IL-PTS and Ad-PTS schemes. Additionally, the computational complexity of the proposed scheme is lower than that of the PR-PTS and Ad-PTS schemes.

• 한국정보과학회논문지:데이타베이스
• /
• 제36권3호
• /
• pp.169-179
• /
• 2009

통신 기록 데이타는 이메일이나 인스턴스 메시지를 주고 받거나, 웹사이트에 접속하는 것과 같은 통신 이벤트들로 구성된다. 미국과 유럽연합을 포함한 여러 나라에서는 인터넷을 사용한 범죄의 조사와 발견을 위해서 통신 서비스 제공자에게 이런 데이타를 보관하도록 규정하고 있다. 보관되는 통신 기록 데이타의 크기가 매우 크기 때문에 치안당국이 이 데이타를 사용하기 위해서는 필요한 정보만을 효과적으로 추출해내는 방법이 필요하다. 본 논문에서는 발신자, 수신자, 통신발생시각의 세 가지 정보만 포함하는 통신 이벤트가 주어질 때, 의미 있는 정보 중 하나인 대화형 통신 순서열 패턴과 이러한 패턴의 마이닝 문제를 정의하고 것을 해결하기 위해 Fast Discovering Interactive Communication Sequence Patterns (FDICSP)라 불리는 알고리즘을 제안한다. FDICSP는 길이가 짧은 대화형 통신 순서열을 조합하여 길이가 긴 대화형 통신 순서열을 생성 해나가는데, 대화형 통신 순서열의 특성에 초점을 맞춘 작업을 통해 효율적으로 대화형 통신 순서열 패턴을 찾는다.

• 한국인터넷방송통신학회논문지
• /
• 제10권6호
• /
• pp.257-262
• /
• 2010

본 논문에서는 다중 사용자들이 존재하는 협력통신 시스템에서 다중 사용자 간 신호를 효율적으로 검출하기 위한 방법을 제안하였다. 협력통신 시스템의 신호 프레임 포맷 중 각 사용자 간 동기를 맞추기 위해 사용되는 동기채널의 NULL 공간에 확산코드를 삽입하여 전송하고, 수신단에서는 삽입된 확산코드들 사이의 상관관계를 이용하여 원하는 신호를 검출한다. 실험 결과로 AWGN, Rician, Rayleigh 채널에서 각각 m-sequence를 이용한 신호간 상관관계를 보여주며 본 논문의 실험결과를 이용하면 신뢰성 있는 협력통신이 가능할 것으로 기대된다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권6호
• /
• pp.2201-2216
• /
• 2015

Peak to average power ratio (PAPR) is one of the main imperfections in the broadband communication systems with multiple carriers. In this paper, a new crest factor reduction (CFR) scheme based on interleaved phase sequence called Dummy Sequence Insertion Enhanced Partial Transmit Sequence (DSI-EPTS) is proposed which effectively reduces the PAPR while at the same time keeps the total complexity low. Moreover, the prototype of the proposed scheme in field programmable gate array (FPGA) is demonstrated. In DSI-EPTS scheme, a new matrix of phase sequence is defined which leads to a significant reduction in hardware complexity due to its less searching operation to extract the optimum phase sequence. The obtained results show comparable performance with slight difference due to the FPGA constraints. The results show 5 dB reduction in PAPR by applying the DSI-EPTS scheme with low complexity and low power consumption.

• 한국위성정보통신학회논문지
• /
• 제5권1호
• /
• pp.22-26
• /
• 2010

본 논문에서는 다중 사용자들이 존재하는 협력통신 시스템에서 다중 사용자 간 신호를 효율적으로 검출하기 위한 방법을 제안하였다. 협력통신 시스템의 신호 프레임 포맷 중 각 사용자 간 동기를 맞추기 위해 사용되는 동기채널의 NULL 공간에 확산코드를 삽입하여 전송하고, 수신단에서는 삽입된 확산코드들 사이의 상관관계를 이용하여 원하는 신호를 검출한다. 실험 결과로 AWGN, Rician, Rayleigh 채널에서 각각 Kasami/walsh sequence를 이용한 신호간 상관관계를 보여주며 본 논문의 실험결과를 이용하면 신뢰성 있는 협력통신이 가능할 것으로 기대된다.

• 한국정보통신학회논문지
• /
• 제16권4호
• /
• pp.730-736
• /
• 2012

의사난수열은 코드 분할 다중접속과 같은 무선통신에서 중요한 역할을 한다. 여러 사용자가 동시에 시스템에 접속할 때 충돌이 발생 할 수 있는데, 의사난수열의 낮은 상관관계는 그런 통신시스템에서 다중 접속 간섭을 최소화 할 수 있다. 본 논문에서는 Welch bound의 관점에서 최적의 상호 상관관계 함숫값을 갖는 $m$-수열, GMW 수열, Kasami 수열, No 수열 등을 모두 포함하는 낮은 상호 상관관계를 갖는 비선형 확장 이진 수열군을 제안한다. 그리고 제안한 수열의 상호상관관계를 분석한다.