The special generator of testing signal was designed for the frequency of 441.171 kHz. The generator consists of the special crystal oscillator and a high power amplifier. The frequency stability of the generator is in order of 10/day, the output power 1W, the value of SINAD is close to 120 dB and the total harmonic distortion under 170 dB by using of linear narrow-band filter.

A full-rank IC x n matrix G ( D ) over the rational functions F ( D ) generates a rate R = k / n convolutional code C. G ( D ) is minimal if it can be realized with as few memory elements as any encoder for C, and G ( D ) is canonical if it has a minimal realization in controller canonical form. We show that G ( D ) is minimal if and only if for all rational input sequences p1 ( D ) , the span ...

In this report we present a method of adding a feedback control mechanism to an echo state network (ESN) pattern generator in order to modulate its output patterns with the purpose of tracking slowly varying control targets, e.g. shift, amplitude, or frequency of an oscillatory pattern. A proofof-principle case study is presented where a basic ESN is trained to produce a stable sinewave oscilla...

Performing real-time reasoning on models of physical systems is essential in many situations, especially when human intervention is impossible. Since many deductive reasoning tasks take memory or time that is exponential in the number of variables that appear in the model, efforts need to be made to reduce the size of the models used online. The model can be reduced without sacrificing reasonin...

Convolutional codes over rings are particularly suitable for representing codes over phase modulation signals. In order to develop a complete structural analysis of this class of codes, it is necessary to study rational matrices over rings, which constitutes the generator matrices (encoders) for such convolutional codes. Noncatastrophic, minimal, systematic and basic generator matrices are intr...

we define minimal cn-dominating graph $mathbf {mcn}(g)$, commonality minimal cn-dominating graph $mathbf {cmcn}(g)$ and vertex minimal cn-dominating graph $mathbf {m_{v}cn}(g)$, characterizations are given for graph $g$ for which the newly defined graphs are connected. further serval new results are developed relating to these graphs.

In this paper, we study trellis properties of the tensor product (product code) of two linear codes, and prove that the tensor product of the lexicographically first bases for two linear codes in minimal span form is exactly the lexicographically first basis for their product code in minimal span form, also the tensor products of characteristic generators of two linear codes are the characteris...

We construct a generator system of the annihilator of a generalized Verma module of a classical reductive Lie algebra induced from a character of a parabolic subalgebra as an analogue of the minimal polynomial of a matrix. In a classical limit it gives a generator system of the defining ideal of any semisimple co-adjoint orbit of the Lie algebra. We also give some applications to integral geome...

The Minimal Constraint Satisfaction Problem, or Minimal CSP for short, arises in a number of real-world applications, most notably in constraint-based product configuration. Despite its very permissive structure, it is NP-hard, even when bounding the size of the domains by d ≥ 9. Yet very little is known about the Minimal CSP beyond that. Our contribution through this paper is twofold. Firstly,...

In this paper, we study the structure of 1-generator quasi-cyclic codes over the ring R = F2 +uF2 + vF2 + uvF2, with u2 = v2 = 0 and uv = vu. We determine the minimal spanning sets for these codes. As a generalization of these codes, we also investigate the structure of 1-generator generalized quasi-cyclic codes over R and determine a BCH type bound for them.