Pseudo-Random Sequences Generator Based on Discrete Hyperchaotic Systems

We first design a discrete hyperchaotic system via piece-wise linear state feedback. The states of the closed loop system are locally expanding in two directions but absolutely bounded on the whole, which implies hyperchaos. Then, we use three suchlike hyperchaotic systems with different feedback gain matrices to design a pseudo-random sequence generator (PRSG). Through a threshold function, three sub-sequences generated from the output of piecewise linear functions are changed into 0-1 sequences. Then, followed by XOR operation, an unpredictable pseudo-random sequence (PRS) is ultimately obtained. The analysis and simulation results indicate that the PRS, generated with hyperchaotic systems, has desirable statistical features.

HIERACHICAL STRUCTURES FOR GENERATING PSEUDO-RANDOM SEQUENCES AND ARRAYS

This paper proposes new hierarchical structures for generating pseudorandom sequences and arrays. The principle of the structures is based on a new concept-multi-interleaving. It is the generalization of normal sequence decimation(sampling). The kernal of the structures is a lower speed linear feedback shift register together with several high speed time-division multiplexers arranged hierarchically. These new structures have much higher speed compared with that of other schemes proposed before.

Adding Pseudo-Random Test Sequence Generator in the Test Simulator for DFT Approach

This paper presents modified version of a realistic test tool suitable to Design For Testability （DFT） and Built-ln Self Test （BIST） environments. A comprehensive tool is developed in the form of a test simulator. The simulator is capable of providing a required goal of test for the Circuit Under Test （CUT）. The simulator uses the approach of fault diagnostics with fault grading procedures to provide the optimum tests. The current version of the simulator embeds features of exhaustive and pseudo-random test generation schemes along with the search solutions of cost effective test goals. The simulator provides facilities of realizing all possible pseudo-random sequence generators with all possible combinations of seeds. The tool is developed on a common Personal Computer （PC） platform and hence no special software is required. Thereby, it is a low cost tool hence economical. The tool is very much suitable for determining realistic test sequences for a targeted goal of testing for any CUT. The developed tool incorporates flexible Graphical User Interface （GUI） procedures and can be operated without any special programming skill. The tool is debugged and tested with the results of many bench mark circuits. Further, this developed tool can be utilized for educational purposes for many courses such as fault-tolerant computing, fault diagnosis, digital electronics, and safe-reliable-testable digital logic designs.

Construction of Midgut Tissue-Specific cDNA Library of Bombyx mandarina M. and Isolation and Sequence Analysis of Serine Protease Gene Fragment

[Objective] The aim of the study is to construct cDNA library of midgut tissue of wild silkworm and isolate the serine protease gene. [Method] The midgut tissue-specific cDNA library of wild silkworm was constructed via cDNA Library Construction Kit (TaKaRa), then the serine protease gene was cloned via sequencing of the yielded cDNA library. [Result] The titer of cDNA library reached 6.2×105 pfu/ml, average insert size was about 1.2 kb. The serine protease gene cDNA fragment was obtained from colony sequencing (Accession No: EU672968). The nucleotide sequence of the cloned 854 bp fragment encodes 284 amino acid residues. Homology analyses showed some homology between putative amino acid sequence of the cloned fragment and amino acid sequences of serine proteases from other ten insects. [Conclusion] The results may avail to reveal the resistance of silkworm and wild silkworm to exotic intrusion.

A new Multilocus Sequence Analysis Scheme for Mycobacterium tuberculosis

Objective Tuberculosis remains one of the most serious infectious diseases in the world. In this study, a scheme of Mycobacterium tuberculosis （M. tuberculosis） multilocus sequence analysis （MLSA） was established for the phylogenetic and epidemiology analysis. Methods To establish the scheme of M. tuberculosis MLSA, the genome of H37Rv, CCDC5079 and CCDC5180 were compared, and some variable genes were chosen to be the MLSA typing scheme. 44 M. tuberculosis clinical isolates were typed by MLSA, IS6110-RFLP, and soligotyping, to evaluate the MLSA methods. Results After comparison of the genome, seven high discrimination gene loci （recX, rpsL, rmlC, rpmG1, mprA, gcvH, ideR） were chosen to be the MLSA typing scheme finally. 11 variable SNP sites of those seven genes were found among the 44 M. tuberculosis isolate strains and 11 sequence types （STs） were identified. Based on the Hunter-Gaston Index （HGI）, MLSA typing was not as good for discrimination at the strain level as IS6110-RFLP, but the HGI was much better than that of spoligotyping. In addition, the MEGA analysis result of MLSA data was similar to spoligotyping/PGG lineage, showing a strong phylogenetic signal in the modern strains of M. tuberculosis. The MLSA data analysis by eBURST revealed that 4 sequence types （ST） came into a main cluster, showing the major clonal complexes in those 44 strains. Conclusion MLSA genotyping not only can be used for molecular typing, but also is an ideal method for the phylogenetic analysis for M. tuberculosis.

