PROBLEMS OF INFORMATION TRANSMISSION
A translation of Problemy Peredachi Informatsii

CONTENTS                  

Disturbance of Conservation Laws in Stochastic Cellular Automata
V. A. Malyshev
pp. 87–93

Abstract—We consider a class of discrete-time Markov processes with a local interaction, which constitutes a quadratic perturbation of the voter model. The main result asserts that, in some reasonable class of measures, the number of extremal invariant measures does not exceed two. Hence follows nonexistence of conservation laws for this class of perturbations.

Ergodicity of Partially Accessible Multichannel Communication Systems
S. G. Foss and N. I. Chernova
pp. 94–99

Abstract—Boundedness and ergodicity of the queue length process are proved for an open partially accessible communication system with different types of messages.

Comparative Throughput Analysis of Queueing Networks with Exponential and Deterministic Service Time in the Nodes
A. L. Stolyar
pp. 99–107

Abstract—We consider a queueing network consisting of $\,\cdot\,|M|m$ and $\,\cdot\,|GI|\infty$ systems. Poisson arrivals are assumed (if the network is open). We show that the throughput characteristics are not degraded when the exponential service time in one or several $\,\cdot\,|M|1$ systems is replaced with a deterministic service time with the same mean: if the network is open, the total number of customers in the modified network is stochastically less that in the original network; if the network is closed, the average load coefficients of the systems in the modified network are not less than in the original network.

Stack Algorithm in a Broadcast Channel with Capture
N. D. Vvedenskaya and B. S. Tsybakov
pp. 107–116

Abstract—We study the characteristics of a multiple access system with a stack algorithm in cases where part of messages can be successfully transmitted despite collision.

Nonlinear Confidence Estimation of Signal Parameters
A. V. Timofeev
pp. 117–128

Abstract—Sequential analysis is applied to obtain a nonasymptotic solution for the problem of confidence estimation of a multidimensional parameter entering nonlinearly the equation of a stochastic dynamic process. The solution is obtained under nonparametric prior uncertainty regarding the distribution of the observations. A sequential design is proposed for the construction of the confidence parallelepiped of given dimensions using estimators that are asymptotically close to OLS estimators. Analytical upper bounds are derived for the mean observation time in the proposed sequential design.

Optimum Zonal Encoding of Digital Signals with Transforms
A. A. Petrosyan
pp. 128–140

Abstract—Digital signal compression by spectral transforms, known as zonal coding, is considered. We obtain an essential improvement of the bounds of [B.I. Golubov et al., Walsh Series and Transforms: Theory and Applications, Kluwer, Dordrecht (1991)] for the discrete Fourier transform spectrum on the class of Lipschitzian signals and for the mean-square signal reconstruction error on this class. A unified approach is proposed to the construction of spectral bounds of a real-valued orthogonal transform. This approach is applied to develop optimal zonal coding methods using some real trigonometric transforms, as well as Walsh and Haar transforms.

Parameter Estimation of ARMA Processes
E. G. Zhilyakov
pp. 140–149

Abstract—We establish some algebraic properties of the elements of inverse matrices of ARMA (autoregressive–moving average) processes and propose new estimation algorithms.

Trispectral Analysis of Stationary Stochastic Processes: Large-Sample Case
V. G. Alekseev
pp. 150–154

Abstract—We consider the trispectral density $f^{(4)}(\lambda_1,\lambda_2,\lambda_3)$ of a stationary stochastic process $\{\xi(k),\: k\in\mathbb Z\}$ for the case where the full realization of the stochastic process $\xi(k)$ cannot be processes in its entirety on the available computer. The trispectral density estimator is constructed as the arithmetic mean of the estimators obtained using a finite number of smaller nonoverlapping (or partially overlapping) arrays. A specific technique is proposed which substantially improves the estimation quality of the function $f^{(4)}(\lambda_1,\lambda_2,\lambda_3)$ in this case.

Convolutional Codes for Channels with Fading
A. N. Trofimov
pp. 155–165

Abstract—For a channel with a correlated Rayleigh fading, we obtain an asymptotic error bound and bounds on error probability for specific codes decoded using the continuous channel output. The asymptotic bound is expressible in terms of the spectral radius of some positive integral operator. The error bounds for specific codes are constructed using a modified coder state diagram.

Weight Enumerators of High-Rate Convolutional Codes Based on the Hamming Code
I. E. Bocharova
pp. 166–171

Abstract—We derive an analytical expression for the weight enumerator of a class of convolutional codes with rate $R=(n-1)/n$, $n=2^r$, $r=1,2,\ldots\strut$, and free distance $d_f=3$. We show that the codes of this class are equivalent to punctured convolutional codes with constraint length $\le r+1$ and admit decoding with complexity of order $\le 2^{r+1}$.

Sequential Syndrome Decoding of Convolutional Codes over Large Alphabets
D. K. Zigangirov and K. Sh. Zigangirov
pp. 172–176

Abstract—A syndrome method of sequential decoding is proposed, which substantially lowers the decoding complexity for large alphabets compared to classical sequential decoding methods.

Reception of Convolutional Codes in a Channel with Intersymbol Interference
D. D. Klovskii, V. G. Kartashevskii, and S. A. Belous
pp. 176–178

Abstract—Signal processing algorithms are proposed for convolutional codes in a channel with intersymbol interference. Simulation results are reported for these algorithms.

Comparative Analysis of Sequential Decoding Algorithms
A. A. Bezruk, D. K. Zigangirov, and S. A. Popov
pp. 179–184

Abstract—The paper describes an experimental comparison of three sequential decoding algorithms, namely, stack algorithm, Fano algorithm, and creeper algorithm. A version of the creeper algorithm is described. The comparison shows that the theoretical characteristics of the creeper algorithm occupy an intermediate position between the stack algorithm and the Fano algorithm.

Fast Evaluation of Multidimensional DFT
M. Ya. Kelbert and A. E. Mazel
pp. 185–188

Abstract—The computation of the multidimensional discrete Fourier transform (DFT) using the discrete Radon transform (DRT) is reducible to the computation of finitely many one-dimensional DFTs. The paper proposes an algorithm for the computation of the DFT of a $d$-dimensional array of $N^d$ points using a minimum number of one-dimensional DFTs $\psi(N)N^{d-1}$. The behaviour of the function $\psi$ is determined by the arithmetic properties of the number $N$, and it is desirable to choose a prime $N$.