In this paper we propose a woven block code construction based on two convolutional outer codes and a single inner code. We proved lower and upper bounds on this construction's code distance. The lower bound is shown to be higher than the product of the free distances of inner and outer constituent codes. Since this construction uses well-developed convolutional constituent codes, we believe that it would be competitive to turbo codes in the future mobile communication systems.
This work is devoted to the problems of information transmission with frequency shift keying and fast frequency hopping in special channels where the signal/noise ratio is low, and a high energy interfering signal is present. We propose a demodulation algorithm that is significantly more stable to the influence of a powerful interfering signal as compared to other known algorithms. Under these conditions, we show a statistical criterion that lets one significantly reduce error probability on the demodulator’s output. For the chosen criterion we prove several lemmas that let us speed up the demodulation algorithm. Computer modeling results show that the proposed demodulation algorithm has better correcting ability under a powerful interfering signal than previously known ones.
In previous papers we have considered fast-frequency hopping frequency shift keying. We have proposed a decoder with low error rate in channels with low signal to interference ratio. This decoder uses the Kolmogorov-Smirnov criterion statistics to differentiate transmitted codeword from others. In this paper we consider different goodness-of-fit criterion to improve the decoder error rate. We have discovered that the decoder based on the Barnett-Eison criterion have lower error rates in wideband interference scenario, while the one based on the Anderson criterion is better in case of narrowband interference.
In what follows an order-statistics based single user reception in a communication system operating under multiuser interference is considered. This paper deals with the problem of finding channel capacity of the channel corresponding to the system under consideration.
The paper discusses generalized error locating (GEL) codes over the same alpha- bet for both component codes. The algorithm for computing upper bound on decoding error probability under known input symbol error rate and code parameters. Is is used for construct- ing the algorithm of code parameters selection that maximizes code rate for given construction and input and output error probabilities. The lower bound on on decoding error probability is given. The examples of wrong decoding probability versus input symbol error rate are given and their behavior is described.