Open Access. Powered by Scholars. Published by Universities.®

Social and Behavioral Sciences Commons

Open Access. Powered by Scholars. Published by Universities.®

Faculty of Engineering and Information Sciences - Papers: Part A

2005

Convergence

Articles 1 - 2 of 2

Full-Text Articles in Social and Behavioral Sciences

A Simple Convergence Comparison Of Gallager Codes Under Two Message-Passing Schedules, Sheng Tong, Xinmei Wang Jan 2005

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 Jan 2005

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.