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

Date

2004-04-30

Author

Yilmaz, AO

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

167
views

0
downloads

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.

Subject Keywords

Gaussian processes, Iterative decoding, AWGN

URI

https://hdl.handle.net/11511/64300

DOI

https://doi.org/10.1109/siu.2004.1338290

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

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.
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...
On Improving Dynamic State Space Approaches to Articulatory Inversion With MAP-Based Parameter Estimation Özbek Arslan, Işıl; Hasegawa-Johnson, Mark; Demirekler, Mübeccel (Institute of Electrical and Electronics Engineers (IEEE), 2012-01-01) This paper presents a complete framework for articulatory inversion based on jump Markov linear systems (JMLS). In the model, the acoustic measurements and the position of each articulator are considered as observable measurement and continuous-valued hidden state of the system, respectively, and discrete regimes of the system are represented by the use of a discrete-valued hidden modal state. Articulatory inversion based on JMLS involves learning the model parameter set of the system and making inference a...

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.