Joint decoding of convolution codes and estimation of multipath communication channel’s parameters on a sliding interval
DOI:
https://doi.org/10.3103/S0735272711030022Keywords:
convolution code, multipath channel, quasi-optimal algorithm, Markov processAbstract
Optimal and quasi-optimal non-linear recurrent algorithms of joint decoding of convolution code and estimation of unknown multipath communication channel’s parameters on a sliding interval are synthesized on the basis of mathematics technique of mixed Markov processes in discrete time. Analysis of the obtained quasi-optimal algorithm is performed using statistical modeling on PC.
References
J. G. Proakis, Digital Communications, 3rd ed. (McGraw–Hill, New York, 1995).
A. A. Shpylka and S. Ya. Zhuk, “Joint interpolation of data and parameter filtration of a multibeam communications channel,” Radioelectron. Commun. Syst., v.53, n.1, p.20-24, 2010.
N. Seshadri, “Joint data and channel estimation using blind trellis search techniques,” IEEE Trans. Commun. 42, Nos. 2–4, 1000 (1994).
T. K. Moon, Error Correction Coding: Mathematical Methods and Algorithms (John Wiley & Sons Inc., New York, 2005).
A. A. Shpylka and S. Ya. Zhuk, “Decoding of convolutional codes on a sliding window during signal propagation in a multipath communications channel,” Radioelectron. Commun. Syst., v.53, n.9, p.497-501, 2010.
S. Ya. Zhuk, Optimization Methods of Discrete Dynamic Systems with Random Structure (NTUU KPI, Kyiv, 2008) [in Russian].
