Iterative decoding of convolutionally encoded signals over multipath Rayleigh fading channels

Download
2001-09-01
Berthet, AO
Unal, BS
Visoz, R
In this paper, we analyze and compare several strategies for iteratively decoding trellis-encoded signals over channels with memory. Soft-in/soft-out extensions of reduced-complexity trellis search algorithms such as delayed decision-feedback sequence estimating (DDFSE) or parallel decision-feedback decoding (PDFD) algorithms are used instead of conventional BCJR and min-log-BCJR algorithms. It has been shown that for long channel impulse responses and/or high modulation orders where the BCJR algorithm becomes prohibitively complex, the proposed algorithms offer very good performance with low complexity. The problem of channel estimation in practical implementation of turbo detection schemes is studied in the second part. Two methods of channel reestimation are proposed: one based on the expectation-maximization (EM) algorithm and the second on a simple Bootstrap technique. Both algorithms are shown to dramatically improve the performance of the classical pseudo-inverse channel estimation performed initially on a training sequence.
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS

Suggestions

Anti-periodic solutions for state-dependent impulsive recurrent neural networks with time-varying and continuously distributed delays
Sayli, Mustafa; YILMAZ, ENES (Springer Science and Business Media LLC, 2017-11-01)
In this paper, we address a new model of neural networks related to the impulsive phenomena which is called state-dependent impulsive recurrent neural networks with time-varying and continuously distributed delays. We investigate sufficient conditions on the existence and uniqueness of exponentially stable anti-periodic solution for these neural networks by employing method of coincide degree theory and an appropriate Lyapunov function. Moreover, we present an illustrative example to show the effectiveness ...
Nested Iterative Solutions of Electromagnetic Problems Using Approximate Forms of the Multilevel Fast Multipole Algorithm
Onol, Can; Ucuncu, Arif; Karaosmanoglu, Bariscan; Ergül, Özgür Salih (2017-03-24)
Nested iterative solutions using full and approximate forms of the multilevel fast multipole algorithm (MLFMA) are presented for efficient analysis of electromagnetic problems. The developed mechanism is based on preconditioning an iterative solution via another iterative solution, and this way, nesting multiple solutions as layers. The accuracy is systematically reduced from top to bottom by using the on-the-fly characteristics of MLFMA, as well as the iterative residual errors. As a demonstration, a three...
Efficient and Accurate Electromagnetic Optimizations Based on Approximate Forms of the Multilevel Fast Multipole Algorithm
Onol, Can; Karaosmanoglu, Bariscan; Ergül, Özgür Salih (2016-01-01)
We present electromagnetic optimizations by heuristic algorithms supported by approximate forms of the multilevel fast multipole algorithm (MLFMA). Optimizations of complex structures, such as antennas, are performed by considering each trial as an electromagnetic problem that can be analyzed via MLFMA and its approximate forms. A dynamic accuracy control is utilized in order to increase the efficiency of optimizations. Specifically, in the proposed scheme, the accuracy is used as a parameter of the optimiz...
Optimizing Parameters of Signal Temporal Logic Formulas with Local Search
Aydin, Sertac Kagan; Aydın Göl, Ebru (2019-08-22)
Signal temporal logic (STL) is a formal language for expressing temporal and real-time properties of real valued signals. In this paper, we study the problem of generating an STL formula from a labeled dataset. We propose a local search algorithm to synthesize parameters of a template formula. Starting from a random initial point, the parameter space is explored in the directions improving the formula evaluation. In addition, the local search method is integrated to the genetic algorithms developed for form...
Errors-and-Erasures Decoding for Block Codes With Feedback
Nakiboğlu, Barış (2012-01-01)
Inner and outer bounds are derived on the optimal performance of fixed-length block codes on discrete memoryless channels with feedback and errors-and-erasures decoding. First, an inner bound is derived using a two-phase encoding scheme with communication and control phases together with the optimal decoding rule for the given encoding scheme, among decoding rules that can be represented in terms of pairwise comparisons between the messages. Then, an outer bound is derived using a generalization of the stra...
Citation Formats
A. Berthet, B. Unal, and R. Visoz, “Iterative decoding of convolutionally encoded signals over multipath Rayleigh fading channels,” IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, pp. 1729–1743, 2001, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/66599.