In this paper we introduce a new approach in the decoding of variable length codes. Based on the tree structure of these codes a trellis representation is derived which allows the application of the BCJR algorithm. This algorithm provides us with the a posteriori probabilities of the transmitted source symbols. Therefore we do not only use soft information from an outer decoding stage but also ...

Symbol-by-symbol maximum a posteriori (MAP) decoding algorithms for linear nonbinary block and convolutional codes over both extension elds GF(q = p a) and integer rings Z q are presented. Equivalent MAP decoding rules employing the dual code are given which are computationally more eecient for high-rate codes. The suitabil-ity of the proposed algorithms is demonstrated by applying them to a pa...

In the present study, we aim at on-line planning for realtime navigation of a mobile robot. To realize this, we consider map formation in an unknown environment and an on-line path search on the obtained map. In the map learning process, the symbol map is constructed by the allocation of a location symbol based on the discretization of the range sensor signal and the association of the neighbor...

A generalized maximum a posteriori (MAP) symbol synchronizer for arbitrary nonoverlapping pulse shape and data-transition density is derived, and a simplified realization is presented. Acquisition performance at low to very low symbol signalto-noise ratios (SNRs) is investigated and compared against the conventional datatransition tracking loop (DTTL). Simulation results show that the MAP symbo...

The symbol-by-symbol maximum a posteriori (MAP) known also as BCJR algorithm is described. The logarithmic versions of the MAP algorithm, namely, Log-MAP and Max-Log-MAP decoding algorithms along with a new Simplified-Log-MAP algorithm, are presented here. Their bit error rate (BER) performance and computational cornplexity of these algorithms are compared. A new hardware architecture for imple...