• Title/Summary/Keyword: sequence information

Search Result 4,019, Processing Time 0.029 seconds

Design of Novel Iterative LMS-based Decision Feedback Equalizer (새로운 반복 LMS 기반의 결정 궤환 등화기의 설계)

  • Choi, Yun-Seok;Park, Hyung-Kun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.11
    • /
    • pp.2033-2035
    • /
    • 2007
  • This paper proposes a novel iterative LMS-based decision feedback equalizer for short burst transmission with relatively short training sequence. In the proposed equalizer, the longer concatenated training sequence can provide the more sufficient channel information and the reused original training sequence can provide the correct decision feedback information. In addition, the overall adaptive processing is performed using the low complexity LMS algorithm. The study shows the performance of the proposed method is enhanced with the number of iterations and, furthermore, better than that of the conventional LMS-based DFEs with the training sequence of longer or equal length. Computational complexity is increased linearly with the number of iterations.

A Study on the Construction of Synchronous SSMA System without Interchannel Interference (채널간 간섭없는 동기식 SSMA 시스템의 구성에 관한 연구)

  • 변건식;정기호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.12 no.2
    • /
    • pp.115-123
    • /
    • 1987
  • It is known that conventional spread spectrum communication systems have a characteristics of non-synchronous multiple access. However, because the system has a interchannel interference, the number of channels that can communicate at the same time is small as compared with TDM. This paper presents a new synchronous sprea spectrum mulitple access communication system using a modified M sequence as a spread sequence. The system was constructed and through experiment we confirmed that a modified M sequence is superior to a M sequence in the area of interchannel interference, And we also confirmed that received waveforms are better with a increase of transmission bandwidth.

  • PDF

Analysis of Expressed Sequence Tags of the Spider, Araneus ventricosus

  • Chung, Eun-Hwa;Lee, Kwang-Sik;Han, Ji-Hee;Sohn, Hung-Dae;Jin, Byung-Rae
    • International Journal of Industrial Entomology and Biomaterials
    • /
    • v.3 no.2
    • /
    • pp.191-199
    • /
    • 2001
  • We have constructed a cDNA library from the whole body of the spider, Araneus ventricosus. Sequence analysis of randomly selected cDNA clones was performed to obtain genetic information on the spider A. ventricosus, of which genetic information is currently not available. We have partially sequenced randomly selected 385 clones of the cDNA library constructed from A. ventricosus. This expressed sequence tags (EST) analysis revealed 383 genes had high homologies to known genes in GenBank. In this report, 241 independent genes were analyzed in detail.

  • PDF

miRNA Pattern Discovery from Sequence Alignment

  • Sun, Xiaohan;Zhang, Junying
    • Journal of Information Processing Systems
    • /
    • v.13 no.6
    • /
    • pp.1527-1543
    • /
    • 2017
  • MiRNA is a biological short sequence, which plays a crucial role in almost all important biological process. MiRNA patterns are common sequence segments of multiple mature miRNA sequences, and they are of significance in identifying miRNAs due to the functional implication in miRNA patterns. In the proposed approach, the primary miRNA patterns are produced from sequence alignment, and they are then cut into short segment miRNA patterns. From the segment miRNA patterns, the candidate miRNA patterns are selected based on estimated probability, and from which, the potential miRNA patterns are further selected according to the classification performance between authentic and artificial miRNA sequences. Three parameters are suggested that bi-nucleotides are employed to compute the estimated probability of segment miRNA patterns, and top 1% segment miRNA patterns of length four in the order of estimated probabilities are selected as potential miRNA patterns.

Analysis of state transition behavior of SPCA (SPCA의 상태전이 행동분석)

  • Cho, S.J.;Choi, U.S.;Hwang, Y.H.;Kwon, M.J.;Lim, J.M.
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.441-445
    • /
    • 2009
  • In this paper we propose the method of generating the maximum length sequence based on Self Programmable Cellular Automata. Recently there is a research trend such that increased CA dimensionality and PCA which applies different rules on the same cell at different time steps can make a sequence with a long period. By changing a cell's state transition rules to give the cell dynamic energy at each time step, we can make the period of a sequence longer and the randomness of a sequence higher.

  • PDF

