Open Access. Powered by Scholars. Published by Universities.®
Social and Behavioral Sciences Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Social and Behavioral Sciences
A Simple Convergence Comparison Of Gallager Codes Under Two Message-Passing Schedules, Sheng Tong, Xinmei Wang
A Simple Convergence Comparison Of Gallager Codes Under Two Message-Passing Schedules, Sheng Tong, Xinmei Wang
Faculty of Engineering and Information Sciences - Papers: Part A
The convergence rate of iterative decoding of Gallager codes on the additive white Gaussian noise (AWGN) channel using the sum-product algorithm (SPA) under the flooding schedule (FS) is compared with that under the turbo-decoding schedule (TDS). Analyses using extrinsic information transfer (EXIT) charts show that TDS exhibits a much faster convergence behavior than FS.
Convergence Rates Comparison Of Sum-Product Decoding Of Ra Codes Under Different Message-Passing Schedules, Sheng Tong, Baoming Bai, Xinmei Wang
Convergence Rates Comparison Of Sum-Product Decoding Of Ra Codes Under Different Message-Passing Schedules, Sheng Tong, Baoming Bai, Xinmei Wang
Faculty of Engineering and Information Sciences - Papers: Part A
In iterative decoding of turbo-like codes, serial schedule generally provides a much faster convergence rate compared with parallel schedule. With the aid of extrinsic information transfer (EXIT) charts, sum-product decoding of repeat accumulate (RA) codes under both message passing schedules is investigated as an example for verifying the above statement.
Convergence Of Eigenvalues In State-Discretization Of Linear Stochastic Systems, Jose A. De Dona, Graham C. Goodwin, Richard H. Middleton, Iain Raeburn
Convergence Of Eigenvalues In State-Discretization Of Linear Stochastic Systems, Jose A. De Dona, Graham C. Goodwin, Richard H. Middleton, Iain Raeburn
Faculty of Engineering and Information Sciences - Papers: Part A
The transition operator that describes the time evolution of the state probability distribution for continuous-state linear systems is given by an integral operator. A state-discretization approach is proposed, which consists of a finite rank approximation of this integral operator. As a result of the state-discretization procedure, a Markov chain is obtained, in which case the transition operator is represented by a transition matrix. Spectral properties of the integral operator for the continuous-state case are presented. The relationships between the integral operator and the finite rank approximation are explored. In particular, the limiting properties of the eigenvalues of the transition matrices …