• 제목/요약/키워드: sequence length

검색결과 1,230건 처리시간 0.026초

A Noble Equalizer Structure with the Variable Length of Training Sequence for Increasing the Throughput in DS-UWB

  • Chung, Se-Myoung;Kim, Eun-Jung;Jin, Ren;Lim, Myoung-Seob
    • 한국통신학회논문지
    • /
    • 제34권1C호
    • /
    • pp.113-119
    • /
    • 2009
  • The training sequence with the appropriate length for equalization and initial synchronization is necessary before sending the pure data in the burst transmission type DS-UWB system. The length of the training sequence is one of the factors which make throughput decreased. The noble structure with the variable length of the training sequence whose length can be adaptively tailored according to the channel conditions (CM1,CM2,CM3,CM4) in the DS-USB systems is proposed. This structure can increase the throughput without sacrificing the performance than the method with fixed length of training sequence considering the worst case channel conditions. Simulation results under IEEE 802.15.3a channel model show that the proposed scheme can achieve higher throughput than a conventional one with the slight loss of BER performance. And this structure can reduce the computation complexity and power consumption with selecting the short length of the training sequence.

Cloning of the 5'-end and Amplification of Full-Length cDNA of Genomic RNA of Lily symptomless virus

  • Park, Seon-Ah;Ryu, Ki-Hyun
    • The Plant Pathology Journal
    • /
    • 제18권4호
    • /
    • pp.187-191
    • /
    • 2002
  • This paper describes the cloning and sequence analysis of the 5'-terminal region and full-length cDNA production of genomic RNA of Lily symptomless virus (LSV), a Species Of the genus Carlavirus. A sing1e DNA band about 600 bp harboring the 5'-end of genomic RNA of the virus was successfully amplified by reverse transcription-polymerase chain reaction (RT-PCR) and rapid amplification of cDNA ends (RACE), and was cloned for nucleotide sequence determination. Sequence analysis of selected RACE cDNA clones revealed that the LSV 5'non-translated region consists of 67 nucleotides long of AT rich stretch followed GC rich from the 5'-end. To produce full-length cDNA products for the viral genomic RNA, a set of LSV-specific primers could be designed based on the obtained sequence in this study and the known sequences of 3'-terminal region for the virus. Full-length cDNA copies of LSV, an 8.4 kb long, were directly amplified by the long-template RT-PCR technique from the purified viral genomic RNA samples. This full-length cDNA copies were analyzed by restriction mapping. The molecules produced in this study can be useful for the production of in vitro infectious cDNA clone, as well as, for the completion of genomic RNA sequence and genome structure for the virus.

ON MINIMAL PRODUCT-ONE SEQUENCES OF MAXIMAL LENGTH OVER DIHEDRAL AND DICYCLIC GROUPS

  • Oh, Jun Seok;Zhong, Qinghai
    • 대한수학회논문집
    • /
    • 제35권1호
    • /
    • pp.83-116
    • /
    • 2020
  • Let G be a finite group. By a sequence over G, we mean a finite unordered sequence of terms from G, where repetition is allowed, and we say that it is a product-one sequence if its terms can be ordered such that their product equals the identity element of G. The large Davenport constant D(G) is the maximal length of a minimal product-one sequence, that is, a product-one sequence which cannot be factored into two non-trivial product-one subsequences. We provide explicit characterizations of all minimal product-one sequences of length D(G) over dihedral and dicyclic groups. Based on these characterizations we study the unions of sets of lengths of the monoid of product-one sequences over these groups.

MUIO와 shortest path를 이용한 개선된 시험순서생성 (Test sequence generation using MUIO and shortest paths)

  • 정윤희;홍범기
    • 한국통신학회논문지
    • /
    • 제21권5호
    • /
    • pp.1193-1199
    • /
    • 1996
  • This paper introduces an algorithm which uses MUIO and the shortest paths to minimize the length of test sequence. The length of test sequence is equal to the total number of the edges in a symmetric test graph $G^{*}$. Therefore, it is important to make a $G^{*}$ with the least number of the edges. This algorithm is based on the one proposed Shen[2]. It needs the complexity to make shortest paths but reduces the thest sequence by 1.0~9.8% over the Shen's algorithm. and this technique, directly, derives a symmetric test graph from an FMS.

  • PDF

New Construction Method for Quaternary Aperiodic, Periodic, and Z-Complementary Sequence Sets

  • Zeng, Fanxin;Zeng, Xiaoping;Zhang, Zhenyu;Zeng, Xiangyong;Xuan, Guixin;Xiao, Lingna
    • 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.

비 최소 다중 UIO를 이용한 최적화된 시험열 생성 (Optimal test sequence generation scheme using non-minimal multiple UIO)

  • 임상용;양대헌;강명호;송주석
    • 한국통신학회논문지
    • /
    • 제22권10호
    • /
    • pp.2357-2363
    • /
    • 1997
  • 본 논문에서는 최소 다중 UIO를 사용했을 때보다 비 최소 다중 UIO를 사용했을 때 시험열의 길이가 줄어들 수 있음을 보여준다. 본 논문에서 제안하는 시험열 생성 방법은 Shen의 방법이 어떤 상태에서 들어오는 에지와 나가는 에지의 차가 클 때에는 최적화된 시험열을 생성하지 못한다는 데에 기초하고 있다. 이 성질을 이용하여 시험열의 길이를 줄이는 관점에서 UIO에 기초한 보다 향상된 기법을 제안하고 기존의 방법과 시험열의 길이와 적합성 검사를 위하여 걸리는 시간, 시험열을 생성하는데 걸리는 시간이 보다 효율적임을 기존의 방법과 비교하여 설명한다.

  • PDF