SOME EULER SPACES OF DIFFERENCE SEQUENCES OF ORDER m

Kizmaz [13] studied the difference sequence spaces ∞（A）, c（A）, and co（A）. Several article dealt with the sets of sequences of m-th order difference of which are bounded, convergent, or convergent to zero. Altay and Basar [5] and Altay, Basar, and Mursaleen [7] introduced the Euler sequence spaces e0^r, ec^r, and e∞^r, respectively. The main purpose of this article is to introduce the spaces e0^r△^（m））, ec^r△^（m））, and e∞^r△^（m））consisting of all sequences whose mth order differences are in the Euler spaces e0^r, ec^r, and e∞^r, respectively. Moreover, the authors give some topological properties and inclusion relations, and determine the α-, β-, and γ-duals of the spaces e0^r△^（m））, ec^r△^（m））, and e∞^r△^（m））, and the Schauder basis of the spaces e0^r△^（m））, ec^r△^（m））. The last section of the article is devoted to the characterization of some matrix mappings on the sequence space ec^r△^（m））.

CHARACTERIZATIONS OF COMPACT OPERATORS ON SOME EULER SPACES OF DIFFERENCE SEQUENCES OF ORDER m

In the past, several authors studied spaces of m-th order difference sequences, among them, H.Polat and F.Basar （[17]） defined the Euler spaces of m-th order difference sequences e r 0 （△ （ m ） ）, e r c （△ （ m ） ） and e r ∞ （△ （ m ） ） and characterized some classes of matrix transformations on them. In our paper, we add a new supplementary aspect to their research by characterizing classes of compact operators on those spaces. For that purpose, the spaces are treated as the matrix domains of a triangle in the classical sequence spaces c 0 , c and ∞ . The main tool for our characterizations is the Hausdorff measure of noncompactness.

MULTI-VALUED CROSSCORRELATION FUNCTION FOR m-SEQUENCES

Based on the theory of exponential sums an d quadratic forms over finite field, the crosscorrelation function values betwee n two maximal linear recursive sequences are determined under some conditions.

Multiple Sequence Alignment of the M Protein in SARS-Associated and Other Known Coronaviruses

In this paper, we report a multiple sequence alignment result on the basis of 10 amino acid sequences of the M protein, which come from different coronaviruses (4 SARS associated and 6 others known). The alignment model was based on the profile HMM (Hidden Markov Model), and the model training was implemented through the SAHMM (Self Adapting Hidden Markov Model) software developed by the authors.

Variant Map System to Simulate Complex Properties of DNA Interactions Using Binary Sequences

Stream cipher, DNA cryptography and DNA analysis are the most important R&D fields in both Cryptography and Bioinformatics. HC-256 is an emerged scheme as the new generation of stream ciphers for advanced network security. From a random sequencing viewpoint, both sequences of HC-256 and real DNA data may have intrinsic pseudo-random properties respectively. In a recent decade, many DNA sequencing projects are developed on cells, plants and animals over the world into huge DNA databases. Researchers notice that mammalian genomes encode thousands of large noncoding RNAs (lncRNAs), interact with chromatin regulatory complexes, and are thought to play a role in localizing these complexes to target loci across the genome. It is a challenge target using higher dimensional visualization tools to organize various complex interactive properties as visual maps. The Variant Map System (VMS) as an emerging scheme is systematically proposed in this paper to apply multiple maps that used four Meta symbols as same as DNA or RNA representations. System architecture of key components and core mechanism on the VMS are described. Key modules, equations and their I/O parameters are discussed. Applying the VM System, two sets of real DNA sequences from both sample human (noncoding DNA) and corn (coding DNA) genomes are collected in comparison with pseudo DNA sequences generated by HC-256 to show their intrinsic properties in higher levels of similar relationships among relevant DNA sequences on 2D maps. Sample 2D maps are listed and their characteristics are illustrated under controllable environment. Visual results are briefly analyzed to explore their intrinsic properties on selected genome sequences.

Using Walsh-m Composite Sequence and LDPC-QPSK Joint Iteration to Reduce ISI in Long-range Underwater Acoustic Systems

To reduce inter-symbol-interference (ISI) in underwater acoustic (UWA) communication systems, a method based on LDPC-QPSK joint iteration and Walsh-m composite sequence is proposed in this paper. The method is intended for use in long-range and low signal-to-noise ratio (SNR) UWA communications. At the transmitter, Walsh-m composite sequence is introduced to resist multipath effect. At the receiver, a soft-input soft-output (SISO) module is implemented in a joint iterative process between QPSK demodulator and LDPC decoder. This method is demonstrated in three types of UWA channel models: positive, negative and invariable sound velocity gradients channels. It is shown that through contrastive simulation experiments, this method is more efficient than conventional methods based on independent decoding and demodulation. After two rounds of joint iteration, the proposed method can obtain 2.5 dB over conventional method at BER of 10-5. Numerical results verify that the proposed method is a good candidate for long-range underwater acoustic communication systems.

