Channel capacity using Arimoto-Blahut Algorithm
To find channel capacity one must maximize the mutual information with respect to the discrete set of probabilities of the source symbols 'c' , and for a given transition probability matrix.
An efficient algorithm to find channel capacity Cc was derived in 1972 by Blahut and independently Arimoto.This algorithm is based on the fact that channel capacity can be both upper and lower bounded by some simple functions of Pc.The algorithm recursively updates Pc based on these bounds.
Cite As
reeno joseph (2024). Channel capacity using Arimoto-Blahut Algorithm (https://www.mathworks.com/matlabcentral/fileexchange/32757-channel-capacity-using-arimoto-blahut-algorithm), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
Version | Published | Release Notes | |
---|---|---|---|
1.0.0.0 |