삽교호 유입량 예측을 위한 LSTM 모형의 적용성 평가 (Evaluation of LSTM Model for Inflow Prediction of Lake Sapgye)

  • 황병기
    • 한국산학기술학회논문지
    • /
    • 제22권4호
    • /
    • pp.287-294
    • /
    • 2021
  • 삽교호로 유입하는 곡교천 유역의 홍수시 유출량을 추정하기 위해서 Tensorflow를 활용하여 파이썬 기반의 LSTM 모형을 구축하였다. 층의 깊이가 성능에 미치는 영향을 분석하기 위해, 은닉층의 깊이를 2, 4, 6층으로 증가시키면서, 선행시간 1시간부터 5시간까지 예측을 수행하였으며, 은닉층의 개수가 4개일 때가 가장 우수한 성능을 나타내었다. 학습에 사용하는 입력자료의 길이 즉, 시퀀스길이가 모형의 성능에 미치는 영향을 파악하고자 시퀀스길이를 3시간, 5시간, 7시간으로 증가시키면서 모형을 실행한 결과, 시퀀스길이가 3시간 일 때, 전 시간대에 걸쳐 예측 성능이 우수한 것으로 분석되었다. 모형 검증에서 극한 강우 3건에 대하여 예측을 수행한 결과 선행시간 1시간에 대하여 평균 NSE 0.96 이상의 높은 정확도를 나타내었으며, 선행시간 2시간 이상에 대하여 정확도는 점차적으로 낮아지는 것으로 확인되었다. 결론적으로 시퀀스길이 3시간을 사용하여 선행시간 1시간에 대한 예측을 수행한다면 곡교천 강청 관측소의 홍수위를 높은 수준의 정확도로 예측할 수 있음을 확인하였다.

TORSION IN THE COHOMOLOGY OF FINITE H-SPACES

  • Choi, Young-Gi
    • 대한수학회지
    • /
    • 제39권6호
    • /
    • pp.963-973
    • /
    • 2002
  • We study torsion phenomena in the integral cohomology of finite if-spaces X through the Eilenberg-Moore spectral sequence converging to H*($\Omega$X; Z$_{p}$). We also investigate how the difference between the Z$_{p}$-filtration length f$_{p}$(X) and the Z$_{p}$-cup length c$_{p}$(X) on a simply connected finite H-space X is reflected in the Eilenberg-Moore spectral sequence converging to H*($\Omega$X;Z$_{p}$). Finally we get the following result: Let p be an odd prime and X an n-connected finite H-space with dim QH* (X;Z$_{p}$) $\leq$ m. Then H*(X;Z) is p-torsion free if (equation omitted).tion omitted).

무선 이미지 전송에서 가변확산부호를 적용한 Digital Watermarking 기법 (Digital Watermarking Scheme Adopting Variable Spreading Sequence in Wireless Image Transmission)

  • 조복은;노재성;조성준
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2002년도 하계종합학술대회 논문집(4)
    • /
    • pp.109-112
    • /
    • 2002
  • In this paper, we propose the efficient digital watermarking scheme to transmit effectively the compressed medical image that embedded with watermarking data in mobile Internet access channel. The wireless channel error based on multiple access interference (MAI) is closely related to the length of spreading sequence in CDMA system. Also, the fixed length coded medical image with watermark bit stream can be classified by significance of source image. In the simulation, we compare the peak signal to noise ratio (PSNR) performance when the watermarked image with a simple symbol and when the watermarked image with a text file is transmitted using variable length of spreading sequences in case of limited length of spread sequence.

  • PDF

Nucleotide sequence analysis of a second set of the polyketide synthase .betha.-ketoacyl synthase and chain length factor genes from the salinomycin-producing streptomyces albus

  • Hyun, Chang-Gu;Park, Kwan-Hyung;C.Richard Hutchinson;Suh, Joo-Won
    • Journal of Microbiology
    • /
    • 제35권1호
    • /
    • pp.40-46
    • /
    • 1997
  • The pWHM220 cosmid with a 24-kb insert cloned from Streptomyces albus ATCC 21838 induces the biosynthesis of a polysther antibiotic similar to salinomycin in Streptomyces invidans. We have analyzed this region by DNA sequencing as well as Southern blot hybridization with type I and type II polyketide synthase (PKS) probes. Surprisingly, we found another set of type II SKS genes only 10-kb from the original PKS genes, salABCDE. The DNA sequence revealed two complete open reading frames (ORFs) named salB2 and salC2, and one partial ORF that does not resemble any known DNA or deduced protein sequence. The salC2 should code for chain length determining factor while the deduced amino acid sequence encoded by salB2 exhibits high similarity to .betha.-ketoacyl synthase from different PKS gene clusters. The highest identity was found for .betha.-keetoacyl synthases from S. argillaceus (MtmP. 59.1% identity), the mithramycin producer and from S. venezuelae ISP5230 (JadA, 52.3% identity), the jadomycin producer. The SalC2 protein clearly resembles its counterparts in order aromatic PKS gene clusters that are believed to influence the length of the polyketide chain. The highest identities observed were to that of S. argillaceus (MtmK, 62.3%) and S. venezuelae ISP 5230 (JadB, 55.1%) proteins, Moreover, the deduced amino acid sequences of the salB2 and salC2 products were 29.0% identical.

  • PDF