On investigating the performance of various turbo decoding algorithms based on the finite-EXIT chart method

2004-04-30
Yilmaz, AO
Finite length analysis of iterative decoders can be done by using probabilistic models based on EXIT charts. The validity of these models will be investigated by checking the performance of iterative decoding under various scenarios.

Suggestions

Waterfall region analysis for iterative decoding
Yılmaz, Ali Özgür (2004-12-01)
Finite length analysis of iterative decoders can be done by using probabilistic models based on EXIT charts. The validity of these models will be investigated by checking the performance of iterative decoding under various scenarios.
Computational Electromagnetic Analysis of Deformed Nanowires Using the Multilevel Fast Multipole Algorithm
Yilmaz, Akif; Karaosmanoglu, Bariscan; Ergül, Özgür Salih (2015-02-16)
We consider computational analysis of deformed nanowires and their arrays using a full-wave simulation environment based on integral-equation formulations and the multilevel fast multipole algorithm (MLFMA). Without requiring any periodicity assumptions, MLFMA allows for fast and accurate simulations of complex nanowire structures with three-dimensional geometries and random deformations. We present the results of hundreds of simulations, where deformed nanowires are considered as isolated, as well as in ar...
On Solving the Forward Kinematics of the 6-6 General Parallel Manipulator with an Efficient Evolutionary Algorithm
Rolland, Luc; Chandra, Rohitash (2010-07-08)
The G3-PCX genetic algorithm is compared with hybrid meta-heuristic approaches for solving the forward kinematics problem of the 6-6 general parallel manipulator. The G3-PCX shows improvements in terms of accuracy, response time and reliability. Several experiments confirm solving the given problem in less than 1 second. It also reports all the 16 unique real solutions which are verified by an exact algebraic method. This opens the way to simulation and certification applications.
A Bayesian Approach to Learning Scoring Systems
Ertekin Bolelli, Şeyda (2015-12-01)
We present a Bayesian method for building scoring systems, which are linear models with coefficients that have very few significant digits. Usually the construction of scoring systems involve manual efforthumans invent the full scoring system without using data, or they choose how logistic regression coefficients should be scaled and rounded to produce a scoring system. These kinds of heuristics lead to suboptimal solutions. Our approach is different in that humans need only specify the prior over what the ...
On the Poisson sum formula for the analysis of wave radiation and scattering from large finite arrays
Aydın Çivi, Hatice Özlem; Chou, HT (1999-05-01)
Poisson sum formulas have been previously presented and utilized in the literature [1]-[8] for converting a finite element-by-element array field summation into an alternative representation that exhibits improved convergence properties with a view toward more efficiently analyzing wave radiation/scattering from electrically large finite periodic arrays. However, different authors [1]-[6] appear to use two different versions of the Poisson sum formula; one of these explicitly shows the end-point discontinui...
Citation Formats
A. Yilmaz, “On investigating the performance of various turbo decoding algorithms based on the finite-EXIT chart method,” 2004, p. 188, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/64300.