On the non-linear combination of the Linear Fedback Shift Register (선형 귀환 쉬프트 레지스터의 비선형적 결합에 관한 연구)

  • Kim, Chul
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.9 no.2
    • /
    • pp.3-12
    • /
    • 1999
  • We introduce feedback registers and definitions of complexity of a register or a sequence generated by it. In the view point of cryptography the linear complexity of an ultimately periodic sequence is important because large one gives an enemy infeasible jobs. We state some results about the linear complexity of sum and product of two LFSRs.

An Improved Pseudorandom Sequence Generator and its Application to Image Encryption

  • Sinha, Keshav;Paul, Partha;Amritanjali, Amritanjali
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.4
    • /
    • pp.1307-1329
    • /
    • 2022
  • This paper proposes an improved Pseudorandom Sequence Generator (PRSG) based on the concept of modular arithmetic systems with non-integral numbers. The generated random sequence use in various cryptographic applications due to its unpredictability. Here the mathematical model is designed to solve the problem of the non-uniform distribution of the sequences. In addition, PRSG has passed the standard statistical and empirical tests, which shows that the proposed generator has good statistical characteristics. Finally, image encryption has been performed based on the sort-index method and diffusion processing to obtain the encrypted image. After a thorough evaluation of encryption performance, there has been no direct association between the original and encrypted images. The results show that the proposed PRSG has good statistical characteristics and security performance in cryptographic applications.

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.

LOTOS Protocol Conformance Testing for Formal Description Specifications (형식 기술 기법에 의한 LOTOS 프로토콜 적합성 시험)

  • Chin, Byoung-Moon;Kim, Sung-Un;Ryu, Young-Suk
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.7
    • /
    • pp.1821-1841
    • /
    • 1997
  • This paper presents an automated protocol conformance test sequence generation based on formal methods for LOTOS specification by using and applying many existing related algorithms and technique, such as the testing framework, Rural Chinese Postman tour concepts. We use the state-transition graphs obtained from LOTOS specifications by means of the CAESAR tool. This tool compiles a specification written in LOTOS into an extended Petri net, from which a transition graph of a event finite-state machine(EvFSM) including data is generated. A new characterizing sequence(CS), called Unique Event sequence(UE sequence) is defined. An UE sequence for a state is a sequence of accepted gate events that is unique for this state. Some experiences about UE sequence, partial UE sequence and signature are also explained. These sequences are combined with the concept of the Rural Chinese Postman Tour to obtain an optimal test sequence which is a minimum cost tour of the reference transition graph of the EvFSM. This paper also presents a fault coverage estimation experience of an automated method for optimized test sequences generation and the translation of the test sequence obtained by using our tool to TTCN notation are also given. A prototype of the proposed framework has been built with special attention to real application in order to generated the executable test cases in an automatic way. This formal method on conformance testing can be applied to the protocols related to IN, PCS and ATM for the purpose of verifying the correctness of implementation with respect to the given specification.

  • PDF

Gait Recognition Using Shape Sequence Descriptor (Shape Sequence 기술자를 이용한 게이트 인식)

  • Jeong, Seung-Do
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.5
    • /
    • pp.2339-2345
    • /
    • 2011
  • Gait recognition is the method to identify the person who walks in front of camera using characteristics of individuals by a sequence of images of walking people. The accuracy of biometric such as fingerprint or iris is very high; however, to provide information needs downsides which allow users to direct contact or close-up, etc. There have been many studies in gait recognition because it could capture images and analysis characteristics far from a person. In order to recognize the gait of person needs a continuous sequence of walking which can be distinguished from the individuals should be extracted features rather than an single image. Therefore, this paper proposes a method of gait recognition that the motion of objects in sequence is described the characteristics of a shape sequence descriptor, and through a variety of experiments can show possibility as a recognition technique.