A NEW ALGORITHM FOR THE GENERATION OF k-AKY M SEQUENCES

A new algorithm for generating k-ary M sequences is given. In the algorithm a new method is used that the main cycle is extended by joining to it a subset of cycles instead of the classical one in which the main cycle is extended by joining to it one cycle. The algorithm reduces the times of choosing bridging states and accelerates the speed of joining cycles.

Binary Sequences from a Pair of Elliptic Curves

A family of binary sequences were constructed by using an elliptic curve and its twisted curves over finite fields. It was shown that these sequences possess ＂good＂ cryptographie properties of 0-1 distribution, long period and large linear complexity. The results indicate that such se quences provide strong potential applications in cryptography.

Multi-Value Sequence Generated over Sub Extension Field and Its Properties

Pseudo-random sequences with long period, low correlation, high linear complexity, and uniform distribution of bit patterns are widely used in the field of information security and cryptography. This paper proposes an approach for generating a pseudo-random multi-value sequence (including a binary sequence) by utilizing a primitive polynomial, trace function, and k-th power residue symbol over the sub extension field. All our previous sequences are defined over the prime field, whereas, proposed sequence in this paper is defined over the sub extension field. Thus, it’s a new and innovative perception to consider the sub extension field during the sequence generation procedure. By considering the sub extension field, two notable outcomes are: proposed sequence holds higher linear complexity and more uniform distribution of bit patterns compared to our previous work which defined over the prime field. Additionally, other important properties of the proposed multi-value sequence such as period, autocorrelation, and cross-correlation are theoretically shown along with some experimental results.

A Property of m-Tuplings Morse Sequence

The m-tuplings Morse sequence, as a fixed point of a constant length substitution, was discussed. An equivalent definition was given by the property of the m-adie development of the integers. Using the combinatorial properties of the m-tuplings Morse sequence, we mainly obtain this sequenee is an admissible sequence and the other two sequenees generated by it are also admissible sequences, which extends the conclusion that the Thue-Morse sequence is an admissible sequences.

On a Fast p-ary m-Sequence Transform

m-Sequences have been used widely in many applications, but the corresponding computation of the correlation-detection is overwhelming N2 operations, where N is the length of the m-sequence, such that it is unpractical. In this paper, a transform from p-ary m-sequence matrices to generalized Hadamard matrices is developed; and then by the fast generalized Hadamard matrices transform, a fast p-ary m-sequence transform is developed. The results show that the computation can be dramatically reduced from N2 to Nlog pN operations, so the fast p-ary m-sequence transform could enable a rapid correlation-detection at the receiver.

Theoretical Bounds and Practical Constructions for Families of One－Coincidence Sequences in FHMA

ＴｈｅｏｒｅｔｉｃａｌＢｏｕｎｄｓａｎｄＰｒａｃｔｉｃａｌＣｏｎｓｔｒｕｃｔｉｏｎｓｆｏｒＦａｍｉｌｉｅｓｏｆＯｎｅ－ＣｏｉｎｃｉｄｅｎｃｅＳｅｑｕｅｎｃｅｓｉｎＦＨＭＡＭｅｉＷｅｎｈｕａ；ＹａｎｇＹｉｘｉａｎ（ＢｅｉｊｉｎｇＡｅｒｏｎａｕｔｉｃａｌ...

2-D localization system utilizing M-sequence encoded laser beam scanning

In this paper, as the active position measurement system, a novel method for a two-dimensional localization system using M-sequence signal is proposed. The feature of this system is to realize a position measurement only by scanning the encoded laser beams from fixing points to a measurement field, and by observing it. First, both the system configuration and encoding method were practically considered, and an order and an initial value of M-sequence signal were selected for encoding. This method is based on discrete angle measurement therefore the resolution has its own limitation. To overcome this limitation, analogue phase shift detecting method was introduced. System design was performed and applied to position measurement experiments. The experimental results show that the measurement error of the analogue method is 1/3 of that of the discrete method.

PERFECT PUNCTURED BINARY SEQUENCE PAIRS

This paper presents the definition of perfect punctured binary sequence pair and the combinatorial admissible conditions for searching the perfect punctured binary sequence pairs and proves that all of the pseudo-random binary sequences satisfy these conditions. Computer calculation verifies that the pseudo-random binary sequences with length up to N=127 can be easily turned into perfect punctured binary sequence pairs.

An input signal used in process identification - chaos sequence

The sequences which consist of any segment of a chaos sequence are called asC-sequences. These sequences could be used as a kind of input signals to replace M-sequences in theprocess identification. This substitution is theoretically proved to be feasible. InverseC-sequences are created in a way similar to inverse M-sequences to solve the problem thatC-sequences have non-ideal balance property, that is, the numbers of '0' and '1' are unequal.Besides its good pseudo-random property, the sequences have other advantages such as easy togenerate, varieties of the segment and adjustable cycle time.