In digital communication receivers, ambiguities in terms of timing and phase need to be
resolved prior to data detection. In the presence of powerful error-correcting codes, which …

The well-known Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm was generalized to compute
joint posterior probabilities of arbitrary sets of symbols given noisy observations of those …

The article introduces a novel concept of a PLC modem as a complement to the existing G3
and PRIME standards for communications using medium-or high-voltage overhead or cable …

A modification of the BCJR algorithm is derived for convolutionally-coded transmissions over
the time-selective, frequency-flat, Rayleigh fading channel with pilot-symbol-assisted …

Práce se zabývá návrhem řešení, umožňující robustnější komunikaci po silnoproudém ve-
dení v distribučních sítích energetiky. V této oblasti se zaměřuje na zlepšení překonání stáva …

1988–1991 Research assistant, University of Utah, Salt Lake City, UT Development and
analysis of algorithms for spread spectrum multiple access communication 1988–1991 …

The iterative decoding of BICM is analyzed from an optimization point of view. The objective
function underlying the standard iterative decoding is a coarse approximation of the optimal …

Low-density parity-check (LDPC) codes and turbo codes are two classes of capacity-
approaching codes. LDPC codes with iterative decoding based on belief propagation (BP) …

Turbo synchronization is an iterative process whereby statistical information is shared
between the synchronizer module and the decoder in a receiver. One technique for …

The paper begins with a general notation for fractional sampling by noninteger rates. This is
applied to detection using optimal (BCJR) and suboptimal (ML/MMSE) detection. Channel …