Informatica

This paper presents GSM speech coder indirect identification algorithm based on sending novel identification pilot signals through the GSM speech channel. Each GSM subsystem disturbs identification pilot, while speech coder uniquely changes the tempo-spectral characteristics of the proposed pilot signal. Speech coder identification algorithm identifies speech coder with the usage of robust linear frequency cepstral coefficient (LFCC) feature extraction procedure and fast artificial neural networks. First step of speech coder identification algorithm is the exact position detection of the identification pilot signal using normalized cross correlation approach. Next stage is time-domain windowing of the input signal to convolve each frame of the input speech signal and window spectrum. Consecutive step is a short-time Fast Fourier Transformation to produce the magnitude spectrum of each windowed frame. Further, a noise reduction with spectral subtraction based on spectral smoothing is carried out. In last steps we perform the frequency filtering and Discrete Cosine Transformation to receive 24 uncorrelated cepstral coefficients per frame as a result. Speech coder identification is completed with fast artificial neural network classification using the input feature vector of 24 LFCC coefficients, giving a result of identified speech coder. For GSM speech coder indirect identification evaluation, the standardized GSM ETSI bit-exact implementations were used. Furthermore, a set of custom tools was build. These tools were used to simulate and control various conditions in the GSM system. Final results show that proposed algorithm identifies the GSM-EFR speech coder with the accuracy of 98.85%, the GSM-FR speech coder with 98.71%, and the GSM-HR coder with 98.61%. These scores were achieved at various types of surrounding noises and even at very low SNR conditions.

The problem of the classification, description by the difference equations and possible models of quasihomogeneous autoregressive random fields, existing in one-dimensional space R¹, is considered. The properties of the quasihomogeneous areas as well as of the parameters changing by not the jumps areas of such fields are considered also. The quasihomogeneous areas determination algorithm is proposed.

The structure of the weight function of a random space–time autoregressive field, existing in three-dimensional space and time, is considered. The two weight coefficients calculation algorithms are proposed here.

We consider a class of identification algorithms for distributed parameter systems. Utilizing stochastic optimization techniques, sequences of estimators are constructed by minimizing appropriate functionals. The main effort is to develop weak and strong invariance principles for the underlying algorithms. By means of weak convergence methods, a functional central limit theorem is established. Using the Skorohod imbedding, a strong invariance principle is obtained. These invariance principles provide very precise rates of convergence results for parameter estimates, yielding important information for experimental design.

The weight coefficients calculation algorithm for, an autoregressive random field, existing in a two-dimensional space and time, is proposed.